diff --git a/NOTICE b/NOTICE
index e7e6761..ad41618 100644
--- a/NOTICE
+++ b/NOTICE
@@ -1,62 +1,62 @@
-Copyright 2025
-
-[powertrain-build : ci]
-
-Phase: DEVELOPMENT
-Distribution: EXTERNAL
-
-Notices Report Content
- * License Data
- * License Text
- * Origin Copyright Text
-
-Components: 
-
-Coverage 7.6.10: http://nedbatchelder.com/code/modules/coverage.html : 
-exceptiongroup 1.2.2: https://github.com/python-trio/exceptiongroup : MIT License
-flake8 7.1.1: https://gitlab.com/pycqa/flake8 : MIT License
-gitdb 4.0.12: http://github.com/gitpython-developers/gitdb : BSD 3-clause "New" or "Revised" License
-GitPython 3.1.44: https://github.com/gitpython-developers/GitPython : 
-idna 3.10: https://github.com/kjd/idna : BSD 3-clause "New" or "Revised" License
-mccabe 0.7.0: http://pypi.python.org/pypi/mccabe : Expat License
-NumPy 1.24.4: https://numpy.org/ : BSD 3-clause "New" or "Revised" License
-Packaging 24.2: https://github.com/pypa/packaging : (BSD 2-clause "Simplified" License OR Apache License 2.0)
-pbr 6.1.0: http://openstack.org : Apache License 2.0
-psf-requests 2.32.3: http://docs.python-requests.org : Apache License 2.0
-pycodestyle 2.12.1: https://pypi.python.org/pypi/pycodestyle : MIT License
-Pyflakes 3.2.0: https://github.com/pyflakes/pyflakes : MIT License
-pytest 8.3.4: http://pytest.org : MIT License
-python3-charset-normalizer 3.4.1: https://github.com/ousret/charset_normalizer : MIT License
-python-certifi 2024.7.4: https://certifiio.readthedocs.io/en/latest/ : Mozilla Public License 2.0
-python-pluggy 1.5.0: https://pypi.python.org/pypi/pluggy : MIT License
-RonnyPfannschmidt/iniconfig 2.0.0: https://github.com/RonnyPfannschmidt/iniconfig : MIT License
-ruamel-yaml 0.18.6: https://pypi.org/project/ruamel.yaml/ : MIT License
-ruamel.yaml.clib 0.2.12: https://sourceforge.net/p/ruamel-yaml-clib/code/ci/default/tree/ : MIT License
-SciPy 1.9.1: http://www.scipy.org : BSD 3-clause "New" or "Revised" License
-smmap 5.0.2: https://github.com/gitpython-developers/smmap : 
-tomli 2.2.1: https://github.com/hukkin/tomli : MIT License
-urllib3 2.3.0: https://urllib3.readthedocs.io/en/stable : MIT License
-voluptuous 0.15.2: http://pypi.python.org/pypi/voluptuous : BSD 3-clause "New" or "Revised" License
-
-Copyright Text: 
-
-Coverage 7.6.10 pypi:coverage/7.6.10: http://nedbatchelder.com/code/modules/coverage.html
-	No Copyrights found
-exceptiongroup 1.2.2 pypi:exceptiongroup/1.2.2: https://github.com/python-trio/exceptiongroup
+Copyright 2025
+
+[powertrain-build : ci]
+
+Phase: DEVELOPMENT
+Distribution: EXTERNAL
+
+Notices Report Content
+ * License Data
+ * License Text
+ * Origin Copyright Text
+
+Components: 
+
+Coverage 7.6.10: http://nedbatchelder.com/code/modules/coverage.html : Apache License 2.0
+exceptiongroup 1.2.2: https://github.com/python-trio/exceptiongroup : MIT License
+flake8 7.1.1: https://gitlab.com/pycqa/flake8 : MIT License
+gitdb 4.0.12: http://github.com/gitpython-developers/gitdb : BSD 3-clause "New" or "Revised" License
+GitPython 3.1.44: https://github.com/gitpython-developers/GitPython : BSD 3-clause "New" or "Revised" License
+idna 3.10: https://github.com/kjd/idna : BSD 3-clause "New" or "Revised" License
+mccabe 0.7.0: http://pypi.python.org/pypi/mccabe : Expat License
+NumPy 1.24.4: https://numpy.org/ : BSD 3-clause "New" or "Revised" License
+Packaging 24.2: https://github.com/pypa/packaging : (BSD 2-clause "Simplified" License OR Apache License 2.0)
+pbr 6.1.0: http://openstack.org : Apache License 2.0
+psf-requests 2.32.3: http://docs.python-requests.org : Apache License 2.0
+pycodestyle 2.12.1: https://pypi.python.org/pypi/pycodestyle : MIT License
+Pyflakes 3.2.0: https://github.com/pyflakes/pyflakes : MIT License
+pytest 8.3.4: http://pytest.org : MIT License
+python3-charset-normalizer 3.4.1: https://github.com/ousret/charset_normalizer : MIT License
+python-certifi 2024.7.4: https://certifiio.readthedocs.io/en/latest/ : Mozilla Public License 2.0
+python-pluggy 1.5.0: https://pypi.python.org/pypi/pluggy : MIT License
+RonnyPfannschmidt/iniconfig 2.0.0: https://github.com/RonnyPfannschmidt/iniconfig : MIT License
+ruamel-yaml 0.18.6: https://pypi.org/project/ruamel.yaml/ : MIT License
+ruamel.yaml.clib 0.2.12: https://sourceforge.net/p/ruamel-yaml-clib/code/ci/default/tree/ : MIT License
+SciPy 1.9.1: http://www.scipy.org : BSD 3-clause "New" or "Revised" License
+smmap 5.0.2: https://github.com/gitpython-developers/smmap : BSD 3-clause "New" or "Revised" License
+tomli 2.2.1: https://github.com/hukkin/tomli : MIT License
+urllib3 2.3.0: https://urllib3.readthedocs.io/en/stable : MIT License
+voluptuous 0.15.2: http://pypi.python.org/pypi/voluptuous : BSD 3-clause "New" or "Revised" License
+
+Copyright Text: 
+
+Coverage 7.6.10 pypi:coverage/7.6.10: http://nedbatchelder.com/code/modules/coverage.html
+	No Copyrights found
+exceptiongroup 1.2.2 pypi:exceptiongroup/1.2.2: https://github.com/python-trio/exceptiongroup
 	Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
-
+
 	Copyright (c) 2022 Alex Gr
-
-flake8 7.1.1 pypi:flake8/7.1.1: https://gitlab.com/pycqa/flake8
+
+flake8 7.1.1 pypi:flake8/7.1.1: https://gitlab.com/pycqa/flake8
 	Copyright (C) 2011-2013 Tarek Ziade <tarek@ziade.org>
-
+
 	Copyright (C) 2012-2016 Ian Cordasco <graffatcolmingov@gmail.com>
-
-gitdb 4.0.12 pypi:gitdb/4.0.12: http://github.com/gitpython-developers/gitdb
-	No Copyrights found
-GitPython 3.1.44 pypi:GitPython/3.1.44: https://github.com/gitpython-developers/GitPython
-	No Copyrights found
-idna 3.10 pypi:idna/3.10: https://github.com/kjd/idna
+
+gitdb 4.0.12 pypi:gitdb/4.0.12: http://github.com/gitpython-developers/gitdb
+	No Copyrights found
+GitPython 3.1.44 pypi:GitPython/3.1.44: https://github.com/gitpython-developers/GitPython
+	No Copyrights found
+idna 3.10 pypi:idna/3.10: https://github.com/kjd/idna
 	Copyright (c) 2013-2024, Kim Davies and contributors.
 All rights reserved.
 
@@ -75,22 +75,22 @@ met:
    contributors may be used to endorse or promote products derived from
    this software without specific prior written permission.
 
-
-mccabe 0.7.0 pypi:mccabe/0.7.0: http://pypi.python.org/pypi/mccabe
+
+mccabe 0.7.0 pypi:mccabe/0.7.0: http://pypi.python.org/pypi/mccabe
 	Copyright © 2011-2013 Tarek Ziade <tarek@ziade.org>
-
+
 	Copyright © 2013 Florent Xicluna <florent.xicluna@gmail.com>
-
+
 	Copyright © <year> Ned Batchelder
-
-NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
+
+NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
 	(c)
 
     @pytest.mark.skipif(IS_PYPY and sys.implementation.version <= (7, 3, 8),
                         reason="PyPy bug in error formatting")
     def test_default_float_converter_exception(self):
         """
-
+
 	(c)
 
     def test_from_complex(self):
@@ -102,7 +102,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
         assert_equal(res, tgt)
 
     def test_complex_misformatted(self):
-
+
 	(c)
 
     where the points
@@ -115,20 +115,20 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     either case, either `x`, `y`, and `z` or their elements must support
     multiplication and addition both with themselves and with the elements
     of `c`.
-
+
 	(c)
                     check = None
             if dim and 'dimension' not in vars[n]:
-
+
 	(c)
                     depend = None
                 if check is not None:
-
+
 	(c)
             assert_equal(cp, c, msg)
 
     def test__complex__should_not_work(self):
-
+
 	(c)
             assert_equal(x.shape, (0,))
             x = np.loadtxt(c, dtype=np.int64)
@@ -136,7 +136,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
             assert_(x.dtype == np.int64)
 
     def test_unused_converter(self):
-
+
 	(c)
             res = self.advance(i)
             self.advance(len(c))
@@ -144,16 +144,16 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
 
     @property
     def next(self):
-
+
 	(C)
             want = np.array(
             assert_equal(have, want)
 
     def test_for_equal_names(self):
-
+
 	(c)
           !f2py integer, depend(c), intent(hide) :: m2 = shape(c, 1)
-
+
 	(c)
           !f2py integer, depend(c), intent(hide) :: n = f2py_itemsize(c)
           integer*1, dimension(m, n), intent(out) :: o
@@ -173,7 +173,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
             c(i) = transfer(o(i, :), c(i))
           end do
         end subroutine {fprefix}_array_output_{fsuffix}
-
+
 	(c)
           character :: c
           character, intent(in) :: o
@@ -189,7 +189,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
             o(i) = transfer(c(i), o(i))
           end do
        end subroutine {fprefix}_array_input
-
+
 	(c)
           character, dimension(3) :: c
           character, intent(in) :: o(3)
@@ -198,7 +198,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
           end do
        end function {fprefix}_array_return
 
-
+
 	(c)
           character, intent(in) :: o
           !f2py character o = "a"
@@ -206,7 +206,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
           c = o
        end function {fprefix}_optional
     """)
-
+
 	(c)
           integer
           !f2py intent(out) o
@@ -220,7 +220,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
           !f2py integer, depend(o), intent(hide) :: n = len(o)
           c = transfer(o, c)
         end subroutine {fprefix}_output_{fsuffix}
-
+
 	(c)
           integer
           do i=1,m1
@@ -230,7 +230,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
           end do
         end subroutine {fprefix}_2d_array_input_{fsuffix}
         """)
-
+
 	(c)
         assert_almost_equal(
             linalg.cond(a, 1),
@@ -250,19 +250,19 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
             single_decimal=5, double_decimal=11)
         assert_almost_equal(
             linalg.cond(a, 'fro'),
-
+
 	(c)
         assert_equal(a, l
         assert_equal(b, l['file_b'])
 
     def test_named_arrays_with_like(self):
-
+
 	(c)
         assert_equal(a, l
         assert_equal(b, l['like'])
 
     def test_BagObj(self):
-
+
 	(c)
         assert_equal(sorted(dir(l.f)),
         assert_equal(a, l.f.file_a)
@@ -270,7 +270,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
 
     @pytest.mark.skipif(IS_WASM, reason="Cannot start thread")
     def test_savez_filename_clashes(self):
-
+
 	(C)
         assert_equal(type(c
 
@@ -290,16 +290,16 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
         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)
-
+
 	(C)
         assert_equal(type(np.polyval(
 
     def test_polyvalfromroots(self):
-
+
 	(c)
         c
         if n == 1 and np.all(c[0] == 0):
-
+
 	(c)
         c = np.add.accumulate(a, 0, None, b)
         assert_equal(c, check)
@@ -310,7 +310,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
         c = np.add.reduceat(a, indices, axis=1)
         assert_equal(c, check)
         assert_(c.info, {'inputs': [0]})
-
+
 	(c)
         c = np.add.reduce(a, 1, None, b)
         assert_equal(c, check)
@@ -320,7 +320,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
         c = np.add.accumulate(a, axis=0)
         assert_equal(c, check)
         assert_(c.info, {'inputs': [0]})
-
+
 	(c)
         c = np.add.reduceat(a, indices, 1, None, b)
         assert_equal(c, check)
@@ -340,17 +340,17 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
         assert_equal(a, check)
         assert_(a.info, {'inputs': [0, 2]})
 
-
+
 	(c)
         c0 = c
         c1 = c[-1]
         for i in range(3, len(c) + 1):
-
+
 	(c)
         c0 = c
         c1 = c[-1]*xs
         for i in range(3, len(c) + 1):
-
+
 	(c)
         d = inner1d(a, b, axis=-1, out=out)
         assert_(d is out)
@@ -387,7 +387,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
         assert_raises(TypeError, np.add, 1., 1., axis=0)
 
     def test_keepdims_argument(self):
-
+
 	(c)
         d = inner1d(a, b, keepdims=True, out=out)
         assert_(d is out)
@@ -457,7 +457,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
         assert_raises(TypeError, np.add, 1., 1., keepdims=False)
 
     def test_innerwt(self):
-
+
 	(c)
         expected = np.array(
                              [144, -12, 1],
@@ -471,7 +471,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
         # 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).
-
+
 	(c)
         if (nl > 1) or (nr > 1) or (nl
             return False
@@ -480,18 +480,18 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
         #     "ab,bc->c" (implicitly sum over 'a')
         #     "ab,ca->ca" (take diagonal of 'a')
         if nl + nr - 1 == int(c in result):
-
+
 	(c)
         powers = np.array(
                            [1, 1, 1, 1, 1],
                            [16, -8, 4, -2, 1],
                            [81, 27, 9, 3, 1]])
         # Check default value of N:
-
+
 	(c)
         prd = zs
         for i in range(2, power + 1):
-
+
 	(c)
         return config_list
 
@@ -500,7 +500,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
                                          subpackage_path,
                                          parent_name,
                                          caller_level = 1):
-
+
 	(C)
         The data is in a single, C-style contiguous segment.
     F_CONTIGUOUS (F)
@@ -536,7 +536,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
         BEHAVED and F_CONTIGUOUS and not C_CONTIGUOUS.
 
     Notes
-
+
 	(c)
     # 3d
     f(d)
@@ -547,7 +547,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     # 3d - size
     f(g, size=(10, 10, 10))
 
-
+
 	(c)
     1.0
     >>> # Formatting supersedes all class/package-level defaults
@@ -555,17 +555,17 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     1.0 + 2.0·x + 3.0·x²
     """
     if style not in ('unicode', 'ascii'):
-
+
 	(c)
     1.0
     >>> np.polynomial.set_default_printstyle('ascii')
     >>> print(p)
     1.0 + 2.0 x + 3.0 x**2
-
+
 	(c)
     array(
 
-
+
 	(c)
     array(
            [1, 4],
@@ -573,7 +573,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
 
     Vector inner products:
 
-
+
 	(c)
     array(
            [2., 3.]])
@@ -583,17 +583,17 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     ...                      'formats': ('S1', 'i4', 'f4')})
     array([(b'M', 21, 72.), (b'F', 35, 58.)],
           dtype=[('gender', 'S1'), ('age', '<i4'), ('weight', '<f4')])
-
+
 	(c)
     array(
         dtype='|S4')
 
-
+
 	(c)
     array(
         dtype='|S5')
 
-
+
 	(c)
     array(
     >>> C.chebder(c,3)
@@ -603,7 +603,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     >>> C.chebder(c,2,-1)
     array([12.,  96.])
 
-
+
 	(c)
     array(
     >>> C.chebint(c,3)
@@ -616,7 +616,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     >>> C.chebint(c,scl=-2)
     array([-1.,  1., -1., -1.])
 
-
+
 	(c)
     array(
     >>> L.legder(c, 3)
@@ -626,7 +626,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     >>> L.legder(c, 2,-1)
     array([  9.,  60.])
 
-
+
 	(c)
     array(
     >>> L.legint(c, 3)
@@ -639,7 +639,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     >>> L.legint(c, scl=2)
     array([ 0.66666667,  0.8       ,  1.33333333,  1.2       ]) # may vary
 
-
+
 	(c)
     array(
     >>> np.char.strip(c, 'a') # 'a' unstripped from c[1] because whitespace leads
@@ -647,13 +647,13 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     >>> np.char.strip(c, 'A') # 'A' unstripped from c[1] because (unprinted) ws trails
     array(['aAaAa', '  aA  ', 'abBABba'], dtype='<U7')
 
-
+
 	(c)
     assert_equal(p.trim().coef, c
     assert_equal(p.trim(1e-10).coef, c[:2])
     assert_equal(p.trim(1e-5).coef, c[:1])
 
-
+
 	(c)
     except ValueError:
         # scalar covariance
@@ -668,42 +668,42 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     # excessive work.
     np.clip(c.real, -1, 1, out=c.real)
     if np.iscomplexobj(c):
-
+
 	(c)
     except ValueError:
         return 1
     #
     if xnotmask.all():
-
+
 	(c)
     if cnt >= n:
         c = c[:1]*0
     else:
-
+
 	(c)
     if cnt >= n:
         return c[:1]*0
     else:
-
+
 	(c)
     if n < 3:
         return c
     else:
-
+
 	(c)
     if n == 1:
         return c
     else:
-
+
 	(c)
     if n == 1:
         return c
     if n == 2:
-
+
 	(c)
     mod_rules.append(code)
     for r in mod_rules:
-
+
 	(c)
     x = la.eigvalsh(m)
 
@@ -711,7 +711,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     dy = _normed_hermite_e_n(x, ideg)
     df = _normed_hermite_e_n(x, ideg - 1) * np.sqrt(ideg)
     x -= dy/df
-
+
 	(c)
     x = la.eigvalsh(m)
 
@@ -719,7 +719,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     dy = _normed_hermite_n(x, ideg)
     df = _normed_hermite_n(x, ideg - 1) * np.sqrt(2*ideg)
     x -= dy/df
-
+
 	(c)
     x = la.eigvalsh(m)
 
@@ -727,7 +727,7 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     dy = lagval(x, c)
     df = lagval(x, lagder(c))
     x -= dy/df
-
+
 	(c)
     x = la.eigvalsh(m)
 
@@ -735,930 +735,930 @@ NumPy 1.24.4 pypi:numpy/1.24.4: https://numpy.org/
     dy = legval(x, c)
     df = legval(x, legder(c))
     x -= dy/df
-
-	(c)
-
-
-class TestMatmulOperator(MatmulCommon):
-    import operator
-    matmul = operator.matmul
-
-    def test_array_priority_override(self):
-
-
-	(c)
-
-    @pytest.mark.skipif(IS_PYPY and sys.implementation.version <= (7, 3, 8),
-                        reason="PyPy bug in error formatting")
-    def test_default_float_converter_exception(self):
-        """
-
-	(c)
-
-    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):
-
-	(c)
-
-    where the points
-    `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`.
-
-	(C)
-
-np.asanyarray(A)
-np.asanyarray(B)
-np.asanyarray(B, dtype=int)
-
-	(C)
-
-np.ascontiguousarray(A)
-np.ascontiguousarray(B)
-
-	(C)
-
-np.asfortranarray(A)
-np.asfortranarray(B)
-
-	(C)
-
-np.atleast_3d(C)
-
-np.vstack([C, C])
-np.vstack([C, A])
-np.vstack([A, A])
-
-	(C)
-
-np.linspace(0, 2)
-np.linspace(0.5, [0, 1, 2])
-np.linspace([0, 1, 2], 3)
-np.linspace(0j, 2)
-np.linspace(0, 2, num=10)
-np.linspace(0, 2, endpoint=True)
-np.linspace(0, 2, retstep=True)
-np.linspace(0j, 2j, retstep=True)
-np.linspace(0, 2, dtype=bool)
-np.linspace([0, 1], [2, 3], axis=Index())
-
-np.logspace(0, 2, base=2)
-np.logspace(0, 2, base=2)
-np.logspace(0, 2, base=[1j, 2j], num=2)
-
-	(C)
-
-np.require(A)
-np.require(B)
-np.require(B, dtype=int)
-np.require(B, requirements=None)
-np.require(B, requirements="E")
-np.require(B, requirements=["ENSUREARRAY"])
-np.require(B, requirements={"F", "E"})
-np.require(B, requirements=["C", "OWNDATA"])
-np.require(B, requirements="W")
-np.require(B, requirements="A")
-
-	(c)
-                    check = None
-            if dim and 'dimension' not in vars[n]:
-
-	(c)
-                    depend = None
-                if check is not None:
-
-	(c)
-            assert_equal(cp, c, msg)
-
-    def test__complex__should_not_work(self):
-
-	(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)
-            res = self.advance(i)
-            self.advance(len(c))
-            return res
-
-    @property
-    def next(self):
-
-	(C)
-            want = np.array(
-            assert_equal(have, want)
-
-    def test_for_equal_names(self):
-
-	(c)
-          !f2py integer, depend(c), intent(hide) :: m2 = shape(c, 1)
-
-	(c)
-          !f2py integer, depend(c), intent(hide) :: n = f2py_itemsize(c)
-          integer*1, dimension(m, n), intent(out) :: o
-          do i=1,m
-            o(i, :) = transfer(c(i), o(i, :))
-          end do
-        end subroutine {fprefix}_array_input_{fsuffix}
-
-        subroutine {fprefix}_array_output_{fsuffix}(c, o, m, n)
-          character*{clength}, intent(out), dimension(m) :: c
-          integer n
-          integer*1, dimension(m, n), intent(in) :: o
-          !f2py character(f2py_len=n) :: c
-          !f2py integer, depend(o), intent(hide) :: m = len(o)
-          !f2py integer, depend(o), intent(hide) :: n = shape(o, 1)
-          do i=1,m
-            c(i) = transfer(o(i, :), c(i))
-          end do
-        end subroutine {fprefix}_array_output_{fsuffix}
-
-	(c)
-          character :: c
-          character, intent(in) :: o
-          c = transfer(o, c)
-       end function {fprefix}_return
-
-       subroutine {fprefix}_array_input(c, o)
-          character, intent(in) :: c(3)
-          integer*1 o(3)
-          !f2py intent(out) o
-          integer i
-          do i=1,3
-            o(i) = transfer(c(i), o(i))
-          end do
-       end subroutine {fprefix}_array_input
-
-	(c)
-          character, dimension(3) :: c
-          character, intent(in) :: o(3)
-          do i=1,3
-            c(i) = o(i)
-          end do
-       end function {fprefix}_array_return
-
-
-	(c)
-          character, intent(in) :: o
-          !f2py character o = "a"
-          character :: c
-          c = o
-       end function {fprefix}_optional
-    """)
-
-	(c)
-          integer
-          !f2py intent(out) o
-          o = transfer(c, o)
-        end subroutine {fprefix}_input_{fsuffix}
-
-        subroutine {fprefix}_output_{fsuffix}(c, o, n)
-          character*{clength}, intent(out) :: c
-          integer n
-          integer*1, dimension(n), intent(in) :: o
-          !f2py integer, depend(o), intent(hide) :: n = len(o)
-          c = transfer(o, c)
-        end subroutine {fprefix}_output_{fsuffix}
-
-	(c)
-          integer
-          do i=1,m1
-            do j=1,m2
-              o(i, j, :) = transfer(c(i, j), o(i, j, :))
-            end do
-          end do
-        end subroutine {fprefix}_2d_array_input_{fsuffix}
-        """)
-
-	(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'),
-
-	(c)
-        assert_equal(a, l
-        assert_equal(b, l['file_b'])
-
-    def test_named_arrays_with_like(self):
-
-	(c)
-        assert_equal(a, l
-        assert_equal(b, l['like'])
-
-    def test_BagObj(self):
-
-	(c)
-        assert_equal(sorted(dir(l.f)),
-        assert_equal(a, l.f.file_a)
-        assert_equal(b, l.f.file_b)
-
-    @pytest.mark.skipif(IS_WASM, reason="Cannot start thread")
-    def test_savez_filename_clashes(self):
-
-	(C)
-        assert_equal(type(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)
-
-	(C)
-        assert_equal(type(np.polyval(
-
-    def test_polyvalfromroots(self):
-
-	(c)
-        c
-        if n == 1 and np.all(c[0] == 0):
-
-	(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]})
-
-	(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]})
-
-	(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]})
-
-
-	(c)
-        c0 = c
-        c1 = c[-1]
-        for i in range(3, len(c) + 1):
-
-	(c)
-        c0 = c
-        c1 = c[-1]*xs
-        for i in range(3, len(c) + 1):
-
-	(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):
-
-	(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):
-
-	(c)
-        expected = np.array(
-                             [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).
-
-	(c)
-        if (nl > 1) or (nr > 1) or (nl
-            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):
-
-	(c)
-        powers = np.array(
-                           [1, 1, 1, 1, 1],
-                           [16, -8, 4, -2, 1],
-                           [81, 27, 9, 3, 1]])
-        # Check default value of N:
-
-	(c)
-        prd = zs
-        for i in range(2, power + 1):
-
-	(c)
-        return config_list
-
-    def _get_configuration_from_setup_py(self, setup_py,
-                                         subpackage_name,
-                                         subpackage_path,
-                                         parent_name,
-                                         caller_level = 1):
-
-	(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.
-    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
-
-	(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))
-
-
-	(c)
-    1.0
-    >>> # Formatting supersedes all class/package-level defaults
-    >>> print(f"{p:unicode}")
-    1.0 + 2.0·x + 3.0·x²
-    """
-    if style not in ('unicode', 'ascii'):
-
-	(c)
-    1.0
-    >>> np.polynomial.set_default_printstyle('ascii')
-    >>> print(p)
-    1.0 + 2.0 x + 3.0 x**2
-
-	(c)
-    array(
-
-
-	(c)
-    array(
-           [1, 4],
-           [2, 5]])
-
-    Vector inner products:
-
-
-	(c)
-    array(
-           [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)
-    array(
-        dtype='|S4')
-
-
-	(c)
-    array(
-        dtype='|S5')
-
-
-	(c)
-    array(
-    >>> C.chebder(c,3)
-    array([96.])
-    >>> C.chebder(c,scl=-1)
-    array([-14., -12., -24.])
-    >>> C.chebder(c,2,-1)
-    array([12.,  96.])
-
-
-	(c)
-    array(
-    >>> 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)
-    array(
-    >>> L.legder(c, 3)
-    array([60.])
-    >>> L.legder(c, scl=-1)
-    array([ -6.,  -9., -20.])
-    >>> L.legder(c, 2,-1)
-    array([  9.,  60.])
-
-
-	(c)
-    array(
-    >>> 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)
-    array(
-    >>> 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')
-
-
-	(c)
-    assert_equal(p.trim().coef, c
-    assert_equal(p.trim(1e-10).coef, c[:2])
-    assert_equal(p.trim(1e-5).coef, c[:1])
-
-
-	(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):
-
-	(c)
-    except ValueError:
-        return 1
-    #
-    if xnotmask.all():
-
-	(c)
-    if cnt >= n:
-        c = c[:1]*0
-    else:
-
-	(c)
-    if cnt >= n:
-        return c[:1]*0
-    else:
-
-	(c)
-    if n < 3:
-        return c
-    else:
-
-	(c)
-    if n == 1:
-        return c
-    else:
-
-	(c)
-    if n == 1:
-        return c
-    if n == 2:
-
-	(c)
-    mod_rules.append(code)
-    for r in mod_rules:
-
-	(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
-
-	(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
-
-	(c)
-    x = la.eigvalsh(m)
-
-    # improve roots by one application of Newton
-    dy = lagval(x, c)
-    df = lagval(x, lagder(c))
-    x -= dy/df
-
-	(c)
-    x = la.eigvalsh(m)
-
-    # improve roots by one application of Newton
-    dy = legval(x, c)
-    df = legval(x, legder(c))
-    x -= dy/df
-
-	(c)
-np.all(A)
-np.all(B)
-np.all(A, axis=0)
-np.all(B, axis=0)
-np.all(A, keepdims=True)
-np.all(B, keepdims=True)
-
-np.any(a)
-np.any(b)
-
-	(c)
-np.amax(A)
-np.amax(B)
-np.amax(A, axis=0)
-np.amax(B, axis=0)
-np.amax(A, keepdims=True)
-np.amax(B, keepdims=True)
-
-np.amin(a)
-np.amin(b)
-
-	(c)
-np.amin(A)
-np.amin(B)
-np.amin(A, axis=0)
-np.amin(B, axis=0)
-np.amin(A, keepdims=True)
-np.amin(B, keepdims=True)
-
-np.prod(a)
-np.prod(b)
-
-	(c)
-np.any(A)
-np.any(B)
-np.any(A, axis=0)
-np.any(B, axis=0)
-np.any(A, keepdims=True)
-np.any(B, keepdims=True)
-
-np.cumsum(a)
-np.cumsum(b)
-
-	(c)
-np.around(A)
-np.around(B)
-
-np.mean(a)
-np.mean(b)
-
-	(C)
-np.atleast_1d(A)
-np.atleast_1d(C, C)
-np.atleast_1d(C, A)
-np.atleast_1d(A, A)
-
-
-	(c)
-np.cumprod(A)
-np.cumprod(B)
-
-np.ndim(a)
-np.ndim(b)
-
-	(c)
-np.cumsum(A)
-np.cumsum(B)
-
-np.ptp(b)
-
-	(C)
-np.empty_like(B)
-np.empty_like(B, dtype=np.int64)
-
-np.full_like(A, i8)
-np.full_like(C, i8)
-np.full_like(B, i8)
-np.full_like(B, i8, dtype=np.int64)
-
-	(c)
-np.mean(A)
-np.mean(B)
-np.mean(A, axis=0)
-np.mean(B, axis=0)
-np.mean(A, keepdims=True)
-np.mean(B, keepdims=True)
-np.mean(b, out=d)
-np.mean(B, out=d)
-
-np.std(a)
-np.std(b)
-
-	(c)
-np.ndim(A)
-np.ndim(B)
-
-np.size(a)
-np.size(b)
-
-	(C)
-np.ones_like(B)
-np.ones_like(B, dtype=np.int64)
-
-np.empty_like(A)
-
-	(c)
-np.prod(A)
-np.prod(B)
-np.prod(a, dtype=None)
-np.prod(A, dtype=None)
-np.prod(A, axis=0)
-np.prod(B, axis=0)
-np.prod(A, keepdims=True)
-np.prod(B, keepdims=True)
-np.prod(b, out=d)
-np.prod(B, out=d)
-
-np.cumprod(a)
-np.cumprod(b)
-
-	(c)
-np.ptp(B)
-np.ptp(B, axis=0)
-np.ptp(B, keepdims=True)
-
-np.amax(a)
-np.amax(b)
-
-	(c)
-np.ravel(A)
-np.ravel(B)
-
-np.nonzero(A)
-np.nonzero(B)
-
-	(c)
-np.shape(A)
-np.shape(B)
-
-np.compress([True], a)
-np.compress([True], b)
-np.compress([True], c)
-np.compress([True], A)
-np.compress([True], B)
-
-	(c)
-np.size(A)
-np.size(B)
-
-np.around(a)
-np.around(b)
-
-	(c)
-np.squeeze(A)
-np.squeeze(B)
-
-np.diagonal(A)
-np.diagonal(B)
-
-	(c)
-np.std(A)
-np.std(B)
-np.std(A, axis=0)
-np.std(B, axis=0)
-np.std(A, keepdims=True)
-np.std(B, keepdims=True)
-np.std(b, out=d)
-np.std(B, out=d)
-
-np.var(a)
-np.var(b)
-
-	(c)
-np.sum(A)
-np.sum(B)
-np.sum(A, axis=0)
-np.sum(B, axis=0)
-
-np.all(a)
-np.all(b)
-
-	(c)
-np.transpose(A)
-np.transpose(B)
-
-np.partition(a, 0, axis=None)
-np.partition(b, 0, axis=None)
-np.partition(c, 0, axis=None)
-np.partition(A, 0)
-np.partition(B, 0)
-
-	(c)
-np.var(A)
-np.var(B)
-np.var(A, axis=0)
-np.var(B, axis=0)
-np.var(A, keepdims=True)
-np.var(B, keepdims=True)
-np.var(b, out=d)
-
-	(C)
-np.zeros_like(B)
-np.zeros_like(B, dtype=np.int64)
-
-np.ones_like(A)
-
+
+	(c)
+
+
+class TestMatmulOperator(MatmulCommon):
+    import operator
+    matmul = operator.matmul
+
+    def test_array_priority_override(self):
+
+
+	(c)
+
+    @pytest.mark.skipif(IS_PYPY and sys.implementation.version <= (7, 3, 8),
+                        reason="PyPy bug in error formatting")
+    def test_default_float_converter_exception(self):
+        """
+
+	(c)
+
+    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):
+
+	(c)
+
+    where the points
+    `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`.
+
+	(C)
+
+np.asanyarray(A)
+np.asanyarray(B)
+np.asanyarray(B, dtype=int)
+
+	(C)
+
+np.ascontiguousarray(A)
+np.ascontiguousarray(B)
+
+	(C)
+
+np.asfortranarray(A)
+np.asfortranarray(B)
+
+	(C)
+
+np.atleast_3d(C)
+
+np.vstack([C, C])
+np.vstack([C, A])
+np.vstack([A, A])
+
+	(C)
+
+np.linspace(0, 2)
+np.linspace(0.5, [0, 1, 2])
+np.linspace([0, 1, 2], 3)
+np.linspace(0j, 2)
+np.linspace(0, 2, num=10)
+np.linspace(0, 2, endpoint=True)
+np.linspace(0, 2, retstep=True)
+np.linspace(0j, 2j, retstep=True)
+np.linspace(0, 2, dtype=bool)
+np.linspace([0, 1], [2, 3], axis=Index())
+
+np.logspace(0, 2, base=2)
+np.logspace(0, 2, base=2)
+np.logspace(0, 2, base=[1j, 2j], num=2)
+
+	(C)
+
+np.require(A)
+np.require(B)
+np.require(B, dtype=int)
+np.require(B, requirements=None)
+np.require(B, requirements="E")
+np.require(B, requirements=["ENSUREARRAY"])
+np.require(B, requirements={"F", "E"})
+np.require(B, requirements=["C", "OWNDATA"])
+np.require(B, requirements="W")
+np.require(B, requirements="A")
+
+	(c)
+                    check = None
+            if dim and 'dimension' not in vars[n]:
+
+	(c)
+                    depend = None
+                if check is not None:
+
+	(c)
+            assert_equal(cp, c, msg)
+
+    def test__complex__should_not_work(self):
+
+	(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)
+            res = self.advance(i)
+            self.advance(len(c))
+            return res
+
+    @property
+    def next(self):
+
+	(C)
+            want = np.array(
+            assert_equal(have, want)
+
+    def test_for_equal_names(self):
+
+	(c)
+          !f2py integer, depend(c), intent(hide) :: m2 = shape(c, 1)
+
+	(c)
+          !f2py integer, depend(c), intent(hide) :: n = f2py_itemsize(c)
+          integer*1, dimension(m, n), intent(out) :: o
+          do i=1,m
+            o(i, :) = transfer(c(i), o(i, :))
+          end do
+        end subroutine {fprefix}_array_input_{fsuffix}
+
+        subroutine {fprefix}_array_output_{fsuffix}(c, o, m, n)
+          character*{clength}, intent(out), dimension(m) :: c
+          integer n
+          integer*1, dimension(m, n), intent(in) :: o
+          !f2py character(f2py_len=n) :: c
+          !f2py integer, depend(o), intent(hide) :: m = len(o)
+          !f2py integer, depend(o), intent(hide) :: n = shape(o, 1)
+          do i=1,m
+            c(i) = transfer(o(i, :), c(i))
+          end do
+        end subroutine {fprefix}_array_output_{fsuffix}
+
+	(c)
+          character :: c
+          character, intent(in) :: o
+          c = transfer(o, c)
+       end function {fprefix}_return
+
+       subroutine {fprefix}_array_input(c, o)
+          character, intent(in) :: c(3)
+          integer*1 o(3)
+          !f2py intent(out) o
+          integer i
+          do i=1,3
+            o(i) = transfer(c(i), o(i))
+          end do
+       end subroutine {fprefix}_array_input
+
+	(c)
+          character, dimension(3) :: c
+          character, intent(in) :: o(3)
+          do i=1,3
+            c(i) = o(i)
+          end do
+       end function {fprefix}_array_return
+
+
+	(c)
+          character, intent(in) :: o
+          !f2py character o = "a"
+          character :: c
+          c = o
+       end function {fprefix}_optional
+    """)
+
+	(c)
+          integer
+          !f2py intent(out) o
+          o = transfer(c, o)
+        end subroutine {fprefix}_input_{fsuffix}
+
+        subroutine {fprefix}_output_{fsuffix}(c, o, n)
+          character*{clength}, intent(out) :: c
+          integer n
+          integer*1, dimension(n), intent(in) :: o
+          !f2py integer, depend(o), intent(hide) :: n = len(o)
+          c = transfer(o, c)
+        end subroutine {fprefix}_output_{fsuffix}
+
+	(c)
+          integer
+          do i=1,m1
+            do j=1,m2
+              o(i, j, :) = transfer(c(i, j), o(i, j, :))
+            end do
+          end do
+        end subroutine {fprefix}_2d_array_input_{fsuffix}
+        """)
+
+	(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'),
+
+	(c)
+        assert_equal(a, l
+        assert_equal(b, l['file_b'])
+
+    def test_named_arrays_with_like(self):
+
+	(c)
+        assert_equal(a, l
+        assert_equal(b, l['like'])
+
+    def test_BagObj(self):
+
+	(c)
+        assert_equal(sorted(dir(l.f)),
+        assert_equal(a, l.f.file_a)
+        assert_equal(b, l.f.file_b)
+
+    @pytest.mark.skipif(IS_WASM, reason="Cannot start thread")
+    def test_savez_filename_clashes(self):
+
+	(C)
+        assert_equal(type(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)
+
+	(C)
+        assert_equal(type(np.polyval(
+
+    def test_polyvalfromroots(self):
+
+	(c)
+        c
+        if n == 1 and np.all(c[0] == 0):
+
+	(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]})
+
+	(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]})
+
+	(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]})
+
+
+	(c)
+        c0 = c
+        c1 = c[-1]
+        for i in range(3, len(c) + 1):
+
+	(c)
+        c0 = c
+        c1 = c[-1]*xs
+        for i in range(3, len(c) + 1):
+
+	(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):
+
+	(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):
+
+	(c)
+        expected = np.array(
+                             [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).
+
+	(c)
+        if (nl > 1) or (nr > 1) or (nl
+            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):
+
+	(c)
+        powers = np.array(
+                           [1, 1, 1, 1, 1],
+                           [16, -8, 4, -2, 1],
+                           [81, 27, 9, 3, 1]])
+        # Check default value of N:
+
+	(c)
+        prd = zs
+        for i in range(2, power + 1):
+
+	(c)
+        return config_list
+
+    def _get_configuration_from_setup_py(self, setup_py,
+                                         subpackage_name,
+                                         subpackage_path,
+                                         parent_name,
+                                         caller_level = 1):
+
+	(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.
+    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
+
+	(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))
+
+
+	(c)
+    1.0
+    >>> # Formatting supersedes all class/package-level defaults
+    >>> print(f"{p:unicode}")
+    1.0 + 2.0·x + 3.0·x²
+    """
+    if style not in ('unicode', 'ascii'):
+
+	(c)
+    1.0
+    >>> np.polynomial.set_default_printstyle('ascii')
+    >>> print(p)
+    1.0 + 2.0 x + 3.0 x**2
+
+	(c)
+    array(
+
+
+	(c)
+    array(
+           [1, 4],
+           [2, 5]])
+
+    Vector inner products:
+
+
+	(c)
+    array(
+           [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)
+    array(
+        dtype='|S4')
+
+
+	(c)
+    array(
+        dtype='|S5')
+
+
+	(c)
+    array(
+    >>> C.chebder(c,3)
+    array([96.])
+    >>> C.chebder(c,scl=-1)
+    array([-14., -12., -24.])
+    >>> C.chebder(c,2,-1)
+    array([12.,  96.])
+
+
+	(c)
+    array(
+    >>> 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)
+    array(
+    >>> L.legder(c, 3)
+    array([60.])
+    >>> L.legder(c, scl=-1)
+    array([ -6.,  -9., -20.])
+    >>> L.legder(c, 2,-1)
+    array([  9.,  60.])
+
+
+	(c)
+    array(
+    >>> 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)
+    array(
+    >>> 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')
+
+
+	(c)
+    assert_equal(p.trim().coef, c
+    assert_equal(p.trim(1e-10).coef, c[:2])
+    assert_equal(p.trim(1e-5).coef, c[:1])
+
+
+	(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):
+
+	(c)
+    except ValueError:
+        return 1
+    #
+    if xnotmask.all():
+
+	(c)
+    if cnt >= n:
+        c = c[:1]*0
+    else:
+
+	(c)
+    if cnt >= n:
+        return c[:1]*0
+    else:
+
+	(c)
+    if n < 3:
+        return c
+    else:
+
+	(c)
+    if n == 1:
+        return c
+    else:
+
+	(c)
+    if n == 1:
+        return c
+    if n == 2:
+
+	(c)
+    mod_rules.append(code)
+    for r in mod_rules:
+
+	(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
+
+	(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
+
+	(c)
+    x = la.eigvalsh(m)
+
+    # improve roots by one application of Newton
+    dy = lagval(x, c)
+    df = lagval(x, lagder(c))
+    x -= dy/df
+
+	(c)
+    x = la.eigvalsh(m)
+
+    # improve roots by one application of Newton
+    dy = legval(x, c)
+    df = legval(x, legder(c))
+    x -= dy/df
+
+	(c)
+np.all(A)
+np.all(B)
+np.all(A, axis=0)
+np.all(B, axis=0)
+np.all(A, keepdims=True)
+np.all(B, keepdims=True)
+
+np.any(a)
+np.any(b)
+
+	(c)
+np.amax(A)
+np.amax(B)
+np.amax(A, axis=0)
+np.amax(B, axis=0)
+np.amax(A, keepdims=True)
+np.amax(B, keepdims=True)
+
+np.amin(a)
+np.amin(b)
+
+	(c)
+np.amin(A)
+np.amin(B)
+np.amin(A, axis=0)
+np.amin(B, axis=0)
+np.amin(A, keepdims=True)
+np.amin(B, keepdims=True)
+
+np.prod(a)
+np.prod(b)
+
+	(c)
+np.any(A)
+np.any(B)
+np.any(A, axis=0)
+np.any(B, axis=0)
+np.any(A, keepdims=True)
+np.any(B, keepdims=True)
+
+np.cumsum(a)
+np.cumsum(b)
+
+	(c)
+np.around(A)
+np.around(B)
+
+np.mean(a)
+np.mean(b)
+
+	(C)
+np.atleast_1d(A)
+np.atleast_1d(C, C)
+np.atleast_1d(C, A)
+np.atleast_1d(A, A)
+
+
+	(c)
+np.cumprod(A)
+np.cumprod(B)
+
+np.ndim(a)
+np.ndim(b)
+
+	(c)
+np.cumsum(A)
+np.cumsum(B)
+
+np.ptp(b)
+
+	(C)
+np.empty_like(B)
+np.empty_like(B, dtype=np.int64)
+
+np.full_like(A, i8)
+np.full_like(C, i8)
+np.full_like(B, i8)
+np.full_like(B, i8, dtype=np.int64)
+
+	(c)
+np.mean(A)
+np.mean(B)
+np.mean(A, axis=0)
+np.mean(B, axis=0)
+np.mean(A, keepdims=True)
+np.mean(B, keepdims=True)
+np.mean(b, out=d)
+np.mean(B, out=d)
+
+np.std(a)
+np.std(b)
+
+	(c)
+np.ndim(A)
+np.ndim(B)
+
+np.size(a)
+np.size(b)
+
+	(C)
+np.ones_like(B)
+np.ones_like(B, dtype=np.int64)
+
+np.empty_like(A)
+
+	(c)
+np.prod(A)
+np.prod(B)
+np.prod(a, dtype=None)
+np.prod(A, dtype=None)
+np.prod(A, axis=0)
+np.prod(B, axis=0)
+np.prod(A, keepdims=True)
+np.prod(B, keepdims=True)
+np.prod(b, out=d)
+np.prod(B, out=d)
+
+np.cumprod(a)
+np.cumprod(b)
+
+	(c)
+np.ptp(B)
+np.ptp(B, axis=0)
+np.ptp(B, keepdims=True)
+
+np.amax(a)
+np.amax(b)
+
+	(c)
+np.ravel(A)
+np.ravel(B)
+
+np.nonzero(A)
+np.nonzero(B)
+
+	(c)
+np.shape(A)
+np.shape(B)
+
+np.compress([True], a)
+np.compress([True], b)
+np.compress([True], c)
+np.compress([True], A)
+np.compress([True], B)
+
+	(c)
+np.size(A)
+np.size(B)
+
+np.around(a)
+np.around(b)
+
+	(c)
+np.squeeze(A)
+np.squeeze(B)
+
+np.diagonal(A)
+np.diagonal(B)
+
+	(c)
+np.std(A)
+np.std(B)
+np.std(A, axis=0)
+np.std(B, axis=0)
+np.std(A, keepdims=True)
+np.std(B, keepdims=True)
+np.std(b, out=d)
+np.std(B, out=d)
+
+np.var(a)
+np.var(b)
+
+	(c)
+np.sum(A)
+np.sum(B)
+np.sum(A, axis=0)
+np.sum(B, axis=0)
+
+np.all(a)
+np.all(b)
+
+	(c)
+np.transpose(A)
+np.transpose(B)
+
+np.partition(a, 0, axis=None)
+np.partition(b, 0, axis=None)
+np.partition(c, 0, axis=None)
+np.partition(A, 0)
+np.partition(B, 0)
+
+	(c)
+np.var(A)
+np.var(B)
+np.var(A, axis=0)
+np.var(B, axis=0)
+np.var(A, keepdims=True)
+np.var(B, keepdims=True)
+np.var(b, out=d)
+
+	(C)
+np.zeros_like(B)
+np.zeros_like(B, dtype=np.int64)
+
+np.ones_like(A)
+
 	(c) # (d/dx)(c) = 2
     array([  2.,   6.,  12.])
     >>> P.polyder(c,3) # (d**3/dx**3)(c) = 24
@@ -1668,17 +1668,17 @@ np.ones_like(A)
     >>> P.polyder(c,2,-1) # (d**2/d(-x)**2)(c) = 6 + 24x
     array([  6.,  24.])
 
-
-	(c) # (d/dx)(c) = 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) # (d/dx)(c) = 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) # should return array(
     array([0.,  1.,  1.,  1.])
     >>> P.polyint(c,3) # should return array([0, 0, 0, 1/6, 1/12, 1/20])
@@ -1691,56 +1691,56 @@ np.ones_like(A)
     >>> P.polyint(c,scl=-2) # should return array([0, -2, -2, -2])
     array([ 0., -2., -2., -2.])
 
-
-	(c) # should return array(
-    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) # should return array(
+    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) < 2:
         raise ValueError('Series must have maximum degree of at least 1.')
     if len(c) == 2:
-
+
 	(c) < 2:
         return np.array([], dtype=c.dtype)
     if len(c) == 2:
-
-	(c) < 2:
-        raise ValueError('Series must have maximum degree of at least 1.')
-    if len(c) == 2:
-
-	(c) < 2:
-        return np.array([], dtype=c.dtype)
-    if len(c) == 2:
-
+
+	(c) < 2:
+        raise ValueError('Series must have maximum degree of at least 1.')
+    if len(c) == 2:
+
+	(c) < 2:
+        return np.array([], dtype=c.dtype)
+    if len(c) == 2:
+
 	(c) > 1:
         tmp = c[1:]/2
         prd[2:] = tmp
         prd[0:-2] += tmp
     return prd
 
-
-	(c) > 1:
-        tmp = c[1:]/2
-        prd[2:] = tmp
-        prd[0:-2] += tmp
-    return prd
-
-
+
+	(c) > 1:
+        tmp = c[1:]/2
+        prd[2:] = tmp
+        prd[0:-2] += tmp
+    return prd
+
+
 	(c) > tol)
     if len(ind) == 0:
-
-	(c) > tol)
-    if len(ind) == 0:
-
+
+	(c) > tol)
+    if len(ind) == 0:
+
 	(c) call-back (Python) functions            :
             cb_passed_call_time);
     fprintf(stderr, "(d) f2py call-back interface, %6d calls  : %8d msec\n",
@@ -1753,75 +1753,75 @@ np.ones_like(A)
             "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);
-
-	(c) call-back (Python) functions            :
-            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);
-
+
+	(c) call-back (Python) functions            :
+            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);
+
 	(c) foo
             integer intent(out) :: x
             callprotoargument int*
             callstatement {{ &
                 ; &
                 x = 42; &
-
+
 	(c) foo
             integer intent(out) :: x
         end subroutine foo
     end interface
 end python module {module_name}
     """
-
-	(c) foo
-            integer intent(out) :: x
-            callprotoargument int*
-            callstatement {{ &
-                ; &
-                x = 42; &
-
-	(c) foo
-            integer intent(out) :: x
-        end subroutine foo
-    end interface
-end python module {module_name}
-    """
-
+
+	(c) foo
+            integer intent(out) :: x
+            callprotoargument int*
+            callstatement {{ &
+                ; &
+                x = 42; &
+
+	(c) foo
+            integer intent(out) :: x
+        end subroutine foo
+    end interface
+end python module {module_name}
+    """
+
 	(c) for c in
 
     def test_values(self):
-
+
 	(c) for c in
 class TestMatrixPower:
 
-
-	(c) for c in
-
-    def test_values(self):
-
-	(c) for c in
-class TestMatrixPower:
-
-
+
+	(c) for c in
+
+    def test_values(self):
+
+	(c) for c in
+class TestMatrixPower:
+
+
 	(c) for c in arr
         if charmax < 256:
-
-	(c) for c in arr
-        if charmax < 256:
-
+
+	(c) for c in arr
+        if charmax < 256:
+
 	(c) for c in c2d
         res = cheb.chebder(c2d, axis=1)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d
         res = cheb.chebint(c2d, axis=1)
         assert_almost_equal(res, tgt)
@@ -1829,12 +1829,12 @@ class TestMatrixPower:
         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)
-
+
 	(c) for c in c2d
         res = herm.hermder(c2d, axis=1)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d
         res = herm.hermint(c2d, axis=1)
         assert_almost_equal(res, tgt)
@@ -1842,12 +1842,12 @@ class TestMatrixPower:
         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)
-
+
 	(c) for c in c2d
         res = herme.hermeder(c2d, axis=1)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d
         res = herme.hermeint(c2d, axis=1)
         assert_almost_equal(res, tgt)
@@ -1855,12 +1855,12 @@ class TestMatrixPower:
         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)
-
+
 	(c) for c in c2d
         res = lag.lagder(c2d, axis=1)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d
         res = lag.lagint(c2d, axis=1)
         assert_almost_equal(res, tgt)
@@ -1868,13 +1868,13 @@ class TestMatrixPower:
         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)
-
+
 	(c) for c in c2d
         res = leg.legder(c2d, axis=1)
         assert_almost_equal(res, tgt)
 
     def test_legder_orderhigherthancoeff(self):
-
+
 	(c) for c in c2d
         res = leg.legint(c2d, axis=1)
         assert_almost_equal(res, tgt)
@@ -1882,12 +1882,12 @@ class TestMatrixPower:
         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)
-
+
 	(c) for c in c2d
         res = poly.polyder(c2d, axis=1)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d
         res = poly.polyint(c2d, axis=1)
         assert_almost_equal(res, tgt)
@@ -1895,236 +1895,236 @@ class TestMatrixPower:
         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)
-
-	(c) for c in c2d
-        res = cheb.chebder(c2d, axis=1)
-        assert_almost_equal(res, tgt)
-
-
-	(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)
-
-	(c) for c in c2d
-        res = herm.hermder(c2d, axis=1)
-        assert_almost_equal(res, tgt)
-
-
-	(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)
-
-	(c) for c in c2d
-        res = herme.hermeder(c2d, axis=1)
-        assert_almost_equal(res, tgt)
-
-
-	(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)
-
-	(c) for c in c2d
-        res = lag.lagder(c2d, axis=1)
-        assert_almost_equal(res, tgt)
-
-
-	(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)
-
-	(c) for c in c2d
-        res = leg.legder(c2d, axis=1)
-        assert_almost_equal(res, tgt)
-
-    def test_legder_orderhigherthancoeff(self):
-
-	(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)
-
-	(c) for c in c2d
-        res = poly.polyder(c2d, axis=1)
-        assert_almost_equal(res, tgt)
-
-
-	(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)
-
+
+	(c) for c in c2d
+        res = cheb.chebder(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+	(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)
+
+	(c) for c in c2d
+        res = herm.hermder(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+	(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)
+
+	(c) for c in c2d
+        res = herme.hermeder(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+	(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)
+
+	(c) for c in c2d
+        res = lag.lagder(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+	(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)
+
+	(c) for c in c2d
+        res = leg.legder(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+    def test_legder_orderhigherthancoeff(self):
+
+	(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)
+
+	(c) for c in c2d
+        res = poly.polyder(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+	(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)
+
 	(c) for c in c2d.T
         res = cheb.chebder(c2d, axis=0)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d.T
         res = cheb.chebint(c2d, axis=0)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d.T
         res = herm.hermder(c2d, axis=0)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d.T
         res = herm.hermint(c2d, axis=0)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d.T
         res = herme.hermeder(c2d, axis=0)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d.T
         res = herme.hermeint(c2d, axis=0)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d.T
         res = lag.lagder(c2d, axis=0)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d.T
         res = lag.lagint(c2d, axis=0)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d.T
         res = leg.legder(c2d, axis=0)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d.T
         res = leg.legint(c2d, axis=0)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d.T
         res = poly.polyder(c2d, axis=0)
         assert_almost_equal(res, tgt)
 
-
+
 	(c) for c in c2d.T
         res = poly.polyint(c2d, axis=0)
         assert_almost_equal(res, tgt)
 
-
-	(c) for c in c2d.T
-        res = cheb.chebder(c2d, axis=0)
-        assert_almost_equal(res, tgt)
-
-
-	(c) for c in c2d.T
-        res = cheb.chebint(c2d, axis=0)
-        assert_almost_equal(res, tgt)
-
-
-	(c) for c in c2d.T
-        res = herm.hermder(c2d, axis=0)
-        assert_almost_equal(res, tgt)
-
-
-	(c) for c in c2d.T
-        res = herm.hermint(c2d, axis=0)
-        assert_almost_equal(res, tgt)
-
-
-	(c) for c in c2d.T
-        res = herme.hermeder(c2d, axis=0)
-        assert_almost_equal(res, tgt)
-
-
-	(c) for c in c2d.T
-        res = herme.hermeint(c2d, axis=0)
-        assert_almost_equal(res, tgt)
-
-
-	(c) for c in c2d.T
-        res = lag.lagder(c2d, axis=0)
-        assert_almost_equal(res, tgt)
-
-
-	(c) for c in c2d.T
-        res = lag.lagint(c2d, axis=0)
-        assert_almost_equal(res, tgt)
-
-
-	(c) for c in c2d.T
-        res = leg.legder(c2d, axis=0)
-        assert_almost_equal(res, tgt)
-
-
-	(c) for c in c2d.T
-        res = leg.legint(c2d, axis=0)
-        assert_almost_equal(res, tgt)
-
-
-	(c) for c in c2d.T
-        res = poly.polyder(c2d, axis=0)
-        assert_almost_equal(res, tgt)
-
-
-	(c) for c in c2d.T
-        res = poly.polyint(c2d, axis=0)
-        assert_almost_equal(res, tgt)
-
-
+
+	(c) for c in c2d.T
+        res = cheb.chebder(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+
+	(c) for c in c2d.T
+        res = cheb.chebint(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+
+	(c) for c in c2d.T
+        res = herm.hermder(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+
+	(c) for c in c2d.T
+        res = herm.hermint(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+
+	(c) for c in c2d.T
+        res = herme.hermeder(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+
+	(c) for c in c2d.T
+        res = herme.hermeint(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+
+	(c) for c in c2d.T
+        res = lag.lagder(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+
+	(c) for c in c2d.T
+        res = lag.lagint(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+
+	(c) for c in c2d.T
+        res = leg.legder(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+
+	(c) for c in c2d.T
+        res = leg.legint(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+
+	(c) for c in c2d.T
+        res = poly.polyder(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+
+	(c) for c in c2d.T
+        res = poly.polyint(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+
 	(c) for c in s
 
         # Check that we do not allow writeable buffer export
         with pytest.raises(BufferError, match="scalar buffer is readonly"):
-
-	(c) for c in s
-
-        # Check that we do not allow writeable buffer export
-        with pytest.raises(BufferError, match="scalar buffer is readonly"):
-
+
+	(c) for c in s
+
+        # Check that we do not allow writeable buffer export
+        with pytest.raises(BufferError, match="scalar buffer is readonly"):
+
 	(c) for c in yo2
         out.append(" ".join(line))
     return out
 
-
-	(c) for c in yo2
-        out.append(" ".join(line))
-    return out
-
-
+
+	(c) for c in yo2
+        out.append(" ".join(line))
+    return out
+
+
 	(c) is C))
 
     def test_failing_wrap(self):
 
-
-	(c) is C))
-
-    def test_failing_wrap(self):
-
-
+
+	(c) is C))
+
+    def test_failing_wrap(self):
+
+
 	(c) is not None
 
         s = as_string("'123'")
@@ -2133,78 +2133,78 @@ class TestMatrixPower:
         assert repr(s) == "Expr(Op.STRING, (\"'123'\", 1))", repr(s)
         assert s == s
         assert s != s2
-
-	(c) is not None
-
-        s = as_string("'123'")
-        s2 = as_string('"ABC"')
-        assert s.op == Op.STRING
-        assert repr(s) == "Expr(Op.STRING, (\"'123'\", 1))", repr(s)
-        assert s == s
-        assert s != s2
-
+
+	(c) is not None
+
+        s = as_string("'123'")
+        s2 = as_string('"ABC"')
+        assert s.op == Op.STRING
+        assert repr(s) == "Expr(Op.STRING, (\"'123'\", 1))", repr(s)
+        assert s == s
+        assert s != s2
+
 	(c) is not np.matrix)
 
-
-	(c) is not np.matrix)
-
-
+
+	(c) is not np.matrix)
+
+
 	(c) is np.ndarray)
         assert_(c.dtype == object)
         assert_(d.dtype == object)
 
     def test_array_resize_method_system_error(self):
-
+
 	(c) is np.ndarray)
         assert_(type(d) is np.ndarray)
 
-
+
 	(c) is np.ndarray)
         assert_(type(d) is np.ndarray)
 
     def test_matrix_multiply_by_1d_vector(self):
-
-	(c) is np.ndarray)
-        assert_(c.dtype == object)
-        assert_(d.dtype == object)
-
-    def test_array_resize_method_system_error(self):
-
-	(c) is np.ndarray)
-        assert_(type(d) is np.ndarray)
-
-
-	(c) is np.ndarray)
-        assert_(type(d) is np.ndarray)
-
-    def test_matrix_multiply_by_1d_vector(self):
-
+
+	(c) is np.ndarray)
+        assert_(c.dtype == object)
+        assert_(d.dtype == object)
+
+    def test_array_resize_method_system_error(self):
+
+	(c) is np.ndarray)
+        assert_(type(d) is np.ndarray)
+
+
+	(c) is np.ndarray)
+        assert_(type(d) is np.ndarray)
+
+    def test_matrix_multiply_by_1d_vector(self):
+
 	(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.
-
-	(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.
-
+
+	(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.
+
 	(c) s4
     real*4 intent(out) :: t4
     real*4 intent(c) :: value
   end
   subroutine s8(t8,value)
-
-	(c) s4
-    real*4 intent(out) :: t4
-    real*4 intent(c) :: value
-  end
-  subroutine s8(t8,value)
-
+
+	(c) s4
+    real*4 intent(out) :: t4
+    real*4 intent(c) :: value
+  end
+  subroutine s8(t8,value)
+
 	(c) s8
     real*8 intent(out) :: t8
     real*8 intent(c) :: value
@@ -2212,43 +2212,43 @@ class TestMatrixPower:
 end interface
 end python module c_ext_return_real
     """
-
-	(c) s8
-    real*8 intent(out) :: t8
-    real*8 intent(c) :: value
-  end
-end interface
-end python module c_ext_return_real
-    """
-
+
+	(c) s8
+    real*8 intent(out) :: t8
+    real*8 intent(c) :: value
+  end
+end interface
+end python module c_ext_return_real
+    """
+
 	(c)**2).sum(-1).sum(-1)
                     * (abs(cinv)**2).sum(-1).sum(-1)),
             single_decimal=5, double_decimal=11)
 
-
-	(c)**2).sum(-1).sum(-1)
-                    * (abs(cinv)**2).sum(-1).sum(-1)),
-            single_decimal=5, double_decimal=11)
-
-
+
+	(c)**2).sum(-1).sum(-1)
+                    * (abs(cinv)**2).sum(-1).sum(-1)),
+            single_decimal=5, double_decimal=11)
+
+
 	Copyright (c) 1992-2013 The University of Tennessee and The University
                           of Tennessee Research Foundation.  All rights
                           reserved.
-
-	Copyright (c) 1992-2013 The University of Tennessee and The University
-                          of Tennessee Research Foundation.  All rights
-                          reserved.
-
+
+	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) 2000-2013 The University of California Berkeley. All
-                          rights reserved.
-
+
+	Copyright (c) 2000-2013 The University of California Berkeley. All
+                          rights reserved.
+
 	Copyright (C) 2002-2017 Free Software Foundation, Inc.
-
-	Copyright (C) 2002-2017 Free Software Foundation, Inc.
-
+
+	Copyright (C) 2002-2017 Free Software Foundation, Inc.
+
 	Copyright (c) 2005-2022, NumPy Developers.
 All rights reserved.
 
@@ -2268,47 +2268,47 @@ met:
        contributors may be used to endorse or promote products derived
        from this software without specific prior written permission.
 
-
-	Copyright (c) 2005-2022, NumPy Developers.
-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 NumPy Developers nor the names of any
-       contributors may be used to endorse or promote products derived
-       from this software without specific prior written permission.
-
-
+
+	Copyright (c) 2005-2022, NumPy Developers.
+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 NumPy Developers nor the names of any
+       contributors may be used to endorse or promote products derived
+       from this software without specific prior written permission.
+
+
 	Copyright (c) 2006-2013 The University of Colorado Denver.  All rights
                           reserved.
 
-
-	Copyright (c) 2006-2013 The University of Colorado Denver.  All rights
-                          reserved.
-
-
+
+	Copyright (c) 2006-2013 The University of Colorado Denver.  All rights
+                          reserved.
+
+
 	Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
-
-	Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
-
+
+	Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+
 	Copyright (C) 2009 Free Software Foundation, Inc. <http://fsf.org/>
-
-	Copyright (C) 2009 Free Software Foundation, Inc. <http://fsf.org/>
-
+
+	Copyright (C) 2009 Free Software Foundation, Inc. <http://fsf.org/>
+
 	Copyright (C) 2010 - 2019 ridiculous_fish, <libdivide@ridiculousfish.com>
-
-	Copyright (C) 2010 - 2019 ridiculous_fish, <libdivide@ridiculousfish.com>
-
+
+	Copyright (C) 2010 - 2019 ridiculous_fish, <libdivide@ridiculousfish.com>
+
 	Copyright (c) 2011-2014, The OpenBLAS Project
   All rights reserved.
 
@@ -2325,40 +2325,40 @@ met:
         distribution.
      3. Neither the name of the OpenBLAS project nor the names of
         its contributors may be used to endorse or promote products
-
-	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
-
+
+	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
+
 	Copyright (C) 2016 - 2019 Kim Walisch, <kim.walisch@gmail.com>
-
+
 	Copyright (C) 2016 - 2019 Kim Walisch, <kim.walisch@gmail.com>
 
   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.
-
-	Copyright (C) 2016 - 2019 Kim Walisch, <kim.walisch@gmail.com>
-
-	Copyright (C) 2016 - 2019 Kim Walisch, <kim.walisch@gmail.com>
-
-  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.
-
+
+	Copyright (C) 2016 - 2019 Kim Walisch, <kim.walisch@gmail.com>
+
+	Copyright (C) 2016 - 2019 Kim Walisch, <kim.walisch@gmail.com>
+
+  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.
+
 	Copyright (c) Donald Stufft and individual contributors.
 # All rights reserved.
 
@@ -2372,29 +2372,29 @@ met:
 #        notice, this list of conditions and the following disclaimer in the
 #        documentation and/or other materials provided with the distribution.
 
-
-	Copyright (c) Donald Stufft and individual 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:
-
-#     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.
-
-
+
+	Copyright (c) Donald Stufft and individual 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:
+
+#     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.
+
+
 	Copyright 1999 - 2011 Pearu Peterson all rights reserved.
 https://web.archive.org/web/20140822061353/http://cens.ioc.ee/projects/f2py2e"""
 
-
-	Copyright 1999 - 2011 Pearu Peterson all rights reserved.
-https://web.archive.org/web/20140822061353/http://cens.ioc.ee/projects/f2py2e"""
-
-
+
+	Copyright 1999 - 2011 Pearu Peterson all rights reserved.
+https://web.archive.org/web/20140822061353/http://cens.ioc.ee/projects/f2py2e"""
+
+
 	Copyright 1999, 2000, 2001 Regents of the University of California.
 Released for unlimited redistribution.
 
@@ -2402,39 +2402,39 @@ Released for unlimited redistribution.
 * 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)
-
-	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)
-
+
+	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)
+
 	Copyright 1999,2000 Pearu Peterson all rights reserved,
-
-	Copyright 1999,2000 Pearu Peterson all rights reserved,
-
+
+	Copyright 1999,2000 Pearu Peterson all rights reserved,
+
 	Copyright 1999--2011 Pearu Peterson all rights reserved,
-
-	Copyright 1999--2011 Pearu Peterson all rights reserved,
-
+
+	Copyright 1999--2011 Pearu Peterson all rights reserved,
+
 	Copyright 1999-2004 Pearu Peterson all rights reserved,
-
-	Copyright 1999-2004 Pearu Peterson all rights reserved,
-
+
+	Copyright 1999-2004 Pearu Peterson all rights reserved,
+
 	Copyright 2000 Pearu Peterson all rights reserved,
-
-	Copyright 2000 Pearu Peterson all rights reserved,
-
+
+	Copyright 2000 Pearu Peterson all rights reserved,
+
 	Copyright 2001-2005 Pearu Peterson all rights reserved,
-
-	Copyright 2001-2005 Pearu Peterson all rights reserved,
-
+
+	Copyright 2001-2005 Pearu Peterson all rights reserved,
+
 	Copyright 2002 Pearu Peterson all rights reserved,
-
-	Copyright 2002 Pearu Peterson all rights reserved,
-
+
+	Copyright 2002 Pearu Peterson all rights reserved,
+
 	copyright 2010 David
 Wolever <david@wolever.net>. All rights reserved.
 
@@ -2448,29 +2448,29 @@ modification, are permitted provided that the following conditions are met:
    this list of conditions and the following disclaimer in the documentation
    and/or other materials provided with the distribution.
 
-
-	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.
-
-
+
+	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.
+
+
 	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
-
-	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
-
+
+	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
+
 	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.
 
@@ -2482,44 +2482,44 @@ modification, are permitted provided that the following conditions are met:
         'linker_so'    : ["<F90>"],
         'archiver'     : ["ar", "-cr"],
         'ranlib'       : ["ranlib"]
-
-	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"]
-
+
+	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"]
+
 	Copyright Absoft Corporation.
                        r' (?P<version>[^\s*,]*)(.*?Absoft Corp|)'
 
     # on windows: f90 -V -c dummy.f
-
-	Copyright Absoft Corporation.
-                       r' (?P<version>[^\s*,]*)(.*?Absoft Corp|)'
-
-    # on windows: f90 -V -c dummy.f
-
+
+	Copyright Absoft Corporation.
+                       r' (?P<version>[^\s*,]*)(.*?Absoft Corp|)'
+
+    # on windows: f90 -V -c dummy.f
+
 	COPYRIGHT$
 
   Additional copyrights may follow
 
   $HEADER$
-
-	COPYRIGHT$
-
-  Additional copyrights may follow
-
-  $HEADER$
-
-Packaging 24.2 pypi:packaging/24.2: https://github.com/pypa/packaging
+
+	COPYRIGHT$
+
+  Additional copyrights may follow
+
+  $HEADER$
+
+Packaging 24.2 pypi:packaging/24.2: https://github.com/pypa/packaging
 	Copyright (c) 2017-present Ofek Lev <oss@ofek.dev>
-
+
 	Copyright (c) Donald Stufft and individual contributors.
 All rights reserved.
 
@@ -2533,15 +2533,15 @@ modification, are permitted provided that the following conditions are met:
        notice, this list of conditions and the following disclaimer in the
        documentation and/or other materials provided with the distribution.
 
-
+
 	copyright = ABOUT
 
 # -- Options for HTML output --------------------------------------------------
 # https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
-
-pbr 6.1.0 pypi:pbr/6.1.0: http://openstack.org
+
+pbr 6.1.0 pypi:pbr/6.1.0: http://openstack.org
 	Copyright (c) 2011 OpenStack Foundation
-
+
 	Copyright (C) 2013 Association of Universities for Research in Astronomy
 #                    (AURA)
 #
@@ -2556,156 +2556,156 @@ pbr 6.1.0 pypi:pbr/6.1.0: http://openstack.org
 #        disclaimer in the documentation and/or other materials provided
 #        with the distribution.
 #
-
+
 	Copyright (c) 2013 Hewlett-Packard Development Company, L.P.
-
+
 	Copyright (c) 2013 New Dream Network, LLC (DreamHost)
-
+
 	Copyright (c) 2013 Testrepository Contributors
-
+
 	Copyright (c) 2015 Hewlett-Packard Development Company, L.P. (HP)
-
+
 	Copyright (C) 2020 Red Hat, Inc.
-
+
 	Copyright 2010-2011 OpenStack Foundation
-
+
 	Copyright 2011 OpenStack Foundation
-
+
 	Copyright 2012 OpenStack Foundation
-
+
 	Copyright 2012 Red Hat, Inc.
-
+
 	Copyright 2012-2013 Hewlett-Packard Development Company, L.P.
-
+
 	Copyright 2013 Hewlett-Packard Development Company, L.P.
-
+
 	Copyright 2014 Hewlett-Packard Development Company, L.P.
-
+
 	Copyright 2018 Red Hat, Inc.
-
+
 	Copyright 2021 Monty Taylor
-
+
 	copyright = '2013, OpenStack Foundation
 
 # If true, '()' will be appended to :func: etc. cross-reference text.
 add_function_parentheses = True
-
+
 	copyright = u
 
 # If true, '()' will be appended to :func: etc. cross-reference text.
 add_function_parentheses = True
-
-psf-requests 2.32.3 pypi:requests/2.32.3: http://docs.python-requests.org
+
+psf-requests 2.32.3 pypi:requests/2.32.3: http://docs.python-requests.org
 	(c)
         return c
 
     def iterkeys(self):
-
+
 	Copyright 2019 Kenneth Reitz
-
+
 	Copyright Kenneth Reitz"
-
+
 	copyright: (c) 2012 by Kenneth Reitz.
-
+
 	copyright: (c) 2017 by Kenneth Reitz.
-
-pycodestyle 2.12.1 pypi:pycodestyle/2.12.1: https://pypi.python.org/pypi/pycodestyle
+
+pycodestyle 2.12.1 pypi:pycodestyle/2.12.1: https://pypi.python.org/pypi/pycodestyle
 	Copyright (C) 2006-2009 Johann C. Rocholl <johann@rocholl.net>
-
+
 	Copyright (C) 2009-2014 Florent Xicluna <florent.xicluna@gmail.com>
-
+
 	Copyright (C) 2014-2016 Ian Lee <ianlee1521@gmail.com>
-
+
 	Copyright © 2006-2009 Johann C. Rocholl <johann@rocholl.net>
-
+
 	Copyright © 2009-2014 Florent Xicluna <florent.xicluna@gmail.com>
-
+
 	Copyright © 2014-2020 Ian Lee <IanLee1521@gmail.com>
-
-Pyflakes 3.2.0 pypi:pyflakes/3.2.0: https://github.com/pyflakes/pyflakes
+
+Pyflakes 3.2.0 pypi:pyflakes/3.2.0: https://github.com/pyflakes/pyflakes
 	Copyright 2005-2011 Divmod, Inc.
-
+
 	Copyright 2013 Florent Xicluna.  See LICENSE file for details
 import os.path
 
 try:
-
+
 	Copyright 2013-2014 Florent Xicluna
-
-pytest 8.3.4 pypi:pytest/8.3.4: http://pytest.org
+
+pytest 8.3.4 pypi:pytest/8.3.4: http://pytest.org
 	(c)
 
     # ASCII fast path.
     if 0x20 <= o < 0x07F:
-
+
 	(c)
 
     # Control characters.
     if category == "Cc":
-
+
 	(C)
 
     assert all_marks ==
 
     assert get_unpacked_marks(C, consider_mro=False) == [xfail("c").mark]
-
+
 	(c)
         if wc < 0:
             return -1
         width += wc
-
+
 	(c) in ("F", "W"):
         return 2
 
     return 1
-
+
 	Copyright (c) 2004 Holger Krekel and others
-
+
 	Copyright (c) 2014, Gregory Boissinot
-
+
 	Copyright Holger Krekel and others, 2004.
-
-python-certifi 2024.7.4 pypi:certifi/2024.7.4: https://certifiio.readthedocs.io/en/latest/
-	No Copyrights found
-python-pluggy 1.5.0 pypi:pluggy/1.5.0: https://pypi.python.org/pypi/pluggy
+
+python-certifi 2024.7.4 pypi:certifi/2024.7.4: https://certifiio.readthedocs.io/en/latest/
+	No Copyrights found
+python-pluggy 1.5.0 pypi:pluggy/1.5.0: https://pypi.python.org/pypi/pluggy
 	Copyright (c) 2015 holger krekel (rather uses bitbucket/hpk42)
-
-python3-charset-normalizer 3.4.1 pypi:charset-normalizer/3.4.1: https://github.com/ousret/charset_normalizer
+
+python3-charset-normalizer 3.4.1 pypi:charset-normalizer/3.4.1: https://github.com/ousret/charset_normalizer
 	(c) https://stackoverflow.com/questions/3041986/apt-command-line-interface-like-yes-no-input
     """
     valid = {"yes": True, "y": True, "ye": True, "no": False, "n": False}
     if default is None:
-
-	(c) https://stackoverflow.com/questions/3041986/apt-command-line-interface-like-yes-no-input
-    """
-    valid = {"yes": True, "y": True, "ye": True, "no": False, "n": False}
-    if default is None:
-
+
+	(c) https://stackoverflow.com/questions/3041986/apt-command-line-interface-like-yes-no-input
+    """
+    valid = {"yes": True, "y": True, "ye": True, "no": False, "n": False}
+    if default is None:
+
 	Copyright (c) 2025 TAHRI Ahmed R.
-
-	Copyright (c) 2025 TAHRI Ahmed R.
-
+
+	Copyright (c) 2025 TAHRI Ahmed R.
+
 	copyright = '2023, Ahmed TAHRI
 author = 'Ahmed TAHRI'
 
 # The version info for the project you're documenting, acts as replacement for
 # |version| and |release|, also used in various other places throughout the
 # built documents.
-
+
 	copyright: (c) 2021 by Ahmed TAHRI
-
-	copyright: (c) 2021 by Ahmed TAHRI
-
+
+	copyright: (c) 2021 by Ahmed TAHRI
+
 	© 2012
 
 ## 💼 For Enterprise
-
+
 	© [Ahmed TAHRI @Ousret
-
+
 	©����-�52
�b�]ct��M�
 �C�Ufw
��٧��x�h�n�&d���U

+�u*gG@"��4�TW�]愅�$Q����aRL
6KXo�5�
���P^0�yQDX��UbF5?�aą�6Ȉ�f}�5��H�W���[�9B8�?��5W�ZZ��d��*s��M�J�X)��U�Ӛ@02�`J��/.^c)ndJ��F�6"Ŵj��ch����4/��e_JT��h�T�7Ա���7n�n��!�Z�ɩA��X6�Н�){�4�T���fV[=,�A~oO8#�����2��S�z�I��kK\T1��D��L�s�&����Bul PU�	�4�`�f+�#�&Z����k���jfT�&�TH"Qa���In�}�B�i����k����&"L�l�U�Xf���GWWg�D��f34���Ϧj�=�$%�ۚ@�сײ@_
-p�� �G���Ei���6엽�\�X�y�1�i��
���X�@N���-�s'yy1�a跭#�	_� �c�{��.���B�.lZ7����
mk�f�e_�dM�(փ|� zo��0S�6�e����X��k����V�	IE*8S���\?f83�k��U�
P�%Ql1��M,��p?�hEU�CD7�#���0*�+��Z�G��K��5�KF�"�,a���bU�Z�9V=;%/4����\qi��=e�!�TTn�?��,wd�6��E��@K�Ȼ��󑟈DPnps���2���R����ix.-��ߊ��y�W�y-��[�$�ih޼��]bmXG�S�ŒU��e_l�j�X2Ƙ�:-�o���}�ɝO�U��c�S�O�m��MpZѸQrC����s��<q�z�4ZE[���B|�Y%X+7�0��M��U��قi��a$pE�c
-RonnyPfannschmidt/iniconfig 2.0.0 pypi:iniconfig/2.0.0: https://github.com/RonnyPfannschmidt/iniconfig
+p�� �G���Ei���6엽�\�X�y�1�i��
���X�@N���-�s'yy1�a跭#�	_� �c�{��.���B�.lZ7����
mk�f�e_�dM�(փ|� zo��0S�6�e����X��k����V�	IE*8S���\?f83�k��U�
P�%Ql1��M,��p?�hEU�CD7�#���0*�+��Z�G��K��5�KF�"�,a���bU�Z�9V=;%/4����\qi��=e�!�TTn�?��,wd�6��E��@K�Ȼ��󑟈DPnps���2���R����ix.-��ߊ��y�W�y-��[�$�ih޼��]bmXG�S�ŒU��e_l�j�X2Ƙ�:-�o���}�ɝO�U��c�S�O�m��MpZѸQrC����s��<q�z�4ZE[���B|�Y%X+7�0��M��U��قi��a$pE�c

+RonnyPfannschmidt/iniconfig 2.0.0 pypi:iniconfig/2.0.0: https://github.com/RonnyPfannschmidt/iniconfig
 	(C) Ronny Pfannschmidt, Holger Krekel -- MIT licensed
 """
 from __future__ import annotations
@@ -2722,10 +2722,10 @@ from typing import (
     NamedTuple,
     overload,
     cast,
-
-ruamel-yaml 0.18.6 pypi:ruamel.yaml/0.18.6: https://pypi.org/project/ruamel.yaml/
-	No Copyrights found
-ruamel.yaml.clib 0.2.12 pypi:ruamel.yaml.clib/0.2.12: https://sourceforge.net/p/ruamel-yaml-clib/code/ci/default/tree/
+
+ruamel-yaml 0.18.6 pypi:ruamel.yaml/0.18.6: https://pypi.org/project/ruamel.yaml/
+	No Copyrights found
+ruamel.yaml.clib 0.2.12 pypi:ruamel.yaml.clib/0.2.12: https://sourceforge.net/p/ruamel-yaml-clib/code/ci/default/tree/
 	(c) ((unsigned char)c)
 #define __Pyx_long_cast(x) ((long)x)
 #define __Pyx_fits_Py_ssize_t(v, type, is_signed)  (\
@@ -2881,25 +2881,25 @@ static int __Pyx_init_sys_getdefaultencoding_params(void) {
         int c;
         for (c = 0; c < 128; c++) {
             ascii_chars[c] = (char) c;
-
+
 	Copyright (c) 2019-2024 Anthon van der Neut, Ruamel bvba
-
-SciPy 1.9.1 pypi:scipy/1.9.1: http://www.scipy.org
+
+SciPy 1.9.1 pypi:scipy/1.9.1: http://www.scipy.org
 	(c)			(Col
-
+
 	(c)	(Col
 #define KILL_ROW(r)			{ Row [r].shared2.mark = DEAD ; }
 #define KILL_PRINCIPAL_COL(c)		{ Col [c].start = DEAD_PRINCIPAL ; }
 #define KILL_NON_PRINCIPAL_COL(c)	{ Col [c].start = DEAD_NON_PRINCIPAL ; }
 
-
+
 	(C)
 
         # Check the estimation
         assert_array_almost_equal(smin, smin_svd, decimal=8)
         assert_array_almost_equal(abs(zmin), abs(zmin_svd), decimal=8)
 
-
+
 	(C)
 
         # Get smallest singular value and correspondent right singular vector.
@@ -2907,7 +2907,7 @@ SciPy 1.9.1 pypi:scipy/1.9.1: http://www.scipy.org
         zmin_svd = Vt[-1, :]
 
         # Estimate smallest singular value
-
+
 	(c)
 
         res = linprog(c=c
@@ -2919,7 +2919,7 @@ SciPy 1.9.1 pypi:scipy/1.9.1: http://www.scipy.org
         np.testing.assert_allclose(square.sum(axis=1), M)
         np.testing.assert_allclose(np.diag(square).sum(), M)
         np.testing.assert_allclose(np.diag(square[:, ::-1]).sum(), M)
-
+
 	(c)
 
         res = linprog(c=c, A_ub=A_ub, b_ub=b_ub, bounds=bounds,
@@ -2928,7 +2928,7 @@ SciPy 1.9.1 pypi:scipy/1.9.1: http://www.scipy.org
         np.testing.assert_allclose(res.fun, -2)
         # two optimal solutions possible, just need one of them
         assert np.allclose(res.x, [1, 2]) or np.allclose(res.x, [2, 2])
-
+
 	(c)
 
         res = linprog(c=c, A_ub=A_ub, b_ub=b_ub, bounds=bounds,
@@ -2936,13 +2936,13 @@ SciPy 1.9.1 pypi:scipy/1.9.1: http://www.scipy.org
 
         np.testing.assert_allclose(res.x, [1, 2])
         np.testing.assert_allclose(res.fun, -3)
-
+
 	(c)
 
         return converted
 
     return __ua_convert__
-
+
 	(c)
 
         self.d, self.fd = self._update_bracket(c, fc)
@@ -2950,7 +2950,7 @@ SciPy 1.9.1 pypi:scipy/1.9.1: http://www.scipy.org
         self.iterations += 1
 
         while True:
-
+
 	(c)
 
         with np.testing.assert_warns(OptimizeWarning):
@@ -2959,7 +2959,7 @@ SciPy 1.9.1 pypi:scipy/1.9.1: http://www.scipy.org
 
         np.testing.assert_allclose(res.x, [1.8, 2.8])
         np.testing.assert_allclose(res.fun, -2.8)
-
+
 	(c)
 
     # solve original problem
@@ -2972,24 +2972,24 @@ SciPy 1.9.1 pypi:scipy/1.9.1: http://www.scipy.org
     res = milp(c=c, constraints=constraints)
     assert_allclose(res.fun, -2.8)
     assert_allclose(res.x, [1.8, 2.8])
-
+
 	(c)
 
     @_call_super_mom
     @inherit_docstring_from(rv_continuous)
     def fit(self, data, *args, **kwds):
-
+
 	(c)
 
     def _cdf(self, x, c):
-
+
 	(c)
 
     def _cdf(self, x, c):
         return sc.gammainc(c, np.exp(x))
 
     def _ppf(self, q, c):
-
+
 	(c)
 
     def _fitstart(self, data, args=None):
@@ -2997,21 +2997,21 @@ SciPy 1.9.1 pypi:scipy/1.9.1: http://www.scipy.org
         args = (2.0,) if args is None else args
         return super(invweibull_gen, self)._fitstart(data, args=args)
 
-
+
 	(c)
 
     def _ppf(self, q, c):
         return sc.expm1(q * sc.log1p(c)) / c
 
     def _stats(self, c, moments='mv'):
-
+
 	(c)
 
     def _shape_info(self):
         return [_ShapeInfo("c", False, (-np.inf, np.inf), (False, False))]
 
     def _get_support(self, c):
-
+
 	(c)
 
     Display the points at which the FFT is calculated:
@@ -3026,12 +3026,12 @@ SciPy 1.9.1 pypi:scipy/1.9.1: http://www.scipy.org
     >>> plt.gca().add_patch(plt.Circle((0,0), radius=1, fill=False, alpha=.3))
     >>> plt.axis('equal')
     >>> plt.show()
-
+
 	(c)
 
     return (((uiva
 
-
+
 	(c)
 
     We solve the problem like:
@@ -3040,23 +3040,23 @@ SciPy 1.9.1 pypi:scipy/1.9.1: http://www.scipy.org
     >>> res = milp(c=c, constraints=constraints, integrality=integrality)
     >>> res.x
     [1.0, 2.0]
-
+
 	(c)
                      for c in prepared_constraints
 
     if len(canonical_all) == 0:
-
+
 	(c)
                     c = scal(1.0/alpha, c)
                     u = scal(1.0/alpha, u)
 
                     new_CU.append((c, u))
                 CU[:] = new_CU
-
+
 	(C)
                 elements.push_back(el);                                                                     // MAY THROW (C)
             }
-
+
 	(C)
               IF (DABS((WA-WA0)/WA).LT.EPS.AND.K.GT.10) GO TO 30
 10            WA0=WA
@@ -3103,7 +3103,7 @@ C            lower quadrant
         RETURN
         END
 
-
+
 	(c)
             # Compute Hessian
             H = lagr_hess(x, v)
@@ -3113,18 +3113,18 @@ C            lower quadrant
             optimality = norm(c + A.T.dot(v), np.inf)
             constr_violation = norm(b, np.inf) if len(b) > 0 else 0
         else:
-
+
 	(c)
             a = dot(c, transpose(c))
             assert_array_almost_equal(cholesky(a, lower=1), c)
 
     def test_random_complex(self):
-
+
 	(c)
             a = dot(c, transpose(conjugate(c)))
             assert_array_almost_equal(cholesky(a, lower=1), c)
 
-
+
 	(c)
             a, b = stats.genpareto._get_support(c)
             assert_equal(a, 0.)
@@ -3132,12 +3132,12 @@ C            lower quadrant
 
         # c < 0: a=0, b=1/|c|
         c = np.asarray(-2.)
-
+
 	(c)
             assert_allclose(
 
     def test_rv_frozen_in_namespace(self):
-
+
 	(c)
             if fc == 0:
                 return _ECONVERGED, c
@@ -3145,7 +3145,7 @@ C            lower quadrant
             # re-bracket
             e, fe = d, fd
             d, fd = self._update_bracket(c, fc)
-
+
 	(c)
             rv = stats.genpareto(c=c)
             a, b = rv.a, rv.b
@@ -3154,49 +3154,49 @@ C            lower quadrant
 
             # c < 0: a=0, b=1/|c|
             c = np.asarray(-2.)
-
+
 	(c)
             scale = fscale
 
         return a, floc, scale
-
+
 	(c)
             x1 = z - x0
             yield [x0, x1]
 
     def all_partitions_n(z, ns):
-
+
 	(C)
         # fails if sparse or scalar; that
         # this is only needed for original simplex (never sparse)
     except TypeError:
-
+
 	(C)
-        A = A
+        A = A
 	(c)
         a = dot(c, transpose(c))
         assert_array_almost_equal(cholesky(a, lower=1), c)
 
     def test_check_finite(self):
-
+
 	(c)
         a = dot(c, transpose(c))
         assert_array_almost_equal(cholesky(a, lower=1, check_finite=False), c)
 
     def test_simple_complex(self):
-
+
 	(c)
         a = dot(c, transpose(conjugate(c)))
         assert_array_almost_equal(cholesky(a, lower=1), c)
 
     def test_random(self):
-
+
 	(c)
         assert_allclose(
 
     def test_c0(self):
         # with c=0, genpareto reduces to the exponential distribution
-
+
 	(C)
         assert_array_equal(C
 
@@ -3205,7 +3205,7 @@ C            lower quadrant
         F = self.spmatrix(E)
         assert_array_equal(E[1, 1:3], F[1, 1:3].toarray())
         assert_array_equal(E[2, -2:], F[2, -2:].A)
-
+
 	(C)
         assert_array_equal(C
         assert_array_equal(C[:, [2]], D[:, 2].toarray())
@@ -3215,30 +3215,30 @@ C            lower quadrant
         F = self.spmatrix(E)
         assert_array_equal(E[:, [1]], F[:, 1].toarray())
         assert_array_equal(E[-2:, [2]], F[-2:, 2].toarray())
-
+
 	(C)
         assert_array_equal(C.A, D.A)
 
     def test_fancy_indexing_lil(self):
-
+
 	(c)
         assert_equal(
 
         c = 0.1
         stats.genpareto.pdf(0, c)  # this should NOT change genpareto.b
         assert_equal((rv.dist.a, rv.dist.b), stats.genpareto._get_support(c))
-
+
 	(c)
         assert_equal(
 
         c = 0.1
         stats.genpareto.pdf(0, c=c)
         assert_equal(rv.dist._get_support(c), [0, np.inf])
-
+
 	(c)
         assert_equal(a.item(), d)
 
-
+
 	(c)
         b = _lazywhere(c < 0, (c,),
                        lambda c: -1. / c,
@@ -3247,7 +3247,7 @@ C            lower quadrant
         return a, b
 
     def _pdf(self, x, c):
-
+
 	(C)
         Dsp = self.spmatrix(D)
         assert_almost_equal(Csp.multiply(Dsp).toarray(), C*D)  # sparse/sparse
@@ -3256,7 +3256,7 @@ C            lower quadrant
         # real/complex
         assert_almost_equal(Asp.multiply(Dsp).toarray(), A*D)  # sparse/sparse
         assert_almost_equal(Asp.multiply(D).toarray(), A*D)  # sparse/dense
-
+
 	(c)
         dsp = self.spmatrix(d)
         esp = self.spmatrix(e)
@@ -3271,21 +3271,21 @@ C            lower quadrant
         assert_array_equal(esp.dot(csp).A, np.dot(e, c))
         assert_array_equal(dsp.dot(csp).A, np.dot(d, c))
         assert_array_equal(fsp.dot(esp).A, np.dot(f, e))
-
+
 	(c)
         if ct > 0:
             c = np.r_[c, np.zeros((ct,) + c.shape[1:])]
         ta, ca, ka = _fitpack_impl.splantider((self.t, c, self.k), 1)
 
         if extrapolate == 'periodic':
-
+
 	(c)
         if ct > 0:
             c = np.r_[c, np.zeros((ct,) + c.shape[1:])]
         tck = _fitpack_impl.splantider((self.t, c, self.k), nu)
 
         if self.extrapolate == 'periodic':
-
+
 	(c)
         if ct > 0:
             c = np.r_[c, np.zeros((ct,) + c.shape[1:])]
@@ -3294,7 +3294,7 @@ C            lower quadrant
                                     axis=self.axis)
 
     def antiderivative(self, nu=1):
-
+
 	(c)
         if extrapolate is None:
             extrapolate = True
@@ -3302,37 +3302,37 @@ C            lower quadrant
 
         ndim = len(self.x)
         if any(v.ndim != 1 for v in self.x):
-
+
 	(c)
         if fc == 0:
-
+
 	(c)
         if fc == 0:
             return _ECONVERGED, c
 
         e, fe = d, fd
         d, fd = self._update_bracket(c, fc)
-
+
 	(c)
         if mode == "left":
             c = c.T
     else:
-
+
 	(c)
         if n_x == 0 or len(c.shape)
             raise ValueError(
                 "Invalid input for linprog: c must be a 1-D array and must "
                 "not have more than one non-singleton dimension")
         if not(np.isfinite(c).all()):
-
+
 	(c)
-        integrality =
+        integrality =
 	(c)
         integrality =
 
         res = linprog(c=c, A_ub=A_ub, b_ub=b_ub, bounds=bounds,
                       method=self.method, integrality=integrality)
-
+
 	(c)
         L
 
@@ -3342,14 +3342,14 @@ C            lower quadrant
         double_atol = 1000 * np.finfo(np.float64).eps
         atol = single_atol if ind in [0, 2] else double_atol
         assert_allclose(A[piv-1][:, piv-1], L @ L.conj().T, rtol=0., atol=atol)
-
+
 	(c)
         mask = np.ones(nx
         mask[x] = False
         y = z[mask]
         yield x, y
 
-
+
 	(c)
         mu2 = np.pi
         g1 = -2*sc.zeta(3, c) + 2*_ZETA3
@@ -3358,7 +3358,7 @@ C            lower quadrant
         g2 /= mu2**2.0
         return mu, mu2, g1, g2
 
-
+
 	(C)
         NM2=2
         CALL KMN(M,N,C,CV,KD,DF,DN,CK1,CK2)
@@ -3436,7 +3436,7 @@ C            lower quadrant
         RETURN
         END
 
-
+
 	(C)
         PI=3.141592653589793D0
         A0=A
@@ -3521,7 +3521,7 @@ C       DLMF 13.3.1
         END
 
 C       **********************************
-
+
 	(C)
         REG=1.0D0
         IF (M+NM.GT.80) REG=1.0D-200
@@ -3586,7 +3586,7 @@ C       **********************************
         RETURN
         END
 
-
+
 	(C)
         REG=1.0D0
         IF (M+NM.GT.80) REG=1.0D-200
@@ -3670,39 +3670,39 @@ C       **********************************
         RETURN
         END
 
-
+
 	(c)
         return cls(c.swapaxes(0, 1), xi, extrapolate)
 
     @staticmethod
     def _construct_from_derivatives(xa, xb, ya, yb):
-
+
 	(c)
         return np.exp(c
 
     def _logpdf(self, x, c):
-
+
 	(c)
         self.ds.append(d)
 
         if len(self.cs) > c.size:
-
+
 	(C)
         self.outputs = self.C.shape
 
     @property
     def D(self):
-
+
 	(c)
         self.t = np.ascontiguousarray(t, dtype=np.float64)
 
         if extrapolate == 'periodic':
-
+
 	(c)
         self.x = np.ascontiguousarray(x, dtype=np.float64)
 
         if extrapolate is None:
-
+
 	(c)
         U
 
@@ -3713,7 +3713,7 @@ C       **********************************
         double_atol = 1000 * np.finfo(np.float64).eps
         atol = single_atol if ind in [0, 2] else double_atol
         assert_allclose(A[piv-1][:, piv-1], U.conj().T @ U, rtol=0., atol=atol)
-
+
 	(c)
         U
 
@@ -3724,19 +3724,19 @@ C       **********************************
         double_atol = 1000 * np.finfo(np.float64).eps
         atol = single_atol if ind in [0, 2] else double_atol
         assert_allclose(A[piv-1][:, piv-1], U.conj().T @ U, rtol=0., atol=atol)
-
+
 	(c)
         var = sc.polygamma(1, c)
         skewness = sc.polygamma(2, c) / np.power(var, 1.5)
         excess_kurtosis = sc.polygamma(3, c) / (var*var)
         return mean, var, skewness, excess_kurtosis
 
-
+
 	(c)
         x = np.asarray(x)
 
         if c.ndim < 2:
-
+
 	(c)
       d1 = abs(d)
 c  test whether p(x) is a third degree polynomial.
@@ -3794,7 +3794,7 @@ c  apply a newton iteration to improve the accuracy of the roots.
         x(i) = y-step
  700  continue
  800  return
-
+
 	(c)
       i = n
       do 80 j=2,n
@@ -3807,7 +3807,7 @@ c  apply a newton iteration to improve the accuracy of the roots.
          g(i) = fac
   80  continue
       return
-
+
 	(c)
       j = 1.0D0
       s = 0.0D0
@@ -3820,7 +3820,7 @@ C
       apser = -a* (c+s)
       RETURN
 
-
+
 	(c)
       v = b
       IF (u.LE.v) GO TO 110
@@ -3829,14 +3829,14 @@ C
 
   110 betaln = (((-0.5D0*dlog(b)+e)+w)-u) - v
       RETURN
-
+
 	(c)
     #     sf = mpmath.gammainc(c, mpmath.exp(x), mpmath.inf,
     #                          regularized=True)
     @pytest.mark.parametrize('x, c, sf', [(4, 1.5, 1.6341528919488565e-23),
                                           (6, 100, 8.23836829202024e-74)])
     def test_sf_isf(self, x, c, sf):
-
+
 	(c)
     # > result
     #               risk ratio with 95% C.I.
@@ -3847,7 +3847,7 @@ C
     # The last line is the result that we want.
     assert_allclose(rr, 4/3)
     assert_allclose((ci.low, ci.high), (0.7347317, 2.419628), rtol=5e-7)
-
+
 	(c)
     # Compute Hessian
     H = lagr_hess(x, v)
@@ -3857,18 +3857,18 @@ C
     constr_violation = norm(b, np.inf) if len(b) > 0 else 0
     cg_info = {'niter': 0, 'stop_cond': 0,
                'hits_boundary': False}
-
+
 	(C)
     # improve precision of result
     for i in range(2):
-
+
 	(c)
     0.5345224838248487
 
     In the example above, it can be seen that this works the same as
     `scipy.stats.variation` except 'stats.mstats.variation' ignores masked
     array elements.
-
+
 	(c)
     >>> u
     array([[-0.21196618,  0.39378971],
@@ -3885,21 +3885,21 @@ C
     array([[  1.00000000e+00,  -1.26363763e-16],
            [ -1.26363763e-16,   1.00000000e+00]])
 
-
+
 	(C)
     assert len(row_ind) == 0
     assert len(col_ind) == 0
 
-
+
 	(C)
     assert_array_equal(row_ind, np.arange(n))
     assert_array_equal(col_ind, np.arange(n))
 
-
+
 	(c)
     else:
         b1 = asarray(b)
-
+
 	(c)
     else:
         r = np.asarray(r).ravel()
@@ -3911,22 +3911,22 @@ C
     n = vals.strides[0]
     return as_strided(vals, shape=out_shp, strides=(n, n)).copy()
 
-
+
 	(c)
     if c.ndim
         raise ValueError("The factored matrix c is not square.")
     if c.shape[1] != b1.shape[0]:
-
+
 	(c)
     if c.ndim < 2:
         onedim = True
-
+
 	(c)
     if c_flag is not None:
         if "extra_compiler_args" not in build_info:
-
+
 	(c)
-    integrality =
+    integrality =
 	(C)
     MD, ND = _shape_or_none(D)
 
@@ -3934,18 +3934,18 @@ C
     q = _choice_not_none(NB, ND)
     r = _choice_not_none(MC, MD)
     if p is None or q is None or r is None:
-
+
 	(c)
     n = c_ext.strides
     return as_strided(c_ext[L-1:], shape=(L, L), strides=(-n, n)).copy()
 
-
+
 	(c)
     nc = _get_axis_len("c", c, caxis)
     b = np.atleast_1d(b)
     nb = _get_axis_len("b", b, baxis)
     if nc != nb:
-
+
 	(c)
     options =
     res = linprog(c=c, A_eq=A, b_eq=b, bounds=bounds, method='highs',
@@ -3960,37 +3960,37 @@ C
     msg = "Iteration limit reached. (HiGHS Status 14:"
     assert res.status == 1
     assert res.message.startswith(msg)
-
+
 	(c)
     return BSpline.construct_fast(t, c, k, axis=axis)
-
+
 	(c)
     return out
 
-
+
 	(c)
     slack = b_ub - A_ub.dot(x)
     # report residuals of ORIGINAL EQ constraints
     con = b_eq - A_eq.dot(x)
 
     return x, fun, slack, con
-
+
 	(c)
     T_ncols = len(r)
     p = T_nrows + T_ncols - 1  # equivalent to len(embedded_col)
 
     embedded_col = np.concatenate((c, r[-1:0:-1]))
-
+
 	(C)
  *	     equed =
  *	   If A->Stype = SLU_NR:
-
+
 	(C)
  *	     equed =
  *
  *         If options->RowPerm = LargeDiag_MC64, MC64 is used to scale and permute
  *            the matrix to an I-matrix, that is A is modified as follows:
-
+
 	(C)
  *               in order to obtain the solution to the original system.
  *
@@ -4003,7 +4003,7 @@ C
  *           largest element in X(j).  The estimate is as reliable as   
  *           the estimate for RCOND, and is almost always a slight   
  *           overestimate of the true error.
-
+
 	(C)
  *               in order to obtain the solution to the original system.
  *
@@ -4016,7 +4016,7 @@ C
  *           largest element in X(j).  The estimate is as reliable as   
  *           the estimate for RCOND, and is almost always a slight   
  *           overestimate of the true error.
-
+
 	(C)
  *           equed =
  *
@@ -4028,11 +4028,11 @@ C
  *         perm_c and a permutation that postorders the elimination tree
  *         of Pc'*A'*A*Pc; perm_c is not changed if the elimination tree
  *         is already in postorder.
-
+
 	(C)
  *           equed =
  *         If A->Stype = SLU_NR:
-
+
 	(c)
 # endif // defined(BOOST_ASIO_HAS_NOEXCEPT)
 #endif // !defined(BOOST_ASIO_NOEXCEPT_IF)
@@ -4059,14 +4059,14 @@ C
 #  endif // defined(BOOST_ASIO_MSVC)
 # endif // !defined(BOOST_ASIO_DISABLE_DECLTYPE)
 #endif // !defined(BOOST_ASIO_HAS_DECLTYPE)
-
+
 	(C)
 #else
     #define BOOST_SERIALIZATION_COLLECTION_TRAITS_HELPER_WCHAR(C)   \
     BOOST_SERIALIZATION_COLLECTION_TRAITS_HELPER(wchar_t, C)        \
     /**/
 #endif
-
+
 	(C)
 #endif
 
@@ -4086,15 +4086,15 @@ C
     BOOST_SERIALIZATION_COLLECTION_TRAITS_HELPER(signed short, C)    \
     BOOST_SERIALIZATION_COLLECTION_TRAITS_HELPER_INT64(C)            \
     BOOST_SERIALIZATION_COLLECTION_TRAITS_HELPER_WCHAR(C)            \
-
+
 	(c)          ((c)
 #endif
 
 #include "pyfpe.h"
-
+
 	(c)          (c)
 #else
-
+
 	(c)  # Number of parameters
     m, = np.shape(b)  # Number of constraints
 
@@ -4103,7 +4103,7 @@ C
     r = Z.dot(H.dot(x) + c)
     g = Z.dot(r)
     p = -g
-
+
 	(c)  # Number of parameters
     m, = np.shape(b)  # Number of constraints
 
@@ -4113,7 +4113,7 @@ C
     kkt_matrix = csc_matrix(bmat([[H, A.T], [A, None]]))
     # Vector of coefficients.
     kkt_vec = np.hstack([-c, -b])
-
+
 	(C) (if options->Trans = NOTRANS) or diag(R)
  *	     (if options->Trans = TRANS or CONJ) so that it solves the
  *	     original system before equilibration.
@@ -4139,13 +4139,13 @@ C
  *              ( Default: 10 )
  *	     4) options->ILU_DropRule specifies the dropping rule.
  *		Option	      Meaning
-
+
 	(C) (if options->Trans = NOTRANS) or diag(R)
  *	     (if options->Trans = TRANS or CONJ) so that it solves the
  *	     original system before equilibration.
  *
  *   See supermatrix.h for the definition of 'SuperMatrix' structure.
-
+
 	(C) (if options->Trans = NOTRANS) or diag(R)
  *           (if options->Trans = TRANS or CONJ) so that it solves the
  *           original system before equilibration.
@@ -4153,13 +4153,13 @@ C
  *   2. If A is stored row-wise (A->Stype = SLU_NR), apply the above algorithm
  *      to the transpose of A:
  *
-
+
 	(C) (if options->Trans = NOTRANS) or diag(R)
  *           (if options->Trans = TRANS or CONJ) so that it solves the
  *           original system before equilibration.
  *
  *   See supermatrix.h for the definition of 'SuperMatrix' structure.
-
+
 	(c) * (xy_y = 1. / sin(d));
                         xy_y *= d * sin(lp_lat);
                     } else
@@ -4168,7 +4168,7 @@ C
                         xy_x = (xy_x + lp_lon * this->m_proj_parm.cosphi1) * 0.5;
                         xy_y = (xy_y + lp_lat) * 0.5;
                     }
-
+
 	(C) * (y = 1. / sin(D));
                             y *= D * sin(lp_lat);
                         } else
@@ -4179,265 +4179,265 @@ C
                         }
                     /* if too far from given values of x,y, repeat with better approximation of phi,lam */
                     } while (((fabs(xy_x-x) > epsilon) || (fabs(xy_y-y) > epsilon)) && (round++ < max_round));
-
+
 	(c) * f;
             }
-
+
 	(c) * gamma(d) / (gamma(p)
 	    goto hypdon;
 	}
 	if (d <= -1.0)
 	    goto hypdiv;
-
+
 	(c) * multiplier;
                     multiplier *= base;
                 }
-
+
 	(c) * self.rtol
                     c = u + adj
                 if not self.ab[0] < c < self.ab[1]:
-
+
 	(C) *inv(diag(C))
  *	     options->Trans = TRANS:
-
+
 	(C) *inv(diag(C))
  *           options->Trans = TRANS:
-
+
 	(c) / (gamma(a)
 		goto psidon;
 	    }
-
+
 	(c) / (Lanczos::lanczos_sum_expG_scaled(a)
 
       T l1 = log(cgh / bgh) * (b - 0.5f);
       T l2 = log(x * cgh / agh) * a;
-
+
 	(c) / (Lanczos::lanczos_sum_expG_scaled(a)
    result *= prefix;
    // combine with the leftover terms from the Lanczos approximation:
-
+
 	(c) / phi
         c = chi[~mask]
         coef = [-358/65690625, 0, -94/1010625, 0, 2/2625, 0, 6/175, 0, 0.4]
         mu2[~mask] = np.polyval(coef, c)
         return m, mu2 - m**2, None, None
 
-
+
 	(c) 1995 Ernst Stadlober, Institut fuer Statistitk, TU Graz
  *****************************************************************************/
-
+
 	(c) 2000  W. Hoermann
  *****************************************************************************/
-
+
 	(C) 2003, C. Bond. All rights reserved.
 /*                                                                           */
 /* See http:// www.crbond.com/                                               */
-
+
 	(c) 2007  W. Hoermann
  *****************************************************************************/
-
+
 	(c) 2008 Gordon Woodhull
-
+
 	(C) 2015-2020 Niall Douglas <http://www.nedproductions.biz/> (7 commits)
 File Created: August 2015
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (1 commit)
 File Created: June 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (10 commits)
 File Created: June 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (10 commits)
 File Created: Oct 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (11 commits)
 File Created: July 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (12 commits)
 File Created: Nov 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (12 commits)
 File Created: Oct 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (13 commits)
 File Created: Oct 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (14 commits)
 File Created: June 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (2 commits)
 File Created: June 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (2 commits)
 File Created: Oct 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (20 commits)
 File Created: July 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (20 commits)
 File Created: June 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (21 commits)
 File Created: July 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (225 commits)
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (24 commits)
 File Created: June 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (25 commits)
 File Created: July 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (3 commits)
 File Created: Oct 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (4 commits)
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (5 commits)
 File Created: Oct 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (6 commits)
 File Created: Aug 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (6 commits)
 File Created: June 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (6 commits)
 File Created: Oct 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (6 commits) and Andrzej Krzemie
 File Created: Oct 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (7 commits)
 File Created: June 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (7 commits)
 File Created: Oct 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (8 commits)
 File Created: June 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (8 commits)
 File Created: Oct 2017
 
-
+
 	(C) 2017-2020 Niall Douglas <http://www.nedproductions.biz/> (9 commits)
 File Created: Oct 2017
 
-
+
 	(C) 2018 - 2019 Niall Douglas <http://www.nedproductions.biz/> (5 commits)
 File Created: Feb 2018
 
-
+
 	(C) 2018 - 2020 Niall Douglas <http://www.nedproductions.biz/> (5 commits)
 File Created: Feb 2018
 
-
+
 	(C) 2018 - 2020 Niall Douglas <http://www.nedproductions.biz/> (5 commits)
 File Created: May 2020
 
-
+
 	(C) 2018-2020 Niall Douglas <http://www.nedproductions.biz/> (11 commits)
 File Created: Apr 2018
 
-
+
 	(C) 2018-2020 Niall Douglas <http://www.nedproductions.biz/> (17 commits)
 File Created: Apr 2018
 
-
+
 	(C) 2018-2020 Niall Douglas <http://www.nedproductions.biz/> (3 commits)
 File Created: March 2018
 
-
+
 	(C) 2018-2020 Niall Douglas <http://www.nedproductions.biz/> (4 commits)
 File Created: Mar 2018
 
-
+
 	(C) 2018-2020 Niall Douglas <http://www.nedproductions.biz/> (4 commits)
 File Created: Sep 2018
 
-
+
 	(C) 2018-2020 Niall Douglas <http://www.nedproductions.biz/> (5 commits)
 File Created: Aug 2018
 
-
+
 	(C) 2018-2020 Niall Douglas <http://www.nedproductions.biz/> (5 commits)
 File Created: Feb 2018
 
-
+
 	(C) 2018-2020 Niall Douglas <http://www.nedproductions.biz/> (5 commits)
 File Created: Jun 2018
 
-
+
 	(C) 2018-2020 Niall Douglas <http://www.nedproductions.biz/> (5 commits)
 File Created: June 2018
 
-
+
 	(C) 2018-2020 Niall Douglas <http://www.nedproductions.biz/> (5 commits)
 File Created: Sep 2018
 
-
+
 	(C) 2018-2020 Niall Douglas <http://www.nedproductions.biz/> (6 commits)
 File Created: March 2018
 
-
+
 	(C) 2018-2020 Niall Douglas <http://www.nedproductions.biz/> (8 commits)
 File Created: March 2018
 
-
+
 	(C) 2019-2020 Niall Douglas <http://www.nedproductions.biz/> (12 commits)
 File Created: Oct 2019
 
-
+
 	(C) 2020 Niall Douglas <http://www.nedproductions.biz/> (11 commits)
 File Created: Jan 2020
 
-
+
 	(C) 2020 Niall Douglas <http://www.nedproductions.biz/> (5 commits)
 File Created: Jan 2020
 
-
+
 	(c) < 1e-7, (c
-
+
 	(c) < 1e-7, np.pi
                          sc.expm1(sc.gammaln(2.0*c+1.0)-2*sc.gammaln(c + 1.0))/c**2.0)
         eps = 1e-14
-
+
 	(c) < 32;
 }
-
+
 	(c) < eps, -_EULER, sc.expm1(sc.gammaln(c
 
         m = np.where(c < -1.0, np.nan, -gamk)
         v = np.where(c < -0.5, np.nan, g1**2.0*gam2k)
-
+
 	(c) < tolerance)
                                 lamt -= tolerance;
                             xlam = (par.one_es * tanphi * this->m_proj_parm.sa + sin(lamt) * this->m_proj_parm.ca) / c;
@@ -4452,7 +4452,7 @@ File Created: Jan 2020
                             lampp = two_and_half_pi;
                         else if (lamdp >= this->m_proj_parm.rlm2)
                             lampp = half_pi;
-
+
 	(c) > 0:
             j = js[c[0]]
             # in a previous commit, the previous line was changed to choose
@@ -4467,22 +4467,22 @@ File Created: Jan 2020
             # priority.
             b[i] = j  # replace artificial column
         else:
-
+
 	(C) ? DD_C_NAN : DD_C_ZERO);
     }
     if (dd_is_zero(C)) {
         return (dd_is_negative(A) ? DD_C_NEGINF : DD_C_INF);
-
+
 	(C) ? DD_C_ZERO : DD_C_NEGINF);
     }
     if (dd_is_zero(C)) {
         return DD_C_INF;
-
+
 	(C) @f
     //!
     //! @param g
     //! A monadic function with signature @f$ A \to M(B) @f$.
-
+
 	(C) @f
     //! @f$ g : A \to M(B) @f$, the signature is
     //! @f$
@@ -4491,17 +4491,17 @@ File Created: Jan 2020
     //! @f$.
     //!
     //! @param f
-
+
 	(C) @f
     //! `Applicative` `F` is also a `Monad`, such functions taking normal
     //! values but returning monadic values are called _monadic functions_.
     //! To compose them, we obviously can't use normal function composition,
     //! since the domains and codomains of `f` and `g` do not match properly.
     //! Instead, we'll need a new operator -- let's call it `monadic_compose`:
-
+
 	(C) @f
     //! must be satisfied:
-
+
 	(C) @f
     //! we could simply set
     //! @code
@@ -4519,17 +4519,17 @@ File Created: Jan 2020
     //! type @f$ X \to X @f$. It is now the right time to observe that `lift`
     //! from `Applicative` has exactly the right signature, and so we'll take
     //! this for our neutral element.
-
+
 	(C) ACM, 2011. http://doi.acm.org/10.1145/1916461.1916469
 //
 // Note that there are no "noexcept" specifications on the functions in this file: there are too many
 // calls to lexical_cast (and similar) to easily analyse the code for correctness. So until compilers
 // can detect noexcept misuse at compile time, the only realistic option is to simply not use it here.
-
+
 	(C) ACM, 2011. http://doi.acm.org/10.1145/1916461.1916469
 //
 // This file has no include guards or namespaces - it's expanded inline inside default_ops.hpp
-
+
 	(C) ACM, 2011. http://doi.acm.org/10.1145/1916461.1916469
 //
 // This header contains implementation details for estimating the zeros
@@ -4539,14 +4539,14 @@ File Created: Jan 2020
 // empirical curve fitting and McMahon's asymptotic approximation
 // for small order, uniform asymptotic expansion for large order,
 // and iteration and root interlacing for negative order.
-
+
 	(C) ACM, 2011. http://doi.acm.org/10.1145/1916461.1916469
 //
 // This header contains implementation details for estimating the zeros
 // of the Airy functions airy_ai and airy_bi on the negative real axis.
-
+
 	(C) and B by diag(R)
-
+
 	(c) Any expression implicitly convertible to the single type
     //      of a one-argument T's constructor.
     //  (d*) Weak compilers (BCB) might also resolved Expr as optional<T> and optional<U>
@@ -4555,34 +4555,34 @@ File Created: Jan 2020
     // Can throw if the resolved T ctor throws.
 #ifndef BOOST_OPTIONAL_DETAIL_NO_RVALUE_REFERENCES
 
-
+
 	(C) as c:
             del c
 
-
+
 	(C) as c:
             pass
 
-
+
 	(C) as c:
     ...     # do something
     ...     del c
 
     >>> class C:
-
+
 	(C) as c:
     ...     # do something
     ...     del c
     Traceback (most recent call last):
         ...
-
+
 	(c) BOOST_ASIO_CORO_REENTER(c)
 #endif
 
 #ifndef yield
 # define yield BOOST_ASIO_CORO_YIELD
 #endif
-
+
 	(c) BOOST_ASIO_OS_DEF_
 # define BOOST_ASIO_OS_DEF_AF_UNSPEC 0
 # define BOOST_ASIO_OS_DEF_AF_INET 2
@@ -4669,7 +4669,7 @@ typedef u_long u_long_type;
 typedef u_short u_short_type;
 typedef int signed_size_type;
 struct sockaddr_un_type { u_short sun_family; char sun_path[108]; };
-
+
 	(c) BOOST_ASIO_OS_DEF_
 # define BOOST_ASIO_OS_DEF_AF_UNSPEC AF_UNSPEC
 # define BOOST_ASIO_OS_DEF_AF_INET AF_INET
@@ -4766,7 +4766,7 @@ struct in4_mreq_type
 {
   struct in_addr imr_multiaddr;
   struct in_addr imr_interface;
-
+
 	(c) BOOST_ASIO_OS_DEF_
 # define BOOST_ASIO_OS_DEF_AF_UNSPEC AF_UNSPEC
 # define BOOST_ASIO_OS_DEF_AF_INET AF_INET
@@ -4856,13 +4856,13 @@ const int always_fail_option = 2;
 } // namespace detail
 } // namespace asio
 } // namespace boost
-
+
 	(c) BOOST_HOF_PP_PRIMITIVE_CAT(BOOST_HOF_PP_IIF_, c)
 #define BOOST_HOF_PP_IIF_0(t, ...) __VA_ARGS__
 #define BOOST_HOF_PP_IIF_1(t, ...) t
 
 #define BOOST_HOF_PP_WALL(...) __VA_ARGS__
-
+
 	(c) BOOST_HOF_PP_PRIMITIVE_CAT(BOOST_HOF_PP_RAIL_IIF_, c)
 #define BOOST_HOF_PP_RAIL_IIF_0(t, ...) __VA_ARGS__
 #define BOOST_HOF_PP_RAIL_IIF_1(t, ...) t
@@ -4871,10 +4871,10 @@ const int always_fail_option = 2;
     BOOST_HOF_PP_RAIL_IIF(BOOST_HOF_PP_IS_PAREN(BOOST_HOF_PP_WALL(())))( \
         BOOST_HOF_PP_RAIL_ID BOOST_HOF_PP_OBSTRUCT()()(macro), \
         macro BOOST_HOF_PP_OBSTRUCT() \
-
+
 	(C) BOOST_MPL_AUX_VALUE_WKND(C)
 #else
-
+
 	(c) BOOST_NOEXCEPT_IF(c)
 #  elif defined(__clang__)
 #   if __has_feature(__cxx_noexcept__)
@@ -4913,87 +4913,87 @@ const int always_fail_option = 2;
 #endif // !defined(BOOST_ASIO_NOEXCEPT_OR_NOTHROW)
 #if !defined(BOOST_ASIO_NOEXCEPT_IF)
 # if defined(BOOST_ASIO_HAS_NOEXCEPT)
-
+
 	(c) c
-
+
 	(C) C
-
+
 	(C) C
 
 #endif
-
+
 	(C) C
 #   define BOOST_MPL_AUX_MSVC_VALUE_WKND(C) \
     ::boost::mpl::aux::value_wknd< C > \
 /**/
 #endif
-
+
 	(c) c
 #   endif
 
 # endif
-
+
 	(C) c = span.innerHTML = C;
           if (c.match(/[\u02C6-\u02DC\u00A8]/)) {this.PHTML.acc = -.52}
           else if (c === "\u2192") {this.PHTML.acc = -.15; this.PHTML.vec = true}
         }
-
+
 	(C) Copyright 2002 Rani Sharoni (rani_sharoni@hotmail.com) and Robert Ramey
-
+
 	(C) Copyright 2002 Robert Ramey - http://www.rrsd.com .
-
+
 	(C) Copyright 2002, 2003 Beman Dawes   Boost.Filesystem
-
+
 	(C) Copyright 2002-2008 Robert Ramey and Joaquin M Lopez Munoz
-
+
 	(C) Copyright 2002-2008, Fernando Luis Cacciola Carballal.
-
+
 	(C) Copyright 2002-2009 Robert Ramey - http://www.rrsd.com .
-
+
 	(C) Copyright 2002-2014 Robert Ramey - http://www.rrsd.com .
-
+
 	(C) Copyright 2002-2020 Robert Ramey - http://www.rrsd.com .
-
+
 	(C) Copyright 2002-4 Pavel Vozenilek .
-
+
 	(C) Copyright 2003-2007 Jonathan Turkanis
-
+
 	(C) Copyright 2003-4 Pavel Vozenilek and Robert Ramey - http://www.rrsd.com.
-
+
 	(C) Copyright 2004 Pavel Vozenilek.
-
+
 	(C) Copyright 2004 Robert Ramey - http://www.rrsd.com .
-
+
 	(C) Copyright 2004 Robert Ramey and Martin Ecker
-
+
 	(C) Copyright 2004-2007 Jonathan Turkanis
-
+
 	(C) Copyright 2004-2009 Robert Ramey, Martin Ecker and Takatoshi Kondo
-
+
 	(C) Copyright 2005  Matthias Troyer
-
+
 	(C) Copyright 2005 John Maddock
-
+
 	(C) Copyright 2005 Matthias Troyer
-
+
 	(C) Copyright 2005 Matthias Troyer .
-
+
 	(C) Copyright 2005 Matthias Troyer and Dave Abrahams
-
+
 	(C) Copyright 2005 Robert Ramey - http://www.rrsd.com
-
+
 	(C) Copyright 2005 Robert Ramey - http://www.rrsd.com .
-
+
 	(C) Copyright 2005-2006 Matthias Troyer
-
+
 	(C) Copyright 2005-2007 Jonathan Turkanis
-
+
 	(C) Copyright 2005-2007 Matthias Troyer
-
+
 	(C) Copyright 2005-7 Anthony Williams
-
+
 	(C) Copyright 2005-8 Anthony Williams
-
+
 	(C) Copyright 2006 David Abrahams - http://www.boost.org.
 // implementation of class export functionality.  This is an alternative to
 // "forward declaration" method to provoke instantiation of derived classes
@@ -5001,19 +5001,19 @@ const int always_fail_option = 2;
 
 #include <utility>
 #include <cstddef> // NULL
-
+
 	(C) Copyright 2006 Douglas Gregor <doug.gregor -at gmail.com>
-
+
 	(C) Copyright 2006 Douglas Gregor <doug.gregor -at- gmail.com>
-
+
 	(C) Copyright 2006-7 Anthony Williams
-
+
 	(C) Copyright 2006-8 Anthony Williams
-
+
 	(C) Copyright 2007 Andrew Sutton
-
+
 	(C) Copyright 2007 Anthony Williams
-
+
 	(C) Copyright 2007 Anthony Williams
 #ifndef THREAD_HEAP_ALLOC_HPP
 #define THREAD_HEAP_ALLOC_HPP
@@ -5026,31 +5026,31 @@ const int always_fail_option = 2;
 #include <boost/core/no_exceptions_support.hpp>
 
 #include <boost/winapi/heap_memory.hpp>
-
+
 	(C) Copyright 2007 David Deakins
-
+
 	(C) Copyright 2007 Matthias Troyer
-
+
 	(C) Copyright 2007 Matthias Troyer .
-
+
 	(C) Copyright 2007 Robert Ramey - http://www.rrsd.com .
-
+
 	(C) Copyright 2007, 2008 Steven Watanabe, Joseph Gauterin, Niels Dekker
-
+
 	(C) Copyright 2007-10 Anthony Williams
-
+
 	(C) Copyright 2007-2009 Andrew Sutton
-
+
 	(C) Copyright 2007-2010 Anthony Williams
-
+
 	(C) Copyright 2007-8 Anthony Williams
-
+
 	(C) Copyright 2007-8 Anthony Williams
 
 #include <boost/thread/detail/config.hpp>
-
+
 	(C) Copyright 2007-9 Anthony Williams
-
+
 	(C) Copyright 2007-9 Anthony Williams
 
 #include <list>
@@ -5058,99 +5058,99 @@ const int always_fail_option = 2;
 #include <boost/thread/shared_mutex.hpp>
 #include <boost/thread/mutex.hpp>
 #include <boost/thread/lock_guard.hpp>
-
+
 	(C) Copyright 2008 Anthony Williams
-
+
 	(C) Copyright 2008 Anthony Williams
 #ifndef THREAD_HEAP_ALLOC_PTHREAD_HPP
 #define THREAD_HEAP_ALLOC_PTHREAD_HPP
 
 #include <boost/config/abi_prefix.hpp>
-
+
 	(C) Copyright 2008 CodeRage, LLC (turkanis at coderage dot com)
-
+
 	(C) Copyright 2008 Matthias Troyer
-
+
 	(C) Copyright 2008 Robert Ramey
-
+
 	(C) Copyright 2008-10 Anthony Williams
-
+
 	(C) Copyright 2008-2009,2012 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_STRICT_LOCK_HPP
 #define BOOST_THREAD_STRICT_LOCK_HPP
-
+
 	(C) Copyright 2008-9 Anthony Williams
-
+
 	(C) Copyright 2009 Eric Bose-Wolf
-
+
 	(C) Copyright 2009 Robert Ramey - http://www.rrsd.com .
-
+
 	(C) Copyright 2009-2011 Frederic Bron, Robert Stewart, Steven Watanabe
-
+
 	(C) Copyright 2009-2011 Frederic Bron.
-
+
 	(C) Copyright 2009-2012 Anthony Williams
-
+
 	(C) Copyright 2009-2012 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_LOCK_TRAITS_HPP
 #define BOOST_THREAD_LOCK_TRAITS_HPP
-
+
 	(C) Copyright 2010 Daniel James
-
+
 	(C) Copyright 2010 Just Software Solutions Ltd http://www.justsoftwaresolutions.co.uk
-
+
 	(C) Copyright 2010 Robert Ramey
-
+
 	(C) Copyright 2010 Vicente J. Botet Escriba
-
+
 	(C) Copyright 2010-2011 Vicente J. Botet Escriba
-
+
 	(C) Copyright 2011 Vicente J. Botet Escriba
-
+
 	(C) Copyright 2011,2012,2015 Vicente J. Botet Escriba
-
+
+	(C) Copyright 2011-2012 Vicente J. Botet Escriba
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
-	(C) Copyright 2011-2012 Vicente J. Botet Escriba
-
-
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_LOCK_ALGORITHMS_HPP
 #define BOOST_THREAD_LOCK_ALGORITHMS_HPP
-
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_LOCK_GUARD_HPP
 #define BOOST_THREAD_LOCK_GUARD_HPP
-
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_LOCK_OPTIONS_HPP
 #define BOOST_THREAD_LOCK_OPTIONS_HPP
-
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_LOCK_TYPES_HPP
 #define BOOST_THREAD_LOCK_TYPES_HPP
-
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_LOCKABLE_TRAITS_HPP
 #define BOOST_THREAD_LOCKABLE_TRAITS_HPP
-
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_LOCKS_HPP
 #define BOOST_THREAD_LOCKS_HPP
-
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_MOVE_HPP
 #define BOOST_THREAD_MOVE_HPP
-
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
 #include <boost/assert.hpp>
@@ -5162,12 +5162,12 @@ const int always_fail_option = 2;
 #include <boost/thread/thread_time.hpp>
 #include <boost/thread/detail/platform_time.hpp>
 #include <boost/thread/pthread/pthread_helpers.hpp>
-
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
 #include <boost/thread/detail/config.hpp>
 #include <boost/predef/platform.h>
-
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
 #include <boost/thread/detail/config.hpp>
@@ -5177,7 +5177,7 @@ const int always_fail_option = 2;
 #include <boost/thread/mutex.hpp>
 #include <boost/thread/pthread/condition_variable_fwd.hpp>
 #include <boost/thread/pthread/pthread_helpers.hpp>
-
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
 #include <boost/thread/detail/config.hpp>
@@ -5185,13 +5185,13 @@ const int always_fail_option = 2;
 #include <boost/thread/win32/thread_primitives.hpp>
 #include <boost/thread/win32/thread_heap_alloc.hpp>
 #include <boost/thread/detail/platform_time.hpp>
-
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
 #include <boost/thread/detail/platform_time.hpp>
 #include <boost/thread/pthread/pthread_mutex_scoped_lock.hpp>
 #include <boost/thread/pthread/pthread_helpers.hpp>
-
+
 	(C) Copyright 2011-2012 Vicente J. Botet Escriba
 
 #include <boost/thread/win32/thread_primitives.hpp>
@@ -5207,31 +5207,31 @@ const int always_fail_option = 2;
 #include <boost/thread/lock_guard.hpp>
 #include <boost/thread/lock_types.hpp>
 #include <boost/thread/detail/platform_time.hpp>
-
+
 	(C) Copyright 2011-2012,2015 Vicente J. Botet Escriba
-
+
 	(C) Copyright 2011-2012,2017-2018 Vicente J. Botet Escriba
-
+
 	(C) Copyright 2011-2013 Vicente J. Botet Escriba
-
+
 	(C) Copyright 2011-2015 Vicente J. Botet Escriba
-
+
 	(C) Copyright 2011Vicente J. Botet Escriba
-
+
 	(C) Copyright 2012 Vicente Botet
-
+
 	(C) Copyright 2012 Vicente J. Botet Escriba
-
+
 	(C) Copyright 2012 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_DETAIL_LOCKABLE_WRAPPER_HPP
 #define BOOST_THREAD_DETAIL_LOCKABLE_WRAPPER_HPP
-
+
 	(C) Copyright 2012 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_LOCK_FACTORIES_HPP
 #define BOOST_THREAD_LOCK_FACTORIES_HPP
-
+
 	(C) Copyright 2012 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_REVERSE_LOCK_HPP
@@ -5241,7 +5241,7 @@ const int always_fail_option = 2;
 #include <boost/thread/lockable_traits.hpp>
 #include <boost/thread/lock_options.hpp>
 #include <boost/thread/detail/delete.hpp>
-
+
 	(C) Copyright 2012 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_SHARED_LOCK_GUARD_HPP
@@ -5250,273 +5250,273 @@ const int always_fail_option = 2;
 //#include <boost/thread/locks.hpp>
 #include <boost/thread/lock_options.hpp>
 #include <boost/thread/detail/delete.hpp>
-
+
 	(C) Copyright 2012 Vicente J. Botet Escriba
 
 #include <boost/thread/detail/config.hpp>
 #include <boost/thread/detail/delete.hpp>
-
+
 	(C) Copyright 2012 Vicente J. Botet Escriba
 
 // Based on the Anthony's idea of scoped_thread in CCiA
-
+
 	(C) Copyright 2012 Vicente J. Botet Escriba
 
 // Based on the Anthony's idea of thread_joiner in CCiA
-
+
 	(C) Copyright 2013 Andrey Semashev
-
+
 	(C) Copyright 2013 Ruslan Baratov
-
+
 	(C) Copyright 2013 Tim Blechmann
-
+
 	(C) Copyright 2013 Vicente J. Botet Escriba
-
+
 	(C) Copyright 2013 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_COMPLETION_LATCH_HPP
 #define BOOST_THREAD_COMPLETION_LATCH_HPP
-
+
 	(C) Copyright 2013 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_COUNTER_HPP
 #define BOOST_THREAD_COUNTER_HPP
-
+
 	(C) Copyright 2013 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_LATCH_HPP
 #define BOOST_THREAD_LATCH_HPP
-
+
 	(C) Copyright 2013, 2020 Andrey Semashev
  */
-
+
 	(C) Copyright 2013,2014 Vicente J. Botet Escriba
-
+
 	(C) Copyright 2013,2015 Vicente J. Botet Escriba
-
+
 	(C) Copyright 2014 Jim Bell
-
+
 	(C) Copyright 2014 Robert Ramey - http://www.rrsd.com .
-
+
 	(C) Copyright 2014 Vicente J. Botet Escriba
 
 #ifndef BOOST_THREAD_EXCEPTIONAL_PTR_HPP
 #define BOOST_THREAD_EXCEPTIONAL_PTR_HPP
-
+
 	(C) Copyright 2016 Ashish Sadanandan
-
+
 	(C) Copyright 2016 Raffi Enficiaud.
-
+
 	(C) Copyright 2017 Andrey Semashev
-
+
 	(C) Copyright 2020  Robert Ramey
-
+
 	(C) Copyright Aleksey Gurtovoy 2002 - 2003.
-
+
 	(C) Copyright Aleksey Gurtovoy 2002.
-
+
 	(C) Copyright Aleksey Gurtovoy 2003.
-
+
 	(c) Copyright Andreas Huber Doenni 2002-2005, Eric Niebler 2006
-
+
 	(C) Copyright Andrew Sutton 2007
-
+
 	(C) Copyright Andrey Semashev 2017.
-
+
 	(C) Copyright Anton Bikineev 2014
-
+
 	(C) Copyright Antony Polukhin 2013.
-
+
 	(C) Copyright Antony Polukhin 2014.
-
+
 	(C) Copyright Artyom Beilis 2010.
-
+
 	(C) Copyright Balint Cserni 2017
-
+
 	(C) Copyright Beman Dawes 1999-2003. Distributed under the Boost
-
+
 	(C) Copyright Beman Dawes 1999.
-
+
 	(C) Copyright Beman Dawes 2000. Distributed under the Boost
-
+
 	(C) Copyright Beman Dawes 2001 - 2003.
-
+
 	(C) Copyright Beman Dawes 2001.
-
+
 	(C) Copyright Beman Dawes 2002
-
+
 	(C) Copyright Beman Dawes 2002 - 2003.
-
+
 	(C) Copyright Beman Dawes 2003.
-
+
 	(C) Copyright Beman Dawes 2006, 2009, 2014
-
+
 	(C) Copyright Benedek Thaler 2015-2016
-
+
 	(C) Copyright Bill Kempf 2001.
-
+
 	(C) Copyright Bill Kempf 2002.
-
+
 	(C) Copyright Boris Gubenko 2006 - 2007.
-
+
 	(C) Copyright Boris Gubenko 2007.
-
+
 	(C) Copyright Boris Rasin 2014.
-
+
 	(C) Copyright Boris Rasin and Antony Polukhin 2014-2019.
-
+
 	(C) Copyright Brian Kuhl 2016.
-
+
 	(C) Copyright Bruno Lalande 2008.
-
+
 	(C) Copyright Bryce Lelbach 2010
-
+
 	(C) Copyright Bryce Lelbach 2011
-
+
 	(C) Copyright Christopher Jefferson 2011.
-
+
 	(C) Copyright Craig Henderson 2002.
-
+
 	(C) Copyright Daniel Frey 2002-2017.
-
+
 	(C) Copyright Daniel Frey and Robert Ramey 2009.
-
+
 	(C) Copyright Daniel K. O. 2005.
-
+
 	(C) Copyright Daniel Wallin 2004.
-
+
 	(C) Copyright Darin Adler 2000
-
+
 	(C) Copyright Darin Adler 2001
-
+
 	(C) Copyright Darin Adler 2001 - 2002.
-
+
 	(C) Copyright Darin Adler 2001.
-
+
 	(C) Copyright Daryle Walker 2000-2001.
-
+
 	(C) Copyright Daryle Walker 2001, 2006.
-
+
 	(C) Copyright Daryle Walker 2001-2002.
-
+
 	(C) Copyright Daryle Walker 2001.
-
+
 	(C) Copyright Daryle Walker and Stephen Cleary 2001-2002.
-
+
 	(C) Copyright Dave Abrahams and Daniel Walker 1999-2003.
-
+
 	(C) Copyright Dave Abrahams and Daryle Walker 2001. Distributed under the Boost
-
+
 	(C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes,
-
+
 	(C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes,
 //      Howard Hinnant and John Maddock 2000, 2010. 
-
+
 	(C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes,
 //      Howard Hinnant and John Maddock 2000. 
-
+
 	(C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard
-
+
 	(C) Copyright David Abrahams 2000.
-
+
 	(C) Copyright David Abrahams 2001 - 2002.
-
+
 	(C) Copyright David Abrahams 2001, Howard Hinnant 2001.
-
+
 	(C) Copyright David Abrahams 2001.
-
+
 	(C) Copyright David Abrahams 2002 - 2003.
-
+
 	(C) Copyright David Abrahams 2002.
-
+
 	(C) Copyright David Abrahams 2003.
-
+
 	(C) Copyright David Abrahams 2004.
-
+
 	(C) Copyright David Abrahams Steve Cleary, Beman Dawes, Howard
-
+
 	(C) Copyright David Abrahams, Jeremy Siek, Daryle Walker 1999-2001.
-
+
 	(C) Copyright David Abrahams, Vicente Botet 2009.
-
+
 	(C) Copyright Douglas Gregor 2001.
-
+
 	(C) Copyright Douglas Gregor 2002.
-
+
 	(C) Copyright Douglas Gregor 2010
-
+
 	(C) Copyright Dustin Spicuzza 2009.
-
+
 	(C) Copyright Edward Diener 2011,2012
-
+
 	(C) Copyright Edward Diener 2011,2012,2013
-
+
 	(C) Copyright Edward Diener 2011,2012,2019
-
+
 	(C) Copyright Edward Diener 2011,2013.
-
+
 	(C) Copyright Edward Diener 2011,2014.
-
+
 	(C) Copyright Edward Diener 2011-2015
-
+
 	(C) Copyright Edward Diener 2011-2015,2019
-
+
 	(C) Copyright Edward Diener 2011-2020.
-
+
 	(C) Copyright Edward Diener 2011.
-
+
 	(C) Copyright Edward Diener 2012
-
+
 	(C) Copyright Edward Diener 2012,2013
-
+
 	(C) Copyright Edward Diener 2012,2013,2019
-
+
 	(C) Copyright Edward Diener 2013.
-
+
 	(C) Copyright Edward Diener 2014,2019.
-
+
 	(C) Copyright Edward Diener 2014.
-
+
 	(C) Copyright Edward Diener 2015
-
+
 	(C) Copyright Edward Diener 2015.
-
+
 	(C) Copyright Edward Diener 2016.
-
+
 	(C) Copyright Edward Diener 2019
-
+
 	(C) Copyright Edward Diener 2019.
-
+
 	(C) Copyright Edward Diener 2020
-
+
 	(C) Copyright Edward Diener 2020.
-
+
 	(C) Copyright Eric Ford
-
+
 	(C) Copyright Eric Ford 2001
-
+
 	(C) Copyright Eric Friedman 2002-2003.
-
+
 	(C) Copyright Eric Jourdanneau, Joel Falcou 2010
-
+
 	(C) Copyright Eric Niebler 2004-2005
-
+
 	(c) Copyright Fernando Luis Cacciola Carballal 2000-2004
-
+
 	(C) Copyright Francois Faure, iMAGIS-GRAVIR / UJF, 2001.
-
+
 	(C) Copyright Gennadiy Rozental 2001.
-
+
 	(C) Copyright Gennaro Prota 2003 - 2004.
-
+
 	(C) Copyright Gennaro Prota 2003.
-
+
 	(C) Copyright Greg Colvin and Beman Dawes 1998, 1999.
-
+
 	(C) Copyright Guillaume Melquiond 2002 - 2003.
-
+
 	(C) Copyright Guillaume Melquiond 2003.
-
+
 	(C) Copyright Guillaume Melquiond 2003.
 
 #ifndef BOOST_LEAF_ENABLE_WARNINGS
@@ -5528,492 +5528,492 @@ const int always_fail_option = 2;
 #       pragma warning(push,1)
 #   endif
 #endif
-
+
 	(C) Copyright Herve Bronnimann 2004.
-
+
 	(C) Copyright Howard Hinnant
-
+
 	(C) Copyright Howard Hinnant 2004
-
+
 	(C) Copyright Howard Hinnant 2007-2010. Distributed under the Boost
-
+
 	(C) Copyright Hubert Holin 2001.
-
+
 	(C) Copyright Hubert Holin 2003-2005.");
-
+
 	(C) Copyright Hubert Holin 2003.
-
+
 	(C) Copyright Hubert Holin and Daryle Walker 2001-2002.  Distributed under the Boost
-
+
 	(C) Copyright Ignacy Gawedzki 2010
-
+
 	(C) Copyright Ion Gaztanaga          2014-2014
-
+
 	(C) Copyright Ion Gaztanaga        2006-2014
-
+
 	(C) Copyright Ion Gaztanaga  2006-2013
-
+
 	(C) Copyright Ion Gaztanaga  2006-2013.
-
+
 	(C) Copyright Ion Gaztanaga  2006-2014
-
+
 	(C) Copyright Ion Gaztanaga  2006-2014.
-
+
 	(C) Copyright Ion Gaztanaga  2006-2015
-
+
 	(C) Copyright Ion Gaztanaga  2007-2013
-
+
 	(C) Copyright Ion Gaztanaga  2007-2014
-
+
 	(C) Copyright Ion Gaztanaga  2009-2013.
-
+
 	(C) Copyright Ion Gaztanaga  2010-2013
-
+
 	(C) Copyright Ion Gaztanaga  2013-2013
-
+
 	(C) Copyright Ion Gaztanaga  2013-2014
-
+
 	(C) Copyright Ion Gaztanaga  2014-2014
-
+
 	(C) Copyright Ion Gaztanaga  2014-2015
-
+
 	(C) Copyright Ion Gaztanaga  2015-2017.
-
+
 	(C) Copyright Ion Gaztanaga  2017-2017
-
+
 	(C) Copyright Ion Gaztanaga 2004-2015. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2005-2012.
-
+
 	(C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2005-2013.
-
+
 	(C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2005-2014. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2005-2015.
-
+
 	(C) Copyright Ion Gaztanaga 2005-2015. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2005-2016.
-
+
 	(C) Copyright Ion Gaztanaga 2005.
-
+
 	(C) Copyright Ion Gaztanaga 2006-2012
-
+
 	(C) Copyright Ion Gaztanaga 2006-2012.
-
+
 	(C) Copyright Ion Gaztanaga 2006-2012. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2006-2014. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2006. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2007-2012.
-
+
 	(C) Copyright Ion Gaztanaga 2007-2012. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2007-2013
-
+
 	(C) Copyright Ion Gaztanaga 2007-2013.
-
+
 	(C) Copyright Ion Gaztanaga 2007-2013. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2007-2014
-
+
 	(C) Copyright Ion Gaztanaga 2007-2014. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2008
-
+
 	(C) Copyright Ion Gaztanaga 2008-2012. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2008-2013
-
+
 	(C) Copyright Ion Gaztanaga 2008-2013. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2008-2015. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2009-2012.
-
+
 	(C) Copyright Ion Gaztanaga 2009-2012. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2009. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2010-2012.
-
+
 	(C) Copyright Ion Gaztanaga 2010-2012. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2010-2016.
-
+
 	(C) Copyright Ion Gaztanaga 2011-2012. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2011-2013. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2011-2014. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2012-2012.
-
+
 	(C) Copyright Ion Gaztanaga 2012-2012. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2012-2013. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2012-2015.
-
+
 	(C) Copyright Ion Gaztanaga 2012-2016.
-
+
 	(C) Copyright Ion Gaztanaga 2013-2013. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2014-2014.
-
+
 	(C) Copyright Ion Gaztanaga 2014-2014. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2014-2015. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2014-2017. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2014.
-
+
 	(C) Copyright Ion Gaztanaga 2015-2015.
-
+
 	(C) Copyright Ion Gaztanaga 2015-2015. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2015-2016.
-
+
 	(C) Copyright Ion Gaztanaga 2016-2016. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2017-2017.
-
+
 	(C) Copyright Ion Gaztanaga 2017-2017. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2017-2018.
-
+
 	(C) Copyright Ion Gaztanaga 2017-2018. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2018-2018. Distributed under the Boost
-
+
 	(C) Copyright Ion Gaztanaga 2019-2020. Distributed under the Boost
-
+
 	(C) Copyright Jens Mauer 2001
-
+
 	(C) Copyright Jens Maurer 2001
-
+
 	(C) Copyright Jens Maurer 2001 - 2002.
-
+
 	(C) Copyright Jens Maurer 2001 - 2003.
-
+
 	(C) Copyright Jens Maurer 2001.
-
+
 	(C) Copyright Jens Maurer 2002 - 2003.
-
+
 	(C) Copyright Jens Maurer 2003.
-
+
 	(C) Copyright Jeremiah Willcock 2004
-
+
 	(C) Copyright Jeremy Siek    2002.
-
+
 	(C) Copyright Jeremy Siek    2004.
-
+
 	(C) Copyright Jeremy Siek 1999-2001.
-
+
 	(C) Copyright Jeremy Siek 1999.
-
+
 	(C) Copyright Jeremy Siek 2000.
-
+
 	(C) Copyright Jeremy Siek 2001.
-
+
 	(C) Copyright Jeremy Siek 2001. Use, modification and
-
+
 	(C) Copyright Jeremy Siek 2002.
-
+
 	(C) Copyright Jeremy Siek 2004
-
+
 	(C) Copyright Jeremy Siek 2006
-
+
 	(c) Copyright Jeremy Siek and John R. Bandela 2001.
-
+
 	(C) Copyright Jeremy Siek, 2001.
-
+
 	(C) Copyright Jeremy William Murphy 2015.
 
-
+
 	(C) Copyright Jeremy William Murphy 2016.
-
+
 	(C) Copyright Jessica Hamilton 2014.
-
+
 	(C) Copyright Jim Douglas 2005.
-
+
 	(C) Copyright Joaquin M Lopez Munoz  2006-2013
-
+
 	(C) Copyright Joel de Guzman 2003.
-
+
 	(C) Copyright Johan Rade 2006.
-
+
 	(C) Copyright John Maddock
-
+
 	(C) Copyright John maddock 1999.
-
+
 	(C) Copyright John maddock 1999. Distributed under the Boost
-
+
 	(C) Copyright John Maddock 2000.
-
+
 	(C) Copyright John Maddock 2001
-
+
 	(C) Copyright John Maddock 2001 - 2002.
-
+
 	(C) Copyright John Maddock 2001 - 2003
-
+
 	(C) Copyright John Maddock 2001 - 2003.
-
+
 	(C) Copyright John Maddock 2001-8.
-
+
 	(C) Copyright John Maddock 2001.
-
+
 	(C) Copyright John Maddock 2002 - 2003.
-
+
 	(C) Copyright John Maddock 2002.
-
+
 	(c) Copyright John Maddock 2003
-
+
 	(C) Copyright John Maddock 2003.
-
+
 	(C) Copyright John Maddock 2005-2006.
-
+
 	(C) Copyright John Maddock 2005.
-
+
 	(C) Copyright John Maddock 2006, 2015
-
+
 	(C) Copyright John Maddock 2006-7.
-
+
 	(C) Copyright John Maddock 2006-8.
-
+
 	(C) Copyright John Maddock 2006.
-
+
 	(C) Copyright John Maddock 2007.
-
+
 	(C) Copyright John Maddock 2008.
-
+
 	(C) Copyright John Maddock 2010.
-
+
 	(C) Copyright John Maddock 2011.
-
+
 	(C) Copyright John Maddock 2015.
-
+
 	(C) Copyright John Maddock 2017.
-
+
 	(C) Copyright John Maddock 2018.
-
+
 	(C) Copyright John Maddock and Steve Cleary 2000.
-
+
 	(C) Copyright Jonathan Graehl 2004.
-
+
 	(C) Copyright Jonathan Turkanis 2003.
-
+
 	(C) Copyright Jonathan Turkanis 2004
-
+
 	(C) Copyright Jonathan Turkanis 2004-2005.
-
+
 	(C) Copyright Jonathan Turkanis 2004.
-
+
 	(C) Copyright Jorge Lodos 2008.
-
+
 	(c) Copyright Juergen Hunold 2008
-
+
 	(C) Copyright Kevlin Henney and Dave Abrahams 1999.
-
+
 	(C) Copyright Lie-Quan Lee 2001.
-
+
 	(C) Copyright Markus Schoepflin 2002 - 2003.
-
+
 	(C) Copyright Markus Schoepflin 2005.
-
+
 	(C) Copyright Markus Schoepflin 2007
-
+
 	(C) Copyright Martin Wille 2003.
-
+
 	(C) Copyright Mat Marcus, Jesse Jones and Adobe Systems Inc 2001
-
+
 	(C) Copyright Matthias Troyerk 2006.
-
+
 	(C) Copyright Michael Glassford 2004.
-
+
 	(C) Copyright Microsoft Corporation  2014
-
+
 	(C) Copyright Milan Svoboda 2008.
-
+
 	(C) Copyright Nick Thompson 2017.
-
+
 	(C) Copyright Nick Thompson 2018.
-
+
 	(C) Copyright Nick Thompson 2019.
-
+
 	(C) Copyright Nick Thompson 2020.
-
+
 	(C) Copyright Nicolai M. Josuttis 2001,
 // available at http://www.josuttis.com/cppcode/fdstream.html.
 
 #ifndef BOOST_IOSTREAMS_FILE_DESCRIPTOR_HPP_INCLUDED
 #define BOOST_IOSTREAMS_FILE_DESCRIPTOR_HPP_INCLUDED
-
+
 	(C) Copyright Nicolai M. Josuttis 2001.
-
+
 	(C) Copyright Noel Belcourt 2007.
-
+
 	(C) Copyright Olaf Krzikalla 2004-2006.
-
+
 	(C) Copyright Orson Peters  2017.
-
+
 	(C) Copyright Pablo Halpern 2009. Distributed under the Boost
-
+
 	(C) Copyright Paul A. Bristow 2006.
-
+
 	(C) Copyright Paul A. Bristow 2011 (added changesign).
-
+
 	(C) Copyright Paul A. Bristow 2011 (added tests for changesign)
-
+
 	(C) Copyright Paul Mensonides 2002-2011.
-
+
 	(C) Copyright Paul Mensonides 2002.
-
+
 	(C) Copyright Paul Mensonides 2003.
-
+
 	(C) Copyright Paul Mensonides 2005.
-
+
 	(C) Copyright Paul Mensonides 2011.
-
+
 	(C) Copyright Paul Mensonides 2012.
-
+
 	(C) Copyright Paul Moore 1999. Permission to copy, use, modify, sell and
-
+
 	(C) Copyright Peter Dimov 2001
-
+
 	(C) Copyright Peter Dimov 2001, 2002
-
+
 	(C) Copyright Peter Dimov 2001, 2002, 2003
-
+
 	(C) Copyright Peter Dimov 2001.
-
+
 	(C) Copyright Peter Dimov 2002
-
+
 	(C) Copyright Peter Dimov 2002.
-
+
 	(C) Copyright Peter Dimov 2004-2005
-
+
 	(C) Copyright Peter Dimov 2008.
-
+
 	(C) Copyright Peter Dimov 2017.
-
+
 	(C) Copyright Peter Dimov 2019
-
+
 	(C) Copyright Peter Dimov and Multi Media Ltd. 2001, 2002, 2003
-
+
 	(C) Copyright R.W. Grosse-Kunstleve 2002.
-
+
 	(c) Copyright Raffi Enficiaud 2017.
-
+
 	(C) Copyright Raffi Enficiaud 2018.
-
+
 	(C) Copyright Raffi Enficiaud 2019.
-
+
 	(C) Copyright Rani Sharoni 2003-2005.
-
+
 	(C) Copyright Rani Sharoni 2003.
-
+
 	(C) Copyright Reimar D
 // Based on zstd.hpp by:
-
+
 	(C) Copyright Rene Rivera 2005.
-
+
 	(C) Copyright Robert Ramey 2003. Jonathan Turkanis 2004.
-
+
 	(c) Copyright Robert Ramey 2004
-
+
 	(C) Copyright Roland Richter 2003.
-
+
 	(C) Copyright Ronald Garcia 2002. Permission to copy, use, modify, sell and
 // distribute this software is granted provided this copyright notice appears
 // in all copies. This software is provided "as is" without express or implied
 // warranty, and with no claim as to its suitability for any purpose.
 
 // See http://www.boost.org/libs/utility/shared_container_iterator.html for documentation.
-
+
 	(C) Copyright Runar Undheim, Robert Ramey
-
+
 	(C) Copyright Samuli-Petrus Korhonen 2017.
-
+
 	(C) Copyright Stefan Slapeta 2004.
-
+
 	(C) Copyright Stephen Cleary 2000
-
+
 	(C) Copyright Stephen Cleary 2000.
-
+
 	(C) Copyright Steve Cleary, Beman Dawes, Aleksey Gurtovoy, Howard Hinnant
-
+
 	(C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant
-
+
 	(C) Copyright Synge Todo 2003.
-
+
 	(C) Copyright Thomas Claveirole 2010
-
+
 	(C) Copyright Thomas Witt    2002.
-
+
 	(C) Copyright Thorsten Ottosen 2002-2003. Use, modification and
-
+
 	(C) Copyright Thorsten Ottosen 2005
-
+
 	(C) Copyright Thorsten Ottosen 2005.
-
+
 	(C) Copyright Tobias Schwinger
-
+
 	(C) Copyright Toon Knapen    2001.
-
+
 	(C) Copyright Toon Knapen 2001 - 2003.
-
+
 	(C) Copyright Toon Knapen 2003.
-
+
 	(C) Copyright Vicente J. Botet Escriba 20010.
-
+
 	(C) Copyright Vicente J. Botet Escriba 2008-2009,2012. Distributed under the Boost
-
+
 	(C) Copyright Vicente J. Botet Escriba 2010.
-
+
 	(C) Copyright Vicente J. Botet Escriba 2013-2014. Distributed under the Boost
-
+
 	(C) Copyright Vicente J. Botet Escriba 2013-2017. Distributed under the Boost
-
+
 	(C) Copyright Vicente J. Botet Escriba 2014-2015. Distributed under the Boost
-
+
 	(C) Copyright Vicente J. Botet Escriba 2014. Distributed under the Boost
-
+
 	(C) Copyright Yuriy Krasnoschek 2009.
-
+
 	(C) David Abrahams 2002.  Distributed under the Boost
-
+
 	(c) for c in p
-
+
 	(c) for c in q
 #---------------------------------------------------------------------------
-
+
 	(c) for c in q
 print('p =', p)
-
+
 	(c) if (
 
 #define MIN(a,b) ((a) < (b) ? (a) : (b))
 #define MAX(a,b) ((a) > (b) ? (a) : (b))
-
+
 	(C) if sps.issparse(A) else A
         c = c*C
 
     b_scale = np.max(np.abs(b)) if b.size > 0 else 1
     if b_scale == 0:
-
+
 	(C) is not known a priori, a conservative bound is:
  *          nnz(C) <= nnz(A) + nnz(B)
  *
  * Note:
-
+
 	(c) MSVC 14.0 and later, which are used with Windows SDK 10.
 BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
 CryptReleaseContext(
@@ -6028,15 +6028,15 @@ CryptReleaseContext(
 #endif // BOOST_WINAPI_PARTITION_APP_SYSTEM
 }
 #endif // !defined( BOOST_USE_WINDOWS_H )
-
+
 	(C) needs to be assigned for the test
         # to function correctly.  It is assigned to c, but c itself is
         # not referenced in the body of the with, it is only there for
         # the refcount.
-
+
 	(c) noexcept(c)
 # else // defined(BOOST_ASIO_HAS_NOEXCEPT)
-
+
 	(c) of the bivariate B-spline representation of the
         surface along with the degree of the spline.
     fp : ndarray
@@ -6049,27 +6049,27 @@ CryptReleaseContext(
         A message corresponding to the integer flag, ier.
 
     See Also
-
+
 	(C) or diag(R))
 		for (i = 0; i < A->nrow; ++i) work[i] *= rwork[i];
 		
 		dgstrs (trans, L, U, perm_c, perm_r, &Bjcol, stat, info);
-
+
 	(C) or diag(R))
 		for (i = 0; i < A->nrow; ++i) work[i] *= rwork[i];
 		
 		sgstrs (trans, L, U, perm_c, perm_r, &Bjcol, stat, info);
-
+
 	(C) or diag(R))
 		for (i = 0; i < A->nrow; ++i) {
 		    cs_mult(&work[i], &work[i], rwork[i]);
 		}
-
+
 	(C) or diag(R))
 		for (i = 0; i < A->nrow; ++i) {
 		    zd_mult(&work[i], &work[i], rwork[i]);
 		}
-
+
 	(C) or diag(R)).
 		if ( notran && colequ )
 		    for (i = 0; i < A->ncol; ++i) work[i] *= C[i];
@@ -6077,7 +6077,7 @@ CryptReleaseContext(
 		    for (i = 0; i < A->nrow; ++i) work[i] *= R[i];
 		
 		dgstrs (transt, L, U, perm_c, perm_r, &Bjcol, stat, info);
-
+
 	(C) or diag(R)).
 		if ( notran && colequ )
 		    for (i = 0; i < A->ncol; ++i) work[i] *= C[i];
@@ -6085,7 +6085,7 @@ CryptReleaseContext(
 		    for (i = 0; i < A->nrow; ++i) work[i] *= R[i];
 		
 		sgstrs (transt, L, U, perm_c, perm_r, &Bjcol, stat, info);
-
+
 	(C) or diag(R)).
 		if ( notran && colequ )
 		    for (i = 0; i < A->ncol; ++i) {
@@ -6094,7 +6094,7 @@ CryptReleaseContext(
 		else if ( !notran && rowequ )
 		    for (i = 0; i < A->nrow; ++i) {
 		        cs_mult(&work[i], &work[i], R[i]);
-
+
 	(C) or diag(R)).
 		if ( notran && colequ )
 		    for (i = 0; i < A->ncol; ++i) {
@@ -6103,26 +6103,26 @@ CryptReleaseContext(
 		else if ( !notran && rowequ )
 		    for (i = 0; i < A->nrow; ++i) {
 		        zd_mult(&work[i], &work[i], R[i]);
-
+
 	(c) or np.iscomplexobj(b)
     dtype = np.complex128 if is_cmplx else np.double
     r, c, b = (np.asarray(i, dtype=dtype) for i in (r, c, b))
 
     if b.ndim == 1 and not keep_b_shape:
-
+
 	(c) or np.iscomplexobj(b)):
         x = x.real
     if outaxis != -1:
-
+
 	(c) Peter Kankowski, 2008
 ==============================================================================*/
 #if !defined(BOOST_SPIRIT_UNICODE_QUERY_FEBRUARY_2_2010)
 #define BOOST_SPIRIT_UNICODE_QUERY_FEBRUARY_2_2010
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 1999, 2004
 c
 
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2000
 c
 
@@ -6131,7 +6131,7 @@ c
       real    tmvopx, tgetu0, tupdmu, tupdnu, tintv, tlanbpro,
      c     treorthu, treorthv, telru, telrv, tbsvd, tnorm2,
      c     tlansvd, tritzvec, trestart, treorth, tdot
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2000
 c
       subroutine clearstat
@@ -6164,7 +6164,7 @@ c
       trestart = 0
       end
 
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2000, 2004
 c
 c
@@ -6177,7 +6177,7 @@ c instructions in the inner loop(?).
       subroutine cmgs(n,k,V,ldv,vnew,index)
 c     
 c     Modified Gram-Schmidt orthogonalization:
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2000, 2004
 c
 c
@@ -6190,7 +6190,7 @@ c instructions in the inner loop(?).
       subroutine dmgs(n,k,V,ldv,vnew,index)
 c     
 c     Modified Gram-Schmidt orthogonalization:
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2000, 2004
 c
 c
@@ -6203,7 +6203,7 @@ c instructions in the inner loop(?).
       subroutine smgs(n,k,V,ldv,vnew,index)
 c     
 c     Modified Gram-Schmidt orthogonalization:
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2000, 2004
 c
 c
@@ -6216,11 +6216,11 @@ c instructions in the inner loop(?).
       subroutine zmgs(n,k,V,ldv,vnew,index)
 c     
 c     Modified Gram-Schmidt orthogonalization:
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2000,2004
 c
 
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2000,2004
 c
       subroutine csafescal(n,alpha,x)
@@ -6235,7 +6235,7 @@ c     %-----------%
       integer n
       real alpha
       complex x(*)
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2000,2004
 c
       subroutine dsafescal(n,alpha,x)
@@ -6249,7 +6249,7 @@ c     %-----------%
       implicit none
       integer n
       double precision alpha, x(*)
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2000,2004
 c
       subroutine ssafescal(n,alpha,x)
@@ -6263,7 +6263,7 @@ c     %-----------%
       implicit none
       integer n
       real alpha, x(*)
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2000,2004
 c
       subroutine zsafescal(n,alpha,x)
@@ -6278,11 +6278,11 @@ c     %-----------%
       integer n
       double precision alpha
       complex*16 x(*)
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c
 
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c
 
@@ -6290,7 +6290,7 @@ c
 c
 c     Perform one implicit LQ SVD sweep with shift SIGMA.
 c
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c
 
@@ -6304,7 +6304,7 @@ c
       integer m,n,k,lda,ldb,ldwork
       double precision alpha,beta,A(lda,*),B(ldb,*),dwork(ldwork)
       integer i,j,l,blocksize
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c
 
@@ -6312,7 +6312,7 @@ c
 c
 c     Perform one implicit LQ SVD sweep with shift SIGMA.
 c
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c
 
@@ -6326,7 +6326,7 @@ c
       integer m,n,k,lda,ldb,lwork
       real alpha,beta,A(lda,*),B(ldb,*),work(lwork)
       integer i,j,l,blocksize
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c
 
@@ -6335,7 +6335,7 @@ c
       implicit none
       integer n, incx
       double precision x(*)
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c
 
@@ -6344,7 +6344,7 @@ c
       implicit none
       integer n, incx
       complex*16 x(*)
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c
 
@@ -6353,7 +6353,7 @@ c
       implicit none
       integer n, incx
       complex x(*)
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c
 
@@ -6362,14 +6362,14 @@ c
       implicit none
       integer n, incx
       real x(*)
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c
 
 c
 c****************************************************************************
 C     This simple version of MGS is faster on Pentium machines.
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c
 
@@ -6378,7 +6378,7 @@ c     DGETU0: Attempt to generate a pseudo-random vector in SPAN(Op(A))
 c     orthogonal to span(U(:,1:j)), where Op(A) = A if transa='n' and
 c     Op(A) = A^H if transa='c'.
 c
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c
 
@@ -6387,7 +6387,7 @@ c     DGETU0: Attempt to generate a pseudo-random vector in SPAN(Op(A))
 c     orthogonal to span(U(:,1:j)), where Op(A) = A if transa='n' and
 c     Op(A) = A^T if transa='t'.
 c
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c
 
@@ -6396,17 +6396,17 @@ c     SGETU0: Attempt to generate a pseudo-random vector in SPAN(Op(A))
 c     orthogonal to span(U(:,1:j)), where Op(A) = A if transa='n' and
 c     Op(A) = A^T if transa='t'.
 c
-
+
 	(C) Rasmus Munk Larsen, Stanford University, 2004
 c     
 
-
+
 	(C) Rasmus Munk Larsen, Stanford University, March 2004.
-
+
 	(C) Rasmus Munk Larsen, Stanford, 1999, 2004
 c
 
-
+
 	(c) test for convergence
 
     trlib_int_t *leftmost_timing = NULL;
@@ -6432,7 +6432,7 @@ c
     trlib_int_t *type_last_head = iwork+13;
     trlib_int_t *nirblk = iwork + 15;
     trlib_int_t *irblk = iwork+16;
-
+
 	(c) the ring consists of at most two distinct points
         // (d) the ring is not topologically closed
         // (e) the ring has spikes
@@ -6443,90 +6443,90 @@ c
         // Note: no need to check if the area is zero. If this is the
         // case, then the ring must have at least two spikes, which is
         // checked by condition (d).
-
+
 	(c)" (ambiguity resolution)
                                                 {
                                                     is >> ch;                                    // get the next lexeme
-
+
 	(c)" (ambiguity resolution)
                                         {
                                             is >> ch;                                    // get the next lexeme
-
+
 	(c)" (ambiguity resolution)
                                 {
                                     is >> ch;                                    // get the next lexeme
-
+
 	(c)(boost::forward<K2>(k));
     }
-
+
 	(c)(boost::forward<V2>(v));
     }
-
+
 	(C)* BOOST_CONTRACT_DETAIL_NAME1(obj) \
             BOOST_CONTRACT_DETAIL_TVARIADIC_COMMA(arity) \
             BOOST_CONTRACT_DETAIL_TVARIADIC_FPARAMS_Z(z, arity, \
                 BOOST_CONTRACT_DETAIL_NAME1(Args), \
                 &, \
                 BOOST_CONTRACT_DETAIL_NAME1(args) \
-
+
 	(c)*8))
 
         #define BOOST_MPL_MULTICHAR_POP_BACK(c)                                                     \
-
+
 	(c)*8))
 
         #define BOOST_MPL_MULTICHAR_PUSH_FRONT(c,i)                                                 \
-
+
 	(C)*B
  *	     options->Trans = CONJ:
-
+
 	(C)*B
  *	     Whether or not the system will be equilibrated depends on the
  *	     scaling of the matrix A, but if equilibration is used, A is
-
+
 	(C)*B
  *	     Whether or not the system will be equilibrated depends on the
  *	     scaling of the matrix A, but if equilibration is used, A' is
-
+
 	(C)*B
  *           options->Trans = CONJ:
-
+
 	(C)*B
  *           Whether or not the system will be equilibrated depends on the
  *           scaling of the matrix A, but if equilibration is used, A is
-
+
 	(C)*B
  *           Whether or not the system will be equilibrated depends on the
  *           scaling of the matrix A, but if equilibration is used, A' is
-
+
 	(C)*B (if options->Trans
  *	     = TRANS or CONJ).
  *
  *	1.2. Permute columns of A, forming A*Pc, where Pc is a permutation
  *	     matrix that usually preserves sparsity.
  *	     For more details of this step, see sp_preorder.c.
-
+
 	(C)*B (if options->Trans
  *           = TRANS or CONJ).
  *
  *      1.2. Permute columns of A, forming A*Pc, where Pc is a permutation
  *           matrix that usually preserves sparsity.
  *           For more details of this step, see sp_preorder.c.
-
+
 	(C)*B (if trans =
  *
  *	2.2. Permute columns of transpose(A) (rows of A),
  *	     forming transpose(A)*Pc, where Pc is a permutation matrix that
  *	     usually preserves sparsity.
  *	     For more details of this step, see sp_preorder.c.
-
+
 	(C)*B (if trans =
  *
  *      2.2. Permute columns of transpose(A) (rows of A),
  *           forming transpose(A)*Pc, where Pc is a permutation matrix that
  *           usually preserves sparsity.
  *           For more details of this step, see sp_preorder.c.
-
+
 	(C)*B;
  *		 if options->Trans = TRANS or CONJ and equed = 'R' of 'B',
  *		    B is overwritten by diag(R)*B.
@@ -6539,7 +6539,7 @@ c
  *	   system is inv(diag(C))*X if options->Trans = NOTRANS and
  *	   equed = 'C' or 'B', or inv(diag(R))*X if options->Trans = 'T' or 'C'
  *	   and equed = 'R' or 'B'.
-
+
 	(C)*B;
  *		 if options->Trans = TRANS or CONJ and equed = 'R' of 'B',
  *		    B is overwritten by diag(R)*B.
@@ -6552,7 +6552,7 @@ c
  *	   system is inv(diag(C))*X if options->Trans = NOTRANS and
  *	   equed = 'C' or 'B', or inv(diag(R))*X if options->Trans = 'T' or 'C'
  *	   and equed = 'R' or 'B'.
-
+
 	(C)*B;
  *		 if options->Trans = TRANS or CONJ and equed = 'R' of 'B',
  *		    B is overwritten by diag(R)*B.
@@ -6565,7 +6565,7 @@ c
  *	   system is inv(diag(C))*X if options->Trans = NOTRANS and
  *	   equed = 'C' or 'B', or inv(diag(R))*X if options->Trans = 'T' or 'C'
  *	   and equed = 'R' or 'B'.
-
+
 	(C)*B;
  *		 if options->Trans = TRANS or CONJ and equed = 'R' of 'B',
  *		    B is overwritten by diag(R)*B.
@@ -6578,10 +6578,10 @@ c
  *	   system is inv(diag(C))*X if options->Trans = NOTRANS and
  *	   equed = 'C' or 'B', or inv(diag(R))*X if options->Trans = 'T' or 'C'
  *	   and equed = 'R' or 'B'.
-
+
 	(C)*B;
  *	      if A->Stype = SLU_NR:
-
+
 	(C)*B;
  *               if options->Trans = TRANS or CONJ and equed = 'R' of 'B',
  *                  B is overwritten by diag(R)*B.
@@ -6594,7 +6594,7 @@ c
  *         system is inv(diag(C))*X if options->Trans = NOTRANS and
  *         equed = 'C' or 'B', or inv(diag(R))*X if options->Trans = 'T' or 'C'
  *         and equed = 'R' or 'B'.
-
+
 	(C)*B;
  *               if options->Trans = TRANS or CONJ and equed = 'R' of 'B',
  *                  B is overwritten by diag(R)*B.
@@ -6607,7 +6607,7 @@ c
  *         system is inv(diag(C))*X if options->Trans = NOTRANS and
  *         equed = 'C' or 'B', or inv(diag(R))*X if options->Trans = 'T' or 'C'
  *         and equed = 'R' or 'B'.
-
+
 	(C)*B;
  *               if options->Trans = TRANS or CONJ and equed = 'R' of 'B',
  *                  B is overwritten by diag(R)*B.
@@ -6620,7 +6620,7 @@ c
  *         system is inv(diag(C))*X if options->Trans = NOTRANS and
  *         equed = 'C' or 'B', or inv(diag(R))*X if options->Trans = 'T' or 'C'
  *         and equed = 'R' or 'B'.
-
+
 	(C)*B;
  *               if options->Trans = TRANS or CONJ and equed = 'R' of 'B',
  *                  B is overwritten by diag(R)*B.
@@ -6633,10 +6633,10 @@ c
  *         system is inv(diag(C))*X if options->Trans = NOTRANS and
  *         equed = 'C' or 'B', or inv(diag(R))*X if options->Trans = 'T' or 'C'
  *         and equed = 'R' or 'B'.
-
+
 	(C)*B;
  *            if A->Stype = SLU_NR:
-
+
 	(C)*EPS) GO TO 15
 10         CONTINUE
 15         S=XA*T/3.0D0
@@ -6690,58 +6690,58 @@ c
         END
 
 C       **********************************
-
+
 	(c)*high
 
     The iteration continues with the updated sample until no
     elements are outside the (updated) range.
-
+
 	(c)*low
-
+
 	(c)*pow((x), ((c)-1.)) )
 #define TI(c,x)  ( pow(-(x), 1./(c)) )
-
+
 	(c)*R::num/R::den)
     );
-
+
 	(c)*sc.expn(1, c)
 
-
+
 	(c)/((c)
-
+
 	(c)/((c)
 
 /* logarithm of inverse transformation */
 #define logTI(c,x)  ( -log(-(x)) / (c) )
-
+
 	(c)<<8)
 
         #define BOOST_MPL_MULTICHAR_POP_BACK(c)                                                     \
           (((1<<((BOOST_MPL_MULTICHAR_LENGTH(c)-1)*8))-1)&(unsigned)(c))
-
+
 	(c)<<8)
 
         #define BOOST_MPL_MULTICHAR_PUSH_FRONT(c,i)                                                 \
-
+
 	(C)> const
 }
-
+
 	(c)>( BOOST_PP_CAT(mpl_assert_arg,counter)::assert_arg() ) \
         ) \
-
+
 	(c)>>(8
 
         #define BOOST_MPL_MULTICHAR_PUSH_BACK(c,i)                                                  \
-
+
 	(c)>>8)
 
         #define BOOST_MPL_MULTICHAR_POP_FRONT(c)                                                    \
           (((1<<((BOOST_MPL_MULTICHAR_LENGTH(c)-1)*8))-1)&(unsigned)(c))
-
+
 	(c)>>8)
 
     #else
-
+
 	(c)?c:null,l(d)
 function Ea(a,b,c,d,e){if(a instanceof E||8==a.b||c&&null===a.b){var f=b.all;if(!f)return e;a=Ga(a);if("*"!=a&&(f=b.getElementsByTagName(a),!f))return e;if(c){for(var g=[],h=0;b=f[h++];)A(b,c,d)&&g.push(b);f=g}for(h=0;b=f[h++];)"*"==a&&"!"==b.tagName||F(e,b);return e}Ha(a,b,c,d,e);return e}
 function Fa(a,b,c,d,e){b.getElementsByName&&d&&"name"==c&&!v?(b=b.getElementsByName(d),r(b,function(b){a.a(b)&&F(e,b)})):b.getElementsByClassName&&d&&"class"==c?(b=b.getElementsByClassName(d),r(b,function(b){b.className==d&&a.a(b)&&F(e,b)})):a instanceof G?Ha(a,b,c,d,e):b.getElementsByTagName&&(b=b.getElementsByTagName(a.f()),r(b,function(a){A(a,c,d)&&F(e,a)}));return e}
@@ -6770,7 +6770,7 @@ sb.prototype.toString=function(){return t(this.a,function(a,b){return a+J(b)},"P
 U.prototype.a=function(a){var b=a.a,c=null,c=this.f,d=null,e=null,f=0;c&&(d=c.name,e=c.s?L(c.s,a):null,f=1);if(this.u)if(this.g||this.c!=tb)if(a=H((new U(ub,new G("node"))).a(a)),b=I(a))for(c=this.m(b,d,e,f);null!=(b=I(a));)c=Pa(c,this.m(b,d,e,f));else c=new C;else c=B(this.o,b,d,e),c=$a(this.h,c,f);else c=this.m(a.a,d,e,f);return c};U.prototype.m=function(a,b,c,d){a=this.c.f(this.o,a,b,c);return a=$a(this.h,a,d)};
 U.prototype.toString=function(){var a;a="Step:"+J("Operator: "+(this.u?"//":"/"));this.c.j&&(a+=J("Axis: "+this.c));a+=J(this.o);if(this.h.a.length){var b=t(this.h.a,function(a,b){return a+J(b)},"Predicates:");a+=J(b)}return a};function vb(a,b,c,d){this.j=a;this.f=b;this.a=c;this.b=d}vb.prototype.toString=function(){return this.j};var wb={};function V(a,b,c,d){if(wb.hasOwnProperty(a))throw Error("Axis already created: "+a);b=new vb(a,b,c,!!d);return wb[a]=b}
 V("ancestor",function(a,b){for(var c=new C,d=b;d=d.parentNode;)a.a(d)&&Qa(c,d);return c},!0);V("ancestor-or-self",function(a,b){var c=new C,d=b;do a.a(d)&&Qa(c,d);while(d=d.parentNode);return c},!0);
-
+
 	(c)?c:null,l(d)
 var ub=V("descendant-or-self",function(a,b,c,d){var e=new C;A(b,c,d)&&a.a(b)&&F(e,b);return B(a,b,c,d,e)},!1,!0),pb=V("following",function(a,b,c,d){var e=new C;do for(var f=b;f=f.nextSibling;)A(f,c,d)&&a.a(f)&&F(e,f),e=B(a,f,c,d,e);while(b=b.parentNode);return e},!1,!0);V("following-sibling",function(a,b){for(var c=new C,d=b;d=d.nextSibling;)a.a(d)&&F(c,d);return c},!1);V("namespace",function(){return new C},!1);
 var xb=V("parent",function(a,b){var c=new C;if(9==b.nodeType)return c;if(2==b.nodeType)return F(c,b.ownerElement),c;var d=b.parentNode;a.a(d)&&F(c,d);return c},!1),qb=V("preceding",function(a,b,c,d){var e=new C,f=[];do f.unshift(b);while(b=b.parentNode);for(var g=1,h=f.length;g<h;g++){var p=[];for(b=f[g];b=b.previousSibling;)p.unshift(b);for(var y=0,D=p.length;y<D;y++)b=p[y],A(b,c,d)&&a.a(b)&&F(e,b),e=B(a,b,c,d,e)}return e},!0,!0);
@@ -6784,25 +6784,25 @@ new U(f,c,e,"//"==b)}function Jb(a){for(var b=[];"["==S(a.a);){T(a.a);W(a,"Missi
 function Y(a,b){if(0==b)if(a instanceof C)b=4;else if("string"==typeof a)b=2;else if("number"==typeof a)b=1;else if("boolean"==typeof a)b=3;else throw Error("Unexpected evaluation result.");if(2!=b&&1!=b&&3!=b&&!(a instanceof C))throw Error("value could not be converted to the specified type");this.resultType=b;var c;switch(b){case 2:this.stringValue=a instanceof C?Sa(a):""+a;break;case 1:this.numberValue=a instanceof C?+Sa(a):+a;break;case 3:this.booleanValue=a instanceof C?0<a.l:!!a;break;case 4:case 5:case 6:case 7:var d=
 H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLength=a.l;this.invalidIteratorState=!1;break;case 8:case 9:d=Ra(a);this.singleNodeValue=d instanceof x?d.a:d;break;default:throw Error("Unknown XPathResult type.");}var f=0;this.iterateNext=function(){if(4!=b&&5!=b)throw Error("iterateNext called with wrong result type");return f>=c.length?null:c[f++]};this.snapshotItem=function(a){if(6!=b&&7!=b)throw Error("snapshotItem called with wrong result type");return a>=c.length||
 0>a?null:c[a]}}Y.ANY_TYPE=0;Y.NUMBER_TYPE=1;Y.STRING_TYPE=2;Y.BOOLEAN_TYPE=3;Y.UNORDERED_NODE_ITERATOR_TYPE=4;Y.ORDERED_NODE_ITERATOR_TYPE=5;Y.UNORDERED_NODE_SNAPSHOT_TYPE=6;Y.ORDERED_NODE_SNAPSHOT_TYPE=7;Y.ANY_UNORDERED_NODE_TYPE=8;Y.FIRST_ORDERED_NODE_TYPE=9;function Ob(a){this.lookupNamespaceURI=Kb(a)}
-
+
 	(c)` is assumed.
 
     Parameters
-
+
 	(C)` to respect the signature of
-
+
 	(c)`` is
     assumed.
 
     Parameters
-
+
 	(c)`` is assumed.
         r[0] is ignored; the last row of the returned matrix is
         ``[c[-1], r[1:]]``. Whatever the actual shape of `r`, it will be
         converted to a 1-D array.
 
     Returns
-
+
 	(c)`` is assumed;
         in this case, if c[0] is real, the result is a Hermitian matrix.
         r[0] is ignored; the first row of the returned matrix is
@@ -6810,7 +6810,7 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
         converted to a 1-D array.
 
     Returns
-
+
 	(c)`` is assumed; in this case, if c
         real, the Toeplitz matrix is Hermitian. r[0] is ignored; the first row
         of the Toeplitz matrix is ``[c[0], r[1:]]``. Whatever the actual shape
@@ -6828,7 +6828,7 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
         If True (default), this verifies that the Toeplitz matrix is square.
 
     Returns
-
+
 	(c)`` is assumed; in this case, if c
         real, the Toeplitz matrix is Hermitian. r[0] is ignored; the first row
         of the Toeplitz matrix is ``[c[0], r[1:]]``. Whatever the actual shape
@@ -6841,7 +6841,7 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
         (result entirely NaNs) if the inputs do contain infinities or NaNs.
 
     Returns
-
+
 	(c)`` is assumed; in this case, if c
         real, the Toeplitz matrix is Hermitian. r[0] is ignored; the first row
         of the Toeplitz matrix is ``[c[0], r[1:]]``. Whatever the actual shape
@@ -6858,7 +6858,7 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
         ``os.cpu_count()``. See scipy.fft.fft for more details.
 
     Returns
-
+
 	(c)`` or two items
         ``c`` which are assumed to be a starting interval for a downhill
         bracket search (see `bracket`); it doesn't always mean that the
@@ -6871,7 +6871,7 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
     method : str or callable, optional
         Type of solver.  Should be one of:
 
-
+
 	copy right boundary of domain
 	iv_new->ip = iv->x;
 	iv_new->fip = iv->fx;
@@ -6884,7 +6884,7 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
       else
 	/* nothing to do any more */
 	break;
-
+
 	Copyright
  *
  * I hereby release this code into the PUBLIC DOMAIN AS IS. There is no
@@ -6893,117 +6893,117 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
  *
  * Robert Kern
  * kern@caltech.edu
-
+
 	copyright  Boost Software License, version 1.0
 
     Contains the declarations (and definitions) of various kinds of CRC
     computation functions, function object types, and encapsulated policy types.
-
+
 	Copyright  Paul A. Bristow 2007, 2009, 2010, 2012.
-
+
 	Copyright  Paul A. Bristow 2007, 2012.
-
+
 	Copyright  Paul A. Bristow 2007.
-
+
 	Copyright (2) Beman Dawes 2010, 2011
-
+
 	Copyright (3) Ion Gaztanaga 2013
 //
-
+
 	Copyright (arg) 2001-2014 Joel de Guzman
-
+
 	Copyright (c)      2010 Bryce Lelbach
-
+
 	Copyright (c)      2011 Bryce Lelbach
-
+
 	Copyright (c)      2011 Thomas Heller
-
+
 	Copyright (c)  2000 David Abrahams.
-
+
 	Copyright (C)  Tyler Reddy, Ross Hemsley, Edd Edmondson,
-
+
 	Copyright (c) 1992-2013 The University of Tennessee and The University
                           of Tennessee Research Foundation.  All rights
                           reserved.
-
+
 	Copyright (c) 1993-2019
                     
                             C.B. Barber
                            Arlington, MA 
-
+
 	Copyright (c) 1993-2019 C.B. Barber.
    $Id: //main/2019/qhull/src/libqhull_r/merge_r.c#12 $$Change: 2712 $
    $DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 C.B. Barber.
    $Id: //main/2019/qhull/src/libqhull_r/merge_r.h#1 $$Change: 2661 $
    $DateTime: 2019/05/24 20:09:58 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/geom2_r.c#15 $$Change: 2712 $
    $DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
 
    frequently used code goes into geom_r.c
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/geom_r.c#4 $$Change: 2712 $
    $DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
 
    infrequent code goes into geom2_r.c
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/geom_r.h#1 $$Change: 2661 $
    $DateTime: 2019/05/24 20:09:58 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/global_r.c#12 $$Change: 2712 $
    $DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
  */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/io_r.c#7 $$Change: 2683 $
    $DateTime: 2019/06/14 16:05:16 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/io_r.h#2 $$Change: 2671 $
    $DateTime: 2019/06/06 11:24:01 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/libqhull_r.c#16 $$Change: 2712 $
    $DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/libqhull_r.h#13 $$Change: 2714 $
    $DateTime: 2019/06/28 16:16:13 $$Author: bbarber $
 
    includes function prototypes for libqhull_r.c, geom_r.c, global_r.c, io_r.c, user_r.c
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/mem_r.h#5 $$Change: 2698 $
    $DateTime: 2019/06/24 14:52:34 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/poly2_r.c#18 $$Change: 2712 $
    $DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/poly_r.c#7 $$Change: 2705 $
    $DateTime: 2019/06/26 16:34:45 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/poly_r.h#3 $$Change: 2701 $
    $DateTime: 2019/06/25 15:24:47 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/qhull_ra.h#1 $$Change: 2661 $
    $DateTime: 2019/05/24 20:09:58 $$Author: bbarber $
@@ -7011,38 +7011,38 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
    Notes:  grep for ((" and (" to catch fprintf("lkasdjf");
            full parens around (x?y:z)
            use '#include "libqhull_r/qhull_ra.h"' to avoid name clashes
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/qset_r.c#7 $$Change: 2711 $
    $DateTime: 2019/06/27 22:34:56 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/qset_r.h#3 $$Change: 2700 $
    $DateTime: 2019/06/25 05:52:18 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/random_r.h#2 $$Change: 2666 $
    $DateTime: 2019/05/30 10:11:25 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/stat_r.c#7 $$Change: 2712 $
    $DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
    $Id: //main/2019/qhull/src/libqhull_r/stat_r.h#3 $$Change: 2711 $
    $DateTime: 2019/06/27 22:34:56 $$Author: bbarber $
 
    recompile qhull if you change this file
-
+
 	Copyright (c) 1993-2019 The Geometry Center.
   $Id: //main/2019/qhull/src/libqhull_r/mem_r.c#6 $$Change: 2711 $
   $DateTime: 2019/06/27 22:34:56 $$Author: bbarber $
 */
-
+
 	Copyright (c) 1994
  * Hewlett-Packard Company
  *
@@ -7053,7 +7053,7 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
  * in supporting documentation.  Hewlett-Packard Company makes no
  * representations about the suitability of this software for any
  * purpose.  It is provided "as is" without express or implied warranty.
-
+
 	Copyright (c) 1994
 // Hewlett-Packard Company
 //
@@ -7064,44 +7064,44 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
 // in supporting documentation.  Hewlett-Packard Company makes no
 // representations about the suitability of this software for any
 // purpose.  It is provided "as is" without express or implied warranty.
-
+
 	Copyright (c) 1994 by Xerox Corporation.  All rights reserved.
  *
  * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY
  * EXPRESSED OR IMPLIED.  ANY USE IS AT YOUR OWN RISK.
-
+
 	Copyright (c) 1995 Maarten Hilferink, Amsterdam, the Netherlands
 
 // This file was modified by Oracle on 2015-2020.
-
+
 	Copyright (c) 1995, 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 1995, Gerald Evenden
-
+
 	copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
+
 	copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2013-2020.
-
+
 	copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2016-2020.
-
+
 	copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2018-2020.
-
+
 	copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2018.
-
+
 	Copyright (C) 1995-2013 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.
-
+
 	Copyright (c) 1996
  * Silicon Graphics Computer Systems, Inc.
  *
@@ -7112,7 +7112,7 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
  * in supporting documentation.  Silicon Graphics makes no
  * representations about the suitability of this software for any
  * purpose.  It is provided "as is" without express or implied warranty.
-
+
 	Copyright (c) 1996
 // Silicon Graphics Computer Systems, Inc.
 //
@@ -7123,14 +7123,14 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
 // in supporting documentation.  Silicon Graphics makes no
 // representations about the suitability of this software for any
 // purpose.  It is provided "as is" without express or implied warranty.
-
+
 	Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough
-
+
 	Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough
  *                                                                           *
  *   adapted by Wolfgang Hoermann and Josef Leydold                          *
  *   Department of Statistics and Mathematics, WU Wien, Austria              *
-
+
 	Copyright (c) 1996,1997
  * Silicon Graphics Computer Systems, Inc.
  *
@@ -7141,7 +7141,7 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
  * in supporting documentation.  Silicon Graphics makes no
  * representations about the suitability of this software for any
  * purpose.  It is provided "as is" without express or implied warranty.
-
+
 	Copyright (c) 1996-1998
 // Silicon Graphics Computer Systems, Inc.
 //
@@ -7152,15 +7152,15 @@ H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLeng
 // in supporting documentation.  Silicon Graphics makes no
 // representations about the suitability of this software for any
 // purpose.  It is provided "as is" without express or implied warranty.
-
+
 	Copyright (c) 1996-2008 Rice University.
-
+
 	Copyright (c) 1996-2008 Rice University.
 Developed by D.C. Sorensen, R.B. Lehoucq, C. Yang, and K. Maschhoff.
 All rights reserved.
 
 Arpack has been renamed to arpack-ng.
-
+
 	Copyright (c) 1998
  * Silicon Graphics Computer Systems, Inc.
  *
@@ -7171,147 +7171,147 @@ Arpack has been renamed to arpack-ng.
  * in supporting documentation.  Silicon Graphics makes no
  * representations about the suitability of this software for any
  * purpose.  It is provided "as is" without express or implied warranty.
-
+
 	Copyright (c) 1998-2000
-
+
 	Copyright (c) 1998-2000 Theodore C. Belding
      /*    University of Michigan Center for the Study of Complex Systems    */
      /*    Ted.Belding@umich.edu)                                            */
      /*----------------------------------------------------------------------*/
-
+
 	Copyright (c) 1998-2002
-
+
 	Copyright (c) 1998-2002 Joel de Guzman
-
+
 	Copyright (c) 1998-2003 by the University of Florida.
 	All Rights Reserved.
 
 	THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY
 	EXPRESSED OR IMPLIED.  ANY USE IS AT YOUR OWN RISK.
-
+
 	Copyright (c) 1998-2003 Joel de Guzman
-
+
 	Copyright (c) 1998-2004 John Maddock
-
+
 	Copyright (c) 1998-2005
-
+
 	Copyright (c) 1998-2008 Joel de Guzman
-
+
 	Copyright (c) 1998-2009
-
+
 	Copyright (c) 1998-2009 John Maddock
-
+
 	Copyright (C) 1999, 2000 Jaakko Jarvi (jaakko.jarvi@cs.utu.fi)
-
+
 	Copyright (c) 1999, 2000, 2001 North Carolina State University
-
+
 	Copyright (C) 1999-2001 Jaakko Jarvi (jaakko.jarvi@cs.utu.fi)
-
+
 	Copyright (c) 1999-2003 Jaakko Jarvi
-
+
 	Copyright (c) 1999-2003 Jeremiah Willcock
-
+
 	Copyright (c) 1999-2006: Cortex Software GmbH, Kantstrasse 57, Berlin
-
+
 	Copyright (c) 2000 Cadenza New Zealand Ltd
-
+
 	Copyright (C) 2000 Gary Powell (gary.powell@sierra.com)
-
+
 	Copyright (C) 2000 Gary Powell (gwpowell@hotmail.com)
-
+
 	Copyright (C) 2000 Gary Powell (powellg@amazon.com)
-
+
 	Copyright (C) 2000 Stephen Cleary
-
+
 	Copyright (C) 2000, 2001 Stephen Cleary
-
+
 	Copyright (c) 2000, Frank Warmerdam
-
+
 	Copyright (c) 2000-2002
-
+
 	Copyright (c) 2000-2003 Brian McNamara and Yannis Smaragdakis
-
+
 	Copyright (c) 2000-2004
-
+
 	Copyright (c) 2000-2006 Wolfgang Hoermann and Josef Leydold
  *   Dept. for Statistics, University of Economics, Vienna, Austria          *
  *                                                                           *
-
+
 	Copyright (c) 2000-2006, 2010 Wolfgang Hoermann and Josef Leydold
  *   Department of Statistics and Mathematics, WU Wien, Austria              *
  *                                                                           *
-
+
 	Copyright (c) 2000-2007
-
+
 	Copyright (c) 2000-2009
-
+
 	Copyright (c) 2000-2010
-
+
 	Copyright (c) 2000-2010
 //  Joerg Walter, Mathias Koch, David Bellot
-
+
 	Copyright (c) 2000-2010
 //  Joerg Walter, Mathias Koch, Gunter Winkler, David Bellot
-
+
 	Copyright (c) 2000-2010  Wolfgang Hoermann and Josef Leydold
  *   Department of Statistics and Mathematics, WU Wien, Austria              *
  *                                                                           *
-
+
 	Copyright (c) 2000-2011 Joerg Walter, Mathias Koch, David Bellot
-
+
 	Copyright (c) 2000-2013
-
+
 	Copyright (c) 2000-2013 The University of California Berkeley. All
                           rights reserved.
-
+
 	Copyright (c) 2000-2022 Wolfgang Hoermann and Josef Leydold
-
+
 	Copyright (C) 2001
-
+
 	Copyright (c) 2001 Alexander Peslyak and it is hereby released to the
  * general public under the following terms:
  *
  * Redistribution and use in source and binary forms, with or without
-
+
 	Copyright (c) 2001 Bruce Florman
-
+
 	Copyright (c) 2001 by Andrei Alexandrescu. Distributed under the Boost
-
+
 	Copyright (c) 2001 Daniel C. Nuffer
-
+
 	Copyright (c) 2001 Daniel C. Nuffer.
-
+
 	Copyright (c) 2001 Daniel Nuffer
-
+
 	Copyright (c) 2001 Darin Adler
-
+
 	Copyright (C) 2001 Daryle Walker.
-
+
 	Copyright (c) 2001 David Abrahams
-
+
 	Copyright (C) 2001 Dietmar Kuehl
-
+
 	Copyright (c) 2001 Doug Gregor
-
+
 	Copyright (C) 2001 Gary Powell (gary.powell@sierra.com)
-
+
 	Copyright (C) 2001 Jaakko Jarvi (jaakko.jarvi@cs.utu.fi)
-
+
 	Copyright (C) 2001 Jeremy Siek <jsiek@cs.indiana.edu>
-
+
 	Copyright (C) 2001 Jeremy Siek, Douglas Gregor, Brian Osman
-
+
 	Copyright (c) 2001 Peter Dimov
-
+
 	Copyright (C) 2001 Peter Dimov
 
 # include <boost/config.hpp>
 # include <boost/mpl/bool.hpp>
-
+
 	Copyright (c) 2001 Peter Dimov and Multi Media Ltd.
-
+
 	Copyright (c) 2001 Ronald Garcia, Indiana University (garcia@osl.iu.edu)
-
+
 	Copyright (c) 2001 Ronald Garcia, Indiana University (garcia@osl.iu.edu)
 // Andrew Lumsdaine, Indiana University (lums@osl.iu.edu). Permission to copy, 
 // use, modify, sell and distribute this software is granted provided this
@@ -7321,44 +7321,44 @@ Arpack has been renamed to arpack-ng.
 
 #ifndef BOOST_PROGRAM_OPTIONS_UTF8_CODECVT_FACET_HPP
 #define BOOST_PROGRAM_OPTIONS_UTF8_CODECVT_FACET_HPP
-
+
 	Copyright (C) 2001 Vladimir Prus <ghost@cs.msu.su>
-
+
 	Copyright (c) 2001, 2002 Enthought, Inc.
 #
 # All rights reserved.
-
+
 	Copyright (c) 2001, 2002 Peter Dimov
-
+
 	Copyright (C) 2001, 2002 Peter Dimov
-
+
 	Copyright (c) 2001, 2002 Peter Dimov and Multi Media Ltd.
-
+
 	Copyright (c) 2001, 2002 Python Software Foundation; All Rights
-
+
 	Copyright (c) 2001, 2002, 2003 Peter Dimov
-
+
 	Copyright (c) 2001, 2002, 2003 Peter Dimov and Multi Media Ltd.
-
+
 	Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021 Python Software Foundation;
 All Rights Reserved
 */
-
+
 	Copyright (c) 2001, 2002, 2012 Peter Dimov
-
+
 	Copyright (c) 2001, Daniel C. Nuffer
-
+
 	Copyright (c) 2001, Daniel C. Nuffer
 
     This software is provided 'as-is', without any express or implied
     warranty. In no event will the copyright holder be held liable for
     any damages arising from the use of this software.
-
+
 	Copyright (c) 2001, Thomas Flemming, tf@ttqv.com
-
+
 	Copyright (c) 2001-2002 Chuck Allison and Jeremy Siek
-
+
 	Copyright (c) 2001-2002 Enthought, Inc. 2003-2022, SciPy Developers.
 All rights reserved.
 
@@ -7378,16 +7378,16 @@ are met:
    contributors may be used to endorse or promote products derived
    from this software without specific prior written permission.
 
-
+
 	Copyright (c) 2001-2002 Joel de Guzman
-
+
 	Copyright (C) 2001-2002 Joel de Guzman
-
+
 	Copyright (C) 2001-2003
-
+
 	Copyright (C) 2001-2003
 // William E. Kempf
-
+
 	Copyright (C) 2001-2003
 // William E. Kempf
 //
@@ -7398,270 +7398,270 @@ are met:
 // in supporting documentation.  William E. Kempf makes no representations
 // about the suitability of this software for any purpose.
 // It is provided "as is" without express or implied warranty.
-
+
 	Copyright (c) 2001-2003 Daniel Nuffer
-
+
 	Copyright (c) 2001-2003 Hartmut Kaiser
-
+
 	Copyright (c) 2001-2003 Joel de Guzman
-
+
 	Copyright (c) 2001-2003 John Maddock
-
+
 	Copyright (c) 2001-2004 Peter Dimov and Multi Media Ltd.
-
+
 	Copyright (c) 2001-2005 Peter Dimov
-
+
 	Copyright (c) 2001-2007 Hartmut Kaiser
-
+
 	Copyright (c) 2001-2007 Joel de Guzman
-
+
 	Copyright (c) 2001-2008 Hartmut Kaiser
-
+
 	Copyright (c) 2001-2008 Joel de Guzman
-
+
 	Copyright (c) 2001-2008 Peter Dimov
-
+
 	Copyright (c) 2001-2009 Daniel Nuffer
-
+
 	Copyright (c) 2001-2009 Joel de Guzman
-
+
 	Copyright (c) 2001-2009, 2012 Peter Dimov
-
+
 	Copyright (c) 2001-2009, Hartmut Kaiser
-
+
 	Copyright (c) 2001-2010 Hartmut Kaiser
-
+
 	Copyright (c) 2001-2010 Joel de Guzman
-
+
 	Copyright (c) 2001-2011 - Scilab Enterprises
 Updated by Allan Cornet, Sylvestre Ledru.
 
-
+
 	Copyright (c) 2001-2011 Hartmut Kaiser
-
+
 	Copyright (c) 2001-2011 Hartmut Kaiser.
-
+
 	Copyright (c) 2001-2011 Joel de Guzman
-
+
 	Copyright (c) 2001-2011 Thomas Bernard
-
+
 	Copyright (c) 2001-2012 Hartmut Kaiser
-
+
 	Copyright (c) 2001-2012 Hartmut Kaiser.
-
+
 	Copyright (c) 2001-2012 Hartmut Kaiser. Distributed under the Boost
-
+
 	Copyright (c) 2001-2012 Joel de Guzman
-
+
 	Copyright (c) 2001-2013 Hartmut Kaiser
-
+
 	Copyright (c) 2001-2013 Hartmut Kaiser.
-
+
 	Copyright (c) 2001-2013 Joel de Guzman
-
+
 	Copyright (c) 2001-2014 Joel de Guzman
-
+
 	Copyright (c) 2001-2015 Joel de Guzman
-
+
 	Copyright (c) 2001-2019 Joel de Guzman
-
+
 	Copyright (c) 2002
-
+
 	Copyright (C) 2002 Beman Dawes
-
+
 	Copyright (c) 2002 Bill Kempf
-
+
 	Copyright (C) 2002 Brad King (brad.king@kitware.com)
                    Douglas Gregor (gregod@cs.rpi.edu)
 
-
+
 	Copyright (C) 2002 Brad King and Douglas Gregor
-
+
 	Copyright (c) 2002 by Andrei Alexandrescu
-
+
 	Copyright (C) 2002 David Abrahams
-
+
 	Copyright (C) 2002 David Abrahams
 //
-
+
 	Copyright (c) 2002 Eric Friedman, Itay Maman
-
+
 	Copyright (C) 2002 Gary Powell (gwpowell@hotmail.com)
-
+
 	Copyright (c) 2002 Hartmut Kaiser
-
+
 	Copyright (C) 2002 Jaakko Jarvi (jaakko.jarvi@cs.utu.fi)
-
+
 	Copyright (c) 2002 Jeff Westfahl
-
+
 	Copyright (c) 2002 Jens Maurer
-
+
 	Copyright (c) 2002 Joel de Guzman
-
+
 	Copyright (c) 2002 Juan Carlos Arevalo-Baeza
-
+
 	Copyright (c) 2002 Lars Gullik Bj
-
+
 	Copyright (c) 2002 Peter Dimov
-
+
 	Copyright (c) 2002 Peter Dimov and Multi Media Ltd.
-
+
 	Copyright (c) 2002 Raghavendra Satish
-
+
 	Copyright (c) 2002 Travis Oliphant all rights reserved
-
+
 	Copyright (c) 2002, 2003 Peter Dimov
-
+
 	Copyright (c) 2002, 2003 Peter Dimov and Multi Media Ltd.
-
+
 	Copyright (C) 2002, 2008, 2013 Peter Dimov
 
-
+
 	Copyright (c) 2002, 2009, 2014 Peter Dimov
-
+
 	Copyright (c) 2002, 2018, 2019 Peter Dimov
-
+
 	Copyright (c) 2002, Frank Warmerdam
-
+
 	Copyright (c) 2002,2003 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2002,2003, 2007 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2002,2003, 2020 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2002,2003,2005 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2002,2003,2005,2020 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2002,2003,2020 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2002-2003
-
+
 	Copyright (C) 2002-2003
 // David Moore, William E. Kempf
-
+
 	Copyright (c) 2002-2003 David Abrahams
-
+
 	Copyright (c) 2002-2003 Eric Friedman
-
+
 	Copyright (c) 2002-2003 Eric Friedman, Itay Maman
-
+
 	Copyright (c) 2002-2003 Hartmut Kaiser
-
+
 	Copyright (c) 2002-2003 Joel de Guzman
-
+
 	Copyright (c) 2002-2003 Juan Carlos Arevalo-Baeza
-
+
 	Copyright (c) 2002-2003 Martin Wille
-
+
 	Copyright (c) 2002-2003,2005 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2002-2004 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2002-2005 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2002-2005, Jean-Sebastien Roy (js@jeannot.org)
-
+
 	Copyright (c) 2002-2006 Hartmut Kaiser
-
+
 	Copyright (C) 2002-2006 Marcin Kalicinski
-
+
 	Copyright (C) 2002-2007 Marcin Kalicinski
-
+
 	Copyright (C) 2002-2017 Free Software Foundation, Inc.
-
+
 	Copyright (c) 2002-2020 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2003
-
+
 	Copyright (c) 2003
 // Eric Friedman
 //
-
+
 	Copyright (c) 2003   Gerald I. Evenden
-
+
 	Copyright (c) 2003 Daniel Frey
-
+
 	Copyright (c) 2003 David Abrahams
-
+
 	Copyright (c) 2003 Eric Friedman
-
+
 	Copyright (c) 2003 Eric Friedman, Itay Maman
-
+
 	Copyright (c) 2003 Gennaro Prota
-
+
 	Copyright (C) 2003 Gennaro Prota.
-
+
 	Copyright (c) 2003 Giovanni Bajo
-
+
 	Copyright (c) 2003 Gustavo Guerra
-
+
 	Copyright (c) 2003 Hartmut Kaiser
-
+
 	Copyright (c) 2003 Howard Hinnant
-
+
 	Copyright (c) 2003 Joel de Guzman
-
+
 	Copyright (c) 2003 Jonathan de Halleux
-
+
 	Copyright (c) 2003 Jonathan de Halleux (dehalleux@pelikhan.com)
-
+
 	Copyright (c) 2003 Martin Wille
-
+
 	Copyright (c) 2003 Paul Mensonides
-
+
 	Copyright (c) 2003 Peter Dimov
-
+
 	Copyright (c) 2003 Peter Dimov  Distributed under the Boost
-
+
 	Copyright (c) 2003 Thomas Witt
-
+
 	Copyright (c) 2003 Vaclav Vesely
-
+
 	Copyright (C) 2003 Vesa Karvonen.
-
+
 	Copyright (c) 2003 Vladimir Prus.
-
+
 	Copyright (c) 2003, 2006   Gerald I. Evenden
-
+
 	Copyright (C) 2003, 2007-14 Massachusetts Institute of Technology
 
 Authors: Martin Reinecke, Peter Bell
-
+
 	Copyright (C) 2003, 2007-14 Matteo Frigo
-
+
 	Copyright (C) 2003, 2008 Fernando Luis Cacciola Carballal.
-
+
 	Copyright (C) 2003, Fernando Luis Cacciola Carballal.
-
+
 	Copyright (c) 2003, Hartmut Kaiser
-
+
 	Copyright (c) 2003, The Regents of the University of California, through
 Lawrence Berkeley National Laboratory (subject to receipt of any required
 approvals from U.S. Dept. of Energy)
 
 All rights reserved.
-
+
 	Copyright (c) 2003, The Regents of the University of California, through
 Lawrence Berkeley National Laboratory (subject to receipt of any required 
 approvals from U.S. Dept. of Energy) 
 
 All rights reserved. 
-
+
 	Copyright (c) 2003-2004 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2003-2004 Gennaro Prota
-
+
 	Copyright (C) 2003-2004 Jeremy B. Maitin-Shepard.
-
+
 	Copyright (c) 2003-2004, 2008 Gennaro Prota
-
+
 	Copyright (c) 2003-2005
-
+
 	Copyright (c) 2003-2005 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2003-2005 Peter Dimov
-
+
 	Copyright (C) 2003-2005 Peter J. Verveer
 
 Redistribution and use in source and binary forms, with or without
@@ -7676,7 +7676,7 @@ modification, are permitted provided that the following conditions are met:
    with the distribution.
 
 3. The name of the author may not be used to endorse or promote
-
+
 	Copyright (C) 2003-2005 Peter J. Verveer
  *
  * Redistribution and use in source and binary forms, with or without
@@ -7692,7 +7692,7 @@ modification, are permitted provided that the following conditions are met:
  *    with the distribution.
  *
  * 3. The name of the author may not be used to endorse or promote
-
+
 	Copyright (C) 2003-2005 Peter J. Verveer
 #
 # Redistribution and use in source and binary forms, with or without
@@ -7708,20 +7708,20 @@ modification, are permitted provided that the following conditions are met:
 #    with the distribution.
 #
 # 3. The name of the author may not be used to endorse or promote
-
+
 	Copyright (c) 2003-2006, 2008 Gennaro Prota
-
+
+	Copyright (c) 2003-2008 Jan Gaspar
+
 	Copyright (c) 2003-2008 Jan Gaspar
 
-	Copyright (c) 2003-2008 Jan Gaspar
-
-
+
 	Copyright (C) 2003-2008 Matthias Christian Schabel
-
+
 	Copyright (C) 2003-2009 Matthias Christian Schabel
-
+
 	Copyright (c) 2003-2009, The Regents of the University of California,
-
+
 	Copyright (c) 2003-2009, The Regents of the University of California,
   through Lawrence Berkeley National Laboratory (subject to receipt of
   any required approvals from U.S. Dept. of Energy) All rights reserved.
@@ -7741,105 +7741,105 @@ modification, are permitted provided that the following conditions are met:
   (3) Neither the name of the University of California, Lawrence
   Berkeley National Laboratory, U.S. Dept. of Energy nor the names
   of its contributors may be used to endorse or promote products
-
+
 	Copyright (c) 2003-2011 Christopher M. Kohlhoff (chris at kohlhoff dot com)
-
+
 	Copyright (c) 2003-2020 Christopher M. Kohlhoff (chris at kohlhoff dot com)
-
+
 	Copyright (c) 2004
-
+
 	Copyright (c) 2004   Gerald I. Evenden
-
+
 	Copyright (C) 2004  The Trustees of Indiana University.
-
+
 	Copyright (c) 2004 Angus Leeming
-
+
 	Copyright (C) 2004 Arkadiy Vertleyb
-
+
 	Copyright (c) 2004 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2004 Daniel Wallin
-
+
 	Copyright (c) 2004 David M. Cooke <cookedm@physics.mcmaster.ca>
-
+
 	Copyright (c) 2004 Hartmut Kaiser
-
+
 	Copyright (c) 2004 Joel de Guzman
-
+
 	Copyright (c) 2004 John Maddock
-
+
 	Copyright (c) 2004 Jonathan Brandmeyer
-
+
 	Copyright (c) 2004 Kristopher Beevers
-
+
 	Copyright (C) 2004 Peder Holt
-
+
 	Copyright (c) 2004 Ralf Mattethat
 //
 //  Permission to copy, use, modify, sell and distribute this software
 //  is granted provided this copyright notice appears in all copies.
 //  This software is provided "as is" without express or implied
 //  warranty, and with no claim as to its suitability for any purpose.
-
+
 	Copyright (C) 2004 The Trustees of Indiana University
-
+
 	Copyright (C) 2004 The Trustees of Indiana University.
-
+
 	Copyright (C) 2004, 2005 Arkadiy Vertleyb
-
+
 	Copyright (c) 2004-2005 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2004-2005, Jean-Sebastien Roy (js@jeannot.org)
-
+
 	Copyright (C) 2004-2006 The Trustees of Indiana University.
-
+
 	Copyright (C) 2004-2008 The Trustees of Indiana University.
-
+
 	Copyright (C) 2004-2009 The Trustees of Indiana University.
-
+
 	copyright (c) 2005
-
+
 	Copyright (c) 2005 Aaron Windsor
-
+
 	Copyright (C) 2005 Arkadiy Vertleyb
-
+
 	Copyright (C) 2005 Arkadiy Vertleyb, Peder Holt.
-
+
 	Copyright (c) 2005 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2005 Dan Marsden
-
+
 	Copyright (C) 2005 Douglas Gregor.
-
+
 	Copyright (c) 2005 Eric Niebler
-
+
 	Copyright (C) 2005 Eric Niebler
-
+
 	Copyright (C) 2005 Igor Chesnokov, mailto:ichesnokov@gmail.com (VC 6.5,VC 7.1
-
+
 	Copyright (c) 2005 Matthew Calabrese
-
+
 	Copyright (C) 2005 Peder Holt
-
+
 	Copyright (C) 2005 Peder Holt
 //
-
+
 	Copyright (c) 2005 Peter Dimov
-
+
 	Copyright (c) 2005 Peter Dimov.
-
+
 	Copyright (c) 2005 Stefan Arentz (stefan at soze dot com)
-
+
 	Copyright (c) 2005 Voipster / Indrek dot Juhani at voipster dot com
-
+
 	Copyright (C) 2005, 2006 Douglas Gregor <doug.gregor -at- gmail.com>.
-
+
 	Copyright (C) 2005, 2006 Douglas Gregor.
-
+
 	Copyright (c) 2005, 2014 Eric Niebler
-
+
 	Copyright (C) 2005, Fernando Luis Cacciola Carballal.
-
+
 	Copyright (c) 2005, Rasmus Munk Larsen, Stanford University
 All rights reserved.
 
@@ -7859,45 +7859,45 @@ met:
       contributors may be used to endorse or promote products derived
       from this software without specific prior written permission.
 
-
+
 	Copyright (C) 2005-2006 Alain Miniussi <alain.miniussi -at- oca.eu>.
-
+
 	Copyright (c) 2005-2006 Dan Marsden
-
+
 	Copyright (C) 2005-2006 Douglas Gregor <doug.gregor -at- gmail.com>
-
+
 	Copyright (C) 2005-2006 Douglas Gregor <doug.gregor -at- gmail.com>.
-
+
 	Copyright (C) 2005-2006 Douglas Gregor <doug.gregor@gmail.com>.
-
+
 	Copyright (c) 2005-2006 Joao Abecasis
-
+
 	Copyright (C) 2005-2006 The Trustees of Indiana University.
-
+
 	Copyright (c) 2005-2007 Dan Marsden
-
+
 	Copyright (C) 2005-2007 Peder Holt (VC 7.0
-
+
 	Copyright (C) 2005-2008 Daniel James.
-
+
 	Copyright (c) 2005-2008 Hartmut Kaiser
-
+
 	Copyright (C) 2005-2008 The Trustees of Indiana University.
-
+
 	Copyright (C) 2005-2009 Jongsoo Park <jongsoo.park -at- gmail.com>
-
+
 	Copyright (c) 2005-2010 Joel de Guzman
-
+
 	Copyright (C) 2005-2010 The Trustees of Indiana University.
-
+
 	Copyright (C) 2005-2011 Daniel James.
-
+
 	Copyright (c) 2005-2011 Joel de Guzman
-
+
 	Copyright (c) 2005-2012 Joel de Guzman
-
+
 	Copyright (c) 2005-2013 Joel de Guzman
-
+
 	Copyright (c) 2005-2015, Michele Simionato
 # All rights reserved.
 
@@ -7912,68 +7912,68 @@ met:
 #   the documentation and/or other materials provided with the
 #   distribution.
 
-
+
 	Copyright (C) 2005-2016 Daniel James
-
+
 	Copyright (c) 2005-2020 Christopher M. Kohlhoff (chris at kohlhoff dot com)
-
+
 	Copyright (C) 2006  Tiago de Paula Peixoto <tiago@forked.de>
-
+
 	Copyright (C) 2006 Arkadiy Vertleyb
-
+
 	Copyright (c) 2006 CrystalClear Software, Inc.
-
+
 	Copyright (c) 2006 Dan Marsden
-
+
 	Copyright (c) 2006 Daniel Wallin
-
+
 	Copyright (C) 2006 Douglas Gregor <doug.gregor -at- gmail.com>
-
+
 	Copyright (C) 2006 Douglas Gregor <doug.gregor -at- gmail.com>.
-
+
 	Copyright (c) 2006 Eric Niebler
-
+
 	Copyright (c) 2006 Joao Abecasis
-
+
 	Copyright (c) 2006 Johan Rade
-
+
 	Copyright (c) 2006 John Maddock
-
+
 	Copyright (c) 2006 Peter Dimov
-
+
 	Copyright (c) 2006 Piotr Wyderski
-
+
 	Copyright (c) 2006 Stephen Nutt
-
+
 	Copyright (C) 2006 Steven Watanabe (VC 8.0)
-
+
 	Copyright (C) 2006 The Trustees of Indiana University.
-
+
 	Copyright (c) 2006 Tobias Schwinger
-
+
 	Copyright (C) 2006 Tobias Schwinger
-
+
 	Copyright (c) 2006 Tomas Puverle
-
+
 	Copyright (C) 2006 Trustees of Indiana University
-
+
 	Copyright (c) 2006 Xiaogang Zhang
-
+
 	Copyright (c) 2006 Xiaogang Zhang, 2015 John Maddock
-
+
 	Copyright (c) 2006 Xiaogang Zhang, 2015 John Maddock.
-
+
 	Copyright (c) 2006, 2007 Julio M. Merino Vidal
-
+
 	Copyright (C) 2006, 2009 Marcin Kalicinski
-
+
 	Copyright (c) 2006, Stephan Diederich
 //
 //  This code may be used under either of the following two licences:
 //
 //    Permission is hereby granted, free of charge, to any person
 //    obtaining a copy of this software and associated documentation
-
+
 	Copyright (c) 2006, Systems Optimization Laboratory
 All rights reserved.
 
@@ -7993,13 +7993,13 @@ met:
       contributors may be used to endorse or promote products derived
       from this software without specific prior written permission.
 
-
+
 	Copyright (c) 2006-2007 Matias Capeletto
-
+
 	Copyright (c) 2006-2007 Tobias Schwinger
-
+
 	Copyright (c) 2006-2007, Robert Hetland <hetland@tamu.edu>
-
+
 	Copyright (c) 2006-2008 Alexander Chemeris
 // 
 // Redistribution and use in source and binary forms, with or without
@@ -8015,87 +8015,87 @@ met:
 //   3. The name of the author may be used to endorse or promote products
 //      derived from this software without specific prior written permission.
 // 
-
+
 	Copyright (c) 2006-2008 Emil Dotchevski and Reverge Studios, Inc.
-
+
 	Copyright (c) 2006-2008 Johan Rade
-
+
 	Copyright (C) 2006-2009 Dmitry Bufistov and Andrey Parfenov
-
+
 	Copyright (c) 2006-2009 Emil Dotchevski and Reverge Studios, Inc.
-
+
 	Copyright (C) 2006-2009, 2012 Alexander Nasonov
-
+
 	Copyright (c) 2006-2010 Emil Dotchevski and Reverge Studios, Inc.
-
+
 	Copyright (C) 2006-2010 The Trustees of Indiana University.
-
+
 	Copyright (c) 2006-2013 Emil Dotchevski and Reverge Studios, Inc.
-
+
 	Copyright (c) 2006-2013 The University of Colorado Denver.  All rights
                           reserved.
   
-
+
 	Copyright (c) 2006-7 John Maddock
-
+
 	Copyright (C) 2007   Douglas Gregor
-
+
 	Copyright (C) 2007  Douglas Gregor  <doug.gregor@gmail.com>
-
+
 	Copyright (C) 2007  Matthias Troyer  <troyer@boost-consulting.com>
-
+
 	Copyright (c) 2007 - S
-
+
 	Copyright (C) 2007 Alexey Baskakov
-
+
 	Copyright (c) 2007 Cybozu Labs, Inc.
-
+
 	Copyright (c) 2007 Dan Marsden
-
+
 	Copyright (C) 2007 Douglas Gregor
-
+
 	Copyright (C) 2007 Douglas Gregor and Matthias Troyer
-
+
 	Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
-
+
 	Copyright (C) 2007 Hartmut Kaiser
-
+
 	Copyright (c) 2007 Joel de Guzman
-
+
 	Copyright (c) 2007 John Maddock
-
+
 	Copyright (C) 2007 Marcin Kalicinski
-
+
 	Copyright (C) 2007 Matthias Troyer
-
+
 	Copyright (C) 2007 Peder Holt
-
+
 	Copyright (c) 2007 Peter Dimov
-
+
 	Copyright (C) 2007 The Trustees of Indiana University.
-
+
 	Copyright (C) 2007 The Trustees of Indiana University.
 
 // Authors: Douglas Gregor
 //          Andrew Lumsdaine
-
+
 	Copyright (c) 2007 Tobias Schwinger
-
+
 	Copyright (C) 2007 Trustees of Indiana University
 
 // Authors: Douglas Gregor
 //          Andrew Lumsdaine
-
+
 	Copyright (c) 2007, 2008 Peter Dimov
-
+
 	Copyright (C) 2007, 2008 Steven Watanabe, Joseph Gauterin, Niels Dekker
-
+
 	Copyright (c) 2007, 2008, 2012 Peter Dimov
-
+
 	Copyright (c) 2007, 2008, Damian Eads
 #
 # All rights reserved.
-
+
 	Copyright (c) 2007, 2008, Damian Eads. All rights reserved.
  * Adapted for incorporation into Scipy, April 9, 2008.
  *
@@ -8113,13 +8113,13 @@ met:
  *     contributors may be used to endorse or promote products derived
  *     from this software without specific prior written permission.
  *
-
+
 	Copyright (c) 2007, 2013 John Maddock
-
+
 	Copyright (c) 2007, 2013 Peter Dimov
-
+
 	Copyright (c) 2007, 2014 Peter Dimov
-
+
 	Copyright (c) 2007, Damian Eads. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
@@ -8136,7 +8136,7 @@ met:
  *     contributors may be used to endorse or promote products derived
  *     from this software without specific prior written permission.
  *
-
+
 	Copyright (c) 2007, John Travers <jtravs@gmail.com>
 
 Redistribution and use in source and binary forms, with or without
@@ -8155,201 +8155,201 @@ met:
        contributors may be used to endorse or promote products derived
        from this software without specific prior written permission.
 
-
+
 	Copyright (C) 2007, Tobias Schwinger.
-
+
 	Copyright (C) 2007-2008 Steven Watanabe
-
+
 	Copyright (c) 2007-2008 Tobias Schwinger
-
+
 	Copyright (c) 2007-2009 Ben Hanson (http://www.benhanson.net/)
-
+
 	Copyright (C) 2007-2009 Steven Watanabe
-
+
 	Copyright (c) 2007-2009: Joachim Faulhaber
-
+
 	Copyright (c) 2007-2009: Joachim Faulhaber
 +------------------------------------------------------------------------------+
-
+
 	Copyright (C) 2007-2010 Steven Watanabe
-
+
 	Copyright (c) 2007-2010: Joachim Faulhaber
-
+
 	Copyright (c) 2007-2010: Joachim Faulhaber
 +------------------------------------------------------------------------------+
-
+
 	Copyright (c) 2007-2011 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2007-2011 Hartmut Kaiser
-
+
 	Copyright (c) 2007-2011: Joachim Faulhaber
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2013, 2014, 2015, 2017, 2018, 2019.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2013, 2014, 2015, 2017, 2018.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2013, 2014, 2015, 2017.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2013, 2014, 2017, 2018.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2013, 2014, 2018.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2013-2020.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2013.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2014, 2016, 2017.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2014, 2017, 2019.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2014-2017.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2014.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2015-2017.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2016-2020.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2016.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017, 2018, 2019.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017, 2018.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017, 2019, 2020.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017, 2019.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017-2020.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2018-2020.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2018.
-
+
 	Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2007-2012: Joachim Faulhaber
-
+
 	Copyright (c) 2007-2013 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2007-2014 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2007-2014 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2013-2020.
-
+
 	Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2014, 2020.
-
+
 	Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2015, 2016.
-
+
 	Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2015, 2017, 2019, 2020.
-
+
 	Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2015-2020.
-
+
 	Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2015.
-
+
 	Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017-2020.
-
+
 	Copyright (c) 2007-2016 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2007-2016 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2014, 2017.
-
+
 	Copyright (c) 2007-2016 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2014-2018.
-
+
 	Copyright (c) 2007-2017 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2007-2020 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (C) 2007-8 Anthony Williams
-
+
 	Copyright (C) 2007-9 Anthony Williams
-
+
 	Copyright (c) 2008   Gerald I. Evenden
-
+
 	Copyright (c) 2008 Beman Dawes
-
+
 	Copyright (C) 2008 Damian Eads
 #
 # Redistribution and use in source and binary forms, with or without
@@ -8365,513 +8365,513 @@ met:
 #    with the distribution.
 #
 # 3. The name of the author may not be used to endorse or promote
-
+
 	Copyright (C) 2008 Eric Niebler.
-
+
 	Copyright (c) 2008 Federico J. Fernandez.
-
+
 	Copyright (c) 2008 Frank Mori Hess
-
+
 	Copyright (c) 2008 Ilya Sokolov, Boris Schaeling
-
+
 	Copyright (C) 2008 Ion Gaztanaga
-
+
 	Copyright (c) 2008 Michael Marcin
-
+
 	Copyright (c) 2008 Peter Dimov
-
+
 	Copyright (c) 2008 Rep Invariant Systems, Inc. (info@repinvariant.com)
-
+
 	Copyright (c) 2008 Roelof Naude (roelof.naude at gmail dot com)
-
+
 	Copyright (C) 2008 Steven Watanabe
-
+
 	Copyright (c) 2008, 2009 Peter Dimov
-
+
 	Copyright (C) 2008, 2009, 2016 Tim Blechmann, based on code by Cory Nelson
-
+
 	Copyright (c) 2008, 2011 Peter Dimov
-
+
 	Copyright (C) 2008, 2016 Tim Blechmann
-
+
 	Copyright (c) 2008, 2018 Peter Dimov
-
+
 	Copyright (c) 2008-2009 Ben Hanson
-
+
 	Copyright (c) 2008-2009 Ben Hanson (http://www.benhanson.net/)
-
+
 	Copyright (c) 2008-2009 Ben Hanson\n";
-
+
 	Copyright (c) 2008-2009 Emil Dotchevski and Reverge Studios, Inc.
-
+
 	Copyright (c) 2008-2009 Frank Mori Hess
-
+
 	Copyright (c) 2008-2009: Joachim Faulhaber
-
+
 	Copyright (c) 2008-2009: Joachim Faulhaber
 +------------------------------------------------------------------------------+
-
+
 	Copyright (c) 2008-2010 Wolfgang Hoermann and Josef Leydold
  *   Department of Statistics and Mathematics, WU Wien, Austria              *
  *                                                                           *
-
+
 	Copyright (c) 2008-2010: Joachim Faulhaber
-
+
 	Copyright (c) 2008-2011 Bruno Lalande, Paris, France.
-
+
 	Copyright (C) 2008-2011 Daniel James.
-
+
 	Copyright (c) 2008-2011 Hartmut Kaiser
-
+
 	Copyright (c) 2008-2011 Hartmut Kaiser\n";
-
+
 	Copyright (c) 2008-2011: Joachim Faulhaber
-
+
+	Copyright (c) 2008-2012 Barend Gehrels, Amsterdam, the Netherlands.
+
 	Copyright (c) 2008-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
-	Copyright (c) 2008-2012 Barend Gehrels, Amsterdam, the Netherlands.
-
-
+
 	Copyright (c) 2008-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017, 2018, 2019.
-
+
 	Copyright (c) 2008-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017, 2018, 2020.
-
+
 	Copyright (c) 2008-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017, 2018.
-
+
 	Copyright (c) 2008-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017, 2019.
-
+
 	Copyright (c) 2008-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017-2020.
-
+
 	Copyright (c) 2008-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017.
-
+
 	Copyright (c) 2008-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2018.
-
+
 	Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-
+
 	Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
 
 // This file was modified by Oracle on 2016-2020.
-
+
 	Copyright (c) 2008-2012 Simonson Lucanus.
-
+
 	Copyright (c) 2008-2012: Joachim Faulhaber
-
+
 	Copyright (c) 2008-2013 Bruno Lalande, Paris, France.
-
+
 	Copyright (C) 2008-2013 Tim Blechmann
-
+
 	Copyright (c) 2008-2014 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2008-2014 Bruno Lalande, Paris, France.
-
+
 	Copyright (c) 2008-2015 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2008-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017, 2018, 2019.
-
+
 	Copyright (c) 2008-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017-2020.
-
+
 	Copyright (c) 2008-2015 Bruno Lalande, Paris, France.
-
+
 	Copyright (C) 2008-2016 Daniel James.
-
+
 	Copyright (c) 2008-2016 Emil Dotchevski and Reverge Studios, Inc.
-
+
 	Copyright (C) 2008-2016 Tim Blechmann
-
+
 	Copyright (c) 2008-2017 Bruno Lalande, Paris, France.
-
+
 	Copyright (c) 2008-2017 Emil Dotchevski and Reverge Studios, Inc.
-
+
 	Copyright (C) 2008-2018 Lorenzo Caminiti
-
+
 	Copyright (C) 2008-2019 Lorenzo Caminiti
-
+
 	Copyright (c) 2009
-
+
 	Copyright (c) 2009  Hartmut Kaiser
-
+
 	Copyright (C) 2009 Andrew Sutton
-
+
 	Copyright (c) 2009 Ben Hanson (http://www.benhanson.net/)
-
+
 	Copyright (c) 2009 Boris Schaeling
-
+
 	Copyright (c) 2009 Carl Barron
-
+
 	Copyright (c) 2009 Chris Hoeppler
-
+
 	Copyright (c) 2009 Christopher Schmidt
-
+
 	Copyright (c) 2009 Francois Barel
-
+
 	Copyright (c) 2009 Frank Mori Hess
-
+
 	Copyright (C) 2009 Free Software Foundation, Inc. <http://fsf.org/>
-
+
 	Copyright (c) 2009 Hartmut Kaiser
-
+
 	Copyright (c) 2009 Helge Bahmann
-
+
 	Copyright (c) 2009 John Maddock
-
+
 	Copyright (C) 2009 Pauli Virtanen
-
+
 	Copyright (c) 2009 Peter Dimov
-
+
 	Copyright (c) 2009 Phil Endecott
-
+
 	Copyright (C) 2009 Sebastian Redl
-
+
 	Copyright (C) 2009 Steven Watanabe
-
+
 	Copyright (C) 2009 Trustees of Indiana University
-
+
 	Copyright (c) 2009 Wolfgang Hoermann and Josef Leydold
  *   Department of Statistics and Mathematics, WU Wien, Austria              *
  *                                                                           *
-
+
 	Copyright (c) 2009, 2011 Helge Bahmann
-
+
 	Copyright (c) 2009, 2015 Peter Dimov
-
+
 	Copyright (c) 2009, Gunter Winkler
-
+
 	Copyright (c) 2009, Marco Guazzone
-
+
 	Copyright (c) 2009, Motorola, Inc
 #
 # All Rights Reserved.
-
+
 	Copyright (C) 2009, Pauli Virtanen <pav@iki.fi>
-
+
 	Copyright (c) 2009, Spirent Communications, Inc.
-
+
 	Copyright (c) 2009-2009: Joachim Faulhaber
-
+
 	Copyright (c) 2009-2010  Wolfgang Hoermann and Josef Leydold
  *   Department of Statistics and Mathematics, WU Wien, Austria              *
  *                                                                           *
-
+
 	Copyright (c) 2009-2010 Christopher Schmidt
-
+
 	Copyright (c) 2009-2010 Hartmut Kaiser
-
+
 	Copyright (c) 2009-2010, Marco Guazzone
-
+
 	Copyright (c) 2009-2010: Joachim Faulhaber
-
+
 	Copyright (c) 2009-2011 Artyom Beilis (Tonkikh)
-
+
 	Copyright (c) 2009-2011 Christopher Schmidt
-
+
 	Copyright (c) 2009-2011 Mateusz Loskot, London, UK.
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2009-2011 Wolfgang Hoermann and Josef Leydold
  *   Department of Statistics and Mathematics, WU Wien, Austria              *
  *                                                                           *
-
+
 	Copyright (c) 2009-2011: Joachim Faulhaber
-
+
 	Copyright (c) 2009-2012 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2009-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2016.
-
+
 	Copyright (C) 2009-2012 Lorenzo Caminiti
-
+
+	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
-	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
-
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2013, 2014, 2017, 2018.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2013, 2014, 2017, 2019.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2013, 2014, 2017.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2013-2020.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2013.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014, 2016, 2017, 2018, 2020.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014, 2016, 2017, 2018.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014, 2016, 2018.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2017-2020.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2018, 2019.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2018-2020.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2018.
-
+
 	Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2009-2012 Wolfgang Hoermann and Josef Leydold
  *   Department of Statistics and Mathematics, WU Wien, Austria              *
  *                                                                           *
-
+
 	Copyright (c) 2009-2012, Marco Guazzone
-
+
 	Copyright (c) 2009-2013 Mateusz Loskot, London, UK.
-
+
 	Copyright (c) 2009-2013 Mateusz Loskot, London, UK.
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (C) 2009-2013 Tim Blechmann
-
+
 	Copyright (c) 2009-2014 Mateusz Loskot, London, UK.
-
+
 	Copyright (c) 2009-2014 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2013-2017.
-
+
 	Copyright (c) 2009-2014 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014, 2018.
-
+
 	Copyright (c) 2009-2014 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014, 2019.
-
+
 	Copyright (c) 2009-2014 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2009-2014 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014.
-
+
 	Copyright (c) 2009-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2015-2020.
-
+
 	Copyright (c) 2009-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2015.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2013, 2015.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014, 2015, 2017.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014, 2015.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2015, 2016, 2017, 2018.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2015, 2016, 2018, 2019.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2015, 2016.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2015, 2017.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2015, 2018.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2015-2018.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2015-2020.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2015.
-
+
 	Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2018-2020.
-
+
 	Copyright (c) 2009-2017 Mateusz Loskot, London, UK.
-
+
 	Copyright (c) 2009-2017 The MathJax Consortium
-
+
 	Copyright (c) 2009-2020 Vladimir Batov.
-
+
 	Copyright (c) 2009-2020 Vladimir Batov.
 //
 // Many thanks to Julian Gonggrijp, Rob Stewart, Andrzej Krzemienski, Matus Chochlik, Jeroen Habraken,
 // Hartmut Kaiser, Joel De Guzman, Thijs (M.A.) van den Berg, Roland Bock, Gavin Lambert, Paul Bristow,
 // Alex Hagen-Zanker, Christopher Kormanyos for taking part in the Boost.Convert review.
-
+
 	Copyright (c) 2010      Bryce Lelbach
-
+
 	Copyright (c) 2010      Eric Niebler
-
+
 	Copyright (c) 2010 - Jordi Guti
 
-
+
 	Copyright (c) 2010 2015 Francisco Jos
-
+
 	Copyright (c) 2010 Alfredo Correa
-
+
 	Copyright (c) 2010 Artyom Beilis (Tonkikh)
-
+
 	Copyright (c) 2010 Athanasios Iliopoulos
-
+
 	Copyright (c) 2010 Christopher Schmidt
-
+
 	Copyright (C) 2010 David Fong and Michael Saunders
-
+
 	Copyright (C) 2010 David Fong and Michael Saunders
 
 LSMR uses an iterative method.
-
+
 	Copyright (c) 2010 Eric Jourdanneau, Joel Falcou
-
+
 	Copyright (c) 2010 Eric Niebler
-
+
 	Copyright (c) 2010 Felipe Tanus, Boris Schaeling
-
+
 	Copyright (c) 2010 Helge Bahmann
-
+
 	Copyright (c) 2010 Ilya Murav
-
+
 	Copyright (c) 2010 Matthias Walter (xammy@xammy.homelinux.net)
  *
  * Authors: Matthias Walter
-
+
 	Copyright (c) 2010 Neil Groves
-
+
 	Copyright (c) 2010 Nuovation System Designs, LLC
 //    Grant Erickson <gerickson@nuovations.com>
 //
 //  Reworked somewhat by Marshall Clow; August 2010
-
+
 	Copyright (C) 2010 Paul A. Bristow added Doxygen comments.
-
+
 	Copyright (C) 2010 Peder Holt
-
+
 	Copyright (c) 2010 Thomas Heller
-
+
 	Copyright (c) 2010 Thomas P. Robitaille
 
 # Many thanks to Craig Markwardt for publishing the Unofficial Format
 # Specification for IDL .sav files, without which this Python module would not
 # exist (http://cow.physics.wisc.edu/~craigm/idl/savefmt).
-
+
 	Copyright (C) 2010 Tim Blechmann
-
+
 	Copyright (c) 2010 Wolfgang Hoermann and Josef Leydold
  *   Department of Statistics and Mathematics, WU Wien, Austria              *
  *                                                                           *
-
+
 	Copyright (c) 2010-2010: Joachim Faulhaber
-
+
 	Copyright (c) 2010-2011 Bryce Lelbach
-
+
 	Copyright (c) 2010-2011 Christopher Schmidt
-
+
 	Copyright (c) 2010-2011 David Bellot
-
+
 	Copyright (c) 2010-2011 Thomas Heller
-
+
 	Copyright (C) 2010-2011 Tim Blechmann
-
+
 	Copyright (c) 2010-2011: Joachim Faulhaber
-
+
 	Copyright (c) 2010-2012 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2010-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2018.
-
+
 	Copyright (c) 2010-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2010-2017 The MathJax Consortium
-
+
 	Copyright (c) 2010-2017 The MathJax Consortium
  *
  *  Part of the MathJax library.
  *  See http://www.mathjax.org for details.
-
+
 	Copyright (C) 2010-2019 Max-Planck-Society
 All rights reserved.
 
@@ -8887,131 +8887,131 @@ are permitted provided that the following conditions are met:
   be used to endorse or promote products derived from this software without
   specific prior written permission.
 
-
+
 	Copyright (C) 2010-2020 Max-Planck-Society
-
+
 	Copyright (c) 2011
-
+
 	Copyright (c) 2011      Bryce Lelbach
-
+
 	Copyright (c) 2011 Aaron Graham
-
+
 	Copyright (c) 2011 Boris Schaeling (boris@highscore.de)
-
+
 	Copyright (c) 2011 Brandon Kohn
-
+
 	Copyright (c) 2011 Bryce Lelbach
-
+
 	Copyright (c) 2011 Christopher Jefferson
-
+
 	Copyright (c) 2011 Emil Dotchevski
-
+
 	Copyright (c) 2011 Eric Niebler
-
+
 	Copyright (c) 2011 Hartmut Kaiser
-
+
 	Copyright (c) 2011 Helge Bahmann
-
+
 	Copyright (C) 2011 J
-
+
 	Copyright (c) 2011 Jamboree
-
+
 	Copyright (c) 2011 Jan Frederick Eick
-
+
 	Copyright (c) 2011 Jeff Flinn, Boris Schaeling
-
+
 	Copyright (c) 2011 John Maddock
-
+
 	Copyright (c) 2011 Paul A. Bristow - filename changes for boost-trunk.
-
+
 	Copyright (c) 2011 Paul A. Bristow comments
-
+
 	Copyright (c) 2011 Paul A. Bristow incorporated Boost.Math
-
+
 	Copyright (c) 2011 Paul A. Bristow To incorporate into Boost.Math
-
+
 	Copyright (c) 2011 Steven Watanabe
-
+
 	Copyright (c) 2011 Thomas Bernard
-
+
 	Copyright (c) 2011 Thomas Heller
-
+
 	Copyright (C) 2011 Tim Blechmann
-
+
 	Copyright (C) 2011 Vicente J. Botet Escriba
-
+
 	Copyright (c) 2011, 2012  Martin Lambers <marlam@marlam.de>
-
+
 	Copyright (c) 2011, 2012 Jeff Flinn, Boris Schaeling
-
+
 	Copyright (C) 2011, 2016 Tim Blechmann
-
+
 	Copyright (c) 2011-2011: Joachim Faulhaber
-
+
 	Copyright (c) 2011-2012
-
+
 	Copyright (c) 2011-2012 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2011-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2011-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2014, 2017.
-
+
 	Copyright (c) 2011-2012 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2016-2020.
-
+
 	Copyright (c) 2011-2012 Bruno Lalande, Paris, France.
-
+
 	Copyright (c) 2011-2012 Mateusz Loskot, London, UK.
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2011-2012 Thomas Bernard
-
+
 	Copyright (C) 2011-2012 Vicente J. Botet Escriba
-
+
 	Copyright (c) 2011-2012 Wolfgang Hoermann and Josef Leydold
  *   Institute for Statistics and Mathematics, WU Wien, Austria              *
  *                                                                           *
-
+
 	Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland.
-
+
 	Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2019-2020.
-
+
 	Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2019.
-
+
 	Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2011-2013 Andrew Hundt.
-
+
 	Copyright (C) 2011-2013 Vicente J. Botet Escriba
-
+
 	Copyright (C) 2011-2013, 2016 Tim Blechmann
-
+
 	Copyright (c) 2011-2014 Adam Wulkiewicz, Lodz, Poland.
-
+
 	Copyright (c) 2011-2014 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2019-2020.
-
+
 	Copyright (c) 2011-2014 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2019.
-
+
 	Copyright (c) 2011-2014 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2011-2014, The OpenBLAS Project
   All rights reserved.
   
@@ -9028,184 +9028,184 @@ are permitted provided that the following conditions are met:
         distribution.
      3. Neither the name of the OpenBLAS project nor the names of 
         its contributors may be used to endorse or promote products 
-
+
 	Copyright (c) 2011-2015 Adam Wulkiewicz, Lodz, Poland.
-
+
 	Copyright (c) 2011-2015 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2019-2020.
-
+
 	Copyright (c) 2011-2015 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2019.
-
+
 	Copyright (c) 2011-2015 Akira Takahashi
-
+
 	Copyright (c) 2011-2015 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2011-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2015-2020.
-
+
 	Copyright (c) 2011-2015 The MathJax Consortium
-
+
 	Copyright (c) 2011-2016 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2019.
-
+
 	Copyright (c) 2011-2017 Adam Wulkiewicz, Lodz, Poland.
-
+
 	Copyright (c) 2011-2017 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2019-2020.
-
+
 	Copyright (c) 2011-2017 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2019.
-
+
 	Copyright (c) 2011-2017 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2011-2017 The MathJax Consortium
-
+
 	Copyright (c) 2011-2018 Adam Wulkiewicz, Lodz, Poland.
-
+
 	Copyright (c) 2011-2018 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2019-2020.
-
+
 	Copyright (c) 2011-2018 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2019.
-
+
 	Copyright (c) 2011-2019 Adam Wulkiewicz, Lodz, Poland.
-
+
 	Copyright (c) 2011-2019 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2019.
-
+
 	Copyright (c) 2011-2019 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2011-2020 Antony Polukhin
-
+
 	Copyright (c) 2012   Martin Raspaud
 
 // See also (section 4.4.3.2):
-
+
 	Copyright (c) 2012 - 2014 Andrey Semashev
  */
-
+
 	Copyright (c) 2012 - 2014, 2017 Andrey Semashev
-
+
 	Copyright (C) 2012 Anthony Williams
-
+
 	Copyright (c) 2012 Artyom Beilis (Tonkikh)
-
+
 	Copyright (c) 2012 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2012 Boris Schaeling
-
+
 	Copyright (c) 2012 Bruno Lalande, Paris, France.
-
+
 	Copyright (C) 2012 David Stone
-
+
 	Copyright (C) 2012 Flavio De Lorenzi (fdlorenzi@gmail.com)
-
+
 	Copyright (c) 2012 Google Inc.
-
+
 	Copyright (c) 2012 Hartmut Kaiser
-
+
 	Copyright (c) 2012 Kohei Takahashi
-
+
 	Copyright (C) 2012 Lorenzo Caminiti
-
+
 	Copyright (c) 2012 Massachusetts Institute of Technology
-
+
 	Copyright (c) 2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2012 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2018-2020.
-
+
 	Copyright (c) 2012 Nathan Ridge
-
+
 	Copyright (c) 2012 Oswin Krause
-
+
 	Copyright (c) 2012 Paul A. Bristow
-
+
 	Copyright (c) 2012 Paul Fultz II
-
+
 	Copyright (C) 2012 Pieter Bastiaan Ober (Integricom).
-
+
 	Copyright (c) 2012 Robert Ramey
-
+
 	Copyright (c) 2012 Tim Blechmann
-
+
 	Copyright (C) 2012 Vicente J. Botet Escriba
-
+
 	Copyright (C) 2012, Michele Caini.
-
+
 	Copyright (c) 2012-2012 Andrii Sydorchuk.
-
+
 	Copyright (c) 2012-2013 Adam Wulkiewicz, Lodz, Poland.
-
+
 	Copyright (C) 2012-2013 Vicente J. Botet Escriba
-
+
 	Copyright (c) 2012-2014 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2012-2014 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017-2020.
-
+
 	Copyright (c) 2012-2014 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2018.
-
+
 	Copyright (c) 2012-2014 Bruno Lalande, Paris, France.
-
+
 	Copyright (c) 2012-2014 Kohei Takahashi
-
+
 	Copyright (c) 2012-2014 Mateusz Loskot, London, UK.
 
 // This file was modified by Oracle on 2014.
-
+
 	Copyright (c) 2012-2015 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2012-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2015, 2018.
-
+
 	Copyright (c) 2012-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2015.
-
+
 	Copyright (c) 2012-2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2012-2020 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2012-2020 Antony Polukhin
-
+
 	Copyright (c) 2012-2020 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2012-2020 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017-2020.
-
+
 	Copyright (c) 2013  Antony Polukhin // Move semantics implementation.
-
+
 	Copyright (c) 2013  Paul A. Bristow // Doxygen comments changed for new version of documentation.
-
+
 	Copyright (C) 2013  Pauli Virtanen
  *
  * Redistribution and use in source and binary forms, with or without
@@ -9220,69 +9220,69 @@ are permitted provided that the following conditions are met:
  *    may be used to endorse or promote products derived from this software
  *    without specific prior written permission.
  *
-
+
 	Copyright (c) 2013 - 2014 Andrey Semashev
  */
-
+
 	Copyright (c) 2013 - 2018, 2020 Andrey Semashev
  */
-
+
 	Copyright (c) 2013 - 2020 Andrey Semashev
  */
-
+
 	Copyright (c) 2013 Adam Wulkiewicz, Lodz, Poland
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2013 Adam Wulkiewicz, Lodz, Poland.
-
+
 	Copyright (c) 2013 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013, 2014.
-
+
 	Copyright (c) 2013 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013-2020.
-
+
 	Copyright (c) 2013 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2013 Agustin Berge
-
+
 	Copyright (c) 2013 Anton Bikineev
-
+
 	Copyright (c) 2013 Antony Polukhin  // Move semantics implementation.
 
-
+
 	Copyright (c) 2013 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2013 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2016-2020.
-
+
 	Copyright (c) 2013 Bruno Lalande, Paris, France.
-
+
 	Copyright (c) 2013 Carl Barron
-
+
 	Copyright (c) 2013 Christopher Kormanyos
-
+
 	Copyright (C) 2013 Eurodecision
-
+
 	Copyright (C) 2013 Jakob Lykke Andersen, University of Southern Denmark
 // (jlandersen@imada.sdu.dk)
 //
 // The algorithm implemented here is derived from original ideas by
 // Pasquale Foggia and colaborators. For further information see
 // e.g. Cordella et al. 2001, 2004.
-
+
 	Copyright (c) 2013 Jamboree
-
+
 	Copyright (c) 2013 Joaquim Duran
-
+
 	Copyright (c) 2013 John Maddock, Antony Polukhin
 // 
-
+
 	Copyright (C) 2013 Kenneth L. Ho
 #
 #   Redistribution and use in source and binary forms, with or without
@@ -9298,7 +9298,7 @@ are permitted provided that the following conditions are met:
 #   promote products derived from this software without specific prior written
 #   permission.
 #
-
+
 	Copyright (C) 2013 Kenneth L. Ho
 #   Redistribution and use in source and binary forms, with or without
 #   modification, are permitted provided that the following conditions are met:
@@ -9313,1056 +9313,1056 @@ are permitted provided that the following conditions are met:
 #   promote products derived from this software without specific prior written
 #   permission.
 #
-
+
 	Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
-
+
 	Copyright (c) 2013 Mateusz Loskot
-
+
 	Copyright (c) 2013 Mateusz Loskot, London, UK.
-
+
 	Copyright (c) 2013 Mateusz Loskot, London, UK.
 //
 // This file was modified by Oracle on 2019-2020.
-
+
 	Copyright (c) 2013 Paul A. Bristow  // Doxygen comments changed.
-
+
 	Copyright (c) 2013 Peter Dimov
-
+
 	Copyright (C) 2013 Sebastian Redl
-
+
 	Copyright (c) 2013 Tim Blechmann
-
+
 	Copyright (c) 2013 Tim Blechmann
  * ARM Code by Phil Endecott, based on other architectures.
-
+
 	Copyright (c) 2013 Tim Blechmann
  * Linux-specific code by Phil Endecott
-
+
 	Copyright (C) 2013 Vicente J. Botet Escriba
-
+
 	copyright (c) 2013, 2014 Oracle and/or its affiliates.
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	copyright (c) 2013, Oracle and/or its affiliates.
-
+
 	copyright (c) 2013, Oracle and/or its affiliates.
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (C) 2013,2014 Vicente J. Botet Escriba
-
+
 	Copyright (c) 2013-2014 Adam Wulkiewicz, Lodz, Poland
 
 // This file was modified by Oracle on 2013-2018.
-
+
 	Copyright (c) 2013-2014 Adam Wulkiewicz, Lodz, Poland.
-
+
 	Copyright (c) 2013-2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013-2014.
-
+
 	Copyright (c) 2013-2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013-2017.
-
+
 	Copyright (c) 2013-2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013-2018.
-
+
 	Copyright (c) 2013-2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013-2019.
-
+
 	Copyright (c) 2013-2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013-2020.
-
+
 	Copyright (c) 2013-2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2014, 2018.
-
+
 	Copyright (c) 2013-2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2014, 2020.
-
+
 	Copyright (c) 2013-2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2013-2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2014.
-
+
 	Copyright (c) 2013-2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2017-2020.
-
+
 	Copyright (c) 2013-2014 Agustin Berge
-
+
 	Copyright (c) 2013-2014 Damien Buhl
-
+
 	Copyright (c) 2013-2014 Ion Gaztanaga
-
+
 	Copyright (c) 2013-2014 Kyle Lutz <kyle.r.lutz@gmail.com>
-
+
 	Copyright (C) 2013-2014 Vicente J. Botet Escriba
-
+
 	Copyright (c) 2013-2014, 2020 Andrey Semashev
  */
-
+
 	copyright (c) 2013-2014, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland
 
 // This file was modified by Oracle on 2013, 2014, 2015, 2017, 2018, 2019.
-
+
 	Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland
 
 // This file was modified by Oracle on 2013, 2014, 2015, 2017, 2018.
-
+
 	Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland
 
 // This file was modified by Oracle on 2013-2018.
-
+
 	Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland
 
 // This file was modified by Oracle on 2013-2020.
-
+
 	Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland.
-
+
 	Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013, 2014, 2015, 2017.
-
+
 	Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013, 2014, 2015.
-
+
 	Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013-2018.
-
+
 	Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013-2020.
-
+
 	Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2015, 2016, 2017, 2019.
-
+
 	Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2015, 2017, 2019.
-
+
 	Copyright (c) 2013-2015 Kyle Lutz <kyle.r.lutz@gmail.com>
-
+
 	copyright (c) 2013-2015, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	copyright (c) 2013-2015, Oracle and/or its affiliates.
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2013-2017 Adam Wulkiewicz, Lodz, Poland
 
 // This file was modified by Oracle on 2015-2020.
-
+
 	Copyright (c) 2013-2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013-2020.
-
+
 	Copyright (c) 2013-2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2013-2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2017-2020.
-
+
 	copyright (c) 2013-2017 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2013-2017 The MathJax Consortium
-
+
 	copyright (c) 2013-2017, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2013-2017, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	copyright (c) 2013-2017, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2013-2018 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2013-2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2013-2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	copyright (c) 2013-2019 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2013-2019, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	copyright (c) 2013-2019, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2013-2020 Antony Polukhin
-
+
 	Copyright (c) 2013-2020 Antony Polukhin.
-
+
 	copyright (c) 2013-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2013-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	copyright (c) 2013-2020 Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	copyright (c) 2013-2020, Oracle and/or its affiliates.
-
+
 	copyright (c) 2013-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2013-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	copyright (c) 2013-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2013-2020, Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2014      John Fletcher
-
+
 	Copyright (c) 2014      Tomoki Imai
-
+
 	Copyright (c) 2014  Joel de Guzman
-
+
 	Copyright (C) 2014 - 2018 Andrzej Krzemienski.
-
+
+	Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
+
 	Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
 
-	Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
-
-
+
 	Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013-2020.
-
+
 	Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2014.
-
+
 	Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2016-2020.
-
+
 	Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2016.
-
+
 	Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2017-2020.
-
+
 	Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2018-2020.
-
+
 	Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2018.
-
+
 	Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2014 Agustin Berge
-
+
 	Copyright (C) 2014 Agustin Berge
-
+
 	Copyright (c) 2014 Ahmed Charles
 //
-
+
 	Copyright (c) 2014 Andrey Semashev
-
+
 	Copyright (C) 2014 Andrey Semashev
-
+
 	Copyright (c) 2014 Andrey Semashev
  */
-
+
 	Copyright (c) 2014 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2014 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2016, 2018.
-
+
 	Copyright (c) 2014 Bruno Lalande, Paris, France.
-
+
 	Copyright (c) 2014 Christoph Weiss
-
+
 	Copyright (c) 2014 Eric Niebler
-
+
 	Copyright (C) 2014 Erik Erlandson
-
+
 	Copyright (c) 2014 Glen Fernandes
-
+
 	Copyright (c) 2014 Glen Joseph Fernandes
 //       (glenjofe@gmail.com)
-
+
 	Copyright (C) 2014 Glen Joseph Fernandes
 //  (glenjofe@gmail.com)
 //
-
+
 	Copyright (c) 2014 Glen Joseph Fernandes
 // (glenjofe@gmail.com)
 //
-
+
 	Copyright (C) 2014 Ian Forbed
-
+
 	Copyright (c) 2014 Jamboree
-
+
 	Copyright (c) 2014 Joel de Guzman
-
+
 	Copyright (c) 2014 John Fletcher
-
+
 	Copyright (c) 2014 Kohei Takahashi
-
+
 	Copyright (c) 2014 Lee Clagett
-
+
 	Copyright (c) 2014 Mageswaran.D <mageswaran1989@gmail.com>
-
+
 	Copyright (c) 2014 Mateusz Loskot, London, UK.
-
+
 	Copyright (c) 2014 Mathjax Consortium
-
+
 	Copyright (c) 2014 Oliver Kowalke (oliver dot kowalke at gmail dot com)
-
+
 	copyright (c) 2014 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014 Paul Fultz II
-
+
 	Copyright (c) 2014 Peter Dimov
-
+
 	Copyright (C) 2014 Pieter Bastiaan Ober (Integricom).
-
+
 	Copyright (c) 2014 Riccardo Marcangelo
-
+
 	Copyright (c) 2014 Roshan <thisisroshansmail@gmail.com>
-
+
 	Copyright (c) 2014 Samuel Debionne, Grenoble, France.
 
 // This file was modified by Oracle on 2014, 2017.
-
+
 	Copyright (c) 2014 Samuel Debionne, Grenoble, France.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2014 Samuel Debionne, Grenoble, France.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2014 Thomas Bernard
-
+
 	Copyright (C) 2014 Vicente J. Botet Escriba
-
+
 	Copyright (C) 2014, 2015 Andrzej Krzemienski.
-
+
 	Copyright (c) 2014, 2015, 2016, 2017 Jarryd Beck
-
+
 	Copyright (c) 2014, 2018, 2019, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014, 2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014, 2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014, 2019 Andrey Semashev
  */
-
+
 	Copyright (c) 2014, 2019, 2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014, 2019, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014, 2019, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014, 2020 Andrey Semashev
  */
-
+
 	Copyright (C) 2014, Andrzej Krzemienski.
-
+
 	Copyright (c) 2014, Athanasios Iliopoulos
-
+
 	Copyright (c) 2014, Oracle and/or its affiliates.
-
+
 	copyright (c) 2014, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	Copyright (c) 2014, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	copyright (c) 2014, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014,2015,2018 Kohei Takahashi
-
+
 	Copyright (c) 2014,2018 Kohei Takahashi
-
+
 	Copyright (c) 2014-2015 Adam Wulkiewicz, Lodz, Poland
 
 // This file was modified by Oracle on 2015.
-
+
 	Copyright (c) 2014-2015 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013-2020.
-
+
 	Copyright (c) 2014-2015 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2014, 2015, 2016, 2017, 2019.
-
+
 	Copyright (c) 2014-2015 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2014, 2015, 2016, 2017.
-
+
 	Copyright (c) 2014-2015 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2014-2015 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2015, 2018.
-
+
 	Copyright (c) 2014-2015 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2015-2020.
-
+
 	Copyright (c) 2014-2015 Adam Wulkiewicz, Lodz, Poland.
 //
 // This file was modified by Oracle on 2019-2020.
-
+
 	Copyright (c) 2014-2015 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2014-2015 Bruno Lalande, Paris, France.
-
+
 	Copyright (c) 2014-2015 John Fletcher
-
+
 	Copyright (c) 2014-2015 Kohei Takahashi
-
+
 	Copyright (c) 2014-2015 Mateusz Loskot, London, UK.
-
+
 	copyright (c) 2014-2015 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	Copyright (c) 2014-2015 Samuel Debionne, Grenoble, France.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2014-2015 Samuel Debionne, Grenoble, France.
 
 // This file was modified by Oracle on 2015, 2016, 2017, 2018, 2019.
-
+
 	Copyright (c) 2014-2015 Samuel Debionne, Grenoble, France.
 
 // This file was modified by Oracle on 2015, 2016, 2017, 2018.
-
+
 	Copyright (c) 2014-2015 Samuel Debionne, Grenoble, France.
 
 // This file was modified by Oracle on 2015, 2016, 2017.
-
+
 	Copyright (c) 2014-2015 Samuel Debionne, Grenoble, France.
 
 // This file was modified by Oracle on 2015, 2017, 2018.
-
+
 	Copyright (c) 2014-2015 Samuel Debionne, Grenoble, France.
 
 // This file was modified by Oracle on 2015-2018.
-
+
 	Copyright (c) 2014-2015 Samuel Debionne, Grenoble, France.
 
 // This file was modified by Oracle on 2015-2020.
-
+
 	Copyright (c) 2014-2015 Samuel Debionne, Grenoble, France.
 
 // This file was modified by Oracle on 2015.
-
+
 	Copyright (C) 2014-2015 Vicente J. Botet Escriba
-
+
 	Copyright (c) 2014-2015, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2014-2015, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	Copyright (C) 2014-2016 Andrzej Krzemienski.
-
+
 	Copyright (c) 2014-2016 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014-2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2014-2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2015-2020.
-
+
 	Copyright (c) 2014-2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2017, 2019.
-
+
 	Copyright (c) 2014-2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2017-2020.
-
+
 	copyright (c) 2014-2017 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014-2017 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	Copyright (c) 2014-2017 The MathJax Consortium
-
+
 	Copyright (C) 2014-2017 Vicente J. Botet Escriba
-
+
 	Copyright (c) 2014-2017, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014-2017, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014-2018 Adam Wulkiewicz, Lodz, Poland.
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	copyright (c) 2014-2018 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014-2018 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014-2018 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014-2018, 2020 Andrey Semashev
  */
-
+
 	Copyright (c) 2014-2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014-2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014-2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014-2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	copyright (c) 2014-2019 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	copyright (c) 2014-2019, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014-2019, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014-2020 Andrey Semashev
  */
-
+
 	Copyright (c) 2014-2020 Antony Polukhin
-
+
 	copyright (c) 2014-2020 Oracle and/or its affiliates.
-
+
 	copyright (c) 2014-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	copyright (c) 2014-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	Copyright (c) 2014-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014-2020 Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	copyright (c) 2014-2020 Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2014-2020, Oracle and/or its affiliates.
-
+
 	copyright (c) 2014-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	copyright (c) 2014-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2014-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Adeel Ahmad, as part of Google Summer of Code 2018 program
-
+
 	copyright (c) 2014-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2014-2020, Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	copyright (c) 2014-2020, Oracle and/or its affiliates.
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (C) 2015 - 2017 Andrzej Krzemienski.
-
+
 	Copyright (c) 2015 Agustin K-ballo Berge
-
+
 	Copyright (c) 2015 Andrey Semashev
  */
-
+
 	Copyright (C) 2015 Andrzej Krzemienski.
-
+
 	Copyright (c) 2015 Artyom Beilis (Tonkikh)
-
+
 	Copyright (c) 2015 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2015, 2017, 2018.
-
+
 	Copyright (c) 2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2017, 2018.
-
+
 	Copyright (c) 2015 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2018.
-
+
 	Copyright (c) 2015 Francisco Jos
-
+
 	Copyright (c) 2015 Ion Gaztanaga
-
+
 	Copyright (c) 2015 Jakub Pola <jakub.pola@gmail.com>
-
+
 	Copyright (c) 2015 Jakub Szuppe <j.szuppe@gmail.com>
-
+
 	Copyright (c) 2015 John Fletcher
-
+
 	Copyright (c) 2015 John Maddock
-
+
 	Copyright (c) 2015 Kohei Takahashi
-
+
 	Copyright (c) 2015 Mario Lang
-
+
 	Copyright (c) 2015 Muhammad Junaid Muzammil <mjunaidmuzammil@gmail.com>
-
+
 	copyright (c) 2015 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2015 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2015 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	Copyright (c) 2015 Orson Peters
 //  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:
-
+
 	Copyright (c) 2015 Orson Peters <orsonpeters@gmail.com>
     
     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.
-
+
 	Copyright (c) 2015 Paul Fultz II
-
+
 	Copyright (c) 2015 Robert Ramey
-
+
 	Copyright (C) 2015 Sebastian Redl
-
+
 	Copyright (c) 2015 Seth Heeren
-
+
 	Copyright (C) 2015 Vicente J. Botet Escriba
-
+
 	copyright (c) 2015, 2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2015, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2015, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	Copyright (c) 2015, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	Copyright (c) 2015, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2015, Oracle and/or its affiliates.
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // 
-
+
 	Copyright (C) 2015, Pauli Virtanen <pav@iki.fi>
-
+
 	Copyright (c) 2015-2016 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2018-2020.
-
+
 	copyright (c) 2015-2016 Oracle and/or its affiliates.
-
+
 	Copyright (c) 2015-2016 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2015-2016, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	Copyright (c) 2015-2017 Martin Hensel
-
+
 	copyright (c) 2015-2017 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2015-2017 The MathJax Consortium
-
+
 	copyright (c) 2015-2017, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2015-2017, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2015-2017, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (C) 2015-2018 Andrzej Krzemienski.
-
+
 	Copyright (c) 2015-2018 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2015-2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2015-2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2015-2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2015-2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2015-2019 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2015-2019 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2015-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
-
+
 	copyright (c) 2015-2019, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2015-2020 Antony Polukhin
-
+
 	Copyright (c) 2015-2020 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2015-2020.
-
+
 	Copyright (c) 2015-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2015-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
-
+
 	copyright (c) 2015-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2015-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2015-2020, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2015-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2015-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2015-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2015-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 // Contributed and/or modified by Adeel Ahmad, as part of Google Summer of Code 2018 program
-
+
 	copyright (c) 2015-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2015-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2015-2020, Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	copyright (c) 2015-2020, Oracle and/or its affiliates.
 // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2016      Kohei Takahashi
-
+
 	Copyright (C) 2016 Andrzej Krzemienski
-
+
 	Copyright (C) 2016 Andrzej Krzemienski.
-
+
 	Copyright (c) 2016 Barrett Adair
-
+
 	Copyright (c) 2016 Francisco Jos
-
+
 	Copyright (c) 2016 Francisco Jose Tapia (fjtapia@gmail.com )\n
-
+
 	Copyright (c) 2016 Frank Hein, maxence business consulting gmbh
-
+
 	Copyright (c) 2016 Jakub Szuppe <j.szuppe@gmail.com>
-
+
 	Copyright (C) 2016 K. Noel Belcourt <kbelco -at- sandia.gov>.
-
+
 	Copyright (c) 2016 Klemens D. Morgenstern
-
+
 	Copyright (c) 2016 Kohei Takahashi
-
+
 	Copyright (c) 2016 Lee Clagett
-
+
 	Copyright (c) 2016 Modified Work Barrett Adair
-
+
 	Copyright (c) 2016 Norbert Wenzel
 
 // This file was modified by Oracle on 2020.
-
+
 	copyright (c) 2016 Oracle and/or its affiliates.
-
+
 	Copyright (c) 2016 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2016 Paul Fultz II
-
+
 	Copyright (c) 2016 Peter Dimov
-
+
 	Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>, All rights reserved.
 
   Redistribution and use in source and binary forms, with or without
@@ -10379,475 +10379,475 @@ are permitted provided that the following conditions are met:
      may be used to endorse or promote products derived from this software
      without specific prior written permission.
 
-
+
 	Copyright (c) 2016, 2018 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2016, Oracle and/or its affiliates.
-
+
 	copyright (c) 2016, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2016--2017 Felix Lenders
-
+
 	Copyright (c) 2016-2017 The MathJax Consortium
-
+
 	Copyright (c) 2016-2017, Oracle and/or its affiliates.
-
+
 	Copyright (C) 2016-2018  ERGO-Code
  *
-
+
 	Copyright (C) 2016-2018  ERGO-Code
  *
  * Build initial triangular factors
-
+
 	Copyright (C) 2016-2018  ERGO-Code
  *
  * Build rowwise and columnwise form of L and U
-
+
 	Copyright (C) 2016-2018  ERGO-Code
  *
  * Computes the 1-norm and infinity-norm of the matrix that was freshly
  * factorized. Unit cols inserted by the factorization are handled implicitly.
-
+
 	Copyright (C) 2016-2018  ERGO-Code
  *
  * Data file implementation
-
+
 	Copyright (C) 2016-2018  ERGO-Code
  *
  * Depth first search in a graph
-
+
 	Copyright (C) 2016-2018  ERGO-Code
  *
  * Forrest-Tomlin update with reordering
-
+
 	Copyright (C) 2016-2018  ERGO-Code
  *
  * Functions to load/save/reset struct lu objects
-
+
 	Copyright (C) 2016-2018  ERGO-Code
  *
  * Implementation of doubly linked lists (see [1] section 5.5)
-
+
 	Copyright (C) 2016-2018  ERGO-Code
  *
  * LINPACK condition number estimate
-
+
 	Copyright (C) 2016-2018  ERGO-Code
  *
  * Stability test of fresh LU factorization based on relative residual.
-
+
 	Copyright (C) 2016-2018  ERGO-Code
  *
  * Symbolic solve with triangular matrix
-
+
 	copyright (c) 2016-2018 Oracle and/or its affiliates.
-
+
 	Copyright (c) 2016-2018 Oracle and/or its affiliates.
-
+
 	Copyright (C) 2016-2018 T. Zachary Laine
-
+
 	Copyright (C) 2016-2019  ERGO-Code
  *
  * Bump factorization driver routine
-
+
 	Copyright (C) 2016-2019  ERGO-Code
  *
  * Pivot elimination from active submatrix
-
+
 	Copyright (C) 2016-2019  ERGO-Code
  *
  * Search for pivot element with small Markowitz cost. An eligible pivot
  * must be nonzero and satisfy
-
+
 	Copyright (C) 2016-2019  ERGO-Code
  *
  * Setup data structures for bump factorization
-
+
 	Copyright (c) 2016-2019 Damian Jarek (damian dot jarek93 at gmail dot com)
-
+
 	Copyright (c) 2016-2019 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2016-2019 Viktor Kirilov
-
+
 	Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
-
+
 	copyright (c) 2016-2019, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2016-2020 Antony Polukhin
-
+
 	Copyright (c) 2016-2020 Antony Polukhin
 //
-
+
 	copyright (c) 2016-2020 Oracle and/or its affiliates.
-
+
 	Copyright (c) 2016-2020 Oracle and/or its affiliates.
-
+
 	Copyright (c) 2016-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2016-2020, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2016-2020, Oracle and/or its affiliates.
-
+
 	copyright (c) 2016-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2016-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (C) 2017
-
+
 	Copyright (c) 2017 - 2018 Andrey Semashev
  */
-
+
+	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
-	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
-
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013, 2014, 2015, 2017, 2018.
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2013-2020.
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2014-2020.
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2015, 2017, 2018, 2019.
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2015-2020.
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2015.
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2016, 2018.
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2016-2020.
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2017, 2019.
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2017-2020.
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2018.
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2019-2020.
-
+
 	Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2017 Andrey Semashev
  */
-
+
 	Copyright (C) 2017 Andrzej Krzemienski.
-
+
 	Copyright (c) 2017 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2017 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (C) 2017 Daniela Engert
-
+
 	Copyright (c) 2017 Denis Demidov <dennis.demidov@gmail.com>
-
+
 	Copyright (c) 2017 Dynatrace
-
+
 	Copyright (c) 2017 Francisco Jos
-
+
 	Copyright (c) 2017 Francisco Jose Tapia (fjtapia@gmail.com )\n
-
+
 	Copyright (C) 2017 Glen Joseph Fernandes (glenjofe@gmail.com)
-
+
 	Copyright (c) 2017 James E. King III
-
+
 	Copyright (C) 2017 James E. King III
-
+
 	Copyright (c) 2017 John Maddock
-
+
 	Copyright (c) 2017 Klemens D. Morgenstern
-
+
 	Copyright (c) 2017 Kohei Takahashi
-
+
 	Copyright (c) 2017 Kristian Popov <kristian.popov@outlook.com>
-
+
 	Copyright (C) 2017 Michel Morin.
-
+
 	copyright (c) 2017 Oracle and/or its affiliates.
-
+
 	copyright (c) 2017 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2017 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2017 Robert Ramey
-
+
 	Copyright (c) 2017 Vinnie Falco (vinnie dot falco at gmail dot com)
-
+
 	Copyright (c) 2017, 2018 James E. King III
-
+
 	Copyright (c) 2017, 2019 Oracle and/or its affiliates.
-
+
 	copyright (c) 2017, 2019 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2017, 2019, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2017, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2017, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2017-2017 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2017-2017 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2017-2018 Alexandr Poltavsky, Antony Polukhin.
-
+
 	Copyright (c) 2017-2018 Chris Beck
-
+
 	Copyright (c) 2017-2018 Oracle and/or its affiliates.
-
+
 	copyright (c) 2017-2018 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2017-2018 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
-
+
 	Copyright (c) 2017-2018 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2017-2018, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2017-2018, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2017-2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2017-2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2017-2019 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2017-2019, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2017-2019, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2017-2020 Oracle and/or its affiliates.
-
+
 	Copyright (c) 2017-2020 Oracle and/or its affiliates.
-
+
 	copyright (c) 2017-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2017-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2017-2020 Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	copyright (c) 2017-2020, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2017-2020, Oracle and/or its affiliates.
-
+
 	copyright (c) 2017-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2017-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2017-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2017-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle.
-
+
 	copyright (c) 2017-2020, Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2018 Adam Butcher, Antony Polukhin
-
+
 	Copyright (c) 2018 Adam Wulkiewicz, Lodz, Poland.
 
-
+
 	Copyright (c) 2018 Adam Wulkiewicz, Lodz, Poland.
 
 // This file was modified by Oracle on 2014, 2016, 2017.
-
+
 	Copyright (c) 2018 Adeel Ahmad, Islamabad, Pakistan.
 
 // Contributed and/or modified by Adeel Ahmad,
 //   as part of Google Summer of Code 2018 program.
-
+
 	Copyright (c) 2018 Adeel Ahmad, Islamabad, Pakistan.
 
 // Contributed and/or modified by Adeel Ahmad, as part of Google Summer of Code 2018 program.
-
+
 	Copyright (c) 2018 agate-pris
-
+
 	Copyright (C) 2018 Alain Miniussi <alain.miniussi -at- oca.eu>.
-
+
 	Copyright (C) 2018 Alain Miniussi <alain.miniussi@oca.eu>.
-
+
 	Copyright (c) 2018 Andrey Semashev
-
+
 	Copyright (c) 2018 Andrey Semashev
  */
-
+
 	Copyright (c) 2018 Artyom Beilis (Tonkikh)
-
+
 	Copyright (c) 2018 ERGO-Code. See license.txt for license.
 //
 // Example for using IPX from its C++ interface. The program solves the Netlib
 // problem afiro.
-
+
 	Copyright (c) 2018 Evgeny Shulgin
-
+
 	Copyright (c) 2018 Fady Essam
-
+
 	Copyright (c) 2018 Jakub Szuppe <j.szuppe@gmail.com>
-
+
 	Copyright (c) 2018 James E. King III
-
+
 	Copyright (c) 2018 Klemens D. Morgenstern
-
+
 	Copyright (c) 2018 Kohei Takahashi
-
+
 	copyright (c) 2018 Oracle and/or its affiliates.
-
+
 	copyright (c) 2018 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2018 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
-
+
 	Copyright (c) 2018 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2018 Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (C) 2018 Peter Dimov
-
+
 	Copyright (c) 2018 Sergei Fedorov
-
+
 	Copyright (c) 2018 Stefan Seefeld
-
+
 	Copyright (c) 2018 Sylvain Gubian <sylvain.gubian@pmi.com>,
 # Yang Xiang <yang.xiang@pmi.com>
 # Author: Sylvain Gubian, PMP S.A.
 """
 Unit tests for the dual annealing global optimizer
-
+
 	Copyright (c) 2018 Sylvain Gubian <sylvain.gubian@pmi.com>,
 # Yang Xiang <yang.xiang@pmi.com>
 # Author: Sylvain Gubian, Yang Xiang, PMP S.A.
 
-
+
 	Copyright (c) 2018 Yaghyavardhan Singh Khangarot, Hyderabad, India.
 // Contributed and/or modified by Yaghyavardhan Singh Khangarot,
 //   as part of Google Summer of Code 2018 program.
 
 // This file was modified by Oracle on 2018.
-
+
 	Copyright (c) 2018 Yi Ji
-
+
 	copyright (c) 2018, 2019, Oracle and/or its affiliates.
-
+
 	copyright (c) 2018, 2019, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2018, Cem Bassoy, cem.bassoy@gmail.com
-
+
 	copyright (c) 2018, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2018, Oracle and/or its affiliates.
-
+
 	copyright (c) 2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2018, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
-
+
 	Copyright (c) 2018, Quansight-Labs
 All rights reserved.
 
@@ -10865,25 +10865,25 @@ modification, are permitted provided that the following conditions are met:
   contributors may be used to endorse or promote products derived from
   this software without specific prior written permission.
 
-
+
 	Copyright (c) 2018-2019
-
+
 	Copyright (c) 2018-2019 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2018-2019 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2018-2019 ERGO-Code. See license.txt for license.
 
 #ifndef IPX_DIAGONAL_PRECOND_H_
 #define IPX_DIAGONAL_PRECOND_H_
-
+
 	Copyright (c) 2018-2019 ERGO-Code. See license.txt for license.
 
 #ifndef IPX_KKT_SOLVER_DIAG_H_
 #define IPX_KKT_SOLVER_DIAG_H_
-
+
 	Copyright (c) 2018-2019 ERGO-Code. See license.txt for license.
 
 #include "diagonal_precond.h"
@@ -10891,277 +10891,277 @@ modification, are permitted provided that the following conditions are met:
 #include <cmath>
 #include <vector>
 #include "timer.h"
-
+
 	Copyright (c) 2018-2019 ERGO-Code. See license.txt for license.
 
 #include "kkt_solver_diag.h"
 #include <cassert>
 #include <cmath>
 #include "conjugate_residuals.h"
-
+
 	Copyright (c) 2018-2019 Oracle and/or its affiliates.
-
+
 	Copyright (c) 2018-2019, Cem Bassoy, cem.bassoy@gmail.com
-
+
 	copyright (c) 2018-2019, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2018-2019, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2018-2020 Antony Polukhin
-
+
 	Copyright (c) 2018-2020 Emil Dotchevski and Reverge Studios, Inc.
-
+
 	copyright (c) 2018-2020 Oracle and/or its affiliates.
-
+
 	Copyright (c) 2018-2020 Oracle and/or its affiliates.
-
+
 	copyright (c) 2018-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2018-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2018-2020 Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	copyright (c) 2018-2020, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2018-2020, Oracle and/or its affiliates.
-
+
 	copyright (c) 2018-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2018-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2018-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2018-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2018-2020, Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2018-2021  ERGO-Code
-
+
 	Copyright (c) 2019 - 2020 Alexander Grund
-
+
 	Copyright (c) 2019 agate-pris
-
+
 	Copyright (c) 2019 Andrey Semashev
-
+
+	Copyright (c) 2019 Barend Gehrels, Amsterdam, the Netherlands.
+
 	Copyright (c) 2019 Barend Gehrels, Amsterdam, the Netherlands.
 
-	Copyright (c) 2019 Barend Gehrels, Amsterdam, the Netherlands.
-
-
+
 	Copyright (c) 2019 Damian Jarek(damian.jarek93@gmail.com)
-
+
 	Copyright (c) 2019 Dario Menendez, Banco Santander
-
+
 	Copyright (c) 2019 Joel de Guzman
-
+
 	Copyright (c) 2019 Klemens D. Morgenstern
-
+
 	Copyright (C) 2019 Max-Planck-Society
-
+
 	Copyright (c) 2019 Mika Fischer (mika.fischer@zoopnet.de)
-
+
 	copyright (c) 2019 Oracle and/or its affiliates.
-
+
 	copyright (c) 2019 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2019 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (C) 2019 Peter Bell
  *  \author Martin Reinecke
  *  \author Peter Bell
  */
-
+
 	Copyright (c) 2019 Peter Dimov (pdimov at gmail dot com),
 //                    Vinnie Falco (vinnie.falco@gmail.com)
-
+
 	Copyright (C) 2019 T. Zachary Laine
-
+
 	Copyright (c) 2019 Vinnie Falco (vinnie.falco@gmail.com)
-
+
 	Copyright (c) 2019, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2019, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2019-2019 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2019-2020 Alexander Grund
-
+
 	Copyright (c) 2019-2020 Antony Polukhin
-
+
 	Copyright (c) 2019-2020 Antony Polukhin.
-
+
 	Copyright (c) 2019-2020 Krystian Stasiowski (sdkrystian at gmail dot com)
-
+
 	copyright (c) 2019-2020 Oracle and/or its affiliates.
-
+
 	copyright (c) 2019-2020 Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (C) 2019-2020 Peter Bell
 
 For the odd-sized DCT-IV transforms:
-
+
 	Copyright (c) 2019-2020, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2019-2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	Copyright (c) 2020
-
+
 	Copyright (c) 2020      Jeff Trull
-
+
 	Copyright (c) 2020 Alexander Grund
-
+
 	Copyright (c) 2020 Andrey Semashev
-
+
 	Copyright (c) 2020 Andrey Semashev
  */
-
+
 	Copyright (c) 2020 Barend Gehrels, Amsterdam, the Netherlands.
-
+
 	Copyright (c) 2020 Barend Gehrels, Amsterdam, the Netherlands.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2020 Caian Benedicto, Campinas, Brazil.
 //
 // This file was modified by Oracle on 2019-2020.
-
+
 	Copyright (c) 2020 Caian Benedicto, Campinas, Brazil.
 //
 // This file was modified by Oracle on 2019.
-
+
 	Copyright (c) 2020 Digvijay Janartha, Hamirpur, India.
 
 // This file was modified by Oracle on 2020.
-
+
 	Copyright (c) 2020 John Maddock
-
+
 	Copyright (c) 2020 Krystian Stasiowski (sdkrystian at gmail dot com)
-
+
 	Copyright (c) 2020 Krystian Stasiowski (sdkrystian@gmail.com)
-
+
 	Copyright (c) 2020 Michael Feldmeier
-
+
 	Copyright (c) 2020 Nikita Kniazev
-
+
 	copyright (c) 2020 Oracle and/or its affiliates.
-
+
 	copyright (c) 2020 Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2020 Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2020 Richard Hodges (hodges.r@gmail.com)
-
+
 	Copyright (c) 2020 Vinnie Falco (vinnie.falco@gmail.com)
-
+
 	Copyright (c) 2020, Debabrata Mandal <mandaldebabrata123@gmail.com>
-
+
 	copyright (c) 2020, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2020, Oracle and/or its affiliates.
-
+
 	Copyright (c) 2020, Oracle and/or its affiliates.
 
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
-
+
 	copyright (c) 2020, Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2020, Oracle and/or its affiliates.
 // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
 
 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-
+
 	Copyright (c) 2021 ERGO-Code
 
-
+
 	Copyright (c) 2021 Orson Peters
 
     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.
-
+
 	Copyright (c) 2021 Orson Peters <orsonpeters@gmail.com>
 
 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.
-
+
 	Copyright (c) 2021-04-21 St
-
+
 	Copyright (c) 2022 ERGO-Code under MIT licence terms\n");
 }
-
+
 	Copyright (c) 2022 Two Blue Cubes Ltd. All rights reserved.
-
+
 	Copyright (c) 2106 Klemens D. Morgenstern
-
+
 	Copyright (c) Aaron Windsor 2007
-
+
 	Copyright (c) Alexander Zaitsev <zamazan4ik@gmail.by>, 2017.
-
+
 	Copyright (c) Alexander Zaitsev <zamazan4ik@gmail.com>, 2016
-
+
 	Copyright (c) Alexander Zaitsev <zamazan4ik@gmail.com>, 2017
-
+
 	Copyright (c) Andrey Semashev 2017
-
+
 	Copyright (c) Beman Dawes 2011
-
+
 	Copyright (c) Beman Dawes 2015
-
+
 	Copyright (C) Benjamin Sobotta 2012
-
+
 	Copyright (c) Charles Karney (2008-2017) <charles@karney.com> and licensed
-
+
 	Copyright (c) Chris Glover, 2016.
 //
-
+
 	Copyright (C) Christof Meerwald 2003
-
+
 	Copyright (c) Christopher Diggins 2005
-
+
 	Copyright (C) Damian Eads, 2007-2008. New BSD License.
 
 # hierarchy.py (derived from cluster.py, http://scipy-cluster.googlecode.com)
-
+
 	Copyright (C) Damian Eads, 2007-2008. New BSD License.
 
 __all__ = [
@@ -11195,11 +11195,11 @@ __all__ = [
     'sqeuclidean',
     'squareform',
     'yule'
-
+
 	Copyright (C) Dan Watkins 2003
-
+
 	Copyright (c) David Abrahams 2001.
-
+
 	Copyright (c) Donald Stufft and individual contributors.
 # All rights reserved.
 
@@ -11213,41 +11213,41 @@ __all__ = [
 #        notice, this list of conditions and the following disclaimer in the
 #        documentation and/or other materials provided with the distribution.
 
-
+
 	Copyright (c) Douglas Gregor 2004
-
+
 	Copyright (C) Douglas Gregor 2008
-
+
 	Copyright (c) Glen Joseph Fernandes 2019 (glenjofe@gmail.com)
-
+
 	Copyright (c) Intel Corporation 2008.
-
+
 	Copyright (c) Jeremy Siek 2001
-
+
 	Copyright (c) Jeremy Siek 2001, Marc Wintermantel 2002
-
+
 	Copyright (c) Jeremy Siek 2001-2003.
-
+
 	Copyright (c) Kevlin Henney 2001
-
+
 	Copyright (c) Marshall Clow 2008-2012.
-
+
 	Copyright (c) Marshall Clow 2010-2012.
-
+
 	Copyright (c) Marshall Clow 2011-2012.
-
+
 	Copyright (c) Marshall Clow 2012-2012.
-
+
 	Copyright (c) Marshall Clow 2012-2015.
-
+
 	Copyright (c) Marshall Clow 2014.
-
+
 	Copyright (c) Marshall Clow 2017.
-
+
 	Copyright (c) Microsoft Corporation 2014
-
+
 	Copyright (c) Pablo Aguilar 2005
-
+
 	Copyright (C) Piers Lawrence.
   All rights reserved.
 
@@ -11265,599 +11265,599 @@ __all__ = [
   may be used to endorse or promote products derived from this software without
   specific prior written permission.
 
-
+
 	Copyright (c) T. Zachary Laine 2018.
-
+
 	Copyright (c) Thomas Witt 2002.
-
+
 	Copyright (c) Tobias Schwinger
-
+
 	Copyright (C) Vladimir Prus 2003
-
+
 	Copyright (C) Vladimir Prus 2003.
-
+
 	Copyright 1984 - 1994 by Stephen L. Moshier
  *                                                                           *
  *   Alternatively, we also can use the functions from the Rmath library     *
  *   from the R project for statistical computing, http://www.R-project.org/ *
-
+
 	Copyright 1984, 1987 by Stephen L. Moshier
  * Direct inquiries to 30 Frost Street, Cambridge, MA 02140
  */
-
+
 	Copyright 1984, 1987, 1988 by Stephen L. Moshier
  * Direct inquiries to 30 Frost Street, Cambridge, MA 02140
  */
-
+
 	Copyright 1984, 1987, 1988 by Stephen L. Moshier
 Direct inquiries to 30 Frost Street, Cambridge, MA 02140
 */
-
+
 	Copyright 1984, 1987, 1988, 1992 by Stephen L. Moshier
  * Direct inquiries to 30 Frost Street, Cambridge, MA 02140
  */
-
+
 	Copyright 1984, 1987, 1988, 1992, 2000 by Stephen L. Moshier
 */
-
+
 	Copyright 1984, 1987, 1988, 2000 by Stephen L. Moshier
  *
  * And other parts:
  *
-
+
 	Copyright 1984, 1987, 1988, 2000 by Stephen L. Moshier
  */
-
+
 	Copyright 1984, 1987, 1989 by Stephen L. Moshier
  * Direct inquiries to 30 Frost Street, Cambridge, MA 02140
  *
  * Feb, 2002:  altered by Travis Oliphant
  * so that it is called with argument m
  * (which gets immediately converted to m1 = 1-m)
-
+
 	Copyright 1984, 1987, 1989 by Stephen L. Moshier
  * Direct inquiries to 30 Frost Street, Cambridge, MA 02140
  */
-
+
 	Copyright 1984, 1987, 1989 by Stephen L. Moshier
  * Direct inquiries to 30 Frost Street, Cambridge, MA 02140
  */
 #include <Python.h>
 #include <numpy/npy_math.h>
-
+
 	Copyright 1984, 1987, 1989, 1992 by Stephen L. Moshier
  * Direct inquiries to 30 Frost Street, Cambridge, MA 02140
  */
-
+
 	Copyright 1984, 1987, 1989, 1992, 2000 by Stephen L. Moshier
  */
-
+
 	Copyright 1984, 1987, 1989, 1992, 2000 by Stephen L. Moshier
 */
-
+
 	Copyright 1984, 1987, 1989, 1995 by Stephen L. Moshier
  */
-
+
 	Copyright 1984, 1987, 1989, 1995 by Stephen L. Moshier
 */
-
+
 	Copyright 1984, 1987, 1989, 2000 by Stephen L. Moshier
  */
-
+
 	Copyright 1984, 1987, 1989, 2000 by Stephen L. Moshier
 */
-
+
 	Copyright 1984, 1987, 1992, 2000 by Stephen L. Moshier
  */
-
+
 	Copyright 1984, 1987, 1993 by Stephen L. Moshier
  * Direct inquiries to 30 Frost Street, Cambridge, MA 02140
  */
-
+
 	Copyright 1984, 1987, 1995 by Stephen L. Moshier
  */
-
+
 	Copyright 1984, 1987, 2000 by Stephen L. Moshier
  */
-
+
 	Copyright 1984, 1991 by Stephen L. Moshier
  * Direct inquiries to 30 Frost Street, Cambridge, MA 02140
  */
-
+
 	Copyright 1984, 1995 by Stephen L. Moshier
  */
-
+
 	Copyright 1984, 1995, 2000 by Stephen L. Moshier
 
   This software is derived from the Cephes Math Library and is
   incorporated herein by permission of the author.
-
+
 	Copyright 1984, 1995, 2000 by Stephen L. Moshier
 */
-
+
 	Copyright 1984, 1996 by Stephen L. Moshier
  */
-
+
 	Copyright 1985 by Stephen L. Moshier
  * Direct inquiries to 30 Frost Street, Cambridge, MA 02140 */
 
 /* Sources
  * [1] NIST, "The Digital Library of Mathematical Functions", dlmf.nist.gov
-
+
 	Copyright 1985, 1987 by Stephen L. Moshier
  * Direct inquiries to 30 Frost Street, Cambridge, MA 02140
  */
-
+
 	Copyright 1985, 1987 by Stephen L. Moshier
  * Direct inquiries to 30 Frost Street, Cambridge, MA 02140 */
 
 #include "mconf.h"
-
+
 	Copyright 1985, 1987, 1989 by Stephen L. Moshier
  * Direct inquiries to 30 Frost Street, Cambridge, MA 02140
  */
-
+
 	Copyright 1985, 1987, 2000 by Stephen L. Moshier
  */
-
+
 	Copyright 1985, 1987, 2000 by Stephen L. Moshier
 */
-
+
 	Copyright 1987-, A. Volgenant/Amsterdam School of Economics,
-
+
 	Copyright 1991: Dieter Kraft, FHM
 C*                                                                     *
 C***********************************************************************
 
       INTEGER          il, im, ir, is, iter, iu, iv, iw, ix, l_w, l_jw,
      *                 jw(l_jw), la, m, meq, mineq, mode, n
-
+
 	Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
-
+
 	Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
 // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
 //
-
+
 	Copyright 1997-2001 University of Notre Dame.
-
+
 	Copyright 1997-2008 by Agner Fog.
-
+
 	Copyright 1999 Travis Oliphant
-
+
 	Copyright 1999, 2000 Jaakko Jarvi (jaakko.jarvi@cs.utu.fi)
-
+
 	Copyright 1999-2003 Aleksey Gurtovoy.  Use, modification, and distribution are
-
+
 	Copyright 2000 by Alan Genz.
-
+
 	Copyright 2000 Jens Maurer
-
+
 	Copyright 2000 Jeremy Siek (jsiek@lsc.nd.edu)
-
+
 	Copyright 2000 John Maddock (john@johnmaddock.co.uk)
-
+
 	Copyright 2000 University of Notre Dame.
-
+
 	Copyright 2001 Indiana University
-
+
 	Copyright 2001 John Maddock.
-
+
 	Copyright 2001 Universite Joseph Fourier, Grenoble.
-
+
 	Copyright 2001 University of Notre Dame.
-
+
 	Copyright 2001, 2003, 2004, 2012 Daryle Walker.  Use, modification, and
-
+
 	Copyright 2001, 2004, 2011 Daryle Walker.
-
+
 	Copyright 2002 Aleksey Gurtovoy (agurtovoy@meta-comm.com)
-
+
 	Copyright 2002 Brad King and Douglas Gregor
-
+
 	Copyright 2002 Daryle Walker
-
+
 	Copyright 2002 Gary Strangman.  All rights reserved
-
+
 	Copyright 2002 H Lohninger, TU Wein
-
+
 	Copyright 2002 Herv
-
+
 	Copyright 2002 Indiana University.
-
+
 	Copyright 2002 Marc Wintermantel (wintermantel@even-ag.ch)
-
+
 	Copyright 2002 Pearu Peterson all rights reserved,
-
+
 	Copyright 2002 Rensselaer Polytechnic Institute
-
+
+	Copyright 2002 The Trustees of Indiana University.
+
 	Copyright 2002 The Trustees of Indiana University.
 
-	Copyright 2002 The Trustees of Indiana University.
-
-
+
 	Copyright 2002, 2005 Daryle Walker
-
+
 	Copyright 2002, 2005 Daryle Walker.  Use, modification, and distribution
-
+
 	Copyright 2002, 2009 Peter Dimov
-
+
 	Copyright 2002, 2009, 2014 Peter Dimov
-
+
 	Copyright 2002, 2020 Peter Dimov
-
+
 	Copyright 2002-2003 Guillaume Melquiond
-
+
 	Copyright 2002-2003 Herv
-
+
 	Copyright 2002-2006 Andreas Huber Doenni
-
+
 	Copyright 2002-2007 Andreas Huber Doenni
-
+
 	Copyright 2002-2008 Andreas Huber Doenni
-
+
 	Copyright 2002-2008 by Agner Fog.
-
+
 	Copyright 2002-2010 Andreas Huber Doenni
-
+
 	Copyright 2002-2014 by Agner Fog.
-
+
 	Copyright 2002-2016 The SciPy Developers
 #
 # The original code from Gary Strangman was heavily adapted for
 # use in SciPy by Travis Oliphant.  The original code came with the
 # following disclaimer:
 #
-
+
 	Copyright 2002-2018 Peter Dimov
-
+
 	Copyright 2003 (c) The Trustees of Indiana University.
-
+
 	Copyright 2003 - 2011  LASMEA UMR 6602 CNRS/Univ. Clermont II
-
+
 	Copyright 2003 Bruce Barr
-
+
 	Copyright 2003 Guillaume Melquiond
-
+
 	Copyright 2003 Guillaume Melquiond, Sylvain Pion
-
+
 	Copyright 2003 Jeremy Siek
-
+
 	Copyright 2003 The Trustees of Indiana University
 
 Authors: Jaakko Jarvi (jajarvi at osl.iu.edu)
          Jeremiah Willcock (jewillco at osl.iu.edu)
          Andrew Lumsdaine (lums at osl.iu.edu)
-
+
 	Copyright 2003-2005 Peter Dimov
-
+
 	Copyright 2003-2008 Joaquin M Lopez Munoz.
-
+
 	Copyright 2003-2013 Joaquin M Lopez Munoz.
-
+
 	Copyright 2003-2014 Joaquin M Lopez Munoz.
-
+
 	Copyright 2003-2015 Joaquin M Lopez Munoz.
-
+
 	Copyright 2003-2016 Joaquin M Lopez Munoz.
-
+
 	Copyright 2003-2017 Joaquin M Lopez Munoz.
-
+
 	Copyright 2003-2018 Joaquin M Lopez Munoz.
-
+
 	Copyright 2003-2019 Joaquin M Lopez Munoz.
-
+
 	Copyright 2003-2020 Joaquin M Lopez Munoz.
-
+
 	copyright 2004 Brian Ravnsgaard Riis
-
+
 	Copyright 2004 Eric Niebler
 
 #ifndef BOOST_PHOENIX_ALGORITHM_DETAIL_BEGIN_HPP
 #define BOOST_PHOENIX_ALGORITHM_DETAIL_BEGIN_HPP
-
+
 	Copyright 2004 Eric Niebler
 
 #ifndef BOOST_PHOENIX_ALGORITHM_DETAIL_DECAY_ARRAY_HPP
 #define BOOST_PHOENIX_ALGORITHM_DETAIL_DECAY_ARRAY_HPP
-
+
 	Copyright 2004 Eric Niebler
 
 #ifndef BOOST_PHOENIX_ALGORITHM_DETAIL_END_HPP
 #define BOOST_PHOENIX_ALGORITHM_DETAIL_END_HPP
-
+
 	Copyright 2004 Eric Niebler
 
 #ifndef BOOST_PHOENIX_ALGORITHM_ITERATION_HPP
 #define BOOST_PHOENIX_ALGORITHM_ITERATION_HPP
-
+
 	Copyright 2004 Eric Niebler
 
 #ifndef BOOST_PHOENIX_ALGORITHM_QUERYING_HPP
 #define BOOST_PHOENIX_ALGORITHM_QUERYING_HPP
-
+
 	Copyright 2004 Eric Niebler
 
 #ifndef BOOST_PHOENIX_ALGORITHM_TRANSFORMATION_HPP
 #define BOOST_PHOENIX_ALGORITHM_TRANSFORMATION_HPP
-
+
 	Copyright 2004 Eric Niebler
 ///////////////////////////////////////////////////////////////////////////////
-
+
 	Copyright 2004 Eric Niebler.
-
+
 	Copyright 2004 The Trustees of Indiana University
-
+
 	Copyright 2004 The Trustees of Indiana University.
-
+
 	Copyright 2004, 2005 The Trustees of Indiana University.
-
+
 	Copyright 2004, 2005 Trustees of Indiana University
-
+
 	Copyright 2004-2005 by Enthought, Inc.
-
+
 	Copyright 2004-2005 by Enthought, Inc.
 #
-
+
 	Copyright 2004-2005 Peter Dimov
-
+
 	Copyright 2004-2006 Peter Dimov
-
+
 	Copyright 2004-2006 The Trustees of Indiana University.
-
+
 	Copyright 2004-2008 by Agner Fog.
-
+
 	Copyright 2004-2008 Peter Dimov
-
+
 	Copyright 2004-2013 by Agner Fog.
-
+
 	Copyright 2004-5 The Trustees of Indiana University.
-
+
 	Copyright 2004-9 Trustees of Indiana University
-
+
 	Copyright 2005 Alexander Nasonov.
-
+
 	Copyright 2005 Ben Hutchings
-
+
 	Copyright 2005 Dan Marsden.
-
+
 	Copyright 2005 Daniel Egloff, Eric Niebler. Distributed under the Boost
-
+
 	Copyright 2005 Daniel Egloff, Olivier Gygi. Distributed under the Boost
-
+
 	Copyright 2005 Daniel Egloff. Distributed under the Boost
-
+
 	Copyright 2005 Daniel Wallin.
-
+
 	Copyright 2005 David Abrahams and Aleksey Gurtovoy. Distributed
-
+
 	Copyright 2005 Douglas Gregor.
-
+
 	Copyright 2005 Eric Niebler, Daniel Egloff. Distributed under the Boost
-
+
 	Copyright 2005 Eric Niebler, Michael Gauckler. Distributed under the Boost
-
+
 	Copyright 2005 Eric Niebler.
-
+
 	Copyright 2005 Eric Niebler. Distributed under the Boost
-
+
 	Copyright 2005 Felix H
-
+
 	Copyright 2005 Guillaume Melquiond
-
+
 	Copyright 2005 Jeremy G. Siek
-
+
 	Copyright 2005 Joel de Guzman.
-
+
 	Copyright 2005 Matthias Troyer.
-
+
 	Copyright 2005 Peter Dimov
-
+
 	Copyright 2005 The Trustees of Indiana University.
-
+
 	Copyright 2005 Travis Oliphant
-
+
 	Copyright 2005 Trustees of Indiana University
-
+
 	Copyright 2005, 2014 Peter Dimov
-
+
 	Copyright 2005-2006 Andreas Huber Doenni
-
+
 	Copyright 2005-2007 Adobe Systems Incorporated
-
+
 	Copyright 2005-2008 Andreas Huber Doenni
-
+
 	Copyright 2005-2009 Daniel James.
-
+
 	Copyright 2005-2009 The Trustees of Indiana University.
-
+
 	Copyright 2005-2011 Daniel James.
-
+
 	Copyright 2005-2012 Daniel James.
-
+
 	Copyright 2005-2013 Peter Dimov
-
+
 	Copyright 2005-2014 Daniel James.
-
+
 	Copyright 2006      Ion Gaztanaga
-
+
 	Copyright 2006 Andy Tompkins.
-
+
 	Copyright 2006 Daniel Egloff, Olivier Gygi. Distributed under the Boost
-
+
 	Copyright 2006 Douglas Gregor <doug.gregor -at- gmail.com>.
-
+
 	Copyright 2006 Eric Niebler, Olivier Gygi. Distributed under the Boost
-
+
 	Copyright 2006 Eric Niebler. Distributed under the Boost
-
+
 	Copyright 2006 Johan Rade
-
+
 	Copyright 2006 John Maddock
-
+
 	Copyright 2006 Michael van der Westhuizen
-
+
 	Copyright 2006 Olivier Gygi, Daniel Egloff. Distributed under the Boost
-
+
 	Copyright 2006 Roland Schwarz.
-
+
 	Copyright 2006 The Trustees of Indiana University.
-
+
 	Copyright 2006 Thorsten Ottosen.
-
+
 	Copyright 2006 Trustees of Indiana University
-
+
 	Copyright 2006, 2020 Peter Dimov
-
+
 	Copyright 2006, Eric Niebler, Olivier Gygi. Distributed under the Boost
-
+
 	Copyright 2006-2007 Boris Gubenko
-
+
 	Copyright 2006-2008 Joaquin M Lopez Munoz.
-
+
 	Copyright 2006-2009 Joaquin M Lopez Munoz.
-
+
 	Copyright 2006-2011 Joaquin M Lopez Munoz.
-
+
 	Copyright 2006-2013 Joaquin M Lopez Munoz.
-
+
 	Copyright 2006-2014 Joaquin M Lopez Munoz.
-
+
 	Copyright 2006-2015 Joaquin M Lopez Munoz.
-
+
 	Copyright 2006-2018 Joaquin M Lopez Munoz.
-
+
 	Copyright 2006-2019 Joaquin M Lopez Munoz.
-
+
 	Copyright 2006-2020 Joaquin M Lopez Munoz.
-
+
 	Copyright 2007 Aaron Windsor
-
+
 	Copyright 2007 Alexandre Courpron
 //
 // Permission to use, copy, modify, redistribute and sell this software,
 // provided that this copyright notice appears on all copies of the software.
-
+
 	Copyright 2007 Andy Tompkins.
-
+
 	Copyright 2007 Baruch Zilber
-
+
 	Copyright 2007 Boris Gubenko
-
+
 	Copyright 2007 Christian Henning
-
+
 	Copyright 2007 David Jenkins.
-
+
 	Copyright 2007 Eric Niebler.
-
+
 	Copyright 2007 Peter Dimov
-
+
 	Copyright 2007 Stanford University
-
+
 	Copyright 2007 Tobias Schwinger
 
-
+
 	Copyright 2007 University of Karlsruhe
-
+
 	Copyright 2007, 2014 Peter Dimov
-
+
 	Copyright 2007, 2019 Peter Dimov
-
+
 	Copyright 2007, 2020 Peter Dimov
-
+
 	Copyright 2007-2008 Andreas Pokorny, Christian Henning
-
+
 	Copyright 2007-2008 Christian Henning
-
+
 	Copyright 2007-2008 Christian Henning, Andreas Pokorny
-
+
 	Copyright 2007-2008 Christian Henning, Andreas Pokorny, Lubomir Bourdev
-
+
 	Copyright 2007-2012 Christian Henning, Andreas Pokorny
-
+
 	Copyright 2007-2012 Christian Henning, Andreas Pokorny, Lubomir Bourdev
-
+
 	Copyright 2007-2012 Christian Henning, Lubomir Bourdev
-
+
 	Copyright 2007-2012 Ion Gaztanaga
-
+
 	Copyright 2008
-
+
 	Copyright 2008 Adobe Systems Incorporated
-
+
 	Copyright 2008 Andreas Huber Doenni
-
+
 	Copyright 2008 Beman Dawes
-
+
 	Copyright 2008 Christian Henning
-
+
 	Copyright 2008 Christian Henning, Lubomir Bourdev
-
+
 	Copyright 2008 Christophe Henry
-
+
 	Copyright 2008 Christophe Henry
 // henry UNDERSCORE christophe AT hotmail DOT com
 // This is taken from Boost.Proto's documentation
-
+
 	Copyright 2008 David Jenkins.
-
+
 	Copyright 2008 Eric Niebler.
-
+
 	Copyright 2008 Eric Niebler. Distributed
-
+
 	Copyright 2008 Eric Niebler. Distributed under the Boost
-
+
 	Copyright 2008 Gautam Sewani
-
+
 	Copyright 2008 Hartmut Kaiser.
-
+
 	Copyright 2008 Howard Hinnant
-
+
 	Copyright 2008 Intel Corporation
-
+
 	Copyright 2008 Joaquin M Lopez Munoz.
-
+
 	Copyright 2008 John Maddock
-
+
 	Copyright 2008 Peter Dimov
-
+
 	Copyright 2008, 2020 Peter Dimov
-
+
 	Copyright 2008, 2020 Peter Dimov
 //
 // inline void boost::detail::yield( unsigned k );
-
+
 	Copyright 2008,2012 Peter Dimov
-
+
 	Copyright 2008-2009 Frank Mori Hess
-
+
 	Copyright 2008-2010 Gordon Woodhull
-
+
 	Copyright 2009 (C) Dean Michael Berris <me@deanberris.com>
-
+
 	Copyright 2009 - 2011  LRI    UMR 8623 CNRS/Univ Paris Sud XI
-
+
 	Copyright 2009 Andy Tompkins.
-
+
 	Copyright 2009 Christian Henning
-
+
 	Copyright 2009 Eric Niebler. Distributed under the Boost
-
+
 	Copyright 2009 Neil Groves.
-
+
 	Copyright 2009 Steven Watanabe
-
+
 	Copyright 2009 The Trustees of Indiana University.
-
+
 	Copyright 2009 Trustees of Indiana University
-
+
 	Copyright 2009 Trustees of Indiana University.
-
+
 	Copyright 2009 Vicente J. Botet Escriba
-
+
 	Copyright 2009, Andrew Sutton
-
+
 	Copyright 2009-2010 Vicente J. Botet Escriba
-
+
 	Copyright 2009-2010 Vicente J. Botet Escriba
 //
 //  Simplified and modified to be able to support exceptionless (-fno-exceptions).
@@ -11866,68 +11866,68 @@ Authors: Jaakko Jarvi (jajarvi at osl.iu.edu)
 //  boost::throw_exception(std::exception const&) implementation
 //  in Boost.Chrono:
 //
-
+
 	Copyright 2009-2011 Karsten Ahnert
-
+
 	Copyright 2009-2011 Mario Mulansky
-
+
 	Copyright 2009-2011 Vicente J. Botet Escriba
-
+
 	Copyright 2009-2012 Karsten Ahnert
-
+
 	Copyright 2009-2012 Mario Mulansky
-
+
 	Copyright 2009-2012 Vicente J. Botet Escriba
-
+
 	Copyright 2009-2013 Karsten Ahnert
-
+
 	Copyright 2009-2013 Mario Mulansky
-
+
 	Copyright 2009-2014 Neil Groves.
-
+
 	Copyright 2009-2015 Mario Mulansky
-
+
 	Copyright 2010 Andy Tompkins.
-
+
 	Copyright 2010 Beman Dawes
 
-
+
 	Copyright 2010 Christian Henning
-
+
 	Copyright 2010 Daniel Wallin, Eric Niebler. Distributed under the Boost
-
+
 	Copyright 2010 Eric Niebler.
-
+
 	Copyright 2010 Eric Niebler. Distributed under the Boost
-
+
 	Copyright 2010 Fabien Castan, Christian Henning
-
+
 	Copyright 2010 Gaetano Mendola, 2011 Simon West. Distributed under the Boost
-
+
 	Copyright 2010 John Maddock
-
+
 	Copyright 2010 Kenneth Riddile
-
+
 	Copyright 2010 Mario Mulansky
-
+
 	Copyright 2010 Paul A. Bristow
-
+
 	Copyright 2010 The Trustees of Indiana University.
-
+
 	Copyright 2010 Thomas Claveirole
-
+
 	Copyright 2010 Vicente J. Botet Escriba
-
+
 	Copyright 2010-2011 Karsten Ahnert
-
+
 	Copyright 2010-2011 Mario Mulansky
-
+
 	Copyright 2010-2012 Karsten Ahnert
-
+
 	Copyright 2010-2012 Kenneth Riddile, Christian Henning
-
+
 	Copyright 2010-2012 Mario Mulansky
-
+
 	Copyright 2010-2012, D. E. Shaw Research.
         // All rights reserved.
 
@@ -11946,477 +11946,477 @@ Authors: Jaakko Jarvi (jajarvi at osl.iu.edu)
         //   contributors may be used to endorse or promote products derived from
         //   this software without specific prior written permission.
 
-
+
 	Copyright 2010-2013 Karsten Ahnert
-
+
 	Copyright 2010-2013 Mario Mulansky
-
+
 	Copyright 2010-2014 Mario Mulansky
-
+
 	Copyright 2010-2015 Mario Mulansky
-
+
 	Copyright 2011         Eric Niebler
-
+
 	Copyright 2011 - 2013 John Maddock. Distributed under the Boost
-
+
 	Copyright 2011 -2013 John Maddock. Distributed under the Boost
-
+
 	Copyright 2011 Christophe Henry
-
+
 	Copyright 2011 Eric Niebler. Distributed under the Boost
-
+
 	Copyright 2011 Garmin Ltd. or its subsidiaries
-
+
 	Copyright 2011 John Maddock
-
+
 	Copyright 2011 John Maddock. Distributed under the Boost
-
+
 	Copyright 2011 Karsten Ahnert
-
+
 	Copyright 2011 Mario Mulansky
-
+
 	Copyright 2011 Paul A. Bristow
-
+
 	Copyright 2011 Paul A. Bristow  To incorporate into Boost.Math
-
+
 	Copyright 2011 Simon West. Distributed under the Boost
-
+
 	Copyright 2011 Steven Watanabe
-
+
 	Copyright 2011 Vicente J. Botet Escriba
-
+
 	Copyright 2011, 2012 Paul A. Bristow
-
+
 	Copyright 2011-2012 Karsten Ahnert
-
+
 	Copyright 2011-2012 Mario Mulansky
-
+
 	Copyright 2011-2012 Steven Watanabe
-
+
 	Copyright 2011-2013 Karsten Ahnert
-
+
 	Copyright 2011-2013 Mario Mulansky
-
+
 	Copyright 2011-2013 Thorsten Ottosen
 
-
+
 	Copyright 2011-2015 Mario Mulansky
-
+
 	Copyright 2012 (C) Google, Inc.
-
+
 	Copyright 2012 (C) Jeffrey Lee Hellrung, Jr.
-
+
 	Copyright 2012 Andreas Pokorny
-
+
 	Copyright 2012 Christian Henning
-
+
 	Copyright 2012 Christian Henning, Andreas Pokorny, Lubomir Bourdev
-
+
 	Copyright 2012 Christoph Koke
-
+
 	Copyright 2012 Chung-Lin Wen
-
+
 	Copyright 2012 Chung-Lin Wen, Davide Anastasia
-
+
 	Copyright 2012 Denis Demidov
-
+
 	Copyright 2012 Eric Niebler. Distributed under the Boost
-
+
 	Copyright 2012 Fernando Vilas
-
+
 	Copyright 2012 IBM Corp.
-
+
 	Copyright 2012 John Maddock.
-
+
 	Copyright 2012 John Maddock. Distributed under the Boost
-
+
 	Copyright 2012 K R Walker
-
+
 	Copyright 2012 Karsten Ahnert
-
+
 	Copyright 2012 Kenneth Riddile, Christian Henning
-
+
 	Copyright 2012 Lucanus Simonson
-
+
 	Copyright 2012 Mario Mulansky
-
+
 	Copyright 2012 Olivier Tournaire
-
+
 	Copyright 2012 Olivier Tournaire, Christian Henning
-
+
 	Copyright 2012 Paul A. Bristow with new tests.
-
+
 	Copyright 2012 Steven Watanabe
-
+
 	Copyright 2012 The Trustees of Indiana University.
-
+
 	Copyright 2012 Vicente J. Botet Escriba
-
+
 	Copyright 2012, Philipp Moeller
-
+
 	Copyright 2012-20 John Maddock.
-
+
 	Copyright 2012-2013 Andreas Angelopoulos
-
+
 	Copyright 2012-2013 Karsten Ahnert
-
+
 	Copyright 2012-2013 Mario Mulansky
-
+
 	Copyright 2012-2013 Steven Watanabe
-
+
 	Copyright 2012-2015 Mario Mulansky
-
+
 	Copyright 2012-2019 Glen Joseph Fernandes
-
+
 	Copyright 2012-2020 Antony Polukhin.
-
+
 	Copyright 2012-2020 Antony Polukhin.
 //
-
+
 	Copyright 2012-2020 John Maddock.
-
+
 	Copyright 2013 Andrea Gavana
 Author: <andrea.gavana@gmail.com>
 
 Modifications 2014 Andrew Nelson
 <andyfaff@gmail.com>
-
+
 	Copyright 2013 Andrey Semashev
-
+
 	Copyright 2013 Ankur Sinha
-
+
 	Copyright 2013 Christian Henning
-
+
 	Copyright 2013 Christian Henning and Juan V. Puertos
-
+
 	Copyright 2013 Christian Shelton
-
+
 	Copyright 2013 Christopher Kormanyos
-
+
 	Copyright 2013 Cromwell D. Enage
-
+
 	Copyright 2013 John Maddock
-
+
 	Copyright 2013 John Maddock. Distributed under the Boost
-
+
 	Copyright 2013 Juan V. Puertos G-Cluster, Christian Henning
-
+
 	Copyright 2013 Karsten Ahnert
-
+
 	Copyright 2013 Kyle Lutz
-
+
 	Copyright 2013 Maciej Piechotka
-
+
 	Copyright 2013 Mario Mulansky
-
+
 	Copyright 2013 Nikhar Agrawal
-
+
 	Copyright 2013 Pascal Germroth
-
+
 	Copyright 2013 Paul Bristow
-
+
 	Copyright 2013 Peter Dimov
-
+
 	Copyright 2013 University of Warsaw.
-
+
 	Copyright 2013, 2017 Andrey Semashev
-
+
 	Copyright 2013, 2017-2018 Cray, Inc.
-
+
 	Copyright 2013-2014 Karsten Ahnert
-
+
 	Copyright 2013-2014 Mario Mulansky
-
+
 	Copyright 2013-2020 Antony Polukhin.
 //
-
+
 	Copyright 2014          LASMEA UMR 6602 CNRS/Univ. Clermont II
-
+
 	Copyright 2014          LRI    UMR 8623 CNRS/Univ Paris Sud XI
-
+
 	Copyright 2014          MetaScale SAS
-
+
 	Copyright 2014          NumScale SAS
-
+
 	Copyright 2014 Andrey Semashev
-
+
 	Copyright 2014 Anton Bikineev
-
+
 	Copyright 2014 Antony Polukhin
-
+
 	Copyright 2014 Bill Gallafent
-
+
 	Copyright 2014 Christopher Kormanyos
-
+
 	Copyright 2014 Glen Joseph Fernandes
-
+
 	Copyright 2014 John Maddock
-
+
 	Copyright 2014 Marco Guazzone (marco.guazzone@gmail.com)
-
+
 	Copyright 2014 Neil Groves
 //
-
+
 	Copyright 2014 Paul Bristow
-
+
 	Copyright 2014 Peter Dimov
-
+
 	Copyright 2014 Peter Dimov
 //
-
+
 	Copyright 2014 Renato Tegon Forti, Antony Polukhin
-
+
 	Copyright 2014 Renato Tegon Forti, Antony Polukhin.
-
+
 	Copyright 2014, Eric W. Moore
 
 /*     Incomplete elliptic integral of first kind      */
-
+
 	Copyright 2014, Eric W. Moore
 
 /*     Incomplete elliptic integral of second kind     */
-
+
 	Copyright 2014,2018 Glen Joseph Fernandes
-
+
 	Copyright 2014-2015 Glen Joseph Fernandes
-
+
 	Copyright 2014-2015 Renato Tegon Forti, Antony Polukhin.
-
+
 	Copyright 2014-2016 Glen Joseph Fernandes
-
+
 	Copyright 2014-2020 Glen Joseph Fernandes
-
+
 	Copyright 2015 Andrey Semashev
-
+
 	Copyright 2015 Antony Polukhin
-
+
 	Copyright 2015 Glen Joseph Fernandes
-
+
 	Copyright 2015 John Fletcher
-
+
 	Copyright 2015 John Fletcher.
-
+
 	Copyright 2015 John Maddock. Distributed under the Boost
-
+
 	Copyright 2015 Klemens Morgenstern
-
+
 	Copyright 2015 Klemens Morgenstern
 //
 // This file provides a demangling for function names, i.e. entry points of a dll.
-
+
 	Copyright 2015 LRI UMR 8623 CNRS/University Paris Sud XI
 
-
+
 	Copyright 2015 Mario Mulansky
-
+
 	Copyright 2015 NumScale SAS
-
+
 	Copyright 2015 Ontario Institute for Cancer Research
 // Written by Matei David (matei@cs.toronto.edu)
 //---------------------------------------------------------
-
+
 	Copyright 2015 Peter Dimov
-
+
 	Copyright 2015 Peter Dimov.
-
+
 	Copyright 2015 Steven Watanabe
-
+
 	Copyright 2015, 2016 Peter Dimov.
-
+
 	Copyright 2015, 2017 Andrey Semashev
-
+
 	Copyright 2015, 2017, 2019 Peter Dimov.
-
+
 	Copyright 2015, 2019 Peter Dimov.
-
+
 	Copyright 2015, 2020 Andrey Semashev
-
+
 	Copyright 2015-2016 Hans Dembinski
-
+
 	Copyright 2015-2017 Hans Dembinski
-
+
 	Copyright 2015-2017 Peter Dimov.
-
+
 	Copyright 2015-2018 Andrey Semashev
-
+
 	Copyright 2015-2018 Hans Dembinski
-
+
 	Copyright 2015-2018 Klemens D. Morgenstern
-
+
 	Copyright 2015-2019 Antony Polukhin.
-
+
 	Copyright 2015-2019 Hans Dembinski
-
+
 	Copyright 2015-2019 Peter Dimov
-
+
 	Copyright 2015-2019 Peter Dimov.
-
+
 	Copyright 2015-2020 Antony Polukhin.
-
+
 	Copyright 2015-2020 Peter Dimov.
-
+
 	Copyright 2016 Andrey Semashev
-
+
 	Copyright 2016 Joaquin M Lopez Munoz.
-
+
 	Copyright 2016 John Maddock. Distributed under the Boost
-
+
 	Copyright 2016 Jorge Lodos
-
+
 	Copyright 2016 Klemens D. Morgenstern
-
+
 	Copyright 2016 Klemens Morgenstern
-
+
 	Copyright 2016 Klemens Morgenstern, Antony Polukhin
-
+
 	Copyright 2016, 2017 Andrey Semashev
-
+
 	Copyright 2016, 2017 Peter Dimov
-
+
 	Copyright 2016, 2018, 2019 Peter Dimov.
-
+
 	Copyright 2016-2017 Joaquin M Lopez Munoz.
-
+
 	Copyright 2016-2018 Andrey Semashev
-
+
 	Copyright 2016-2018 Joaquin M Lopez Munoz.
-
+
 	Copyright 2016-2019 Antony Polukhin.
-
+
 	Copyright 2016-2019 Joaquin M Lopez Munoz.
-
+
 	Copyright 2016-2020 Joaquin M Lopez Munoz.
-
+
 	Copyright 2017 Andrey Semashev
-
+
 	Copyright 2017 Daniel James.
-
+
 	Copyright 2017 Glen Joseph Fernandes
-
+
 	Copyright 2017 James E. King III
-
+
 	Copyright 2017 James E. King, III
-
+
 	Copyright 2017 Joaquin M Lopez Munoz.
-
+
 	Copyright 2017 John Maddock
-
+
 	Copyright 2017 Peter Dimov
-
+
 	Copyright 2017 Peter Dimov.
-
+
 	Copyright 2017 Two Blue Cubes Ltd. All rights reserved.
-
+
 	Copyright 2017 Valentin Noah Hartmann
-
+
 	Copyright 2017 Vinnie Falco
-
+
 	Copyright 2017, 2018 Peter Dimov.
-
+
 	Copyright 2017, 2019 Peter Dimov.
-
+
 	Copyright 2017, NVIDIA CORPORATION.
-
+
 	Copyright 2017-2018 Glen Joseph Fernandes
-
+
 	Copyright 2017-2018 Joaquin M Lopez Munoz.
-
+
 	Copyright 2017-2019 Glen Joseph Fernandes
-
+
 	Copyright 2017-2019 Peter Dimov.
-
+
 	Copyright 2018 Glen Joseph Fernandes
-
+
 	Copyright 2018 Hans Dembinski
-
+
 	Copyright 2018 Joaquin M Lopez Munoz.
-
+
 	Copyright 2018 John Maddock
-
+
 	Copyright 2018 John Maddock. Distributed under the Boost
-
+
 	Copyright 2018 Mateusz Loskot <mateusz@loskot.net>
-
+
 	Copyright 2018 Nico Weber
-
+
 	Copyright 2018 Peter Dimov
-
+
 	Copyright 2018 Stefan Seefeld
-
+
 	Copyright 2018 Steven Watanabe
-
+
 	Copyright 2018 Ulf Adams
-
+
 	Copyright 2018, 2019 Andrey Semashev
-
+
 	Copyright 2018, 2020 Peter Dimov
-
+
 	Copyright 2018-2019 Antony Polukhin.
-
+
 	Copyright 2018-2019 Hans Dembinski
-
+
 	Copyright 2019 Emil Dotchevski.
-
+
 	Copyright 2019 Glen Joseph Fernandes
-
+
 	Copyright 2019 Glen Joseph Fernandes (glenjofe@gmail.com)
-
+
 	Copyright 2019 Glen Joseph Fernandes (glenjofe@gmail.com)
 //
 // For more information, see http://www.boost.org/libs/range/
-
+
 	Copyright 2019 Hans Dembinski
-
+
 	Copyright 2019 Henry Schreiner
-
+
 	Copyright 2019 John Maddock
-
+
 	Copyright 2019 John Maddock. Distributed under the Boost
-
+
 	Copyright 2019 Mateusz Loskot <mateusz at loskot dot net>
-
+
 	Copyright 2019 Miral Shah <miralshah2211@gmail.com>
-
+
 	Copyright 2019 Olzhas Zhumabek <anonymous.from.applecity@gmail.com>
-
+
 	Copyright 2019 Peter Dimov
-
+
 	Copyright 2019 Pranam Lashkari <plashkari628@gmail.com>
-
+
 	Copyright 2019 Przemyslaw Bartosik
-
+
 	Copyright 2019, 2020 Peter Dimov
-
+
 	Copyright 2019-20 Christopher Kormanyos.
-
+
 	Copyright 2019-20 Madhur Chauhan.
-
+
 	Copyright 2019-2020 Antony Polukhin
-
+
 	Copyright 2019-2020 Glen Joseph Fernandes
-
+
 	Copyright 2020 Andrey Semashev
-
+
 	Copyright 2020 Glen Joseph Fernandes
-
+
 	Copyright 2020 Hans Dembinski
-
+
 	Copyright 2020 Ion Gaztanaga
-
+
 	Copyright 2020 John Maddock.
-
+
 	Copyright 2020 John Maddock. Distributed under the Boost
-
+
 	Copyright 2020 Madhur Chauhan.
-
+
 	Copyright 2020 Peter Dimov
-
+
 	Copyright 2020 Samuel Debionne
-
+
 	copyright : tiff_property_base< std::string, TIFFTAG_COPYRIGHT >
 
 /// non-baseline tags
-
+
 	copyright = '2008-
 
 # The default replacements for |version| and |release|, also used in various
@@ -12424,361 +12424,361 @@ Modifications 2014 Andrew Nelson
 import scipy
 version = re.sub(r'\.dev-.*$', r'.dev', scipy.__version__)
 release = scipy.__version__
-
+
 	Copyright \copyright\ 2014 by P.-G. Martinsson, V. Rokhlin,
 Y. Shkolnisky, and M. Tygert.
 
 \bigskip
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)   2011.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)   2013.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)  2009 - 2010.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)  2009 - 2011.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)  2009 - 2012.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)  2010 - 2011.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)  2010.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)  2011.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)  2012.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)  2013.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)  2014.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)  2015.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)  2016.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)  2017.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu)  2018.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu) 2011 - 2012.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu) 2011.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu) 2013.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu) 2014.
-
+
 	Copyright Abel Sinkovics (abel@sinkovics.hu) 2015.
-
+
 	Copyright Adam D. Walling 2012. Use, modification and
-
+
 	Copyright Alain Miniussi 2014.
-
+
 	Copyright Aleksey Gurtovoy 2000-2002
-
+
 	Copyright Aleksey Gurtovoy 2000-2003
-
+
 	Copyright Aleksey Gurtovoy 2000-2004
-
+
 	Copyright Aleksey Gurtovoy 2000-2006
-
+
 	Copyright Aleksey Gurtovoy 2000-2008
-
+
 	Copyright Aleksey Gurtovoy 2000-2009
-
+
 	Copyright Aleksey Gurtovoy 2000-2010
-
+
 	Copyright Aleksey Gurtovoy 2001-2004
-
+
 	Copyright Aleksey Gurtovoy 2001-2006
-
+
 	Copyright Aleksey Gurtovoy 2001-2007
-
+
 	Copyright Aleksey Gurtovoy 2001-2008
-
+
 	Copyright Aleksey Gurtovoy 2002-2004
-
+
 	Copyright Aleksey Gurtovoy 2002-2006
-
+
 	Copyright Aleksey Gurtovoy 2003-2004
-
+
 	Copyright Aleksey Gurtovoy 2003-2007
-
+
 	Copyright Aleksey Gurtovoy 2004
-
+
 	Copyright Aleksey Gurtovoy 2006
-
+
 	Copyright Aleksey Gurtovoy 2008
-
+
 	Copyright Alexander Grund 2018. Corrections to singleton lifetime
-
+
 	Copyright Alexander Nasonov
-
+
 	Copyright Alexander Nasonov 2004
-
+
 	Copyright Alexander Nasonov, 2006-2010.
-
+
 	Copyright Anne M. Archibald 2008
-
+
 	Copyright Antony Polukhin, 2011-2020.
-
+
 	Copyright Antony Polukhin, 2013-2014.
-
+
 	Copyright Antony Polukhin, 2013-2020.
-
+
 	Copyright Antony Polukhin, 2016-2019.
-
+
 	Copyright Antony Polukhin, 2016-2020.
-
+
 	Copyright Arno Schoedl
-
+
 	Copyright Barrett Adair 2015-2017
-
+
 	Copyright Barrett Adair 2015-2018
-
+
 	Copyright Barrett Adair 2016-2017
-
+
 	copyright below:
 /*
-
+
 	Copyright Beman Dawes 1994, 2006, 2008
-
+
 	Copyright Beman Dawes 1994-2007, 2011
-
+
 	Copyright Beman Dawes 1994-2007, 2011
 //
 //  Boost.Chrono:
-
+
 	Copyright Beman Dawes 1994-99.
-
+
 	Copyright Beman Dawes 1994-99.  Distributed under the Boost
-
+
 	Copyright Beman Dawes 1995-2001.  Distributed under the Boost
-
+
 	Copyright Beman Dawes 2001.  Distributed under the Boost
-
+
 	Copyright Beman Dawes 2002
-
+
 	Copyright Beman Dawes 2002, 2006
-
+
 	Copyright Beman Dawes 2002-2005, 2009
-
+
 	Copyright Beman Dawes 2002-2009
-
+
 	Copyright Beman Dawes 2003
-
+
 	Copyright Beman Dawes 2003, 2006
-
+
 	Copyright Beman Dawes 2003, 2006, 2008
-
+
 	Copyright Beman Dawes 2003, 2006, 2010
-
+
 	Copyright Beman Dawes 2003, 2006, 2011
-
+
 	Copyright Beman Dawes 2005.
-
+
 	Copyright Beman Dawes 2006
-
+
 	Copyright Beman Dawes 2006, 2007
-
+
 	Copyright Beman Dawes 2007
-
+
 	Copyright Beman Dawes 2008
-
+
 	Copyright Beman Dawes 2009
-
+
 	Copyright Beman Dawes 2010
-
+
 	Copyright Beman Dawes 2010, 2011, 2014
-
+
 	Copyright Beman Dawes 2011
-
+
 	Copyright Beman Dawes 2013
-
+
 	Copyright Beman Dawes 2014
-
+
 	Copyright Beman Dawes 2015
-
+
 	Copyright Beman Dawes and Daryle Walker 1999.  Distributed under the Boost
-
+
 	Copyright Beman Dawes, 2002-2005
-
+
 	Copyright Beman Dawes, 2009
-
+
 	Copyright Benjamin Sobotta 2012
-
+
 	Copyright Benjamin Sobotta 2012.
-
+
 	Copyright Benjamin Worpitz 2018
-
+
 	Copyright Bertolt Mildner 2004.
-
+
 	Copyright Bruno Dutra 2015
-
+
 	Copyright Bryce Lelbach 2010
-
+
 	copyright by Renee Touzin)
 under the BSD licence. The following files have been removed from the original library:
 
-
+
 	Copyright Catch2 Authors
-
+
 	Copyright Charly Chevalier 2015
-
+
 	Copyright Christoper Kohlhoff 2007
-
+
 	Copyright Christopher Brown 2013
-
+
 	Copyright Christopher Kormanyos 2002 - 2011.
-
+
 	Copyright Christopher Kormanyos 2002 - 2013.
-
+
 	Copyright Christopher Kormanyos 2013-14
-
+
 	Copyright Christopher Kormanyos 2013.
-
+
 	Copyright Christopher Kormanyos 2013. Distributed under the Boost
-
+
 	Copyright Christopher Kormanyos 2014.
-
+
 	Copyright Cromwell D. Enage 2013.
-
+
 	Copyright Cromwell D. Enage 2017.
-
+
 	Copyright Cromwell D. Enage 2018.
-
+
 	Copyright Cromwell D. Enage 2019.
-
+
 	Copyright Daniel Trebbien 2010.
-
+
 	Copyright Daniel Walker 2006. Use, modification and distribution
-
+
 	Copyright Daniel Walker 2007
-
+
 	Copyright Daniel Walker, Eric Niebler, Michel Morin 2008-2012.
-
+
 	Copyright Daniel Wallin 2005.
-
+
 	Copyright Daniel Wallin 2005. Use, modification and distribution is
-
+
 	Copyright Daniel Wallin 2006.
-
+
 	Copyright Daniel Wallin 2006. Use, modification and distribution is
-
+
 	Copyright Daniel Wallin 2007. Use, modification and distribution is
-
+
 	Copyright Daniel Wallin, David Abrahams 2005.
-
+
 	Copyright Daniel Wallin, David Abrahams 2010.
-
+
 	Copyright Daryle Walker, Hubert Holin, John Maddock 2006 - 2007
-
+
 	Copyright Dave Abrahams 2001-2002
-
+
 	Copyright David Abrahams 2000-2002
-
+
 	Copyright David Abrahams 2001
-
+
 	Copyright David Abrahams 2001-2002
-
+
 	Copyright David Abrahams 2001.
-
+
 	Copyright David Abrahams 2002
-
+
 	Copyright David Abrahams 2002,  Nikolay Mladenov 2007.
-
+
 	Copyright David Abrahams 2002, Joel de Guzman, 2002.
-
+
 	Copyright David Abrahams 2002-2003
-
+
 	Copyright David Abrahams 2002.
-
+
 	Copyright David Abrahams 2003
-
+
 	Copyright David Abrahams 2003-2004
-
+
 	Copyright David Abrahams 2003.
-
+
 	Copyright David Abrahams 2003. Use, modification and distribution is
-
+
 	Copyright David Abrahams 2004
-
+
 	Copyright David Abrahams 2004.
-
+
 	Copyright David Abrahams 2004. Distributed under the Boost
-
+
 	Copyright David Abrahams 2004. Use, modification and distribution is
-
+
 	Copyright David Abrahams 2005.
-
+
 	Copyright David Abrahams 2005. Distributed under the Boost
-
+
 	Copyright David Abrahams 2006.
-
+
 	Copyright David Abrahams 2006. Distributed under the Boost
-
+
 	Copyright David Abrahams 2006. Original version
 //
-
+
 	Copyright David Abrahams 2009. Distributed under the Boost
-
+
 	Copyright David Abrahams and Jeremy Siek 2003.
-
+
 	Copyright David Abrahams and Nikolay Mladenov 2003.
-
+
 	Copyright David Abrahams and Thomas Becker 2000-2006.
-
+
 	Copyright David Abrahams, Daniel Wallin 2003.
-
+
 	Copyright David Abrahams, Daniel Wallin 2005.
-
+
 	Copyright Dietmar Kuehl 2001
-
+
 	Copyright Douglas Gregor 2001-2003.
-
+
 	Copyright Douglas Gregor 2001-2003. Use, modification and
-
+
 	Copyright Douglas Gregor 2001-2004.
-
+
 	Copyright Douglas Gregor 2001-2004. Use, modification and
-
+
 	Copyright Douglas Gregor 2001-2006
-
+
 	Copyright Douglas Gregor 2002-2003. Use, modification and
-
+
 	Copyright Douglas Gregor 2002-2004. Use, modification and
-
+
 	Copyright Douglas Gregor 2003. Use, modification and
-
+
 	Copyright Douglas Gregor 2004.
-
+
 	Copyright Douglas Gregor 2004. Use, modification and
-
+
 	Copyright Emil Dotchevski 2007
-
+
 	Copyright Eric Friedman 2002
-
+
 	Copyright Eric Friedman 2002-2003
-
+
 	Copyright Eric Friedman 2003
-
+
 	Copyright Eric Niebler 2005.
-
+
 	Copyright Eric Niebler 2008
-
+
 	Copyright Eric Niebler 2009
-
+
 	Copyright Eric Niebler 2014
-
+
 	Copyright Eric Niebler 2014. Use, modification and
-
+
 	Copyright Evan Miller 2020
-
+
 	copyright follows:
 //
-
+
 	copyright for code they wrote and submit for
-
+
 	Copyright for the original TNBC Fortran routines:
 
   TRUNCATED-NEWTON METHOD:  SUBROUTINES
@@ -12786,7 +12786,7 @@ under the BSD licence. The following files have been removed from the original l
           SCHOOL OF INFORMATION TECHNOLOGY & ENGINEERING
           GEORGE MASON UNIVERSITY
           FAIRFAX, VA 22030
-
+
 	Copyright for the original TNBC fortran routines:
  *
  *   TRUNCATED-NEWTON METHOD:  SUBROUTINES
@@ -12794,43 +12794,43 @@ under the BSD licence. The following files have been removed from the original l
  *           SCHOOL OF INFORMATION TECHNOLOGY & ENGINEERING
  *           GEORGE MASON UNIVERSITY
  *           FAIRFAX, VA 22030
-
+
 	Copyright for the original version:
-
+
 	Copyright Frank Mori Hess 2007,2009.
-
+
 	Copyright Frank Mori Hess 2007-2008
-
+
 	Copyright Frank Mori Hess 2007-2008.
-
+
 	Copyright Frank Mori Hess 2007-2009
-
+
 	Copyright Frank Mori Hess 2007-2009.
-
+
 	Copyright Frank Mori Hess 2007-2010.
-
+
 	Copyright Frank Mori Hess 2007.
-
+
 	Copyright Frank Mori Hess 2007. Use, modification and
-
+
 	Copyright Frank Mori Hess 2008.
-
+
 	Copyright Frank Mori Hess 2009
-
+
 	Copyright Frank Mori Hess 2009.
-
+
 	Copyright Franz Detro 2014
-
+
 	Copyright Gautam Sewani
-
+
 	Copyright Gautam Sewani 2008
-
+
 	copyright Gonzalo Brito Gadeschi 2015
-
+
 	Copyright Gottfried Gan
-
+
 	Copyright Hans Dembinski 2020
-
+
 	copyright header
 #
 	print(outfile "$CopyrightHeaderLine0\n");
@@ -12845,42 +12845,42 @@ under the BSD licence. The following files have been removed from the original l
 	print(outfile "$CopyrightHeaderLine6\n");
 	print(outfile "$CopyrightHeaderLine1\n");
 	print(outfile "$CopyrightHeaderLine0\n");
-
+
 	copyright header
 # Look to see if we've reached the end
 #
 	    $fpos=index($_,$CopyrightHeaderLine0);
 	    if ($fpos>=0) {
-
+
 	copyright header in
 	    print (outfile);
 	} else {
 	    $RemoveCopyrightHeader = 1;
-
+
 	copyright header in
 	}
 #	print "Line0: Rm=$RemoveCopyrightHeader|$_";
     } else {
 #	print "Line+: Rm=$RemoveCopyrightHeader|$_";
-
+
 	Copyright header line 0 is at
 	if ($fpos<0) {
 	    $RemoveCopyrightHeader = 0;
-
+
 	copyright header should be ignored
 #
 	$fpos=index($_,$CopyrightHeaderLine0);
-
+
 	copyright header so stop ignoring lines
 #
 		$RemoveCopyrightHeader = 0;
-
+
 	copyright header so write out the line
 #
 	    print (outfile);
-
+
 	Copyright Howard Hinnant 2007-2010.
-
+
 	copyright information
 - HISTORY : Release history
 - README : This file
@@ -12893,36 +12893,36 @@ under the BSD licence. The following files have been removed from the original l
 
 Use is described in tnc.h. For more information, see the example.
 The example can be built and executed by doing :
-
+
 	copyright information.
 
    If you recompile and load this file, then userprintf_rbox_r.o will not be loaded
    from qhull.a or qhull.lib
-
+
 	copyright information.
 
    see libqhull_r.h for data structures, macros, and user-callable functions.
-
+
 	copyright information.
 
    See user_r.c for sample code.
-
+
 	copyright information.
 
   If you recompile and load this file, then userprintf_r.o will not be loaded
   from qhull_r.a or qhull_r.lib
-
+
 	copyright information.
 # $Jeannot: README,v 1.32 2005/01/28 15:12:09 js Exp $
 
 This software is a C implementation of TNBC, a truncated newton minimization
 package originally developed by Stephen G. Nash in Fortran.
-
+
 	copyright is
  * claimed, and the software is hereby placed in the public domain.
  * In case this attempt to disclaim copyright and place the software in the
  * public domain is deemed null and void, then the software is
-
+
 	copyright is acknowledged.
 /*                                                                           */
 /* C Contact Information                                                     */
@@ -12935,424 +12935,424 @@ package originally developed by Stephen G. Nash in Fortran.
 /* C 461 William L Everitt Laboratory                                        */
 /* C 1406 West Green Street                                                  */
 /* C Urbana, IL 61801-2991                                                   */
-
+
 	Copyright J.S. Roy (js@jeannot.org), 2002-2005
-
+
 	Copyright Jaap Suter 2003
-
+
 	Copyright James E. King III, 2017
-
+
 	Copyright Jan Langer 2002
-
+
 	Copyright Jason Rhinelander 2016
-
+
 	copyright Jason Rice 2016
-
+
 	copyright Jason Rice 2017
-
+
 	Copyright Jens Maurer 2000
-
+
 	Copyright Jens Maurer 2000-2001
-
+
 	Copyright Jens Maurer 2002
-
+
 	Copyright Jens Maurer 2006
-
+
 	Copyright Jens Maurer 2006-1011
-
+
 	Copyright Jessica Hamilton 2014
-
+
 	Copyright Jim Bosch 2010-2012.
-
+
 	Copyright Joel Falcou 2015
-
+
 	Copyright John Maddock 2005-2006, 2011.
-
+
 	Copyright John Maddock 2005-2006.
-
+
 	Copyright John Maddock 2005-2008.
-
+
 	Copyright John Maddock 2005.
-
+
 	Copyright John Maddock 2006
-
+
 	Copyright John Maddock 2006, 2007
-
+
 	Copyright John Maddock 2006, 2007, 2012, 2014.
-
+
 	Copyright John Maddock 2006, 2007.
-
+
 	Copyright John Maddock 2006, 2010.
-
+
 	Copyright John Maddock 2006, 2011.
-
+
 	Copyright John Maddock 2006, 2012.
-
+
 	Copyright John Maddock 2006-7, 2013-14.
-
+
 	Copyright John Maddock 2006-7.
-
+
 	Copyright John Maddock 2006.
-
+
 	Copyright John Maddock 2007, 2014.
-
+
 	Copyright John Maddock 2007-8.
-
+
 	Copyright John Maddock 2007.
-
+
 	Copyright John Maddock 2008
-
+
 	Copyright John Maddock 2008, 2012.
-
+
 	Copyright John Maddock 2008.
-
+
 	Copyright John Maddock 2009
-
+
 	Copyright John Maddock 2009.
-
+
 	Copyright John Maddock 2010
-
+
 	Copyright John Maddock 2010, 2012.
-
+
 	Copyright John Maddock 2010.
-
+
 	Copyright John Maddock 2011.
-
+
 	Copyright John Maddock 2012
-
+
 	Copyright John Maddock 2012.
-
+
 	Copyright John Maddock 2013
-
+
 	Copyright John Maddock 2013.
-
+
 	Copyright John Maddock 2014.
-
+
 	Copyright John Maddock 2015
-
+
 	Copyright John Maddock 2015.
-
+
 	Copyright John Maddock 2016.
-
+
 	Copyright John Maddock 2017.
-
+
 	Copyright John Maddock 2018.
-
+
 	Copyright John Maddock, 2020
-
+
 	Copyright John R. Bandela 2000-2002
-
+
 	Copyright John R. Bandela 2001
-
+
 	Copyright John R. Bandela 2001.
-
+
 	Copyright Justinas Vygintas Daugmaudis 2010-2018
-
+
 	Copyright Kevlin Henney, 2000, 2001, 2002. All rights reserved.
-
+
 	Copyright Kevlin Henney, 2000-2005.
-
+
 	Copyright Kohei Takahashi 2012-2014.
-
+
 	Copyright Lingxi Li 2015.
-
+
 	Copyright Louis Dionne 2013
-
+
 	copyright Louis Dionne 2013-2016
-
+
 	copyright Louis Dionne 2013-2017
-
+
 	Copyright Louis Dionne 2013-2017
-
+
 	copyright Louis Dionne 2016
-
+
 	Copyright Marco Guazzone 2014
-
+
 	Copyright Matthew Pulver 2018 - 2019.
-
+
 	Copyright Michael Drexl 2005, 2006.
-
+
 	Copyright Nat Goodspeed
-
+
 	Copyright Nat Goodspeed 2014.
-
+
 	Copyright Neil Groves
-
+
 	Copyright Neil Groves 2003-2004.
-
+
 	Copyright Neil Groves 2007.
-
+
 	Copyright Neil Groves 2007. Use, modification and
-
+
 	Copyright Neil Groves 2009.
-
+
 	Copyright Neil Groves 2009. Use, modification and
-
+
 	Copyright Neil Groves 2009. Use, modification and distribution
-
+
 	Copyright Neil Groves 2010. Use, modification and
-
+
 	Copyright Neil Groves 2014
-
+
 	Copyright Neil Groves 2014.
-
+
 	Copyright Neil Groves 2014. Use, modification and
-
+
 	Copyright Nicholas Thompson 2018
-
+
 	Copyright Nick Thompson 2017.
-
+
 	Copyright Nick Thompson 2019.
-
+
 	Copyright Nick Thompson, 2017
-
+
 	Copyright Nick Thompson, 2018
-
+
 	Copyright Nick Thompson, 2019
-
+
 	Copyright Nick Thompson, 2020
-
+
 	Copyright Nick Thompson, John Maddock 2020
-
+
 	Copyright Nikhar Agrawal 2013-14
-
+
 	Copyright Nikolay Mladenov 2007.
-
+
 	Copyright Nuxi, https://nuxi.nl/ 2015.
-
+
 	Copyright ohn Maddock 2012
-
+
 	Copyright Oliver Kowalke 2009.
-
+
 	Copyright Oliver Kowalke 2013.
-
+
 	Copyright Oliver Kowalke 2014.
-
+
 	Copyright Oliver Kowalke 2015.
-
+
 	Copyright Oliver Kowalke 2016.
-
+
 	Copyright Oliver Kowalke 2017.
-
+
 	Copyright Oliver Kowalke 2018.
-
+
 	Copyright Orson Peters 2017.
-
+
 	Copyright Paul A. Bristow
-
+
 	Copyright Paul A. Bristow 2006, 2007, 2009, 2010.
-
+
 	Copyright Paul A. Bristow 2006, 2007, 2012
-
+
 	Copyright Paul A. Bristow 2006, 2007, 2012.
-
+
 	Copyright Paul A. Bristow 2006, 2007.
-
+
 	Copyright Paul A. Bristow 2006, 2012, 2017.
-
+
 	Copyright Paul A. Bristow 2006-2011.
-
+
 	Copyright Paul A. Bristow 2006-7.
-
+
 	Copyright Paul A. Bristow 2006.
-
+
 	Copyright Paul A. Bristow 2007
-
+
 	Copyright Paul A. Bristow 2007, 2009
-
+
 	Copyright Paul A. Bristow 2007, 2009.
-
+
 	Copyright Paul A. Bristow 2007, 2010, 2012, 2014.
-
+
 	Copyright Paul A. Bristow 2007, 2010.
-
+
 	Copyright Paul A. Bristow 2007, 2012.
-
+
 	Copyright Paul A. Bristow 2007, 2013-14.
-
+
 	Copyright Paul A. Bristow 2007.
-
+
 	Copyright Paul A. Bristow 2008, 2009.
-
+
 	Copyright Paul A. Bristow 2008, 2010.
-
+
 	Copyright Paul A. Bristow 2008, 2014.
-
+
 	Copyright Paul A. Bristow 2009, 2011
-
+
 	Copyright Paul A. Bristow 2010
-
+
 	Copyright Paul A. Bristow 2010.
-
+
 	Copyright Paul A. Bristow 2011, 2012.
-
+
 	Copyright Paul A. Bristow 2012.
-
+
 	Copyright Paul A. Bristow 2013.
-
+
 	Copyright Paul A. Bristow 2014.
-
+
 	Copyright Paul A. Bristow 2016, 2017, 2018.
-
+
 	Copyright Paul A. Bristow 2017.
-
+
 	Copyright Paul Bristow 2006, 2007.
-
+
 	Copyright Paul Bristow 2007, 2011.
-
+
 	Copyright Paul Bristow 2007.
-
+
 	Copyright Paul Bristow 2014.
-
+
 	Copyright Paul Mensonides 2003
-
+
 	Copyright Pavol Droba 2002-2003.
-
+
 	Copyright Pavol Droba 2002-2003. Use, modification and
-
+
 	Copyright Pavol Droba 2002-2004.
-
+
 	Copyright Pavol Droba 2002-2006.
-
+
 	Copyright Peter Dimov 2000-2002
-
+
 	Copyright Peter Dimov 2000-2003
-
+
 	Copyright Peter Dimov 2001
-
+
 	Copyright Peter Dimov 2001-2002
-
+
 	Copyright Peter Dimov 2001-2003
-
+
 	Copyright Peter Dimov 2017, 2018
-
+
 	Copyright Peter Dimov 2017, 2018, 2020
-
+
 	Copyright Peter Dimov 2019.
-
+
 	Copyright Peter Dimov and David Abrahams 2002.
-
+
 	Copyright Peter Dimov and Multi Media Ltd 2001, 2002
-
+
 	copyright property.
-
+
 	Copyright Ralf W. Grosse-Kunstleve
-
+
 	Copyright Ralf W. Grosse-Kunstleve 2006.
-
+
 	Copyright Rene Rivera 2005-2016
-
+
 	Copyright Rene Rivera 2008-2013
-
+
 	Copyright Rene Rivera 2008-2015
-
+
 	Copyright Rene Rivera 2008-2017
-
+
 	Copyright Rene Rivera 2008-2019
-
+
 	Copyright Rene Rivera 2011-2012
-
+
 	Copyright Rene Rivera 2011-2015
-
+
 	Copyright Rene Rivera 2012-2015
-
+
 	Copyright Rene Rivera 2013
-
+
 	Copyright Rene Rivera 2013-2015
-
+
 	Copyright Rene Rivera 2014
-
+
 	Copyright Rene Rivera 2014-2015
-
+
 	Copyright Rene Rivera 2015
-
+
 	Copyright Rene Rivera 2015-2016
-
+
 	Copyright Rene Rivera 2015-2019
-
+
 	Copyright Rene Rivera 2017
-
+
 	Copyright Robert Ramey 2007.  Changes made to permit
 // application throughout the serialization library.
 //
-
+
 	Copyright Robin Eckert 2015.
-
+
 	Copyright Ruslan Baratov 2017
-
+
 	Copyright Samuel Krempp 2003.
-
+
 	Copyright Samuel Krempp 2003. Use, modification, and distribution are
-
+
 	Copyright Sebastian Ramacher, 2007.
-
+
 	Copyright Sergey Krivonos 2017
-
+
 	Copyright Shreyans Doshi 2017.
-
+
 	Copyright Shunsuke Sogame 2005-2006.
-
-	copyright sign","short":"copyright"
-	copyright sign",short:"copyright"
+
+	copyright sign","short":"copyright"
+	copyright sign",short:"copyright"
 	Copyright Stefan Seefeld 2005.
-
+
 	Copyright Stefan Seefeld 2016.
-
+
 	Copyright Steven J. Ross 2001 - 2009.
-
+
 	Copyright Steven J. Ross 2001 - 2014
-
+
 	Copyright Steven J. Ross 2001 - 2014.
-
+
 	Copyright Steven J. Ross 2014
-
+
 	Copyright Steven Watanabe 2009
-
+
 	Copyright Steven Watanabe 2009-2011
-
+
 	Copyright Steven Watanabe 2010
-
+
 	Copyright Steven Watanabe 2010-2011
-
+
 	Copyright Steven Watanabe 2011
-
+
 	Copyright Steven Watanabe 2014
-
+
 	Copyright Thijs van den Berg 2014
-
+
 	Copyright Thijs van den Berg, 2008.
-
+
 	Copyright Thomas Mang 2012.
-
+
 	Copyright Thorsten Ottosen 2003-2004. Use, modification and
-
+
 	Copyright Thorsten Ottosen 2003-2005. Use, modification and
-
+
 	Copyright Thorsten Ottosen 2003-2006. Use, modification and
-
+
 	Copyright Thorsten Ottosen 2003-2007. Use, modification and
-
+
 	Copyright Thorsten Ottosen 2003-2008. Use, modification and
-
+
 	Copyright Thorsten Ottosen 2006.
-
+
 	Copyright Thorsten Ottosen 2006. Use, modification and
-
+
 	Copyright Thorsten Ottosen 2008. Use, modification and
-
+
 	Copyright Thorsten Ottosen, 2009.
-
+
 	Copyright Thorsten Ottosen, Neil Groves 2006 - 2008. Use, modification and
-
+
 	Copyright Thorsten Ottosen, Neil Groves 2006. Use, modification and
-
+
 	Copyright Timmo Stange 2007.
-
+
 	copyright to this source code.
 
 #if !defined(BOOST_FUNCTIONAL_HASH_HASH_HPP)
 #define BOOST_FUNCTIONAL_HASH_HASH_HPP
-
+
 	Copyright uses reporting
   // settings defined in any options file.
   highs.passOptions(loaded_options);
@@ -13361,60 +13361,60 @@ package originally developed by Stephen G. Nash in Fortran.
   HighsStatus read_status = highs.readModel(model_file);
   reportModelStatsOrError(log_options, read_status, highs.getModel());
   if (read_status == HighsStatus::kError) return (int)read_status;
-
+
 	Copyright Vicente J. Botet Escriba 2009
-
+
 	Copyright Vicente J. Botet Escriba 2009-2011
-
+
 	Copyright Vicente J. Botet Escriba 2010
-
+
 	Copyright Vicente J. Botet Escriba 2012.
-
+
 	Copyright Vladimir Prus 2002
-
+
 	Copyright Vladimir Prus 2002-2004.
-
+
 	Copyright Vladimir Prus 2002.
-
+
 	Copyright Vladimir Prus 2004.
-
+
 	Copyright Vladimir Prus, 2002
-
+
 	Copyright Xiaogang Zhang 2006
-
+
 	copyright Xiaogang Zhang.
 //
 #ifndef BOOST_MATH_BESSEL_HPP
 #define BOOST_MATH_BESSEL_HPP
-
+
 	COPYRIGHT$
   
   Additional copyrights may follow
   
   $HEADER$
-
+
 	Copyright(c) 2016 Francisco Jos
-
+
 	Copyright(c) 2016 Francisco Jose Tapia (fjtapia@gmail.com )\n
-
-	copyright-sign"
+
+	copyright-sign"
 	copyright:
 
     Copyright Eric Niebler 2013-present
-
+
 	copyright:
  *
  *     Cephes Math Library Release 2.8:  June, 2000
-
+
 	Copyright:   2007-2008 CodeRage, LLC
-
+
 	Copyright:   2007-2008 CodeRage, LLC
  * Author:      Jonathan Turkanis
  * Contact:     turkanis at coderage dot com
 
  * Defines several function objects and object generators for use with 
  * execute_all()
-
+
 	Copyright:   2007-2008 CodeRage, LLC
  * Author:      Jonathan Turkanis
  * Contact:     turkanis at coderage dot com
@@ -13422,21 +13422,21 @@ package originally developed by Stephen G. Nash in Fortran.
  * Defines the overloaded function template 
  * boost::iostreams::detail::execute_all() and the function template 
  * boost::iostreams::detail::execute_foreach().
-
+
 	Copyright:   2007-2008 CodeRage, LLC
  * Author:      Jonathan Turkanis
  * Contact:     turkanis at coderage dot com
  *
  * Defines the function boost::iostreams::detail::absolute_path, used for 
  * debug output for mapped files.
-
+
 	Copyright:   2007-2008 CodeRage, LLC
  * Author:      Jonathan Turkanis
  * Contact:     turkanis at coderage dot com
  *
  * Defines the function boost::iostreams::detail::current_directory, used by 
  * boost::iostreams::detail::absolute_path.
-
+
 	Copyright:   2007-2008 CodeRage, LLC
  * Author:      Jonathan Turkanis
  * Contact:     turkanis at coderage dot com
@@ -13444,7 +13444,7 @@ package originally developed by Stephen G. Nash in Fortran.
  * Defines the preprocessor symbol BOOST_IOSTREAMS_HAS_DINKUMWARE_FPOS for
  * platforms that use the implementation of std::fpos from the Dinkumware
  * Standard Library.
-
+
 	Copyright:   2007-2008 CodeRage, LLC
  * Author:      Jonathan Turkanis
  * Contact:     turkanis at coderage dot com
@@ -13454,12 +13454,12 @@ package originally developed by Stephen G. Nash in Fortran.
  * BOOST_IOSTREAMS_RESTRICT defined as an identifier, defines the overloaded
  * function template boost::iostreams::BOOST_IOSTREAMS_RESTRICT, and object 
  * generator for boost::iostreams::restriction.
-
+
 	Copyright:   2007-2008 CodeRage, LLC
  * Author:      Jonathan Turkanis
  * Contact:     turkanis at coderage dot com
  */
-
+
 	Copyright:   2008 CodeRage, LLC
                 2004-2007 Jonathan Turkanis
  * Author:      Jonathan Turkanis
@@ -13467,7 +13467,7 @@ package originally developed by Stephen G. Nash in Fortran.
  *
  * Defines the class template boost::iostreams::restriction and the 
  * overloaded function template boost::iostreams::restrict
-
+
 	Copyright:   2008 CodeRage, LLC
                 2004-2007 Jonathan Turkanis
  * Author:      Jonathan Turkanis
@@ -13475,48 +13475,48 @@ package originally developed by Stephen G. Nash in Fortran.
  *
  * Defines the class template boost::iostreams::restriction and the 
  * overloaded function template boost::iostreams::slice.
-
+
 	Copyright:   2008 CodeRage, LLC
  * Author:      Jonathan Turkanis
  * Contact:     turkanis at coderage dot com
  *
  * Defines the class boost::iostreams::detail::path, for storing a 
  * a std::string or std::wstring.
-
+
 	Copyright:   2008 CodeRage, LLC
  * Author:      Jonathan Turkanis
  * Contact:     turkanis at coderage dot com
  *
  * Defines the class template basic_grep_filter and its specializations
  * grep_filter and wgrep_filter.
-
+
 	Copyright:   2008 CodeRage, LLC
  * Author:      Jonathan Turkanis
  * Contact:     turkanis at coderage dot com
  *
  * Defines the type boost::iostreams::detail::file_handle, representing an
  * operating system file handle.
-
+
 	copyright: Copyright 2015  Jon Lund Steffensen. Based on extlinks by
-
-smmap 5.0.2 pypi:smmap/5.0.2: https://github.com/gitpython-developers/smmap
-	No Copyrights found
-tomli 2.2.1 pypi:tomli/2.2.1: https://github.com/hukkin/tomli
+
+smmap 5.0.2 pypi:smmap/5.0.2: https://github.com/gitpython-developers/smmap
+	No Copyrights found
+tomli 2.2.1 pypi:tomli/2.2.1: https://github.com/hukkin/tomli
 	Copyright (c) 2021 Taneli Hukkinen
-
-	Copyright (c) 2021 Taneli Hukkinen
-
-urllib3 2.3.0 pypi:urllib3/2.3.0: https://urllib3.readthedocs.io/en/stable
+
+	Copyright (c) 2021 Taneli Hukkinen
+
+urllib3 2.3.0 pypi:urllib3/2.3.0: https://urllib3.readthedocs.io/en/stable
 	Copyright (c) 2008-2020 Andrey Petrov and contributors.
-
+
 	copyright = f"
 
 # The short X.Y version.
 version = urllib3.__version__
 # The full version, including alpha/beta/rc tags.
 release = version
-
-voluptuous 0.15.2 pypi:voluptuous/0.15.2: http://pypi.python.org/pypi/voluptuous
+
+voluptuous 0.15.2 pypi:voluptuous/0.15.2: http://pypi.python.org/pypi/voluptuous
 	Copyright (c) 2010, Alec Thomas
 All rights reserved.
 
@@ -13532,13 +13532,13 @@ modification, are permitted provided that the following conditions are met:
    be used to endorse or promote products derived from this software without
    specific prior written permission.
 
-
-
-Licenses: 
-
-Apache License 2.0
-(Packaging 24.2, pbr 6.1.0, psf-requests 2.32.3)
-
+
+
+Licenses: 
+
+Apache License 2.0
+(Coverage 7.6.10, Packaging 24.2, pbr 6.1.0, psf-requests 2.32.3)
+
 Apache License
 Version 2.0, January 2004
 =========================
@@ -13719,13 +13719,13 @@ third-party archives.
   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.
-
----
-
-BSD 2-clause "Simplified" License
-(Packaging 24.2)
-
+  governing permissions and limitations under the License.
+
+---
+
+BSD 2-clause "Simplified" License
+(Packaging 24.2)
+
 BSD Two Clause License
 ======================
 
@@ -13748,13 +13748,13 @@ 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.
-
----
-
-BSD 3-clause "New" or "Revised" License
-(gitdb 4.0.12, idna 3.10, NumPy 1.24.4, SciPy 1.9.1, voluptuous 0.15.2)
-
+DAMAGE.
+
+---
+
+BSD 3-clause "New" or "Revised" License
+(gitdb 4.0.12, GitPython 3.1.44, idna 3.10, NumPy 1.24.4, SciPy 1.9.1, smmap 5.0.2, voluptuous 0.15.2)
+
 Copyright (c) <YEAR>, <OWNER>
 All rights reserved.
 
@@ -13782,13 +13782,13 @@ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 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.
-
----
-
-Expat License
-(mccabe 0.7.0)
-
+IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+---
+
+Expat License
+(mccabe 0.7.0)
+
 Expat License
 =============
 
@@ -13811,13 +13811,13 @@ 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.
-
----
-
-MIT License
-(exceptiongroup 1.2.2, flake8 7.1.1, pycodestyle 2.12.1, Pyflakes 3.2.0, pytest 8.3.4, python-pluggy 1.5.0, python3-charset-normalizer 3.4.1, RonnyPfannschmidt/iniconfig 2.0.0, ruamel-yaml 0.18.6, ruamel.yaml.clib 0.2.12, tomli 2.2.1, urllib3 2.3.0)
-
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+---
+
+MIT License
+(exceptiongroup 1.2.2, flake8 7.1.1, pycodestyle 2.12.1, Pyflakes 3.2.0, pytest 8.3.4, python-pluggy 1.5.0, python3-charset-normalizer 3.4.1, RonnyPfannschmidt/iniconfig 2.0.0, ruamel-yaml 0.18.6, ruamel.yaml.clib 0.2.12, tomli 2.2.1, urllib3 2.3.0)
+
 The MIT License
 ===============
 
@@ -13838,13 +13838,13 @@ 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.
-
----
-
-Mozilla Public License 2.0
-(python-certifi 2024.7.4)
-
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+---
+
+Mozilla Public License 2.0
+(python-certifi 2024.7.4)
+
 Mozilla Public License
 Version 2.0
 ======================
@@ -14252,7 +14252,7 @@ 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.
-
----
-
+  by the Mozilla Public License, v. 2.0.
+
+---
+
diff --git a/zuul.d/projects.yaml b/zuul.d/projects.yaml
index 3f34791..83f4974 100644
--- a/zuul.d/projects.yaml
+++ b/zuul.d/projects.yaml
@@ -7,7 +7,7 @@
       jobs:
         - noop
         - powertrain-build-tox
-        #- powertrain-build-blackduck
+        - powertrain-build-blackduck
     release:
       jobs:
         - release-powertrain-build