codelexity 0.2.2__tar.gz → 0.2.4__tar.gz

{codelexity-0.2.2 → codelexity-0.2.4}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: codelexity
-Version: 0.2.2
+Version: 0.2.4
 Summary: A package that measures code complexity in the age of AI slop.
 Keywords: complexity,halstead,maintainability,cyclomatic,static-analysis,metrics
 License-Expression: MIT
@@ -42,6 +42,12 @@ In the age of AI, codebases are becoming messier and more difficult to maintain.
 ![Codelexity Graph](https://raw.githubusercontent.com/nickgiki/codelexity/main/assets/codelexity_codelexity.png)
 _Codelexity HTML report on the `codelexity` repo_
 
+**If you have an older version of python you can still run this package** on your codebase with `uv`:
+
+```bash
+uvx --python 3.11 codelexity <my-package-path>
+```
+
 
 ## Intuition
 
@@ -70,7 +76,7 @@ $$M=E-N+2P$$
 
 where $M$ the complexity, $E$ and $N$ the number of edges and nodes in the computation graph and $P$ the number of connected components.
 
-With Halstead's volume and McCabe's complexity one can compute the [**Maintainability Index**](https://ieeexplore.ieee.org/document/242525) computed as:
+With Halstead's volume and McCabe's complexity one can compute the [Maintainability Index](https://ieeexplore.ieee.org/document/242525) computed as:
 
 $$ 171 - 5.2 * log_2(V) - 0.23 * M- 16.2 * log_2(SLOC)+ 50 * \sqrt{2.4 * perCOM}$$
 
@@ -103,17 +109,18 @@ The `codelexity.json` containts aggregate analytics for the whole package and pe
 ```json
 {
     "analytics": {
-        "total_lines": 234629,
-        "total_functions": 9555,
-        "total_modules": 624
+        "total_lines": 330993,
+        "total_functions": 11740,
+        "total_modules": 862,
+        "total_man_hours": 13956
     },
     "modules": {
         "conftest.py": {
             "imports": [
+                "<site-packages>/networkx/__init__.py",
                 "<stdlib>/importlib/metadata/__init__.py",
                 "<stdlib>/os.py",
-                "<stdlib>/warnings.py",
-                "__init__.py"
+                "<stdlib>/warnings.py"
             ],
             "total_lines": 262,
             "empty_lines": 39,
@@ -121,20 +128,4 @@ The `codelexity.json` containts aggregate analytics for the whole package and pe
             "code_length": 211,
 ...
         }
-```
-
-## Running the tests
-
-The suite lives in `tests/` and uses the standard library's `unittest` — no test dependencies to install.
-
-```sh
-uv run python -m unittest discover        # all tests
-uv run python -m unittest discover -v     # verbose, one line per test
-```
-
-Coverage, which needs no dev dependency either:
-
-```sh
-uv run --with coverage coverage run --source=src -m unittest discover
-uv run --with coverage coverage report
-```
+```

{codelexity-0.2.2 → codelexity-0.2.4}/README.md

@@ -20,6 +20,12 @@ In the age of AI, codebases are becoming messier and more difficult to maintain.
 ![Codelexity Graph](https://raw.githubusercontent.com/nickgiki/codelexity/main/assets/codelexity_codelexity.png)
 _Codelexity HTML report on the `codelexity` repo_
 
+**If you have an older version of python you can still run this package** on your codebase with `uv`:
+
+```bash
+uvx --python 3.11 codelexity <my-package-path>
+```
+
 
 ## Intuition
 
@@ -48,7 +54,7 @@ $$M=E-N+2P$$
 
 where $M$ the complexity, $E$ and $N$ the number of edges and nodes in the computation graph and $P$ the number of connected components.
 
-With Halstead's volume and McCabe's complexity one can compute the [**Maintainability Index**](https://ieeexplore.ieee.org/document/242525) computed as:
+With Halstead's volume and McCabe's complexity one can compute the [Maintainability Index](https://ieeexplore.ieee.org/document/242525) computed as:
 
 $$ 171 - 5.2 * log_2(V) - 0.23 * M- 16.2 * log_2(SLOC)+ 50 * \sqrt{2.4 * perCOM}$$
 
@@ -81,17 +87,18 @@ The `codelexity.json` containts aggregate analytics for the whole package and pe
 ```json
 {
     "analytics": {
-        "total_lines": 234629,
-        "total_functions": 9555,
-        "total_modules": 624
+        "total_lines": 330993,
+        "total_functions": 11740,
+        "total_modules": 862,
+        "total_man_hours": 13956
     },
     "modules": {
         "conftest.py": {
             "imports": [
+                "<site-packages>/networkx/__init__.py",
                 "<stdlib>/importlib/metadata/__init__.py",
                 "<stdlib>/os.py",
-                "<stdlib>/warnings.py",
-                "__init__.py"
+                "<stdlib>/warnings.py"
             ],
             "total_lines": 262,
             "empty_lines": 39,
@@ -99,20 +106,4 @@ The `codelexity.json` containts aggregate analytics for the whole package and pe
             "code_length": 211,
 ...
         }
-```
-
-## Running the tests
-
-The suite lives in `tests/` and uses the standard library's `unittest` — no test dependencies to install.
-
-```sh
-uv run python -m unittest discover        # all tests
-uv run python -m unittest discover -v     # verbose, one line per test
-```
-
-Coverage, which needs no dev dependency either:
-
-```sh
-uv run --with coverage coverage run --source=src -m unittest discover
-uv run --with coverage coverage report
-```
+```

{codelexity-0.2.2 → codelexity-0.2.4}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "codelexity"
-version = "0.2.2"
+version = "0.2.4"
 description = "A package that measures code complexity in the age of AI slop."
 readme = "README.md"
 requires-python = ">=3.11"
@@ -43,7 +43,7 @@ path = "src"
 editable = true
 
 [tool.bumpver]
-current_version = "0.2.2"
+current_version = "0.2.4"
 version_pattern = "MAJOR.MINOR.PATCH"
 push = false
 

{codelexity-0.2.2 → codelexity-0.2.4}/pyproject.toml.orig

@@ -1,6 +1,6 @@
 [project]
 name = "codelexity"
-version = "0.2.2"
+version = "0.2.4"
 description = "A package that measures code complexity in the age of AI slop."
 readme = "README.md"
 requires-python = ">=3.11"
@@ -48,7 +48,7 @@ dev = [
 ]
 
 [tool.bumpver]
-current_version = "0.2.2"
+current_version = "0.2.4"
 version_pattern = "MAJOR.MINOR.PATCH"
 push = false  # inspect the tag before it leaves the machine
 

{codelexity-0.2.2 → codelexity-0.2.4}/src/codelexity/calculations.py

@@ -70,8 +70,6 @@ def maintainability_index(module_source: str):
         - 16.2 * log(sloc)
         + 50 * sin(sqrt(2.4 * comments / sloc))
     )
-    # ponytail: clamped to 0-100 so it reads as a percentage. The comment term can push raw above
-    # 171, which is why the upper bound is here and not just a max(0, ...).
     return min(100.0, max(0.0, raw * 100 / 171))
 
 
@@ -96,8 +94,6 @@ def _resolve(name, search):
         try:
             found = locations and importlib.machinery.PathFinder.find_spec(".".join(parts[: i + 1]), locations)
         except KeyError:
-            # ponytail: namespace packages need their own parent in sys.modules
-            # to build a submodule spec; we never import, so treat as unresolved.
             found = None
         if not found:
             break
@@ -113,7 +109,7 @@ def imports(module_path, root=None):
     search = sys.path + [str(root), *(str(d) for d in root.rglob("*") if d.is_dir())]
     names = {n for n in _import_names(code) if n.split(".")[0] not in sys.builtin_module_names}
     specs = (_resolve(n, search) for n in names)
-    return sorted({s.origin for s in specs if s and s.origin})
+    return sorted({Path(s.origin).as_posix() for s in specs if s and s.origin})
 
 
 def analyze_module(path, root=None):

{codelexity-0.2.2 → codelexity-0.2.4}/src/codelexity/graph.py

@@ -90,4 +90,7 @@ def create_viz(package_data: dict, fpath: str):
         f"Total comprehension time (h): {package_data['analytics']['total_man_hours']}</div>"
     )
     path = Path(fpath)
-    path.write_text(path.read_text().replace("<body>", f"<body>\n{legend}", 1))
+    # encoding pinned both ways: pyvis writes UTF-8, but Windows defaults to cp1252, which raises
+    # UnicodeDecodeError on read and produces mojibake on write.
+    html = path.read_text(encoding="utf-8")
+    path.write_text(html.replace("<body>", f"<body>\n{legend}", 1), encoding="utf-8")