Merge pull request #3 from AnshMNSoni/code_quality

fix the space and indentation issue leds in bad code quality

Author: AnshMNSoni

.flake8

@@ -1,6 +1,6 @@
 [flake8]
 max-line-length = 100
-exclude = 
+exclude =
     .git,
     __pycache__,
     .venv,
@@ -10,9 +10,9 @@ exclude =
     *.egg-info,
     .pytest_cache,
     .mypy_cache
-ignore = 
-    E203,  # whitespace before ':'
-    W503,  # line break before binary operator
-    E501   # line too long (handled by max-line-length)
+ignore =
+    E203,
+    W503,
+    E501
 per-file-ignores =
     __init__.py:F401,F403

.github/workflows/python.yml

@@ -29,16 +29,16 @@ jobs:
     
     - name: Run flake8
       run: |
-        flake8 pystl/ --count --show-source --statistics
+        flake8 pythonstl/ --count --show-source --statistics
     
     - name: Run mypy
       run: |
-        mypy pystl/ --ignore-missing-imports
+        mypy pythonstl/ --ignore-missing-imports
       continue-on-error: true
 
     - name: Run tests with coverage
       run: |
-        pytest tests/ --cov=pystl --cov-report=xml --cov-report=term
+        pytest tests/ --cov=pythonstl --cov-report=xml --cov-report=term
     
     - name: Upload coverage reports
       uses: codecov/codecov-action@v3

pythonstl/core/base.py

@@ -17,31 +17,31 @@
 class ContainerBase(ABC, Generic[T]):
     """
     Abstract base class for all STL-style containers.
-    
+
     Provides common interface methods that all containers must implement.
     """
-    
+
     @abstractmethod
     def empty(self) -> bool:
         """
         Check if the container is empty.
-        
+
         Returns:
             bool: True if container is empty, False otherwise.
-            
+
         Time Complexity:
             O(1)
         """
         pass
-    
+
     @abstractmethod
     def size(self) -> int:
         """
         Get the number of elements in the container.
-        
+
         Returns:
             int: Number of elements in the container.
-            
+
         Time Complexity:
             O(1)
         """

pythonstl/core/exceptions.py

@@ -14,11 +14,11 @@ class PySTLException(Exception):
 class EmptyContainerError(PySTLException):
     """
     Exception raised when attempting to access elements from an empty container.
-    
+
     This matches the behavior of C++ STL when accessing empty containers
     (e.g., calling top() on an empty stack).
     """
-    
+
     def __init__(self, container_type: str):
         self.container_type = container_type
         super().__init__(f"Cannot access element from empty {container_type}")
@@ -27,10 +27,10 @@ def __init__(self, container_type: str):
 class OutOfRangeError(PySTLException):
     """
     Exception raised when accessing an invalid index or position.
-    
+
     This matches C++ STL's std::out_of_range exception.
     """
-    
+
     def __init__(self, index: int, size: int):
         self.index = index
         self.size = size
@@ -40,10 +40,10 @@ def __init__(self, index: int, size: int):
 class KeyNotFoundError(PySTLException):
     """
     Exception raised when a key is not found in an associative container.
-    
+
     This matches C++ STL behavior when accessing non-existent keys in maps.
     """
-    
+
     def __init__(self, key):
         self.key = key
         super().__init__(f"Key '{key}' not found in container")

pythonstl/core/iterator.py

@@ -5,7 +5,7 @@
 enabling both C++ STL-style iteration and Python iteration protocols.
 """
 
-from typing import TypeVar, Generic, List, Any
+from typing import TypeVar, Generic, List
 from abc import ABC, abstractmethod
 
 T = TypeVar('T')
@@ -14,15 +14,15 @@
 class Iterator(ABC, Generic[T]):
     """
     Abstract base class for iterators.
-    
+
     Provides the foundation for both forward and reverse iterators.
     """
-    
+
     @abstractmethod
     def __next__(self) -> T:
         """Get the next element."""
         pass
-    
+
     @abstractmethod
     def __iter__(self):
         """Return the iterator itself."""
@@ -32,28 +32,28 @@ def __iter__(self):
 class VectorIterator(Iterator[T]):
     """
     Forward iterator for vector.
-    
+
     This iterator traverses the vector from beginning to end.
     """
-    
+
     def __init__(self, data: List[T], index: int = 0) -> None:
         """
         Initialize vector iterator.
-        
+
         Args:
             data: Reference to the vector's internal data
             index: Starting position
         """
         self._data = data
         self._index = index
-    
+
     def __next__(self) -> T:
         """
         Get the next element.
-        
+
         Returns:
             The next element in the vector.
-            
+
         Raises:
             StopIteration: When iteration is complete.
         """
@@ -62,7 +62,7 @@ def __next__(self) -> T:
         value = self._data[self._index]
         self._index += 1
         return value
-    
+
     def __iter__(self):
         """Return the iterator itself."""
         return self
@@ -71,14 +71,14 @@ def __iter__(self):
 class VectorReverseIterator(Iterator[T]):
     """
     Reverse iterator for vector.
-    
+
     This iterator traverses the vector from end to beginning.
     """
-    
+
     def __init__(self, data: List[T], index: int = -1) -> None:
         """
         Initialize reverse vector iterator.
-        
+
         Args:
             data: Reference to the vector's internal data
             index: Starting position (default: last element)
@@ -88,14 +88,14 @@ def __init__(self, data: List[T], index: int = -1) -> None:
             self._index = len(data) - 1
         else:
             self._index = index
-    
+
     def __next__(self) -> T:
         """
         Get the next element (in reverse order).
-        
+
         Returns:
             The next element in reverse order.
-            
+
         Raises:
             StopIteration: When iteration is complete.
         """
@@ -104,7 +104,7 @@ def __next__(self) -> T:
         value = self._data[self._index]
         self._index -= 1
         return value
-    
+
     def __iter__(self):
         """Return the iterator itself."""
         return self
@@ -113,32 +113,32 @@ def __iter__(self):
 class SetIterator(Iterator[T]):
     """
     Iterator for set.
-    
+
     This iterator traverses the set elements.
     Note: Order is not guaranteed (matches Python set behavior).
     """
-    
+
     def __init__(self, data: set) -> None:
         """
         Initialize set iterator.
-        
+
         Args:
             data: Reference to the set's internal data
         """
         self._iterator = iter(data)
-    
+
     def __next__(self) -> T:
         """
         Get the next element.
-        
+
         Returns:
             The next element in the set.
-            
+
         Raises:
             StopIteration: When iteration is complete.
         """
         return next(self._iterator)
-    
+
     def __iter__(self):
         """Return the iterator itself."""
         return self
@@ -147,32 +147,32 @@ def __iter__(self):
 class MapIterator(Iterator):
     """
     Iterator for map.
-    
+
     This iterator traverses the map's key-value pairs.
     Returns tuples of (key, value).
     """
-    
+
     def __init__(self, data: dict) -> None:
         """
         Initialize map iterator.
-        
+
         Args:
             data: Reference to the map's internal data
         """
         self._iterator = iter(data.items())
-    
+
     def __next__(self):
         """
         Get the next key-value pair.
-        
+
         Returns:
             Tuple of (key, value).
-            
+
         Raises:
             StopIteration: When iteration is complete.
         """
         return next(self._iterator)
-    
+
     def __iter__(self):
         """Return the iterator itself."""
         return self