[release] v0.4.0

Author: Qu1nel

docs/source/changelog.rst

@@ -18,14 +18,7 @@ Unreleased
 Added
 -----
 
-- **[feat:typo] Smart typo detection system** - Added comprehensive typo detection infrastructure with TypoDetector, ScopeAnalyzer, and PythonStyleFormatter classes
-- **[feat:typo] Levenshtein Distance algorithm** - Implemented string similarity algorithm for basic typo detection with optimized space complexity
-- **[feat:typo] Python 3.11+ style error messages** - Added formatted error messages with file location, source highlighting, and typo suggestions
-- **[feat:typo] Semantic similarity scoring** - Enhanced confidence calculation with prefix/suffix matching and contextual relevance analysis
-- **[feat:typo] Integration with IsRequiredConstraint** - Automatic typo suggestions when validation rules fail to find required elements
-- **[feat:ux] Enhanced error reporting with numbered messages** - Added numbered error messages (1., 2., 3.) for better readability
-- **[feat:ux] User-visible typo suggestions** - Typo suggestions now appear in user output instead of debug logs only
-- **[feat:ux] Compact Russian typo format** - Created user-friendly Russian format for typo suggestions with proper indentation
+- *...*
 
 
 Changed
@@ -49,10 +42,7 @@ Removed
 Fixed
 -----
 
-- **[Critical Bug]** Fixed scope validation bug where selectors were not receiving proper scope configuration from the factory, causing rules to search in wrong scopes or ignore scope restrictions entirely.
-- **[Scope Logic]** Improved global scope handling for different selector types: assignments now only search at module level, while function calls include ``if __name__ == "__main__"`` blocks.
-- **[fix:typo] Improved target type inference** - Enhanced logic for determining whether to search for assignments, functions, or classes based on naming patterns
-- **[fix:typo] Enhanced confidence scoring** - Improved similarity scoring algorithm with semantic context awareness for better typo suggestions
+- *...*
 
 
 Security
@@ -62,6 +52,32 @@ Security
 
 
 
+v0.4.0 - 2025-08-06
+===================
+
+Added
+-----
+
+- **[feat:typo] Smart typo detection system** - Added comprehensive typo detection infrastructure with TypoDetector, ScopeAnalyzer, and PythonStyleFormatter classes
+- **[feat:typo] Levenshtein Distance algorithm** - Implemented string similarity algorithm for basic typo detection with optimized space complexity
+- **[feat:typo] Python 3.11+ style error messages** - Added formatted error messages with file location, source highlighting, and typo suggestions
+- **[feat:typo] Semantic similarity scoring** - Enhanced confidence calculation with prefix/suffix matching and contextual relevance analysis
+- **[feat:typo] Integration with IsRequiredConstraint** - Automatic typo suggestions when validation rules fail to find required elements
+- **[feat:ux] Enhanced error reporting with numbered messages** - Added numbered error messages (1., 2., 3.) for better readability
+- **[feat:ux] User-visible typo suggestions** - Typo suggestions now appear in user output instead of debug logs only
+- **[feat:ux] Compact Russian typo format** - Created user-friendly Russian format for typo suggestions with proper indentation
+
+
+Fixed
+-----
+
+- **[Critical Bug]** Fixed scope validation bug where selectors were not receiving proper scope configuration from the factory, causing rules to search in wrong scopes or ignore scope restrictions entirely.
+- **[Scope Logic]** Improved global scope handling for different selector types: assignments now only search at module level, while function calls include ``if __name__ == "__main__"`` blocks.
+- **[fix:typo] Improved target type inference** - Enhanced logic for determining whether to search for assignments, functions, or classes based on naming patterns
+- **[fix:typo] Enhanced confidence scoring** - Improved similarity scoring algorithm with semantic context awareness for better typo suggestions
+
+
+
 v0.3.0 - 2025-07-19
 ===================
 

pyproject.toml

@@ -10,7 +10,7 @@ build-backend = "setuptools.build_meta"
 # ==============================================================================
 [project]
 name = "python-code-validator"
-version = "0.3.0"
+version = "0.4.0"
 description = "A flexible, AST-based framework for static validation of Python code using declarative JSON rules."
 keywords = ["validation", "linter", "static analysis", "testing", "education", "ast"]
 authors = [{ name = "Qu1nel", email = "covach.qn@gmail.com" }]

src/code_validator/__init__.py

@@ -54,4 +54,4 @@
     "RuleParsingError",
 ]
 
-__version__ = "0.3.0"
+__version__ = "0.4.0"

src/code_validator/components/typo_detection/__init__.py

@@ -5,21 +5,21 @@
 analyzes similar names in the same scope and provides helpful suggestions.
 
 Example:
-    Instead of just "Required attribute 'self.speed' not found", 
+    Instead of just "Required attribute 'self.speed' not found",
     users get "Did you mean 'self.speed' instead of 'self.sped'?"
 
 Classes:
     TypoDetector: Main detector class for analyzing failed searches
-    ScopeAnalyzer: Extracts names from specific AST scopes  
+    ScopeAnalyzer: Extracts names from specific AST scopes
     PythonStyleFormatter: Formats suggestions like Python 3.11+ errors
 """
 
 from .detector import TypoDetector
-from .scope_analyzer import ScopeAnalyzer
 from .formatters import PythonStyleFormatter
+from .scope_analyzer import ScopeAnalyzer
 
 __all__ = [
     "TypoDetector",
-    "ScopeAnalyzer", 
+    "ScopeAnalyzer",
     "PythonStyleFormatter",
-]
+]

src/code_validator/components/typo_detection/algorithms.py

@@ -13,26 +13,26 @@
 
 class SimilarityAlgorithm(Protocol):
     """Protocol for string similarity algorithms."""
-    
+
     def distance(self, s1: str, s2: str) -> int:
         """Calculate distance between two strings.
-        
+
         Args:
             s1: First string
             s2: Second string
-            
+
         Returns:
             Distance value (lower = more similar)
         """
         ...
-    
+
     def similarity(self, s1: str, s2: str) -> float:
         """Calculate similarity score between two strings.
-        
+
         Args:
             s1: First string
             s2: Second string
-            
+
         Returns:
             Similarity score from 0.0 (no similarity) to 1.0 (identical)
         """
@@ -41,77 +41,77 @@ def similarity(self, s1: str, s2: str) -> float:
 
 class LevenshteinDistance:
     """Levenshtein distance algorithm for measuring string similarity.
-    
-    Calculates the minimum number of single-character edits (insertions, 
+
+    Calculates the minimum number of single-character edits (insertions,
     deletions, or substitutions) required to change one string into another.
-    
+
     Examples:
         >>> algo = LevenshteinDistance()
         >>> algo.distance("speed", "sped")
         1
-        >>> algo.similarity("speed", "sped") 
+        >>> algo.similarity("speed", "sped")
         0.8
     """
-    
+
     def distance(self, s1: str, s2: str) -> int:
         """Calculate Levenshtein distance between two strings.
-        
+
         Uses dynamic programming approach with O(n*m) time complexity
         and O(min(n,m)) space complexity optimization.
-        
+
         Args:
             s1: First string
             s2: Second string
-            
+
         Returns:
             Minimum number of edits needed to transform s1 into s2
         """
         if not s1:
             return len(s2)
         if not s2:
             return len(s1)
-        
+
         # Ensure s1 is the shorter string for space optimization
         if len(s1) > len(s2):
             s1, s2 = s2, s1
-        
+
         # Use only two rows instead of full matrix
         prev_row = list(range(len(s1) + 1))
         curr_row = [0] * (len(s1) + 1)
-        
+
         for i in range(1, len(s2) + 1):
             curr_row[0] = i
-            
+
             for j in range(1, len(s1) + 1):
                 if s2[i - 1] == s1[j - 1]:
                     curr_row[j] = prev_row[j - 1]  # No operation needed
                 else:
                     curr_row[j] = 1 + min(
-                        prev_row[j],      # Deletion
+                        prev_row[j],  # Deletion
                         curr_row[j - 1],  # Insertion
-                        prev_row[j - 1]   # Substitution
+                        prev_row[j - 1],  # Substitution
                     )
-            
+
             prev_row, curr_row = curr_row, prev_row
-        
+
         return prev_row[len(s1)]
-    
+
     def similarity(self, s1: str, s2: str) -> float:
         """Calculate similarity score based on Levenshtein distance.
-        
+
         Args:
             s1: First string
             s2: Second string
-            
+
         Returns:
             Similarity score from 0.0 to 1.0, where 1.0 means identical strings
         """
         if not s1 and not s2:
             return 1.0
-        
+
         max_len = max(len(s1), len(s2))
         if max_len == 0:
             return 1.0
-        
+
         distance = self.distance(s1, s2)
-        return 1.0 - (distance / max_len)
+        return 1.0 - (distance / max_len)