rgwfuncs 0.0.31__tar.gz → 0.0.32__tar.gz

{rgwfuncs-0.0.31/src/rgwfuncs.egg-info → rgwfuncs-0.0.32}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.2
 Name: rgwfuncs
-Version: 0.0.31
+Version: 0.0.32
 Summary: A functional programming paradigm for mathematical modelling and data science
 Home-page: https://github.com/ryangerardwilson/rgwfunc
 Author: Ryan Gerard Wilson
@@ -154,7 +154,31 @@ Print a list of available function names in alphabetical order. If a filter is p
 
 This section provides comprehensive functions for handling algebraic expressions, performing tasks such as computation, simplification, solving equations, and prime factorization, all outputted in LaTeX format.
 
-### 1. `compute_constant_expression`
+### 1. `compute_prime_factors_latex`
+
+Computes prime factors of a number and presents them in LaTeX format.
+
+• Parameters:
+  - `n` (int): The integer to factorize.
+
+• Returns:
+  - `str`: Prime factorization in LaTeX.
+
+• Example:
+
+    from rgwfuncs import compute_prime_factors_latex
+    factors_1 = compute_prime_factors_latex(100)
+    print(factors_1)  # Output: "2^{2} \cdot 5^{2}"
+
+    factors_2 = compute_prime_factors_latex(60)
+    print(factors_2)  # Output: "2^{2} \cdot 3 \cdot 5"
+
+    factors_3 = compute_prime_factors_latex(17)
+    print(factors_3)  # Output: "17"
+
+--------------------------------------------------------------------------------
+
+### 2. `compute_constant_expression`
 
 Computes the numerical result of a given expression, which can evaluate to a constant, represented as a float. Evaluates an constant expression provided as a string and returns the computed result. Supports various arithmetic operations, including addition, subtraction, multiplication, division, and modulo, as well as mathematical functions from the math module.
 
@@ -178,7 +202,7 @@ Computes the numerical result of a given expression, which can evaluate to a con
 
 --------------------------------------------------------------------------------
 
-### 2. `compute_constant_expression_involving_matrices`
+### 3. `compute_constant_expression_involving_matrices`
 
 Computes the result of a constant expression involving matrices and returns it as a LaTeX string.
 
@@ -206,7 +230,7 @@ Computes the result of a constant expression involving matrices and returns it a
 
 --------------------------------------------------------------------------------
 
-### 3. `compute_constant_expression_involving_ordered_series`
+### 4. `compute_constant_expression_involving_ordered_series`
 
 Computes the result of a constant expression involving ordered series, and returns it as a Latex string. 
 
@@ -235,7 +259,7 @@ Computes the result of a constant expression involving ordered series, and retur
 
 --------------------------------------------------------------------------------
 
-### 4. `python_polynomial_expression_to_latex`
+### 5. `python_polynomial_expression_to_latex`
 
 Converts a polynomial expression written in Python syntax to a LaTeX formatted string. This function parses algebraic expressions provided as strings using Python’s syntax and translates them into equivalent LaTeX representations, making them suitable for academic or professional documentation. The function supports inclusion of named variables, with an option to substitute specific values into the expression.
 
@@ -275,7 +299,7 @@ Converts a polynomial expression written in Python syntax to a LaTeX formatted s
 
 --------------------------------------------------------------------------------
 
-### 5. `simplify_polynomial_expression`
+### 6. `simplify_polynomial_expression`
 
 Simplifies an algebraic expression in polynomial form and returns it in LaTeX format. Takes an algebraic expression, in polynomial form, written in Python syntax and simplifies it. The result is returned as a LaTeX formatted string, suitable for academic or professional documentation.
 
@@ -308,7 +332,7 @@ Simplifies an algebraic expression in polynomial form and returns it in LaTeX fo
 
 --------------------------------------------------------------------------------
 
-### 6. `solve_homogeneous_polynomial_expression`
+### 7. `solve_homogeneous_polynomial_expression`
 
 Solves a homogeneous polynomial expression for a specified variable and returns solutions in LaTeX format. Assumes that the expression is homoegeneous (i.e. equal to zero), and solves for a designated variable. May optionally include substitutions for other variables in the equation. The solutions are provided as a LaTeX formatted string. The method solves equations for specified variables, with optional substitutions, returning LaTeX-formatted solutions.
 
@@ -331,30 +355,6 @@ Solves a homogeneous polynomial expression for a specified variable and returns
     
 --------------------------------------------------------------------------------
 
-### 7. `get_prime_factors_latex`
-
-Computes prime factors of a number and presents them in LaTeX format.
-
-• Parameters:
-  - `n` (int): The integer to factorize.
-
-• Returns:
-  - `str`: Prime factorization in LaTeX.
-
-• Example:
-
-    from rgwfuncs import get_prime_factors_latex
-    factors1 = get_prime_factors_latex(100)
-    print(factors1)  # Output: "2^{2} \cdot 5^{2}"
-
-    factors2 = get_prime_factors_latex(60)
-    print(factors2)  # Output: "2^{2} \cdot 3 \cdot 5"
-
-    factors3 = get_prime_factors_latex(17)
-    print(factors3)  # Output: "17"    
- 
---------------------------------------------------------------------------------
-
 ## String Based Functions
 
 ### 1. send_telegram_message

{rgwfuncs-0.0.31 → rgwfuncs-0.0.32}/README.md

@@ -128,7 +128,31 @@ Print a list of available function names in alphabetical order. If a filter is p
 
 This section provides comprehensive functions for handling algebraic expressions, performing tasks such as computation, simplification, solving equations, and prime factorization, all outputted in LaTeX format.
 
-### 1. `compute_constant_expression`
+### 1. `compute_prime_factors_latex`
+
+Computes prime factors of a number and presents them in LaTeX format.
+
+• Parameters:
+  - `n` (int): The integer to factorize.
+
+• Returns:
+  - `str`: Prime factorization in LaTeX.
+
+• Example:
+
+    from rgwfuncs import compute_prime_factors_latex
+    factors_1 = compute_prime_factors_latex(100)
+    print(factors_1)  # Output: "2^{2} \cdot 5^{2}"
+
+    factors_2 = compute_prime_factors_latex(60)
+    print(factors_2)  # Output: "2^{2} \cdot 3 \cdot 5"
+
+    factors_3 = compute_prime_factors_latex(17)
+    print(factors_3)  # Output: "17"
+
+--------------------------------------------------------------------------------
+
+### 2. `compute_constant_expression`
 
 Computes the numerical result of a given expression, which can evaluate to a constant, represented as a float. Evaluates an constant expression provided as a string and returns the computed result. Supports various arithmetic operations, including addition, subtraction, multiplication, division, and modulo, as well as mathematical functions from the math module.
 
@@ -152,7 +176,7 @@ Computes the numerical result of a given expression, which can evaluate to a con
 
 --------------------------------------------------------------------------------
 
-### 2. `compute_constant_expression_involving_matrices`
+### 3. `compute_constant_expression_involving_matrices`
 
 Computes the result of a constant expression involving matrices and returns it as a LaTeX string.
 
@@ -180,7 +204,7 @@ Computes the result of a constant expression involving matrices and returns it a
 
 --------------------------------------------------------------------------------
 
-### 3. `compute_constant_expression_involving_ordered_series`
+### 4. `compute_constant_expression_involving_ordered_series`
 
 Computes the result of a constant expression involving ordered series, and returns it as a Latex string. 
 
@@ -209,7 +233,7 @@ Computes the result of a constant expression involving ordered series, and retur
 
 --------------------------------------------------------------------------------
 
-### 4. `python_polynomial_expression_to_latex`
+### 5. `python_polynomial_expression_to_latex`
 
 Converts a polynomial expression written in Python syntax to a LaTeX formatted string. This function parses algebraic expressions provided as strings using Python’s syntax and translates them into equivalent LaTeX representations, making them suitable for academic or professional documentation. The function supports inclusion of named variables, with an option to substitute specific values into the expression.
 
@@ -249,7 +273,7 @@ Converts a polynomial expression written in Python syntax to a LaTeX formatted s
 
 --------------------------------------------------------------------------------
 
-### 5. `simplify_polynomial_expression`
+### 6. `simplify_polynomial_expression`
 
 Simplifies an algebraic expression in polynomial form and returns it in LaTeX format. Takes an algebraic expression, in polynomial form, written in Python syntax and simplifies it. The result is returned as a LaTeX formatted string, suitable for academic or professional documentation.
 
@@ -282,7 +306,7 @@ Simplifies an algebraic expression in polynomial form and returns it in LaTeX fo
 
 --------------------------------------------------------------------------------
 
-### 6. `solve_homogeneous_polynomial_expression`
+### 7. `solve_homogeneous_polynomial_expression`
 
 Solves a homogeneous polynomial expression for a specified variable and returns solutions in LaTeX format. Assumes that the expression is homoegeneous (i.e. equal to zero), and solves for a designated variable. May optionally include substitutions for other variables in the equation. The solutions are provided as a LaTeX formatted string. The method solves equations for specified variables, with optional substitutions, returning LaTeX-formatted solutions.
 
@@ -305,30 +329,6 @@ Solves a homogeneous polynomial expression for a specified variable and returns
     
 --------------------------------------------------------------------------------
 
-### 7. `get_prime_factors_latex`
-
-Computes prime factors of a number and presents them in LaTeX format.
-
-• Parameters:
-  - `n` (int): The integer to factorize.
-
-• Returns:
-  - `str`: Prime factorization in LaTeX.
-
-• Example:
-
-    from rgwfuncs import get_prime_factors_latex
-    factors1 = get_prime_factors_latex(100)
-    print(factors1)  # Output: "2^{2} \cdot 5^{2}"
-
-    factors2 = get_prime_factors_latex(60)
-    print(factors2)  # Output: "2^{2} \cdot 3 \cdot 5"
-
-    factors3 = get_prime_factors_latex(17)
-    print(factors3)  # Output: "17"    
- 
---------------------------------------------------------------------------------
-
 ## String Based Functions
 
 ### 1. send_telegram_message

{rgwfuncs-0.0.31 → rgwfuncs-0.0.32}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "rgwfuncs"
-version = "0.0.31"
+version = "0.0.32"
 authors = [
   { name = "Ryan Gerard Wilson", email = "ryangerardwilson@gmail.com" },
 ]

{rgwfuncs-0.0.31 → rgwfuncs-0.0.32}/setup.cfg

@@ -1,6 +1,6 @@
 [metadata]
 name = rgwfuncs
-version = 0.0.31
+version = 0.0.32
 author = Ryan Gerard Wilson
 author_email = ryangerardwilson@gmail.com
 description = A functional programming paradigm for mathematical modelling and data science

{rgwfuncs-0.0.31 → rgwfuncs-0.0.32}/src/rgwfuncs/__init__.py

@@ -1,7 +1,7 @@
 # This file is automatically generated
 # Dynamically importing functions from modules
 
-from .algebra_lib import compute_constant_expression, compute_constant_expression_involving_matrices, compute_constant_expression_involving_ordered_series, get_prime_factors_latex, python_polynomial_expression_to_latex, simplify_polynomial_expression, solve_homogeneous_polynomial_expression
+from .algebra_lib import compute_constant_expression, compute_constant_expression_involving_matrices, compute_constant_expression_involving_ordered_series, compute_prime_factors_latex, python_polynomial_expression_to_latex, simplify_polynomial_expression, solve_homogeneous_polynomial_expression
 from .df_lib import append_columns, append_percentile_classification_column, append_ranged_classification_column, append_ranged_date_classification_column, append_rows, append_xgb_labels, append_xgb_logistic_regression_predictions, append_xgb_regression_predictions, bag_union_join, bottom_n_unique_values, cascade_sort, delete_rows, drop_duplicates, drop_duplicates_retain_first, drop_duplicates_retain_last, filter_dataframe, filter_indian_mobiles, first_n_rows, from_raw_data, insert_dataframe_in_sqlite_database, last_n_rows, left_join, limit_dataframe, load_data_from_path, load_data_from_query, load_data_from_sqlite_path, mask_against_dataframe, mask_against_dataframe_converse, numeric_clean, order_columns, print_correlation, print_dataframe, print_memory_usage, print_n_frequency_cascading, print_n_frequency_linear, rename_columns, retain_columns, right_join, send_data_to_email, send_data_to_slack, send_dataframe_via_telegram, sync_dataframe_to_sqlite_database, top_n_unique_values, union_join, update_rows
 from .docs_lib import docs
 from .str_lib import send_telegram_message

{rgwfuncs-0.0.31 → rgwfuncs-0.0.32}/src/rgwfuncs/algebra_lib.py

@@ -10,6 +10,37 @@ from sympy.parsing.sympy_parser import (standard_transformations, implicit_multi
 from typing import Tuple, List, Dict, Optional
 
 
+def compute_prime_factors_latex(n: int) -> str:
+    """
+    Computes the prime factors of a number and returns the factorization as a LaTeX string.
+
+    Determines the prime factorization of the given integer. The result is formatted as a LaTeX
+    string, enabling easy integration into documents or presentations that require mathematical notation.
+
+    Parameters:
+    n (int): The number for which to compute prime factors.
+
+    Returns:
+    str: The LaTeX representation of the prime factorization.
+    """
+
+    factors = []
+    while n % 2 == 0:
+        factors.append(2)
+        n //= 2
+    for i in range(3, int(math.sqrt(n)) + 1, 2):
+        while n % i == 0:
+            factors.append(i)
+            n //= i
+    if n > 2:
+        factors.append(n)
+
+    factor_counts = {factor: factors.count(factor) for factor in set(factors)}
+    latex_factors = [f"{factor}^{{{count}}}" if count > 1 else str(
+        factor) for factor, count in factor_counts.items()]
+    return " \\cdot ".join(latex_factors)
+
+
 def compute_constant_expression(expression: str) -> float:
     """
     Computes the numerical result of a given expression, which can evaluate to a constant,
@@ -520,34 +551,3 @@ def solve_homogeneous_polynomial_expression(
         raise ValueError(f"Error solving the expression: {e}")
 
 
-
-
-def get_prime_factors_latex(n: int) -> str:
-    """
-    Computes the prime factors of a number and returns the factorization as a LaTeX string.
-
-    Determines the prime factorization of the given integer. The result is formatted as a LaTeX
-    string, enabling easy integration into documents or presentations that require mathematical notation.
-
-    Parameters:
-    n (int): The number for which to compute prime factors.
-
-    Returns:
-    str: The LaTeX representation of the prime factorization.
-    """
-
-    factors = []
-    while n % 2 == 0:
-        factors.append(2)
-        n //= 2
-    for i in range(3, int(math.sqrt(n)) + 1, 2):
-        while n % i == 0:
-            factors.append(i)
-            n //= i
-    if n > 2:
-        factors.append(n)
-
-    factor_counts = {factor: factors.count(factor) for factor in set(factors)}
-    latex_factors = [f"{factor}^{{{count}}}" if count > 1 else str(
-        factor) for factor, count in factor_counts.items()]
-    return " \\cdot ".join(latex_factors)

{rgwfuncs-0.0.31 → rgwfuncs-0.0.32/src/rgwfuncs.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.2
 Name: rgwfuncs
-Version: 0.0.31
+Version: 0.0.32
 Summary: A functional programming paradigm for mathematical modelling and data science
 Home-page: https://github.com/ryangerardwilson/rgwfunc
 Author: Ryan Gerard Wilson
@@ -154,7 +154,31 @@ Print a list of available function names in alphabetical order. If a filter is p
 
 This section provides comprehensive functions for handling algebraic expressions, performing tasks such as computation, simplification, solving equations, and prime factorization, all outputted in LaTeX format.
 
-### 1. `compute_constant_expression`
+### 1. `compute_prime_factors_latex`
+
+Computes prime factors of a number and presents them in LaTeX format.
+
+• Parameters:
+  - `n` (int): The integer to factorize.
+
+• Returns:
+  - `str`: Prime factorization in LaTeX.
+
+• Example:
+
+    from rgwfuncs import compute_prime_factors_latex
+    factors_1 = compute_prime_factors_latex(100)
+    print(factors_1)  # Output: "2^{2} \cdot 5^{2}"
+
+    factors_2 = compute_prime_factors_latex(60)
+    print(factors_2)  # Output: "2^{2} \cdot 3 \cdot 5"
+
+    factors_3 = compute_prime_factors_latex(17)
+    print(factors_3)  # Output: "17"
+
+--------------------------------------------------------------------------------
+
+### 2. `compute_constant_expression`
 
 Computes the numerical result of a given expression, which can evaluate to a constant, represented as a float. Evaluates an constant expression provided as a string and returns the computed result. Supports various arithmetic operations, including addition, subtraction, multiplication, division, and modulo, as well as mathematical functions from the math module.
 
@@ -178,7 +202,7 @@ Computes the numerical result of a given expression, which can evaluate to a con
 
 --------------------------------------------------------------------------------
 
-### 2. `compute_constant_expression_involving_matrices`
+### 3. `compute_constant_expression_involving_matrices`
 
 Computes the result of a constant expression involving matrices and returns it as a LaTeX string.
 
@@ -206,7 +230,7 @@ Computes the result of a constant expression involving matrices and returns it a
 
 --------------------------------------------------------------------------------
 
-### 3. `compute_constant_expression_involving_ordered_series`
+### 4. `compute_constant_expression_involving_ordered_series`
 
 Computes the result of a constant expression involving ordered series, and returns it as a Latex string. 
 
@@ -235,7 +259,7 @@ Computes the result of a constant expression involving ordered series, and retur
 
 --------------------------------------------------------------------------------
 
-### 4. `python_polynomial_expression_to_latex`
+### 5. `python_polynomial_expression_to_latex`
 
 Converts a polynomial expression written in Python syntax to a LaTeX formatted string. This function parses algebraic expressions provided as strings using Python’s syntax and translates them into equivalent LaTeX representations, making them suitable for academic or professional documentation. The function supports inclusion of named variables, with an option to substitute specific values into the expression.
 
@@ -275,7 +299,7 @@ Converts a polynomial expression written in Python syntax to a LaTeX formatted s
 
 --------------------------------------------------------------------------------
 
-### 5. `simplify_polynomial_expression`
+### 6. `simplify_polynomial_expression`
 
 Simplifies an algebraic expression in polynomial form and returns it in LaTeX format. Takes an algebraic expression, in polynomial form, written in Python syntax and simplifies it. The result is returned as a LaTeX formatted string, suitable for academic or professional documentation.
 
@@ -308,7 +332,7 @@ Simplifies an algebraic expression in polynomial form and returns it in LaTeX fo
 
 --------------------------------------------------------------------------------
 
-### 6. `solve_homogeneous_polynomial_expression`
+### 7. `solve_homogeneous_polynomial_expression`
 
 Solves a homogeneous polynomial expression for a specified variable and returns solutions in LaTeX format. Assumes that the expression is homoegeneous (i.e. equal to zero), and solves for a designated variable. May optionally include substitutions for other variables in the equation. The solutions are provided as a LaTeX formatted string. The method solves equations for specified variables, with optional substitutions, returning LaTeX-formatted solutions.
 
@@ -331,30 +355,6 @@ Solves a homogeneous polynomial expression for a specified variable and returns
     
 --------------------------------------------------------------------------------
 
-### 7. `get_prime_factors_latex`
-
-Computes prime factors of a number and presents them in LaTeX format.
-
-• Parameters:
-  - `n` (int): The integer to factorize.
-
-• Returns:
-  - `str`: Prime factorization in LaTeX.
-
-• Example:
-
-    from rgwfuncs import get_prime_factors_latex
-    factors1 = get_prime_factors_latex(100)
-    print(factors1)  # Output: "2^{2} \cdot 5^{2}"
-
-    factors2 = get_prime_factors_latex(60)
-    print(factors2)  # Output: "2^{2} \cdot 3 \cdot 5"
-
-    factors3 = get_prime_factors_latex(17)
-    print(factors3)  # Output: "17"    
- 
---------------------------------------------------------------------------------
-
 ## String Based Functions
 
 ### 1. send_telegram_message

{rgwfuncs-0.0.31 → rgwfuncs-0.0.32}/tests/test_algebra_lib.py

@@ -7,13 +7,27 @@ import math
 sys.path.insert(0, os.path.abspath(os.path.join(os.path.dirname(__file__), '..')))
 
 from src.rgwfuncs.algebra_lib import (
+    compute_prime_factors_latex,
     compute_constant_expression,
     compute_constant_expression_involving_matrices,
     compute_constant_expression_involving_ordered_series,
     python_polynomial_expression_to_latex,
     simplify_polynomial_expression,
-    solve_homogeneous_polynomial_expression,
-    get_prime_factors_latex)
+    solve_homogeneous_polynomial_expression)
+
+
+def test_compute_prime_factors_latex():
+    test_cases = [
+        (100, "2^{2} \\cdot 5^{2}"),
+        (60, "2^{2} \\cdot 3 \\cdot 5"),
+        (45, "3^{2} \\cdot 5"),
+        (1, ""),  # Handle case with 1, which has no prime factors
+        (17, "17")  # Prime number itself
+    ]
+
+    for n, expected_output in test_cases:
+        result = compute_prime_factors_latex(n)
+        assert result == expected_output, f"Failed for {n}, got {result}"
 
 
 def test_compute_constant_expression():
@@ -127,15 +141,4 @@ def test_solve_homogeneous_polynomial_expression():
         assert solve_homogeneous_polynomial_expression(expression, variable, subs) == expected_output
 
 
-def test_get_prime_factors_latex():
-    test_cases = [
-        (100, "2^{2} \\cdot 5^{2}"),
-        (60, "2^{2} \\cdot 3 \\cdot 5"),
-        (45, "3^{2} \\cdot 5"),
-        (1, ""),  # Handle case with 1, which has no prime factors
-        (17, "17")  # Prime number itself
-    ]
 
-    for n, expected_output in test_cases:
-        result = get_prime_factors_latex(n)
-        assert result == expected_output, f"Failed for {n}, got {result}"