numclassify 0.1.0__tar.gz → 0.1.1__tar.gz

numclassify-0.1.1/.gitignore

@@ -0,0 +1,10 @@
+__pycache__/
+*.pyc
+*.pyo
+*.pyd
+.Python
+build/
+dist/
+*.egg-info/
+.env
+.venv 

numclassify-0.1.0/CHANGELOG.txt → numclassify-0.1.1/CHANGELOG.md

@@ -6,6 +6,12 @@ This project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.htm
 
 ---
 
+## [0.1.1] - 2026-05-06
+### Fixed
+- cli.py: Fixed imports to use numclassify._core instead of numclassify
+- combinatorial.py: Moved `from math import comb` to top-level (was inside loops)
+- _registry.py: Fixed find_any_in_range docstring example (removed non-existent duplicate)
+
 ## [0.1.0] - 2026-04-18
 
 ### Added

{numclassify-0.1.0 → numclassify-0.1.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: numclassify
-Version: 0.1.0
+Version: 0.1.1
 Summary: The most comprehensive Python library for number classification — 3000+ number types
 Project-URL: Homepage, https://github.com/aratrikghosh2011-tech/numclassify
 Project-URL: Repository, https://github.com/aratrikghosh2011-tech/numclassify

{numclassify-0.1.0 → numclassify-0.1.1}/numclassify/_core/combinatorial.py

@@ -9,6 +9,7 @@ All membership sets are precomputed at module load time up to 10^9
 from __future__ import annotations
 
 from typing import Set
+from math import comb
 
 from numclassify._registry import register
 
@@ -197,13 +198,11 @@ def _gen_catalan_triangle() -> Set[int]:
     # T(n,0)=1 for all n; T(n,n) = Catalan(n)
     for n in range(0, 60):
         for k in range(0, n + 1):
-            from math import comb
             val = comb(n + k, k) - (comb(n + k, k - 1) if k > 0 else 0)
             if val > _LIMIT:
                 break
             s.add(val)
         if n > 0:
-            from math import comb
             check = comb(2 * n, n) - comb(2 * n, n - 1) if n > 0 else 1
             if check > _LIMIT:
                 break

{numclassify-0.1.0 → numclassify-0.1.1}/numclassify/_registry.py

@@ -379,7 +379,7 @@ def find_any_in_range(
     Example
     -------
     >>> find_any_in_range(["prime", "palindrome"], 1, 15)
-    [2, 3, 5, 7, 11, 11, 13]
+    [2, 3, 5, 7, 11, 13]
     """
     funcs = [_resolve(f) for f in funcs_or_names]
     return [n for n in range(start, end + 1) if any(f(n) for f in funcs)]

{numclassify-0.1.0 → numclassify-0.1.1}/numclassify/cli.py

@@ -126,14 +126,14 @@ def _resolve_type(name: str, registry: Dict[str, Any]) -> str:
 def _computed_extras(n: int) -> Dict[str, int]:
     """Return a small dict of directly computed values for display."""
     try:
-        from numclassify.digital import digit_sum, digital_root
+        from numclassify._core.digital import digit_sum, digital_root
         ds = digit_sum(n)
         dr = digital_root(n)
     except Exception:
         ds = sum(int(d) for d in str(abs(n))) if n != 0 else 0
         dr = ds  # fallback
     try:
-        from numclassify.divisors import count_divisors
+        from numclassify._core.divisors import count_divisors
         nd = count_divisors(n)
     except Exception:
         nd = sum(1 for i in range(1, abs(n) + 1) if n % i == 0) if n != 0 else 0

{numclassify-0.1.0 → numclassify-0.1.1}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "hatchling.build"
 
 [project]
 name = "numclassify"
-version = "0.1.0"
+version = "0.1.1"
 description = "The most comprehensive Python library for number classification — 3000+ number types"
 authors = [{name = "Aratrik Ghosh", email = "aratrikghosh2011@gmail.com"}]
 readme = "README.md"