code2llm 0.5.134__tar.gz → 0.5.136__tar.gz

{code2llm-0.5.134/code2llm.egg-info → code2llm-0.5.136}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: code2llm
-Version: 0.5.134
+Version: 0.5.136
 Summary: High-performance Python code flow analysis with optimized TOON format - CFG, DFG, call graphs, and intelligent code queries
 Home-page: https://github.com/wronai/stts
 Author: STTS Project
@@ -67,16 +67,18 @@ Dynamic: requires-python
 
 ## AI Cost Tracking
 
-![PyPI](https://img.shields.io/badge/pypi-costs-blue) ![Version](https://img.shields.io/badge/version-0.5.134-blue) ![Python](https://img.shields.io/badge/python-3.9+-blue) ![License](https://img.shields.io/badge/license-Apache--2.0-green)
-![AI Cost](https://img.shields.io/badge/AI%20Cost-$153.46-orange) ![Human Time](https://img.shields.io/badge/Human%20Time-64.5h-blue) ![Model](https://img.shields.io/badge/Model-openrouter%2Fqwen%2Fqwen3--coder--next-lightgrey)
+![PyPI](https://img.shields.io/badge/pypi-costs-blue) ![Version](https://img.shields.io/badge/version-0.5.136-blue) ![Python](https://img.shields.io/badge/python-3.9+-blue) ![License](https://img.shields.io/badge/license-Apache--2.0-green)
+![AI Cost](https://img.shields.io/badge/AI%20Cost-$7.50-orange) ![Human Time](https://img.shields.io/badge/Human%20Time-65.3h-blue) ![Model](https://img.shields.io/badge/Model-openrouter%2Fqwen%2Fqwen3--coder--next-lightgrey)
 
-- 🤖 **LLM usage:** $153.4641 (195 commits)
-- 👤 **Human dev:** ~$6447 (64.5h @ $100/h, 30min dedup)
+- 🤖 **LLM usage:** $7.5000 (188 commits)
+- 👤 **Human dev:** ~$6526 (65.3h @ $100/h, 30min dedup)
 
 Generated on 2026-04-20 using [openrouter/qwen/qwen3-coder-next](https://openrouter.ai/qwen/qwen3-coder-next)
 
 ---
 
+
+
 This directory contains the complete analysis of your project generated by `code2llm`. Each file serves a specific purpose for understanding, refactoring, and documenting your codebase.
 
 ## 📁 Generated Files Overview
@@ -404,10 +406,10 @@ code2llm ./ -f yaml --separate-orphans
 ---
 
 **Generated by**: `code2llm ./ -f all --readme`  
-**Analysis Date**: 2026-04-19  
-**Total Functions**: 1115  
-**Total Classes**: 121  
-**Modules**: 152  
+**Analysis Date**: 2026-04-20  
+**Total Functions**: 2124  
+**Total Classes**: 241  
+**Modules**: 359  
 
 For more information about code2llm, visit: https://github.com/tom-sapletta/code2llm
 

{code2llm-0.5.134 → code2llm-0.5.136}/README.md

@@ -3,16 +3,18 @@
 
 ## AI Cost Tracking
 
-![PyPI](https://img.shields.io/badge/pypi-costs-blue) ![Version](https://img.shields.io/badge/version-0.5.134-blue) ![Python](https://img.shields.io/badge/python-3.9+-blue) ![License](https://img.shields.io/badge/license-Apache--2.0-green)
-![AI Cost](https://img.shields.io/badge/AI%20Cost-$153.46-orange) ![Human Time](https://img.shields.io/badge/Human%20Time-64.5h-blue) ![Model](https://img.shields.io/badge/Model-openrouter%2Fqwen%2Fqwen3--coder--next-lightgrey)
+![PyPI](https://img.shields.io/badge/pypi-costs-blue) ![Version](https://img.shields.io/badge/version-0.5.136-blue) ![Python](https://img.shields.io/badge/python-3.9+-blue) ![License](https://img.shields.io/badge/license-Apache--2.0-green)
+![AI Cost](https://img.shields.io/badge/AI%20Cost-$7.50-orange) ![Human Time](https://img.shields.io/badge/Human%20Time-65.3h-blue) ![Model](https://img.shields.io/badge/Model-openrouter%2Fqwen%2Fqwen3--coder--next-lightgrey)
 
-- 🤖 **LLM usage:** $153.4641 (195 commits)
-- 👤 **Human dev:** ~$6447 (64.5h @ $100/h, 30min dedup)
+- 🤖 **LLM usage:** $7.5000 (188 commits)
+- 👤 **Human dev:** ~$6526 (65.3h @ $100/h, 30min dedup)
 
 Generated on 2026-04-20 using [openrouter/qwen/qwen3-coder-next](https://openrouter.ai/qwen/qwen3-coder-next)
 
 ---
 
+
+
 This directory contains the complete analysis of your project generated by `code2llm`. Each file serves a specific purpose for understanding, refactoring, and documenting your codebase.
 
 ## 📁 Generated Files Overview
@@ -340,10 +342,10 @@ code2llm ./ -f yaml --separate-orphans
 ---
 
 **Generated by**: `code2llm ./ -f all --readme`  
-**Analysis Date**: 2026-04-19  
-**Total Functions**: 1115  
-**Total Classes**: 121  
-**Modules**: 152  
+**Analysis Date**: 2026-04-20  
+**Total Functions**: 2124  
+**Total Classes**: 241  
+**Modules**: 359  
 
 For more information about code2llm, visit: https://github.com/tom-sapletta/code2llm
 

code2llm-0.5.136/VERSION

@@ -0,0 +1 @@
+0.5.136

{code2llm-0.5.134 → code2llm-0.5.136}/code2llm/__init__.py

@@ -8,7 +8,7 @@ Includes NLP Processing Pipeline for query normalization, intent matching,
 and entity resolution with multilingual support.
 """
 
-__version__ = "0.5.134"
+__version__ = "0.5.136"
 __author__ = "STTS Project"
 
 # Core analysis components (lightweight, always needed)

{code2llm-0.5.134 → code2llm-0.5.136}/code2llm/exporters/mermaid/calls.py

@@ -5,19 +5,22 @@ from pathlib import Path
 
 from code2llm.core.models import AnalysisResult
 
-from .utils import readable_id, safe_module, resolve_callee, write_file
+from .utils import readable_id, safe_module, resolve_callee, write_file, build_name_index
 
 
 def export_calls(result: AnalysisResult, output_path: str) -> None:
     """Export simplified call graph — only connected nodes."""
     lines = ["flowchart LR"]
 
+    # Build name index for O(1) callee resolution
+    name_index = build_name_index(result.functions)
+
     # Collect connected nodes first
     connected: Set[str] = set()
     edges: List[Tuple[str, str]] = []
     for func_name, fi in result.functions.items():
         for callee in fi.calls[:10]:
-            resolved = resolve_callee(callee, result.functions)
+            resolved = resolve_callee(callee, result.functions, name_index)
             if resolved and resolved != func_name:
                 connected.add(func_name)
                 connected.add(resolved)

{code2llm-0.5.134 → code2llm-0.5.136}/code2llm/exporters/mermaid/classic.py

@@ -5,18 +5,21 @@ from pathlib import Path
 
 from code2llm.core.models import AnalysisResult
 
-from .utils import readable_id, safe_module, resolve_callee, write_file, get_cc
+from .utils import readable_id, safe_module, resolve_callee, write_file, get_cc, build_name_index
 
 
 def export_classic(result: AnalysisResult, output_path: str) -> Optional[Path]:
     """Export full flow diagram with CC-based node shapes and styling."""
     lines = ["flowchart TD"]
 
+    # Build name index for O(1) callee resolution
+    name_index = build_name_index(result.functions)
+
     # Subgraphs per module
     _render_subgraphs(result, lines)
 
     # Edges — all cross-function calls
-    _render_edges(result, lines, limit=600)
+    _render_edges(result, lines, name_index, limit=600)
 
     # CC-based styling
     _render_cc_styles(result, lines)
@@ -48,13 +51,13 @@ def _render_subgraphs(result: AnalysisResult, lines: List[str]) -> None:
         lines.append("    end")
 
 
-def _render_edges(result: AnalysisResult, lines: List[str], limit: int = 600) -> None:
+def _render_edges(result: AnalysisResult, lines: List[str], name_index: Dict[str, List[str]], limit: int = 600) -> None:
     """Render cross-function call edges up to limit."""
     seen_edges: Set[Tuple[str, str]] = set()
     for func_name, fi in result.functions.items():
         src = readable_id(func_name)
         for callee in fi.calls[:15]:
-            resolved = resolve_callee(callee, result.functions)
+            resolved = resolve_callee(callee, result.functions, name_index)
             if resolved and resolved != func_name:
                 dst = readable_id(resolved)
                 edge = (src, dst)

{code2llm-0.5.134 → code2llm-0.5.136}/code2llm/exporters/mermaid/compact.py

@@ -6,7 +6,7 @@ from pathlib import Path
 
 from code2llm.core.models import AnalysisResult
 
-from .utils import safe_module, resolve_callee, write_file
+from .utils import safe_module, resolve_callee, write_file, build_name_index
 
 
 def export_compact(result: AnalysisResult, output_path: str) -> None:
@@ -14,6 +14,9 @@ def export_compact(result: AnalysisResult, output_path: str) -> None:
     lines = ["flowchart TD"]
 
     from .utils import module_of
+    # Build name index for O(1) callee resolution
+    name_index = build_name_index(result.functions)
+
     # Compute module stats
     mod_funcs: Dict[str, int] = defaultdict(int)
     mod_lines: Dict[str, int] = defaultdict(int)
@@ -27,7 +30,7 @@ def export_compact(result: AnalysisResult, output_path: str) -> None:
     for func_name, fi in result.functions.items():
         src_mod = module_of(func_name)
         for callee in fi.calls:
-            resolved = resolve_callee(callee, result.functions)
+            resolved = resolve_callee(callee, result.functions, name_index)
             if resolved:
                 dst_mod = module_of(resolved)
                 if dst_mod != src_mod:

{code2llm-0.5.134 → code2llm-0.5.136}/code2llm/exporters/mermaid/flow_compact.py

@@ -6,7 +6,7 @@ from pathlib import Path
 
 from code2llm.core.models import AnalysisResult
 
-from .utils import readable_id, safe_module, resolve_callee, write_file, get_cc
+from .utils import readable_id, safe_module, resolve_callee, write_file, get_cc, build_name_index
 
 
 # Default skip patterns for noise reduction
@@ -43,30 +43,30 @@ def is_entry_point(func_name: str, fi, result: AnalysisResult) -> bool:
     return False
 
 
-def build_callers_graph(result: AnalysisResult) -> Dict[str, Set[str]]:
+def build_callers_graph(result: AnalysisResult, name_index: Dict[str, List[str]]) -> Dict[str, Set[str]]:
     """Build reverse graph: map each function to its callers."""
     callers: Dict[str, Set[str]] = defaultdict(set)
     for func_name, fi in result.functions.items():
         for callee in fi.calls:
-            resolved = resolve_callee(callee, result.functions)
+            resolved = resolve_callee(callee, result.functions, name_index)
             if resolved:
                 callers[resolved].add(func_name)
     return callers
 
 
-def find_leaves(result: AnalysisResult) -> Set[str]:
+def find_leaves(result: AnalysisResult, name_index: Dict[str, List[str]]) -> Set[str]:
     """Find leaf nodes (functions that don't call other project functions)."""
     leaves = set()
     for func_name, fi in result.functions.items():
         has_internal_call = any(
-            resolve_callee(c, result.functions) for c in fi.calls
+            resolve_callee(c, result.functions, name_index) for c in fi.calls
         )
         if not has_internal_call:
             leaves.add(func_name)
     return leaves
 
 
-def _longest_path_dfs(result: AnalysisResult, start: str, visited: Set[str]) -> List[str]:
+def _longest_path_dfs(result: AnalysisResult, start: str, visited: Set[str], name_index: Dict[str, List[str]]) -> List[str]:
     """DFS to find longest path from start node."""
     if start in visited:
         return []
@@ -77,21 +77,21 @@ def _longest_path_dfs(result: AnalysisResult, start: str, visited: Set[str]) ->
 
     longest: List[str] = []
     for callee in fi.calls:
-        resolved = resolve_callee(callee, result.functions)
+        resolved = resolve_callee(callee, result.functions, name_index)
         if resolved and resolved not in visited:
-            path = _longest_path_dfs(result, resolved, visited)
+            path = _longest_path_dfs(result, resolved, visited, name_index)
             if len(path) > len(longest):
                 longest = path
 
     return [start] + longest
 
 
-def _select_longest_path(result: AnalysisResult, entry_points: List[str]) -> List[str]:
+def _select_longest_path(result: AnalysisResult, entry_points: List[str], name_index: Dict[str, List[str]]) -> List[str]:
     """Select the longest path from all entry points."""
     max_path: List[str] = []
     for ep in entry_points:
         if ep in result.functions:
-            path = _longest_path_dfs(result, ep, set())
+            path = _longest_path_dfs(result, ep, set(), name_index)
             if len(path) > len(max_path):
                 max_path = path
     return max_path
@@ -101,11 +101,13 @@ def find_critical_path(result: AnalysisResult, entry_points: List[str]) -> Set[s
     """Find the longest path from entry points (critical path)."""
     if not entry_points:
         return set()
+    # Build name index for O(1) resolution
+    name_index = build_name_index(result.functions)
     # Build data structures
-    build_callers_graph(result)
-    find_leaves(result)
+    build_callers_graph(result, name_index)
+    find_leaves(result, name_index)
     # Find longest path from each entry point
-    max_path = _select_longest_path(result, entry_points)
+    max_path = _select_longest_path(result, entry_points, name_index)
     return set(max_path)
 
 

{code2llm-0.5.134 → code2llm-0.5.136}/code2llm/exporters/mermaid/flow_detailed.py

@@ -4,7 +4,7 @@ from pathlib import Path
 
 from code2llm.core.models import AnalysisResult
 
-from .utils import readable_id, safe_module, resolve_callee, write_file, get_cc
+from .utils import readable_id, safe_module, resolve_callee, write_file, get_cc, build_name_index
 from ..mermaid_flow_helpers import (
     _entry_points,
     _filtered_functions,
@@ -25,6 +25,9 @@ def export_flow_detailed(result: AnalysisResult, output_path: str,
     from .utils import module_of
 
     lines = ["flowchart TD"]
+
+    # Build name index for O(1) callee resolution
+    name_index = build_name_index(result.functions)
     lines.append("")
     lines.append("    %% Styling definitions")
     lines.append("    classDef highCC fill:#ff6b6b,stroke:#c92a2a,color:#fff")
@@ -50,7 +53,7 @@ def export_flow_detailed(result: AnalysisResult, output_path: str,
         sort_funcs=True,
         max_funcs=40,
     )
-    _render_flow_edges(lines, filtered_funcs, readable_id, resolve_callee, calls_per_function=10, limit=200)
+    _render_flow_edges(lines, filtered_funcs, readable_id, resolve_callee, calls_per_function=10, limit=200, name_index=name_index)
     _render_flow_styles(
         lines,
         filtered_funcs,

{code2llm-0.5.134 → code2llm-0.5.136}/code2llm/exporters/mermaid/flow_full.py

@@ -4,7 +4,7 @@ from pathlib import Path
 
 from code2llm.core.models import AnalysisResult
 
-from .utils import readable_id, safe_module, resolve_callee, write_file, get_cc
+from .utils import readable_id, safe_module, resolve_callee, write_file, get_cc, build_name_index
 from ..mermaid_flow_helpers import (
     _entry_points,
     _filtered_functions,
@@ -25,6 +25,9 @@ def export_flow_full(result: AnalysisResult, output_path: str,
     from .utils import module_of
 
     lines = ["flowchart TD"]
+
+    # Build name index for O(1) callee resolution
+    name_index = build_name_index(result.functions)
     lines.append("")
     lines.append("    %% Styling definitions")
     lines.append("    classDef highCC fill:#ff6b6b,stroke:#c92a2a,color:#fff")
@@ -50,7 +53,7 @@ def export_flow_full(result: AnalysisResult, output_path: str,
         sort_funcs=False,
         max_funcs=None,
     )
-    _render_flow_edges(lines, filtered_funcs, readable_id, resolve_callee, calls_per_function=15, limit=None)
+    _render_flow_edges(lines, filtered_funcs, readable_id, resolve_callee, calls_per_function=15, limit=None, name_index=name_index)
     _render_flow_styles(
         lines,
         filtered_funcs,

{code2llm-0.5.134 → code2llm-0.5.136}/code2llm/exporters/mermaid/utils.py

@@ -1,8 +1,9 @@
 """Mermaid exporter utilities — identifiers, module extraction, file writing."""
 
 import re
+from collections import defaultdict
 from pathlib import Path
-from typing import Optional
+from typing import Dict, List, Optional
 
 from code2llm.core.models import FunctionInfo
 
@@ -42,11 +43,30 @@ def module_of(func_name: str) -> str:
     return parts[0] if parts else 'unknown'
 
 
-def resolve_callee(callee: str, funcs: dict) -> Optional[str]:
-    """Resolve callee to a known qualified name."""
+def build_name_index(funcs: dict) -> Dict[str, List[str]]:
+    """Build index mapping simple names to qualified names for O(1) lookup."""
+    index: Dict[str, List[str]] = defaultdict(list)
+    for qn in funcs:
+        simple_name = qn.split('.')[-1]
+        index[simple_name].append(qn)
+    return index
+
+
+def resolve_callee(callee: str, funcs: dict, name_index: Optional[Dict[str, List[str]]] = None) -> Optional[str]:
+    """Resolve callee to a known qualified name.
+    
+    Args:
+        callee: The callee name to resolve
+        funcs: Dictionary of all functions
+        name_index: Optional pre-built index from build_name_index() for O(1) lookup
+    """
     if callee in funcs:
         return callee
-    candidates = [qn for qn in funcs if qn.endswith(f".{callee}")]
+    if name_index is not None:
+        candidates = name_index.get(callee, [])
+    else:
+        # Fallback to slow path if index not provided
+        candidates = [qn for qn in funcs if qn.endswith(f".{callee}")]
     if len(candidates) == 1:
         return candidates[0]
     return None
@@ -72,6 +92,7 @@ __all__ = [
     'readable_id',
     'safe_module',
     'module_of',
+    'build_name_index',
     'resolve_callee',
     'write_file',
     'get_cc',

{code2llm-0.5.134 → code2llm-0.5.136}/code2llm/exporters/mermaid_flow_helpers.py

@@ -159,16 +159,17 @@ def _render_flow_edges(
     lines: List[str],
     funcs: Dict[str, Any],
     readable_id: Callable[[str], str],
-    resolve: Callable[[str, Dict[str, Any]], Optional[str]],
+    resolve: Callable[..., Optional[str]],
     calls_per_function: int = 10,
     limit: Optional[int] = 200,
+    name_index: Optional[Dict[str, List[str]]] = None,
 ) -> None:
     """Render cross-function call edges with optional limits."""
     seen_edges: Set[Tuple[str, str]] = set()
     for func_name, fi in funcs.items():
         src = readable_id(func_name)
         for callee in fi.calls[:calls_per_function]:
-            resolved = resolve(callee, funcs)
+            resolved = resolve(callee, funcs, name_index) if name_index else resolve(callee, funcs)
             if resolved and resolved != func_name:
                 dst = readable_id(resolved)
                 edge = (src, dst)

{code2llm-0.5.134 → code2llm-0.5.136}/code2llm/exporters/yaml_exporter.py

@@ -289,6 +289,7 @@ class YAMLExporter(BaseExporter):
         - CHAINS: call chains/paths
         - MODULES: functions grouped by module with call relationships
         """
+        self._name_index = None  # Reset cache for fresh analysis
         connected, edges = self._collect_edges(result, max_calls_per_func, max_edges)
         nodes = self._build_nodes(result, connected)
         modules = self._group_by_module(result, connected)

{code2llm-0.5.134 → code2llm-0.5.136}/code2llm/nlp/__init__.py

@@ -4,7 +4,7 @@ Provides query normalization, intent matching, and entity resolution
 with multilingual support and fuzzy matching.
 """
 
-__version__ = "0.5.134"
+__version__ = "0.5.136"
 
 from .pipeline import NLPPipeline
 from .normalization import QueryNormalizer

{code2llm-0.5.134 → code2llm-0.5.136/code2llm.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: code2llm
-Version: 0.5.134
+Version: 0.5.136
 Summary: High-performance Python code flow analysis with optimized TOON format - CFG, DFG, call graphs, and intelligent code queries
 Home-page: https://github.com/wronai/stts
 Author: STTS Project
@@ -67,16 +67,18 @@ Dynamic: requires-python
 
 ## AI Cost Tracking
 
-![PyPI](https://img.shields.io/badge/pypi-costs-blue) ![Version](https://img.shields.io/badge/version-0.5.134-blue) ![Python](https://img.shields.io/badge/python-3.9+-blue) ![License](https://img.shields.io/badge/license-Apache--2.0-green)
-![AI Cost](https://img.shields.io/badge/AI%20Cost-$153.46-orange) ![Human Time](https://img.shields.io/badge/Human%20Time-64.5h-blue) ![Model](https://img.shields.io/badge/Model-openrouter%2Fqwen%2Fqwen3--coder--next-lightgrey)
+![PyPI](https://img.shields.io/badge/pypi-costs-blue) ![Version](https://img.shields.io/badge/version-0.5.136-blue) ![Python](https://img.shields.io/badge/python-3.9+-blue) ![License](https://img.shields.io/badge/license-Apache--2.0-green)
+![AI Cost](https://img.shields.io/badge/AI%20Cost-$7.50-orange) ![Human Time](https://img.shields.io/badge/Human%20Time-65.3h-blue) ![Model](https://img.shields.io/badge/Model-openrouter%2Fqwen%2Fqwen3--coder--next-lightgrey)
 
-- 🤖 **LLM usage:** $153.4641 (195 commits)
-- 👤 **Human dev:** ~$6447 (64.5h @ $100/h, 30min dedup)
+- 🤖 **LLM usage:** $7.5000 (188 commits)
+- 👤 **Human dev:** ~$6526 (65.3h @ $100/h, 30min dedup)
 
 Generated on 2026-04-20 using [openrouter/qwen/qwen3-coder-next](https://openrouter.ai/qwen/qwen3-coder-next)
 
 ---
 
+
+
 This directory contains the complete analysis of your project generated by `code2llm`. Each file serves a specific purpose for understanding, refactoring, and documenting your codebase.
 
 ## 📁 Generated Files Overview
@@ -404,10 +406,10 @@ code2llm ./ -f yaml --separate-orphans
 ---
 
 **Generated by**: `code2llm ./ -f all --readme`  
-**Analysis Date**: 2026-04-19  
-**Total Functions**: 1115  
-**Total Classes**: 121  
-**Modules**: 152  
+**Analysis Date**: 2026-04-20  
+**Total Functions**: 2124  
+**Total Classes**: 241  
+**Modules**: 359  
 
 For more information about code2llm, visit: https://github.com/tom-sapletta/code2llm
 

{code2llm-0.5.134 → code2llm-0.5.136}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "code2llm"
-version = "0.5.134"
+version = "0.5.136"
 description = "High-performance Python code flow analysis with optimized TOON format - CFG, DFG, call graphs, and intelligent code queries"
 readme = "README.md"
 requires-python = ">=3.8"

code2llm-0.5.134/VERSION

@@ -1 +0,0 @@
-0.5.134