mplusa 0.0.2__py3-none-any.whl → 0.0.4__py3-none-any.whl

mplusa/maxplus.py

@@ -1,179 +0,0 @@
-import math
-import numpy as np
-from numbers import Real
-
-
-def add(*args) -> Real:
-    if math.inf in args:
-        raise ValueError(
-            'Maxplus.add: value out of domain.'
-        )
-    return max(args)
-
-
-def mult(*args) -> Real:
-    if math.inf in args:
-        raise ValueError(
-            'Maxplus.add: value out of domain.'
-        )
-    return sum(args) if -math.inf not in args else -math.inf
-
-
-def add_matrices(A : np.ndarray,
-                 B : np.ndarray) -> np.ndarray:
-    if A.shape != B.shape:
-        raise ValueError(
-            'Maxplus.add_matrices: given matrices ' +\
-            'are of different shape (A: {}, B: {}).'.format(A.shape, B.shape)
-        )
-    result = np.copy(A)
-    shape = A.shape
-    for i in range(shape[0]):
-        for j in range(shape[1]):
-            result[i, j] = add(result[i, j], B[i, j])
-    return result
-
-
-def mult_matrices(A : np.ndarray,
-                  B : np.ndarray) -> np.ndarray:
-    if A.shape[1] != B.shape[0]:
-        raise ValueError(
-            'Maxplus.mult_matrices: given matrices ' +\
-            'are of shapes not given as MxN and NxP (A: {}, B: {}).'.format(
-                A.shape, B.shape
-            )
-        )
-    result = np.zeros((A.shape[0], B.shape[1]))
-    for i in range(A.shape[0]):
-        for j in range(B.shape[1]):
-            result[i, j] = add(*[mult(A[i, k], B[k, j]) for k in range(A.shape[1])])
-    return result
-
-
-def modulo(a : Real,
-           t : int) -> Real:
-    if a < 0 or t < 0:
-        raise ValueError(
-            'Maxplus.modulo: modulo operation is only defined for positive numbers.'
-        )
-    if a == -math.inf:
-        return -math.inf
-    if a == 0:
-        return 0
-    if t == -math.inf or t == 0:
-        return a
-    return a - (a // t) * t
-
-
-def modulo_matrices(A : np.ndarray,
-                    b : np.ndarray) -> np.ndarray:
-    if b.shape[1] != 1:
-        raise ValueError(
-            'Maxplus.modulo_matrices: given matrix b ' +\
-            'is not a vertical vector of shape Mx1 (has shape of {}).'.format(
-                b.shape
-            )
-        )
-    if A.shape[0] != b.shape[0]:
-        raise ValueError(
-            'Maxplus.modulo_matrices: given matrix b ' +\
-            'does not have an Mx1 shape against MxN matrix A (A: {}, b: {}).'.format(
-                A.shape, b.shape
-            )
-        )
-    if np.any(A < 0) or np.any(b < 0):
-        raise ValueError(
-            'Maxplus.modulo_matrices: matrices contain negative values.'
-        )
-    result = np.zeros(A.shape)
-    for i in range(A.shape[0]):
-        for j in range(A.shape[1]):
-            result[i, j] = modulo(A[i, j], b[i])
-    return result
-
-
-def power(a : Real,
-          k : int) -> Real:
-    return mult(*[a for _ in range(k)])
-
-
-def power_matrix(A : np.ndarray,
-                 k : int) -> np.ndarray:
-    if np.any(np.diagonal(A) != 0):
-        raise ValueError(
-            'Maxplus.power_matrix: matrix contains non-zero values on the diagonal.'
-        )
-    if k == 0:
-        result = unit_matrix(A.shape[0], A.shape[1])
-    else:
-        result = A.copy()
-        for _ in range(k):
-            result = mult_matrices(A, result)
-    return result
-
-
-def unit_matrix(width : int,
-                height : int) -> np.ndarray:
-    if width < 0 or height < 0:
-        raise ValueError(
-            'Maxplus.unit_matrix: invalid width or height.'
-        )
-    result = np.eye(width, height)
-    result[result == 0] = -math.inf
-    result[result == 1] = 0
-    return result
-
-
-def star(A : np.ndarray,
-         iterations : int = 1000,
-         eps : float = 0.001) -> np.ndarray:
-    if A.shape[0] != A.shape[1]:
-        raise ValueError(
-            'Maxplus.star: matrix is not square.'
-        )
-    series = [
-        unit_matrix(A.shape[0], A.shape[1]),
-        A.copy()
-    ]
-    for i in range(2, iterations):
-        series.append(add_matrices(series[-1], series[-2]))
-        # Very basic check if the series is convergent.
-        if abs(np.max(series[-1] - series[-2])) < eps:
-            break
-    else:
-        raise ValueError(
-            'Maxplus.star: the series for this matrix is not convergent ' +\
-            '(within the limits of iterations and decimal places).'
-        )
-    return series[-1]
-
-
-class Polynomial:
-    """ A simple implementation of a single-variable arctic polynomial. """
-
-    def __init__(self, *coefficients) -> None:
-        for value in coefficients:
-            if not isinstance(value, Real) or value == math.inf:
-                raise ValueError(
-                    'Maxplus.Polynomial.__init__: coefficient value out of domain.'
-                )
-        self.coefficients = coefficients[::-1]
-
-    def __call__(self, x : float) -> float:
-        return add(*[mult(coefficient, power(x, i)) for i, coefficient in enumerate(self.coefficients)])
-
-    def get_lines(self) -> list[tuple[float]]:
-        """ Returns the a and b values of standard linear functions building the polynomial in form of y = ax + b. """
-        return [(a, b) for a, b in enumerate(self.coefficients) if b > -math.inf]
-
-    def get_hypersurface(self) -> list[float]:
-        lines = self.get_lines()
-        result = []
-        for (a, c) in lines:
-            for (b, d) in lines:
-                if a == b or c == d:
-                    continue
-                x = (d - c) / (a - b)
-                if a * x + c == self(x):
-                    result.append(x)
-        return list(set(result))

mplusa/minplus.py

@@ -1,179 +0,0 @@
-import math
-import numpy as np
-from numbers import Real
-
-
-def add(*args) -> Real:
-    if -math.inf in args:
-        raise ValueError(
-            'Minplus.add: value out of domain.'
-        )
-    return min(args)
-
-
-def mult(*args) -> Real:
-    if -math.inf in args:
-        raise ValueError(
-            'Minplus.mult: value out of domain.'
-        )
-    return sum(args) if math.inf not in args else math.inf
-
-
-def add_matrices(A : np.ndarray,
-                 B : np.ndarray) -> np.ndarray:
-    if A.shape != B.shape:
-        raise ValueError(
-            'Minplus.add_matrices: given matrices ' +\
-            'are of different shape (A: {}, B: {}).'.format(A.shape, B.shape)
-        )
-    result = np.copy(A)
-    shape = A.shape
-    for i in range(shape[0]):
-        for j in range(shape[1]):
-            result[i, j] = add(result[i, j], B[i, j])
-    return result
-
-
-def mult_matrices(A : np.ndarray,
-                  B : np.ndarray) -> np.ndarray:
-    if A.shape[1] != B.shape[0]:
-        raise ValueError(
-            'Minplus.mult_matrices: given matrices ' +\
-            'are of shapes not given as MxN and NxP (A: {}, B: {}).'.format(
-                A.shape, B.shape
-            )
-        )
-    result = np.zeros((A.shape[0], B.shape[1]))
-    for i in range(A.shape[0]):
-        for j in range(B.shape[1]):
-            result[i, j] = add(*[mult(A[i, k], B[k, j]) for k in range(A.shape[1])])
-    return result
-
-
-def modulo(a : Real,
-           t : int) -> Real:
-    if a < 0 or t < 0:
-        raise ValueError(
-            'Minplus.modulo: modulo operation is only defined for positive numbers.'
-        )
-    if a == math.inf:
-        return math.inf
-    if a == 0:
-        return 0
-    if t == math.inf or t == 0:
-        return a
-    return a - (a // t) * t
-
-
-def modulo_matrices(A : np.ndarray,
-                    b : np.ndarray) -> np.ndarray:
-    if b.shape[1] != 1:
-        raise ValueError(
-            'Minplus.modulo_matrices: given matrix b ' +\
-            'is not a vertical vector of shape Mx1 (has shape of {}).'.format(
-                b.shape
-            )
-        )
-    if A.shape[0] != b.shape[0]:
-        raise ValueError(
-            'Minplus.modulo_matrices: given matrix b ' +\
-            'does not have an Mx1 shape against MxN matrix A (A: {}, b: {}).'.format(
-                A.shape, b.shape
-            )
-        )
-    if np.any(A < 0) or np.any(b < 0):
-        raise ValueError(
-            'Minplus.modulo_matrices: matrices contain negative values.'
-        )
-    result = np.zeros(A.shape)
-    for i in range(A.shape[0]):
-        for j in range(A.shape[1]):
-            result[i, j] = modulo(A[i, j], b[i])
-    return result
-
-
-def power(a : Real,
-          k : int) -> Real:
-    return mult(*[a for _ in range(k)])
-
-
-def power_matrix(A : np.ndarray,
-                 k : int) -> np.ndarray:
-    if np.any(np.diagonal(A) != 0):
-        raise ValueError(
-            'Minplus.power_matrix: matrix contains non-zero values on the diagonal.'
-        )
-    if k == 0:
-        result = unit_matrix(A.shape[0], A.shape[1])
-    else:
-        result = A.copy()
-        for _ in range(k):
-            result = mult_matrices(A, result)
-    return result
-
-
-def unit_matrix(width : int,
-                height : int) -> np.ndarray:
-    if width < 0 or height < 0:
-        raise ValueError(
-            'Minplus.unit_matrix: invalid width or height.'
-        )
-    result = np.eye(width, height)
-    result[result == 0] = math.inf
-    result[result == 1] = 0
-    return result
-
-
-def star(A : np.ndarray,
-         iterations : int = 1000,
-         eps : float = 0.001) -> np.ndarray:
-    if A.shape[0] != A.shape[1]:
-        raise ValueError(
-            'Minplus.star: matrix is not square.'
-        )
-    series = [
-        unit_matrix(A.shape[0], A.shape[1]),
-        A.copy()
-    ]
-    for i in range(2, iterations):
-        series.append(add_matrices(series[-1], series[-2]))
-        # Very basic check if the series is convergent.
-        if abs(np.max(series[-1] - series[-2])) < eps:
-            break
-    else:
-        raise ValueError(
-            'Minplus.star: the series for this matrix is not convergent ' +\
-            '(within the limits of iterations and decimal places).'
-        )
-    return series[-1]
-
-
-class Polynomial:
-    """ A simple implementation of a single-variable tropical polynomial. """
-
-    def __init__(self, *coefficients) -> None:
-        for value in coefficients:
-            if not isinstance(value, Real) or value == -math.inf:
-                raise ValueError(
-                    'Minplus.Polynomial.__init__: coefficient value out of domain.'
-                )
-        self.coefficients = coefficients[::-1]
-
-    def __call__(self, x : float) -> float:
-        return add(*[mult(coefficient, power(x, i)) for i, coefficient in enumerate(self.coefficients)])
-
-    def get_lines(self) -> list[tuple[float]]:
-        """ Returns the a and b values of standard linear functions building the polynomial in form of y = ax + b. """
-        return [(a, b) for a, b in enumerate(self.coefficients) if b < math.inf]
-
-    def get_hypersurface(self) -> list[float]:
-        lines = self.get_lines()
-        result = []
-        for (a, c) in lines:
-            for (b, d) in lines:
-                if a == b or c == d:
-                    continue
-                x = (d - c) / (a - b)
-                if a * x + c == self(x):
-                    result.append(x)
-        return list(set(result))

mplusa-0.0.2.dist-info/METADATA

@@ -1,94 +0,0 @@
-Metadata-Version: 2.2
-Name: mplusa
-Version: 0.0.2
-Summary: A library for calculations in tropical and arctic semirings.
-Author-email: "Maksymilian W." <maksymilian3563@gmail.com>
-License: Copyright (c) 2025 Maksymilian Wiekiera
-        
-        Permission is hereby granted, free of charge, to any person obtaining a copy
-        of this software and associated documentation files (the "Software"), to deal
-        in the Software without restriction, including without limitation the rights
-        to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-        copies of the Software, and to permit persons to whom the Software is
-        furnished to do so, subject to the following conditions:
-        
-        The above copyright notice and this permission notice shall be included in all
-        copies or substantial portions of the Software.
-        
-        THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-        IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-        FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-        AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-        LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-        OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-        SOFTWARE.
-Project-URL: homepage, https://github.com/Hadelekw/mplusa
-Classifier: Programming Language :: Python :: 3
-Classifier: Operating System :: OS Independent
-Requires-Python: >=3.11
-Description-Content-Type: text/markdown
-License-File: LICENSE
-Requires-Dist: numpy>=2.2.3
-
-# MPlusA
----
-**MPlusA** is a small Python library for tropical algebra (also known as $(\min, +)$ and $(\max, +)$ algebra). It provides the definitions of basic operations on numbers and NumPy arrays, as well as a basic implementation of tropical polynomials.
-
-Any improvements or fixes are always welcome.
-
-## How to use
-After having installed the library one can import one of the two modules the package consists of (`minplus` and `maxplus`) and use the full array of its capabilities. The functions are essentially the same between the modules. The list below is a full list of the library's capabilities.
-
-**`add(*args) -> Real`**
-	Tropical addition. Essentially an alias for Python's `min` function.
-
-**`mult(*args) -> Real`**
-	Tropical multiplication. Essentially an alias for Python's `sum` function.
-
-**`add_matrices(A : np.ndarray, B : np.ndarray) -> np.ndarray`**
-	Tropical addition of NumPy arrays. The summed matrices have to be of the same shape.
-
-**`mult_matrices(A : np.ndarray, B : np.ndarray) -> np.ndarray`**
-	Tropical multiplication of NumPy arrays. The multiplied matrices have to be of sizes MxN and NxP and their order matters. The result is of shape MxP.
-
-**`modulo(a : Real, t : int) -> Real`**
-	Tropical modulo operator. It can be understood as the difference between the number $a$ and $t^k$ where $k$ is the largest integer that satisfies $a \geq t^k$.
-
-**`modulo_matrices(A : np.ndarray, b : np.ndarray) -> np.ndarray`**
-	Tropical modulo operator for NumPy arrays. The input matrices should be of size MxN and Mx1. The result is an MxN matrix.
-
-**`power(a : real, k : int) -> Real`**
-	Tropical power operator.  Applies the multiplication k times.
-
-**`power_matrix(A : np.ndarray, k : int) -> np.ndarray`**
-	Tropical power operator for NumPy arrays. It multiplies the matrix k times.
-
-**`unit_matrix(width : int, height : int) -> np.ndarray`**
-	Creates a tropical unit matrix of given width and height.
-
-**`star(A : np.ndarray) -> np.ndarray`**
-	Definition of a unique operator of tropical algebra, usually denoted as $\mathbf{A}^*$. It returns the value to which an infinite recursive sum of matrices converges. The input matrix has to be square and the series created in the process of calculating the value needs to be convergent.
-
-**`Polynomial(*coefficients)`**
-	This is a class that implements basic single-variable tropical polynomials. Calling an object of this class allows to take a value the polynomial takes at a given point, it also implements function `get_hypersurface` which returns a list of its roots.
-
-### Example code
-```
-import numpy as np
-from mplusa import minplus
-
-# Basic operators
-s = minplus.add(10, 6, 4, 13)  # -> 4
-p = minplus.mult(10, 5, 8)  # -> 23
-mod = minplus.modulo(p, s)  # -> 3
-
-# NumPy arrays
-A = np.array([[1, 2, 3], [4, 5, 6], [7, 8, 9]])
-B = np.array([[9, 8, 7], [6, 5, 4], [3, 2, 1]])
-S = minplus.add_matrices(A, B)  # -> [[1, 2, 3], [4, 5, 4], [3, 2, 1]]
-P = minplus.mult_matrices(A, B)  # -> [[6, 5, 4], [9, 8, 7], [12, 11, 10]]
-```
-
-## Bibliography
-1. A. Obuchowicz, K. A. D'Souza, Z. A. Banaszak. *An Algebraic Approach to Modelling and Performance Optimisation of a Traffic Route System*. International Journal of Applied Mathematics and Computer Science, vol. 8, no. 2, pp. 335-365, June 1998.
-2. D. Speyer, B. Sturmfels. "*Tropical Mathematics*". Mathematics Magazine, vol. 82, no. 3, pp. 163-173, June 2009, doi: https://doi.org/10.4169%2F193009809x468760.

mplusa-0.0.2.dist-info/RECORD

@@ -1,8 +0,0 @@
-mplusa/__init__.py,sha256=8D1JvAZfjHkQ1DOqrxLyXWMEfROgGwf8Y41-rSX51cY,44
-mplusa/maxplus.py,sha256=UnFh0lfbvarUfDHH7JQpQY5KC0_IP9uzgYYnbOkd3CY,5461
-mplusa/minplus.py,sha256=uNsvTNjjlMO4_zuFI5S2z2HP07AKWXnCWOItw2fE5Js,5460
-mplusa-0.0.2.dist-info/LICENSE,sha256=x1S-x_tM1tAmndGsdQKT4DU9LnstfQRgS4befak4XdA,1063
-mplusa-0.0.2.dist-info/METADATA,sha256=2JhnKWBWTaO2dDThFq7DdlUfbCsLMObmVr2O49qqlsE,5100
-mplusa-0.0.2.dist-info/WHEEL,sha256=52BFRY2Up02UkjOa29eZOS2VxUrpPORXg1pkohGGUS8,91
-mplusa-0.0.2.dist-info/top_level.txt,sha256=W5b7P8CkZ-DB3-2K0Rcf0T0tpEuWLCbZBaVgrd7FEcM,7
-mplusa-0.0.2.dist-info/RECORD,,