code2llm 0.5.13__tar.gz → 0.5.15__tar.gz

{code2llm-0.5.13 → code2llm-0.5.15}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: code2llm
-Version: 0.5.13
+Version: 0.5.15
 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

{code2llm-0.5.13 → code2llm-0.5.15}/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.13"
+__version__ = "0.5.15"
 __author__ = "STTS Project"
 
 # Core analysis components

{code2llm-0.5.13 → code2llm-0.5.15}/code2llm/core/analyzer.py

@@ -184,15 +184,37 @@ class ProjectAnalyzer:
     
     def _build_call_graph(self, result: AnalysisResult) -> None:
         """Build call graph and find entry points."""
+        # Build lookup maps for O(1) resolution
+        # Map simple name -> list of full names (for overloaded methods)
+        simple_to_full: Dict[str, List[str]] = {}
+        for known_name in result.functions:
+            simple_name = known_name.split('.')[-1]
+            if simple_name not in simple_to_full:
+                simple_to_full[simple_name] = []
+            simple_to_full[simple_name].append(known_name)
+        
         # Map calls between functions
         for func_name, func in result.functions.items():
-            for called in func.calls:
-                # Try to resolve to a known function
-                for known_name in result.functions:
-                    if known_name.endswith(f".{called}") or known_name == called:
-                        func.calls[func.calls.index(called)] = known_name
-                        result.functions[known_name].called_by.append(func_name)
-                        break
+            for idx, called in enumerate(func.calls):
+                # Try exact match first, then suffix match
+                if called in result.functions:
+                    resolved = called
+                elif called in simple_to_full:
+                    # Use first match if multiple (common case: single match)
+                    candidates = simple_to_full[called]
+                    # Prefer exact module match if available
+                    resolved = None
+                    for cand in candidates:
+                        if func_name.rsplit('.', 1)[0] == cand.rsplit('.', 1)[0]:
+                            resolved = cand
+                            break
+                    if resolved is None:
+                        resolved = candidates[0]
+                else:
+                    continue  # Unknown function
+                
+                func.calls[idx] = resolved
+                result.functions[resolved].called_by.append(func_name)
         
         # Find entry points (not called by anything)
         for func_name, func in result.functions.items():

{code2llm-0.5.13 → code2llm-0.5.15}/code2llm/core/core/refactoring.py

@@ -67,7 +67,16 @@ class RefactoringAnalyzer:
         """Calculate betweenness centrality for bottleneck detection."""
         if len(call_graph) > 0:
             try:
-                centrality = nx.betweenness_centrality(call_graph)
+                node_count = len(call_graph)
+                # For large graphs, use sampling to avoid exponential time complexity
+                if node_count > 500:
+                    if self.config.verbose:
+                        print(f"  Large graph ({node_count} nodes), using sampled centrality...")
+                    # Sample 20% of nodes, max 500
+                    k = min(int(node_count * 0.2), 500)
+                    centrality = nx.betweenness_centrality(call_graph, k=k)
+                else:
+                    centrality = nx.betweenness_centrality(call_graph)
                 for func_name, score in centrality.items():
                     if func_name in result.functions:
                         result.functions[func_name].centrality = score
@@ -78,6 +87,11 @@ class RefactoringAnalyzer:
     def _detect_cycles(self, call_graph: nx.DiGraph, result: AnalysisResult) -> None:
         """Detect circular dependencies."""
         try:
+            # Limit cycle detection for large graphs
+            if len(call_graph) > 1000:
+                if self.config.verbose:
+                    print(f"  Skipping cycle detection for large graph ({len(call_graph)} nodes)")
+                return
             cycles = list(nx.simple_cycles(call_graph))
             if cycles:
                 result.metrics["project"] = result.metrics.get("project", {})
@@ -89,6 +103,11 @@ class RefactoringAnalyzer:
     def _detect_communities(self, call_graph: nx.DiGraph, result: AnalysisResult) -> None:
         """Detect communities (module groups)."""
         try:
+            # Limit community detection for large graphs
+            if len(call_graph) > 1000:
+                if self.config.verbose:
+                    print(f"  Skipping community detection for large graph ({len(call_graph)} nodes)")
+                return
             from networkx.algorithms import community
             # Using Louvain if available, otherwise greedy modularity
             if hasattr(community, 'louvain_communities'):

{code2llm-0.5.13 → code2llm-0.5.15}/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.13"
+__version__ = "0.5.15"
 
 from .pipeline import NLPPipeline
 from .normalization import QueryNormalizer

{code2llm-0.5.13 → code2llm-0.5.15}/code2llm.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: code2llm
-Version: 0.5.13
+Version: 0.5.15
 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

{code2llm-0.5.13 → code2llm-0.5.15}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "code2llm"
-version = "0.5.13"
+version = "0.5.15"
 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"
@@ -75,7 +75,7 @@ line-length = 100
 target-version = ['py38']
 
 [tool.mypy]
-python_version = "0.5.8"
+python_version = "0.5.14"
 ignore_missing_imports = true
 
 [tool.pytest.ini_options]