hmath-python 1.0.0__py3-none-any.whl

hmath.py

@@ -0,0 +1,283 @@
+# SPDX-License-Identifier: MPL-2.0
+"""Binary64 HMath ABI 1. Set HMATH_LIBRARY to the installed shared library.
+
+Tensor owns one native reference. close()/with provide deterministic cleanup;
+__del__ is a fallback. Arrays are copied by default. from_numpy(copy=False)
+requires readonly, native-endian, aligned float64 storage and nonnegative
+strides; the caller must not mutate aliases until all derived views die.
+Native storage views retain independent references, so closing a Tensor does
+not invalidate an existing NumPy view. The process owner shuts down explicitly.
+"""
+
+import ctypes as C
+import ctypes.util
+import os
+import threading
+import weakref
+from itertools import islice
+
+_lib = C.CDLL(
+    os.environ.get("HMATH_LIBRARY")
+    or ctypes.util.find_library("hmath")
+    or "libhmath.so"
+)
+P, Z, D = C.c_void_p, C.c_size_t, C.c_double
+
+
+def _sig(name, result, *args):
+    fn = getattr(_lib, name)
+    fn.restype, fn.argtypes = result, list(args)
+    return fn
+
+
+try:
+    _sig("hmath_abi_version", C.c_uint32)
+    if _lib.hmath_abi_version() != 1:
+        raise RuntimeError("HMath binding requires ABI 1")
+except AttributeError as error:
+    raise RuntimeError(
+        "HMath binding requires ABI 1; library has no version query"
+    ) from error
+_sig("hmath_init", C.c_int)
+_sig("hmath_last_error_message", C.c_char_p)
+_sig("hmath_runtime_shutdown", C.c_int)
+_sig("hmath_tensor_copy", C.c_int, C.POINTER(D), Z, C.POINTER(Z), Z, C.POINTER(P))
+_sig(
+    "hmath_tensor_borrow",
+    C.c_int,
+    C.POINTER(D),
+    Z,
+    C.POINTER(Z),
+    C.POINTER(Z),
+    Z,
+    P,
+    P,
+    C.POINTER(P),
+)
+_sig("hmath_tensor_retain", None, P)
+_sig("hmath_tensor_release", None, P)
+_sig("hmath_tensor_count", Z, P)
+_sig("hmath_tensor_rank", Z, P)
+_sig("hmath_tensor_metadata", C.c_int, P, C.POINTER(Z), C.POINTER(Z), Z)
+_sig("hmath_tensor_copy_to", C.c_int, P, C.POINTER(D), Z)
+_sig("hmath_tensor_data", C.c_int, P, C.POINTER(C.POINTER(D)), C.POINTER(Z))
+_sig("hmath_scalar_add", C.c_int, P, D, D, C.POINTER(D))
+_sig("hmath_tensor_sum", C.c_int, P, P, C.POINTER(D))
+_sig("hmath_tensor_dot", C.c_int, P, P, P, C.POINTER(D))
+for _name in ("hmath_tensor_add", "hmath_tensor_matmul"):
+    _sig(_name, C.c_int, P, P, P, C.POINTER(P))
+_sig("hmath_tensor_reshape", C.c_int, P, C.POINTER(Z), Z, C.POINTER(P))
+
+
+class HMathError(RuntimeError):
+    def __init__(self, status):
+        self.status = status
+        super().__init__(_lib.hmath_last_error_message().decode("utf-8", "replace"))
+
+
+def _check(status):
+    if status:
+        raise HMathError(status)
+
+
+def initialize():
+    if _lib.hmath_abi_version() != 1:
+        raise RuntimeError("HMath binding requires ABI 1")
+    if _lib.hmath_init():
+        raise RuntimeError("HMath runtime was permanently shut down")
+
+
+def shutdown():
+    """Process-owner operation; join all numerical users before calling."""
+    _check(_lib.hmath_runtime_shutdown())
+
+
+def add(a, b):
+    initialize()
+    result = D()
+    _check(_lib.hmath_scalar_add(None, a, b, C.byref(result)))
+    return result.value
+
+
+def _shape(shape):
+    shape = tuple(shape)
+    if len(shape) > 8 or any(type(n) is not int or n < 0 or n > 1048576 for n in shape):
+        raise ValueError("shape requires at most eight nonnegative bounded integers")
+    return shape, (Z * len(shape))(*shape)
+
+
+class Tensor:
+    def __init__(self, values, shape=None):
+        initialize()
+        values = list(islice(values, 1048577))
+        self._lock, self._ptr, self._owner = threading.RLock(), P(), None
+        shape, dims = _shape((len(values),) if shape is None else shape)
+        if len(values) > 1048576:
+            raise ValueError("tensor exceeds element budget")
+        data = (D * len(values))(*values)
+        _check(
+            _lib.hmath_tensor_copy(
+                data, len(values), dims, len(shape), C.byref(self._ptr)
+            )
+        )
+
+    @classmethod
+    def _adopt(cls, ptr, owner=None):
+        result = object.__new__(cls)
+        result._lock, result._ptr, result._owner = threading.RLock(), ptr, owner
+        return result
+
+    @classmethod
+    def scalar(cls, value):
+        return cls([value], ())
+
+    @classmethod
+    def matrix(cls, values, rows, columns):
+        return cls(values, (rows, columns))
+
+    @classmethod
+    def from_numpy(cls, array, copy=True):
+        import numpy as np
+
+        array = np.asarray(array)
+        if array.size > 1048576 or array.ndim > 8:
+            raise ValueError("tensor exceeds element or rank budget")
+        if copy:
+            array = np.asarray(array, dtype=np.float64)
+            return cls(array.ravel(order="C"), array.shape)
+        initialize()
+        if (
+            array.dtype != np.dtype("float64")
+            or not array.dtype.isnative
+            or not array.flags.aligned
+            or array.flags.writeable
+        ):
+            raise ValueError("zero-copy requires readonly aligned native float64")
+        shape, dims = _shape(array.shape)
+        if any(s < 0 or s % 8 for s in array.strides):
+            raise ValueError("zero-copy requires nonnegative whole-element strides")
+        strides = (Z * array.ndim)(*(s // 8 for s in array.strides))
+        span = (
+            0
+            if array.size == 0
+            else 1 + sum((n - 1) * (s // 8) for n, s in zip(shape, array.strides))
+        )
+        ptr = P()
+        _check(
+            _lib.hmath_tensor_borrow(
+                array.ctypes.data_as(C.POINTER(D)),
+                span,
+                dims,
+                strides,
+                array.ndim,
+                None,
+                None,
+                C.byref(ptr),
+            )
+        )
+        return cls._adopt(ptr, array)
+
+    def _live(self):
+        if not self._ptr:
+            raise RuntimeError("Tensor is closed")
+        return self._ptr
+
+    def close(self):
+        lock = getattr(self, "_lock", None)
+        if lock is not None:
+            with lock:
+                if self._ptr:
+                    _lib.hmath_tensor_release(self._ptr)
+                    self._ptr = P()
+                    self._owner = None
+
+    def __del__(self):
+        self.close()
+
+    def __enter__(self):
+        self._live()
+        return self
+
+    def __exit__(self, *args):
+        self.close()
+
+    @property
+    def shape(self):
+        with self._lock:
+            rank = _lib.hmath_tensor_rank(self._live())
+            dims, steps = (Z * rank)(), (Z * rank)()
+            _check(_lib.hmath_tensor_metadata(self._ptr, dims, steps, rank))
+            return tuple(dims)
+
+    def values(self):
+        with self._lock:
+            count = _lib.hmath_tensor_count(self._live())
+            result = (D * count)()
+            _check(_lib.hmath_tensor_copy_to(self._ptr, result, count))
+            return list(result)
+
+    def numpy(self, copy=True):
+        import numpy as np
+
+        with self._lock:
+            if copy:
+                return np.array(self.values()).reshape(self.shape)
+            rank = _lib.hmath_tensor_rank(self._live())
+            dims, steps = (Z * rank)(), (Z * rank)()
+            _check(_lib.hmath_tensor_metadata(self._ptr, dims, steps, rank))
+            data, count = C.POINTER(D)(), Z()
+            _check(_lib.hmath_tensor_data(self._ptr, C.byref(data), C.byref(count)))
+            if count.value == 0:
+                result = np.empty(tuple(dims))
+                result.setflags(write=False)
+                return result
+            buffer = (D * count.value).from_address(C.addressof(data.contents))
+            result = np.ndarray(
+                tuple(dims),
+                dtype=np.float64,
+                buffer=memoryview(buffer).toreadonly(),
+                strides=tuple(s * 8 for s in steps),
+            )
+            # Keep ownership on the actual buffer shared by every NumPy base
+            # chain. A finalizer on only the first ndarray would release too
+            # early when another array is created from view.base.
+            retained, owner = P(self._ptr.value), self._owner
+            _lib.hmath_tensor_retain(retained)
+            weakref.finalize(
+                buffer, lambda p, keep: _lib.hmath_tensor_release(p), retained, owner
+            )
+            return result
+
+    def sum(self):
+        with self._lock:
+            result = D()
+            _check(_lib.hmath_tensor_sum(None, self._live(), C.byref(result)))
+            return result.value
+
+    def _binary(self, other, operation, scalar=False):
+        # Stable lock ordering prevents opposite-operand deadlocks.
+        first, second = sorted((self, other), key=id)
+        with first._lock, second._lock:
+            result = D() if scalar else P()
+            _check(operation(None, self._live(), other._live(), C.byref(result)))
+            return result.value if scalar else self._adopt(result)
+
+    def dot(self, other):
+        return self._binary(other, _lib.hmath_tensor_dot, True)
+
+    def __add__(self, other):
+        return self._binary(other, _lib.hmath_tensor_add)
+
+    def __matmul__(self, other):
+        return self._binary(other, _lib.hmath_tensor_matmul)
+
+    def reshape(self, shape):
+        shape, dims = _shape(shape)
+        with self._lock:
+            result = P()
+            _check(
+                _lib.hmath_tensor_reshape(
+                    self._live(), dims, len(shape), C.byref(result)
+                )
+            )
+            return self._adopt(result, self._owner)

hmath_cffi.py

@@ -0,0 +1,127 @@
+# SPDX-License-Identifier: MPL-2.0
+"""Optional cffi ABI binding; no compiler needed. Explicit close/with cleanup."""
+
+import os
+from itertools import islice
+
+from cffi import FFI
+
+ffi = FFI()
+ffi.cdef("""
+typedef struct hmath_tensor hmath_tensor;
+unsigned int hmath_abi_version(void); int hmath_init(void);
+const char *hmath_last_error_message(void);
+int hmath_scalar_add(void*,double,double,double*);
+int hmath_tensor_copy(const double*,size_t,const size_t*,size_t,hmath_tensor**);
+void hmath_tensor_release(hmath_tensor*);
+size_t hmath_tensor_count(const hmath_tensor*);
+int hmath_tensor_copy_to(const hmath_tensor*,double*,size_t);
+int hmath_tensor_sum(void*,const hmath_tensor*,double*);
+int hmath_tensor_dot(void*,const hmath_tensor*,const hmath_tensor*,double*);
+int hmath_tensor_add(void*,const hmath_tensor*,const hmath_tensor*,hmath_tensor**);
+int hmath_tensor_matmul(void*,const hmath_tensor*,const hmath_tensor*,hmath_tensor**);
+""")
+lib = ffi.dlopen(os.environ.get("HMATH_LIBRARY", "libhmath.so"))
+try:
+    if lib.hmath_abi_version() != 1:
+        raise RuntimeError("HMath binding requires ABI 1")
+except AttributeError as error:
+    raise RuntimeError(
+        "HMath binding requires ABI 1; library has no version query"
+    ) from error
+if lib.hmath_init():
+    raise RuntimeError("HMath runtime was permanently shut down")
+
+
+class HMathError(RuntimeError):
+    def __init__(self, status):
+        self.status = status
+        super().__init__(ffi.string(lib.hmath_last_error_message()).decode())
+
+
+def check(status):
+    if status:
+        raise HMathError(status)
+
+
+def add(a, b):
+    result = ffi.new("double *")
+    check(lib.hmath_scalar_add(ffi.NULL, a, b, result))
+    return result[0]
+
+
+class Tensor:
+    """Do not close a cffi tensor concurrently with operations on that tensor."""
+
+    def __init__(self, values, shape=None):
+        values = list(islice(values, 1048577))
+        shape = list(shape if shape is not None else [len(values)])
+        if (
+            len(shape) > 8
+            or len(values) > 1048576
+            or any(type(n) is not int or n < 0 or n > 1048576 for n in shape)
+        ):
+            raise ValueError("invalid bounded shape")
+        out = ffi.new("hmath_tensor **")
+        check(
+            lib.hmath_tensor_copy(
+                ffi.new("double[]", values),
+                len(values),
+                ffi.new("size_t[]", shape),
+                len(shape),
+                out,
+            )
+        )
+        self.ptr = ffi.gc(out[0], lib.hmath_tensor_release)
+        self.shape = tuple(shape)
+
+    def _live(self):
+        if self.ptr == ffi.NULL:
+            raise RuntimeError("Tensor is closed")
+        return self.ptr
+
+    def close(self):
+        if self.ptr != ffi.NULL:
+            ffi.release(self.ptr)
+            self.ptr = ffi.NULL
+
+    def __enter__(self):
+        self._live()
+        return self
+
+    def __exit__(self, *args):
+        self.close()
+
+    def values(self):
+        n = lib.hmath_tensor_count(self._live())
+        out = ffi.new("double[]", n)
+        check(lib.hmath_tensor_copy_to(self.ptr, out, n))
+        return list(out)
+
+    def sum(self):
+        out = ffi.new("double *")
+        check(lib.hmath_tensor_sum(ffi.NULL, self._live(), out))
+        return out[0]
+
+    def dot(self, other):
+        out = ffi.new("double *")
+        check(lib.hmath_tensor_dot(ffi.NULL, self._live(), other._live(), out))
+        return out[0]
+
+    def _binary(self, other, operation, shape):
+        out = ffi.new("hmath_tensor **")
+        check(operation(ffi.NULL, self._live(), other._live(), out))
+        result = object.__new__(Tensor)
+        result.ptr, result.shape = ffi.gc(out[0], lib.hmath_tensor_release), shape
+        return result
+
+    def __add__(self, other):
+        return self._binary(other, lib.hmath_tensor_add, self.shape)
+
+    def __matmul__(self, other):
+        shape = (
+            (self.shape[0], other.shape[1])
+            if len(self.shape) == len(other.shape) == 2
+            else ()
+        )
+        return self._binary(other, lib.hmath_tensor_matmul, shape)

hmath_python-1.0.0.dist-info/METADATA

@@ -0,0 +1,103 @@
+Metadata-Version: 2.4
+Name: hmath-python
+Version: 1.0.0
+Summary: Python bindings for the Haskell HMath numerical library
+License-Expression: MPL-2.0
+Project-URL: Homepage, https://github.com/wavefnd/hmath
+Project-URL: Source, https://github.com/wavefnd/hmath
+Project-URL: Issues, https://github.com/wavefnd/hmath/issues
+Keywords: mathematics,haskell,ffi,tensor
+Classifier: Development Status :: 5 - Production/Stable
+Classifier: Operating System :: POSIX :: Linux
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Provides-Extra: cffi
+Requires-Dist: cffi>=1.15; extra == "cffi"
+Provides-Extra: numpy
+Requires-Dist: numpy>=1.22; extra == "numpy"
+Dynamic: license-file
+
+# HMath
+
+HMath is a mathematics and numerical computing library with Python bindings, written in Haskell. It also provides native Haskell, C, and Wave interfaces.
+
+The 1.0.0 release targets Linux x86-64. The Python distribution is named **hmath-python** and is imported as `hmath`.
+
+## Python quick start
+
+Install the Python package on Linux x86-64:
+
+```sh
+pip install hmath-python
+```
+
+```python
+from hmath import Tensor, add
+
+print(add(2, 3))  # 5.0
+
+with Tensor.matrix([1, 2, 3, 4], 2, 2) as matrix:
+    with matrix @ matrix as product:
+        print(product.values())  # [7.0, 10.0, 15.0, 22.0]
+```
+
+Use `with` to release native resources automatically. Invalid operations raise `HMathError`. Install `hmath-python[numpy,cffi]` for optional NumPy and cffi support.
+
+## Features
+
+- **Core math:** checked scalar operations, numeric types, constants, units, number theory, and polynomials.
+- **Linear algebra:** dense and sparse matrices, decompositions, iterative solvers, and CPU tensors.
+- **Scientific computing:** differentiation, integration, ODE/PDE solvers, optimization, interpolation, FFTs, and signal processing.
+- **Statistics and learning:** reproducible sampling, probability distributions, inference, automatic differentiation, and machine learning primitives.
+- **Discrete and symbolic math:** combinatorics, graphs, numerical data structures, symbolic calculus, and a bounded expression evaluator.
+- **Applied math:** complex numbers, rotations, computational geometry, time series, and numerical image processing.
+- **Native interface:** checked scalar, vector, matrix, and tensor operations; explicit ownership and errors; Python/NumPy and Wave bindings.
+- **Interchange:** typed binary and text arrays, CSV/TSV, Matrix Market, NPY/NPZ, and CPU DLPack.
+
+The Haskell library contains the full numerical API; Python currently exposes scalar addition and binary64 vector, matrix, and tensor construction, arithmetic, and reductions.
+
+## Build from source
+
+Requires GHC, Cabal, a C11 compiler, Meson >= 1.3, Ninja, and Python 3. Zlib enables compressed interchange. BLAS/LAPACKE are optional runtime backends; the full spectral test suite needs LAPACKE.
+
+```sh
+git clone https://github.com/wavefnd/hmath.git
+cd hmath
+meson setup builddir
+meson compile -C builddir
+meson test -C builddir --print-errorlogs
+```
+
+This builds `builddir/libhmath.so` and runs the Haskell, C, and Python tests. Wave tests also run when `wavec` is available.
+
+## Haskell
+
+Save the following as `Main.hs` in the checkout. Run `cabal build lib:hmath`, then `cabal exec -- runghc -package=hmath Main.hs`:
+
+```haskell
+import HMath
+
+main :: IO ()
+main = do
+    print (dotChecked [1, 2, 3 :: Int] [4, 5, 6]) -- Right 32
+    print $ do
+        matrix <- fromListChecked 2 2 [1, 2, 3, 4 :: Int]
+        pure (toList (transposeMatrix matrix))   -- Right [1,3,2,4]
+```
+
+Checked operations return `Either MathError` for invalid shapes or lengths. More examples are available in [examples/haskell](examples/haskell).
+
+## C and Wave
+
+The [C header](include/hmath.h) defines errors, ownership, and runtime lifetime. See the [C example](examples/c/main.c) and [Wave bindings](bindings/wave) for usage.
+
+## Contributing
+
+Report bugs or discuss changes through [GitHub issues](https://github.com/wavefnd/hmath/issues). Submit pull requests from a fork against `master`; see [ROADMAP.md](ROADMAP.md) for planned work.
+
+## License
+
+[Mozilla Public License 2.0](LICENSE).

hmath_python-1.0.0.dist-info/RECORD

@@ -0,0 +1,7 @@
+hmath.py,sha256=JtAmA3XCoNXIWyZWn4wYTkAf0XsKFxlC56Y1Dy-1_xU,9390
+hmath_cffi.py,sha256=ufU0JfjMAiLA7NsLrVoyG0LHz62aFhs6HBvpJOdDovc,4083
+hmath_python-1.0.0.dist-info/licenses/LICENSE,sha256=Pz2eACSxkhsGfW9_iN60pgy-enjnbGTj8df8O3ebnQQ,16726
+hmath_python-1.0.0.dist-info/METADATA,sha256=Hv52tVxAGjrWAf76WAxDxnPr_vwEpQJUtLouFzcoguQ,4255
+hmath_python-1.0.0.dist-info/WHEEL,sha256=mOdXR9C3wMVov7cSY8PY-XCzo3SmmWCHvGQr5csJoao,91
+hmath_python-1.0.0.dist-info/top_level.txt,sha256=1fzu3v5WMqNhy-9mApcfmFj0BBP-HYKeLFjmTHie8CI,17
+hmath_python-1.0.0.dist-info/RECORD,,

hmath_python-1.0.0.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (84.2.1)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

hmath_python-1.0.0.dist-info/licenses/LICENSE

@@ -0,0 +1,373 @@
+Mozilla Public License Version 2.0
+==================================
+
+1. Definitions
+--------------
+
+1.1. "Contributor"
+    means each individual or legal entity that creates, contributes to
+    the creation of, or owns Covered Software.
+
+1.2. "Contributor Version"
+    means the combination of the Contributions of others (if any) used
+    by a Contributor and that particular Contributor's Contribution.
+
+1.3. "Contribution"
+    means Covered Software of a particular Contributor.
+
+1.4. "Covered Software"
+    means Source Code Form to which the initial Contributor has attached
+    the notice in Exhibit A, the Executable Form of such Source Code
+    Form, and Modifications of such Source Code Form, in each case
+    including portions thereof.
+
+1.5. "Incompatible With Secondary Licenses"
+    means
+
+    (a) that the initial Contributor has attached the notice described
+        in Exhibit B to the Covered Software; or
+
+    (b) that the Covered Software was made available under the terms of
+        version 1.1 or earlier of the License, but not also under the
+        terms of a Secondary License.
+
+1.6. "Executable Form"
+    means any form of the work other than Source Code Form.
+
+1.7. "Larger Work"
+    means a work that combines Covered Software with other material, in
+    a separate file or files, that is not Covered Software.
+
+1.8. "License"
+    means this document.
+
+1.9. "Licensable"
+    means having the right to grant, to the maximum extent possible,
+    whether at the time of the initial grant or subsequently, any and
+    all of the rights conveyed by this License.
+
+1.10. "Modifications"
+    means any of the following:
+
+    (a) any file in Source Code Form that results from an addition to,
+        deletion from, or modification of the contents of Covered
+        Software; or
+
+    (b) any new file in Source Code Form that contains any Covered
+        Software.
+
+1.11. "Patent Claims" of a Contributor
+    means any patent claim(s), including without limitation, method,
+    process, and apparatus claims, in any patent Licensable by such
+    Contributor that would be infringed, but for the grant of the
+    License, by the making, using, selling, offering for sale, having
+    made, import, or transfer of either its Contributions or its
+    Contributor Version.
+
+1.12. "Secondary License"
+    means either the GNU General Public License, Version 2.0, the GNU
+    Lesser General Public License, Version 2.1, the GNU Affero General
+    Public License, Version 3.0, or any later versions of those
+    licenses.
+
+1.13. "Source Code Form"
+    means the form of the work preferred for making modifications.
+
+1.14. "You" (or "Your")
+    means an individual or a legal entity exercising rights under this
+    License. For legal entities, "You" includes any entity that
+    controls, is controlled by, or is under common control with You. For
+    purposes of this definition, "control" means (a) the power, direct
+    or indirect, to cause the direction or management of such entity,
+    whether by contract or otherwise, or (b) ownership of more than
+    fifty percent (50%) of the outstanding shares or beneficial
+    ownership of such entity.
+
+2. License Grants and Conditions
+--------------------------------
+
+2.1. Grants
+
+Each Contributor hereby grants You a world-wide, royalty-free,
+non-exclusive license:
+
+(a) under intellectual property rights (other than patent or trademark)
+    Licensable by such Contributor to use, reproduce, make available,
+    modify, display, perform, distribute, and otherwise exploit its
+    Contributions, either on an unmodified basis, with Modifications, or
+    as part of a Larger Work; and
+
+(b) under Patent Claims of such Contributor to make, use, sell, offer
+    for sale, have made, import, and otherwise transfer either its
+    Contributions or its Contributor Version.
+
+2.2. Effective Date
+
+The licenses granted in Section 2.1 with respect to any Contribution
+become effective for each Contribution on the date the Contributor first
+distributes such Contribution.
+
+2.3. Limitations on Grant Scope
+
+The licenses granted in this Section 2 are the only rights granted under
+this License. No additional rights or licenses will be implied from the
+distribution or licensing of Covered Software under this License.
+Notwithstanding Section 2.1(b) above, no patent license is granted by a
+Contributor:
+
+(a) for any code that a Contributor has removed from Covered Software;
+    or
+
+(b) for infringements caused by: (i) Your and any other third party's
+    modifications of Covered Software, or (ii) the combination of its
+    Contributions with other software (except as part of its Contributor
+    Version); or
+
+(c) under Patent Claims infringed by Covered Software in the absence of
+    its Contributions.
+
+This License does not grant any rights in the trademarks, service marks,
+or logos of any Contributor (except as may be necessary to comply with
+the notice requirements in Section 3.4).
+
+2.4. Subsequent Licenses
+
+No Contributor makes additional grants as a result of Your choice to
+distribute the Covered Software under a subsequent version of this
+License (see Section 10.2) or under the terms of a Secondary License (if
+permitted under the terms of Section 3.3).
+
+2.5. Representation
+
+Each Contributor represents that the Contributor believes its
+Contributions are its original creation(s) or it has sufficient rights
+to grant the rights to its Contributions conveyed by this License.
+
+2.6. Fair Use
+
+This License is not intended to limit any rights You have under
+applicable copyright doctrines of fair use, fair dealing, or other
+equivalents.
+
+2.7. Conditions
+
+Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
+in Section 2.1.
+
+3. Responsibilities
+-------------------
+
+3.1. Distribution of Source Form
+
+All distribution of Covered Software in Source Code Form, including any
+Modifications that You create or to which You contribute, must be under
+the terms of this License. You must inform recipients that the Source
+Code Form of the Covered Software is governed by the terms of this
+License, and how they can obtain a copy of this License. You may not
+attempt to alter or restrict the recipients' rights in the Source Code
+Form.
+
+3.2. Distribution of Executable Form
+
+If You distribute Covered Software in Executable Form then:
+
+(a) such Covered Software must also be made available in Source Code
+    Form, as described in Section 3.1, and You must inform recipients of
+    the Executable Form how they can obtain a copy of such Source Code
+    Form by reasonable means in a timely manner, at a charge no more
+    than the cost of distribution to the recipient; and
+
+(b) You may distribute such Executable Form under the terms of this
+    License, or sublicense it under different terms, provided that the
+    license for the Executable Form does not attempt to limit or alter
+    the recipients' rights in the Source Code Form under this License.
+
+3.3. Distribution of a Larger Work
+
+You may create and distribute a Larger Work under terms of Your choice,
+provided that You also comply with the requirements of this License for
+the Covered Software. If the Larger Work is a combination of Covered
+Software with a work governed by one or more Secondary Licenses, and the
+Covered Software is not Incompatible With Secondary Licenses, this
+License permits You to additionally distribute such Covered Software
+under the terms of such Secondary License(s), so that the recipient of
+the Larger Work may, at their option, further distribute the Covered
+Software under the terms of either this License or such Secondary
+License(s).
+
+3.4. Notices
+
+You may not remove or alter the substance of any license notices
+(including copyright notices, patent notices, disclaimers of warranty,
+or limitations of liability) contained within the Source Code Form of
+the Covered Software, except that You may alter any license notices to
+the extent required to remedy known factual inaccuracies.
+
+3.5. Application of Additional Terms
+
+You may choose to offer, and to charge a fee for, warranty, support,
+indemnity or liability obligations to one or more recipients of Covered
+Software. However, You may do so only on Your own behalf, and not on
+behalf of any Contributor. You must make it absolutely clear that any
+such warranty, support, indemnity, or liability obligation is offered by
+You alone, and You hereby agree to indemnify every Contributor for any
+liability incurred by such Contributor as a result of warranty, support,
+indemnity or liability terms You offer. You may include additional
+disclaimers of warranty and limitations of liability specific to any
+jurisdiction.
+
+4. Inability to Comply Due to Statute or Regulation
+---------------------------------------------------
+
+If it is impossible for You to comply with any of the terms of this
+License with respect to some or all of the Covered Software due to
+statute, judicial order, or regulation then You must: (a) comply with
+the terms of this License to the maximum extent possible; and (b)
+describe the limitations and the code they affect. Such description must
+be placed in a text file included with all distributions of the Covered
+Software under this License. Except to the extent prohibited by statute
+or regulation, such description must be sufficiently detailed for a
+recipient of ordinary skill to be able to understand it.
+
+5. Termination
+--------------
+
+5.1. The rights granted under this License will terminate automatically
+if You fail to comply with any of its terms. However, if You become
+compliant, then the rights granted under this License from a particular
+Contributor are reinstated (a) provisionally, unless and until such
+Contributor explicitly and finally terminates Your grants, and (b) on an
+ongoing basis, if such Contributor fails to notify You of the
+non-compliance by some reasonable means prior to 60 days after You have
+come back into compliance. Moreover, Your grants from a particular
+Contributor are reinstated on an ongoing basis if such Contributor
+notifies You of the non-compliance by some reasonable means, this is the
+first time You have received notice of non-compliance with this License
+from such Contributor, and You become compliant prior to 30 days after
+Your receipt of the notice.
+
+5.2. If You initiate litigation against any entity by asserting a patent
+infringement claim (excluding declaratory judgment actions,
+counter-claims, and cross-claims) alleging that a Contributor Version
+directly or indirectly infringes any patent, then the rights granted to
+You by any and all Contributors for the Covered Software under Section
+2.1 of this License shall terminate.
+
+5.3. In the event of termination under Sections 5.1 or 5.2 above, all
+end user license agreements (excluding distributors and resellers) which
+have been validly granted by You or Your distributors under this License
+prior to termination shall survive termination.
+
+************************************************************************
+*                                                                      *
+*  6. Disclaimer of Warranty                                           *
+*  -------------------------                                           *
+*                                                                      *
+*  Covered Software is provided under this License on an "as is"       *
+*  basis, without warranty of any kind, either expressed, implied, or  *
+*  statutory, including, without limitation, warranties that the       *
+*  Covered Software is free of defects, merchantable, fit for a        *
+*  particular purpose or non-infringing. The entire risk as to the     *
+*  quality and performance of the Covered Software is with You.        *
+*  Should any Covered Software prove defective in any respect, You     *
+*  (not any Contributor) assume the cost of any necessary servicing,   *
+*  repair, or correction. This disclaimer of warranty constitutes an   *
+*  essential part of this License. No use of any Covered Software is   *
+*  authorized under this License except under this disclaimer.         *
+*                                                                      *
+************************************************************************
+
+************************************************************************
+*                                                                      *
+*  7. Limitation of Liability                                          *
+*  --------------------------                                          *
+*                                                                      *
+*  Under no circumstances and under no legal theory, whether tort      *
+*  (including negligence), contract, or otherwise, shall any           *
+*  Contributor, or anyone who distributes Covered Software as          *
+*  permitted above, be liable to You for any direct, indirect,         *
+*  special, incidental, or consequential damages of any character      *
+*  including, without limitation, damages for lost profits, loss of    *
+*  goodwill, work stoppage, computer failure or malfunction, or any    *
+*  and all other commercial damages or losses, even if such party      *
+*  shall have been informed of the possibility of such damages. This   *
+*  limitation of liability shall not apply to liability for death or   *
+*  personal injury resulting from such party's negligence to the       *
+*  extent applicable law prohibits such limitation. Some               *
+*  jurisdictions do not allow the exclusion or limitation of           *
+*  incidental or consequential damages, so this exclusion and          *
+*  limitation may not apply to You.                                    *
+*                                                                      *
+************************************************************************
+
+8. Litigation
+-------------
+
+Any litigation relating to this License may be brought only in the
+courts of a jurisdiction where the defendant maintains its principal
+place of business and such litigation shall be governed by laws of that
+jurisdiction, without reference to its conflict-of-law provisions.
+Nothing in this Section shall prevent a party's ability to bring
+cross-claims or counter-claims.
+
+9. Miscellaneous
+----------------
+
+This License represents the complete agreement concerning the subject
+matter hereof. If any provision of this License is held to be
+unenforceable, such provision shall be reformed only to the extent
+necessary to make it enforceable. Any law or regulation which provides
+that the language of a contract shall be construed against the drafter
+shall not be used to construe this License against a Contributor.
+
+10. Versions of the License
+---------------------------
+
+10.1. New Versions
+
+Mozilla Foundation is the license steward. Except as provided in Section
+10.3, no one other than the license steward has the right to modify or
+publish new versions of this License. Each version will be given a
+distinguishing version number.
+
+10.2. Effect of New Versions
+
+You may distribute the Covered Software under the terms of the version
+of the License under which You originally received the Covered Software,
+or under the terms of any subsequent version published by the license
+steward.
+
+10.3. Modified Versions
+
+If you create software not governed by this License, and you want to
+create a new license for such software, you may create and use a
+modified version of this License if you rename the license and remove
+any references to the name of the license steward (except to note that
+such modified license differs from this License).
+
+10.4. Distributing Source Code Form that is Incompatible With Secondary
+Licenses
+
+If You choose to distribute Source Code Form that is Incompatible With
+Secondary Licenses under the terms of this version of the License, the
+notice described in Exhibit B of this License must be attached.
+
+Exhibit A - Source Code Form License Notice
+-------------------------------------------
+
+  This Source Code Form is subject to the terms of the Mozilla Public
+  License, v. 2.0. If a copy of the MPL was not distributed with this
+  file, You can obtain one at https://mozilla.org/MPL/2.0/.
+
+If it is not possible or desirable to put the notice in a particular
+file, then You may include the notice in a location (such as a LICENSE
+file in a relevant directory) where a recipient would be likely to look
+for such a notice.
+
+You may add additional accurate notices of copyright ownership.
+
+Exhibit B - "Incompatible With Secondary Licenses" Notice
+---------------------------------------------------------
+
+  This Source Code Form is "Incompatible With Secondary Licenses", as
+  defined by the Mozilla Public License, v. 2.0.

hmath_python-1.0.0.dist-info/top_level.txt

@@ -0,0 +1,2 @@
+hmath
+hmath_cffi