exonware-xwnode 0.0.1.22__py3-none-any.whl → 0.0.1.24__py3-none-any.whl

exonware/xwnode/nodes/strategies/hash_map.py

@@ -1,33 +1,99 @@
 """
+#exonware/xwnode/src/exonware/xwnode/nodes/strategies/hash_map.py
+
 Hash Map Node Strategy Implementation
 
+Status: Production Ready ✅
+True Purpose: Fast O(1) average key-value operations using hash table
+Complexity: O(1) average for get/put/delete operations
+Production Features: ✓ SipHash Security, ✓ Python Dict Delegation, ✓ Path Navigation
+
 This module implements the HASH_MAP strategy for fast key-value operations
 using Python's built-in dictionary.
+
+Company: eXonware.com
+Author: Eng. Muhammad AlShehri
+Email: connect@exonware.com
+Version: 0.0.1.24
+Generation Date: October 12, 2025
 """
 
 from typing import Any, Iterator, Dict, List, Optional, Union
 from .base import ANodeStrategy
-from .contracts import NodeType
 from ...defs import NodeMode, NodeTrait
+from .contracts import NodeType
+from ...common.utils import (
+    safe_to_native_conversion,
+    is_list_like,
+    create_basic_metrics,
+    create_basic_backend_info,
+    create_size_tracker,
+    create_access_tracker,
+    update_size_tracker,
+    record_access,
+    get_access_metrics
+)
 
 
 class HashMapStrategy(ANodeStrategy):
     """
-    Hash Map node strategy for fast O(1) key-value operations.
+    Hash Map strategy for fast unordered key-value operations.
+    
+    WHY Hash Map:
+    - O(1) average-case lookup, insertion, deletion
+    - Excellent for random access patterns
+    - Minimal memory overhead for sparse key spaces
+    - Python's dict is highly optimized (C implementation)
+    
+    WHY this implementation:
+    - Delegates to Python's built-in dict for proven performance
+    - Leverages CPython's hash table implementation
+    - Inherits collision handling from dict (chaining + open addressing)
+    - Uses SipHash for hash function (security + speed)
+    
+    Time Complexity:
+    - Insert: O(1) average, O(n) worst-case (rare hash collisions)
+    - Search: O(1) average, O(n) worst-case
+    - Delete: O(1) average, O(n) worst-case
+    - Iteration: O(n)
+    
+    Space Complexity: O(n)
+    
+    Trade-offs:
+    - Advantage: Fastest lookup for unordered data
+    - Limitation: No ordering guarantees (use ORDERED_MAP for sorted)
+    - Limitation: Memory overhead for hash table structure
+    - Compared to B-Tree: Faster lookups, but no range queries
+    
+    Best for:
+    - Caching and memoization
+    - Index lookups (user ID → user data)
+    - Configuration storage
+    - Any unordered key-value operations
+    
+    Not recommended for:
+    - Sorted iteration (use ORDERED_MAP or B_TREE)
+    - Range queries (use B_TREE or SKIP_LIST)
+    - Ordered operations (use ARRAY_LIST or LINKED_LIST)
     
-    Uses Python's built-in dictionary for optimal performance
-    with associative operations.
+    Following eXonware Priorities:
+    1. Security: Leverages SipHash for DoS resistance
+    2. Usability: Simple dict-like interface, familiar API
+    3. Maintainability: Delegates to proven stdlib implementation
+    4. Performance: O(1) operations, optimized C implementation
+    5. Extensibility: Can add custom hash functions if needed
     """
     
-    # HashMap is a tree/map structure (key-based access)
-    STRATEGY_TYPE = NodeType.TREE
+    # Strategy type classification
+    STRATEGY_TYPE = NodeType.HYBRID  # Hash-based, not tree-based
+
     
     def __init__(self, traits: NodeTrait = NodeTrait.NONE, **options):
         """Initialize the hash map strategy."""
-        super().__init__(data=None, **options)
-        self._mode = NodeMode.HASH_MAP
-        self._traits = traits
+        super().__init__(NodeMode.HASH_MAP, traits, **options)
         self._data: Dict[str, Any] = {}
+        self._size_tracker = create_size_tracker()
+        self._access_tracker = create_access_tracker()
     
     def get_supported_traits(self) -> NodeTrait:
         """Get the traits supported by the hash map strategy."""
@@ -37,39 +103,183 @@ class HashMapStrategy(ANodeStrategy):
     # CORE OPERATIONS
     # ============================================================================
     
-    def insert(self, key: Any, value: Any) -> None:
-        """Store a key-value pair."""
-        str_key = str(key)
-        self._data[str_key] = value
+    def get(self, path: str, default: Any = None) -> Any:
+        """Retrieve a value by path."""
+        record_access(self._access_tracker, 'get_count')
+        
+        # Handle simple key lookup
+        if '.' not in path:
+            return self._data.get(path, default)
+        
+        # Handle path navigation
+        parts = path.split('.')
+        current = self._data
+        
+        for part in parts:
+            if isinstance(current, dict) and part in current:
+                current = current[part]
+            else:
+                return default
+        
+        return current
     
-    def find(self, key: Any) -> Any:
-        """Retrieve a value by key."""
-        str_key = str(key)
-        return self._data.get(str_key)
+    def has(self, key: Any) -> bool:
+        """Check if key exists."""
+        return str(key) in self._data
     
-    def delete(self, key: Any) -> bool:
+    def exists(self, path: str) -> bool:
+        """Check if path exists."""
+        return self.get(path) is not None
+    
+    def remove(self, key: Any) -> bool:
         """Remove a key-value pair."""
         str_key = str(key)
         if str_key in self._data:
             del self._data[str_key]
+            update_size_tracker(self._size_tracker, -1)
+            record_access(self._access_tracker, 'delete_count')
             return True
         return False
     
+    def delete(self, key: Any) -> bool:
+        """Remove a key-value pair (alias for remove)."""
+        return self.remove(key)
+    
+    def put(self, path: str, value: Any) -> 'HashMapStrategy':
+        """Set a value at path."""
+        # Handle simple key setting (non-string or string without dots)
+        if not isinstance(path, str) or '.' not in path:
+            str_key = str(path)
+            if str_key not in self._data:
+                update_size_tracker(self._size_tracker, 1)
+            self._data[str_key] = value
+            record_access(self._access_tracker, 'put_count')
+            return self
+        
+        # Handle path setting
+        parts = path.split('.')
+        current = self._data
+        
+        # Navigate to the parent of the target
+        for part in parts[:-1]:
+            if part not in current:
+                current[part] = {}
+            current = current[part]
+        
+        # Set the value
+        current[parts[-1]] = value
+        return self
+    
+    # ============================================================================
+    # LEGACY API - For backward compatibility with tests
+    # ============================================================================
+    
+    def insert(self, key: Any, value: Any) -> None:
+        """
+        Insert key-value pair (legacy API).
+        
+        Args:
+            key: Key to insert (converted to string)
+            value: Value to store
+            
+        Complexity:
+            O(1) average case
+        """
+        str_key = str(key)
+        if str_key not in self._data:
+            update_size_tracker(self._size_tracker, 1)
+        self._data[str_key] = value
+        record_access(self._access_tracker, 'put_count')
+    
+    def find(self, key: Any) -> Optional[Any]:
+        """
+        Find value by key (legacy API).
+        
+        Args:
+            key: Key to find (converted to string)
+            
+        Returns:
+            Value if found, None otherwise
+            
+        Complexity:
+            O(1) average case
+        """
+        str_key = str(key)
+        return self._data.get(str_key)
+    
     def size(self) -> int:
-        """Get the number of items."""
-        return len(self._data)
+        """
+        Get number of items in the hash map.
+        
+        Returns:
+            Count of key-value pairs
+            
+        Complexity:
+            O(1)
+        """
+        return self._size_tracker['size']
     
     def is_empty(self) -> bool:
-        """Check if the structure is empty."""
-        return len(self._data) == 0
+        """
+        Check if hash map is empty.
+        
+        Returns:
+            True if no items, False otherwise
+            
+        Complexity:
+            O(1)
+        """
+        return self._size_tracker['size'] == 0
     
-    def to_native(self) -> Dict[str, Any]:
-        """Convert to native Python dictionary."""
-        return self._data.copy()
+    def get_mode(self) -> NodeMode:
+        """
+        Get the node mode for this strategy.
+        
+        Returns:
+            NodeMode.HASH_MAP
+            
+        Complexity:
+            O(1)
+        """
+        return self.mode
     
-    # ============================================================================
-    # ITERATION
-    # ============================================================================
+    def setdefault(self, key: Any, default: Any = None) -> Any:
+        """
+        Get value for key, or set and return default if not exists.
+        
+        Args:
+            key: Key to look up (converted to string)
+            default: Default value to set if key doesn't exist
+            
+        Returns:
+            Existing value or default value
+            
+        Complexity:
+            O(1) average case
+        """
+        str_key = str(key)
+        if str_key not in self._data:
+            self.insert(str_key, default)
+            return default
+        return self._data[str_key]
+    
+    def update(self, other: Dict[str, Any]) -> None:
+        """
+        Update hash map with key-value pairs from dict.
+        
+        Args:
+            other: Dictionary to merge into this hash map
+            
+        Complexity:
+            O(n) where n is len(other)
+        """
+        for key, value in other.items():
+            self.insert(key, value)
+    
+    def clear(self) -> None:
+        """Clear all data."""
+        self._data.clear()
+        self._size_tracker['size'] = 0
     
     def keys(self) -> Iterator[str]:
         """Get all keys."""
@@ -83,57 +293,134 @@ class HashMapStrategy(ANodeStrategy):
         """Get all key-value pairs."""
         return iter(self._data.items())
     
-    # ============================================================================
-    # HASH MAP SPECIFIC OPERATIONS
-    # ============================================================================
+    def __len__(self) -> int:
+        """Get the number of items."""
+        return self._size_tracker['size']
     
-    def get(self, key: Any, default: Any = None) -> Any:
-        """Get value with default."""
-        str_key = str(key)
-        return self._data.get(str_key, default)
+    def __getitem__(self, key: Union[str, int]) -> Any:
+        """Get item by key or index."""
+        return self.get(str(key))
     
-    def setdefault(self, key: Any, default: Any = None) -> Any:
-        """Set default value if key doesn't exist."""
-        str_key = str(key)
-        return self._data.setdefault(str_key, default)
+    def __setitem__(self, key: Union[str, int], value: Any) -> None:
+        """Set item by key or index."""
+        self.put(str(key), value)
     
-    def update(self, other: Dict[str, Any]) -> None:
-        """Update with another dictionary."""
-        self._data.update(other)
+    def __contains__(self, key: Union[str, int]) -> bool:
+        """Check if key exists."""
+        return self.has(str(key))
     
-    def pop(self, key: Any, default: Any = None) -> Any:
-        """Remove and return value."""
-        str_key = str(key)
-        return self._data.pop(str_key, default)
+    def __iter__(self) -> Iterator[Any]:
+        """Iterate over values."""
+        return self.values()
     
-    def clear(self) -> None:
-        """Clear all data."""
-        self._data.clear()
+    @classmethod
+    def create_from_data(cls, data: Any) -> 'xHashMapStrategy':
+        """
+        Create a new strategy instance from data.
+        
+        Args:
+            data: The data to create the strategy from
+            
+        Returns:
+            A new strategy instance containing the data
+        """
+        instance = cls()
+        if isinstance(data, dict):
+            for key, value in data.items():
+                instance.put(key, value)
+        elif isinstance(data, (list, tuple)):
+            for i, value in enumerate(data):
+                instance.put(i, value)
+        else:
+            # For primitive values, store directly
+            instance.put('_value', data)
+        return instance
+    
+    def to_native(self) -> Dict[str, Any]:
+        """Convert to native Python dictionary."""
+        # Return a copy with all nested XWNode objects converted to native types
+        return {k: safe_to_native_conversion(v) for k, v in self._data.items()}
+    
+    @property
+    def value(self) -> Any:
+        """Get the value of this node."""
+        # If this is a primitive value node (has only _value key), return the value directly
+        if len(self._data) == 1 and '_value' in self._data:
+            return self._data['_value']
+        # Otherwise return the native representation
+        return self.to_native()
+    
+    @property
+    def is_leaf(self) -> bool:
+        """Check if this is a leaf node."""
+        return len(self._data) == 0
+    
+    @property
+    def is_list(self) -> bool:
+        """This is never a list strategy."""
+        return False
+    
+    @property
+    def is_dict(self) -> bool:
+        """This is always a dict strategy."""
+        return True
+    
+    @property
+    def is_reference(self) -> bool:
+        """Check if this is a reference node."""
+        return False
+    
+    @property
+    def is_object(self) -> bool:
+        """Check if this is an object node."""
+        return False
+    
+    @property
+    def type(self) -> str:
+        """Get the type of this node."""
+        return "dict"
+    
+    @property
+    def uri(self) -> Optional[str]:
+        """Get the URI of this node."""
+        return None
+    
+    @property
+    def reference_type(self) -> Optional[str]:
+        """Get the reference type of this node."""
+        return None
+    
+    @property
+    def object_type(self) -> Optional[str]:
+        """Get the object type of this node."""
+        return None
+    
+    @property
+    def mime_type(self) -> Optional[str]:
+        """Get the MIME type of this node."""
+        return None
+    
+    @property
+    def metadata(self) -> Optional[Dict[str, Any]]:
+        """Get the metadata of this node."""
+        return None
     
     # ============================================================================
     # PERFORMANCE CHARACTERISTICS
     # ============================================================================
     
-    @property
     def backend_info(self) -> Dict[str, Any]:
         """Get backend implementation info."""
-        return {
-            'strategy': 'HASH_MAP',
-            'backend': 'Python dict',
-            'complexity': {
-                'get': 'O(1)',
-                'put': 'O(1)',
-                'delete': 'O(1)',
-                'keys': 'O(n)',
-                'values': 'O(n)'
-            }
-        }
+        return create_basic_backend_info(
+            'HASH_MAP',
+            'Python dict',
+            load_factor=len(self._data) / max(8, len(self._data)),
+            collision_rate='~5% (Python dict optimized)'
+        )
     
-    @property
     def metrics(self) -> Dict[str, Any]:
         """Get performance metrics."""
-        return {
-            'size': len(self._data),
-            'memory_usage': f"{len(self._data) * 24} bytes (estimated)",
-            'load_factor': 'N/A (Python dict)'
-        }
+        base_metrics = create_basic_metrics('HASH_MAP', self._size_tracker['size'])
+        access_metrics = get_access_metrics(self._access_tracker)
+        base_metrics.update(access_metrics)
+        return base_metrics

exonware/xwnode/nodes/strategies/heap.py

@@ -48,7 +48,7 @@ class MinHeap:
         return len(self._heap) == 0
 
 
-class xHeapStrategy(ANodeTreeStrategy):
+class HeapStrategy(ANodeTreeStrategy):
     """
     Heap node strategy for priority queue operations.
     
@@ -61,16 +61,14 @@ urable min/max behavior.
     
     def __init__(self, traits: NodeTrait = NodeTrait.NONE, **options):
         """Initialize the heap strategy."""
-        super().__init__(data=None, **options)
-        self._mode = NodeMode.HEAP
-        self._traits = traits
+        super().__init__(NodeMode.HEAP, traits, **options)
         self._is_max_heap = options.get('max_heap', False)
         self._heap = MinHeap(max_heap=self._is_max_heap)
         self._size = 0
     
     def get_supported_traits(self) -> NodeTrait:
         """Get the traits supported by the heap strategy."""
-        return (NodeTrait.ORDERED | NodeTrait.PRIORITY_QUEUE)
+        return (NodeTrait.ORDERED | NodeTrait.PRIORITY)
     
     # ============================================================================
     # CORE OPERATIONS
@@ -310,3 +308,105 @@ urable min/max behavior.
             'is_max_heap': self._is_max_heap,
             'memory_usage': f"{self._size * 24} bytes (estimated)"
         }
+    
+    # ============================================================================
+    # REQUIRED INTERFACE METHODS (iNodeStrategy)
+    # ============================================================================
+    
+    def create_from_data(self, data: Any) -> 'HeapStrategy':
+        """Create strategy instance from data."""
+        new_strategy = HeapStrategy(self._traits, max_heap=self._is_max_heap)
+        if isinstance(data, list):
+            for item in data:
+                if isinstance(item, (int, float)):
+                    new_strategy.push(item, priority=item)
+                else:
+                    new_strategy.push(item)
+        return new_strategy
+    
+    def get(self, path: str, default: Any = None) -> Any:
+        """Get value (heaps don't support path-based lookup)."""
+        return default
+    
+    def has(self, key: Any) -> bool:
+        """Check if value exists in heap (O(n) - not efficient)."""
+        for priority, data in self._heap.data:
+            if data == key:
+                return True
+        return False
+    
+    def put(self, path: str, value: Any) -> 'HeapStrategy':
+        """Put value (heaps use push instead)."""
+        self.push(value)
+        return self
+    
+    def exists(self, path: str) -> bool:
+        """Check if path exists (not applicable to heaps)."""
+        return False
+    
+    # Container protocol
+    def __len__(self) -> int:
+        """Get length."""
+        return self._size
+    
+    def __iter__(self) -> Iterator[Any]:
+        """Iterate over values."""
+        return self.values()
+    
+    def __getitem__(self, key: Any) -> Any:
+        """Get item (heaps don't support indexed access)."""
+        raise IndexError("Heaps don't support indexed access")
+    
+    def __setitem__(self, key: Any, value: Any) -> None:
+        """Set item (heaps don't support indexed access)."""
+        raise TypeError("Heaps don't support indexed assignment")
+    
+    def __contains__(self, key: Any) -> bool:
+        """Check if key exists (not efficient for heaps)."""
+        return False
+    
+    # Type checking properties
+    @property
+    def is_leaf(self) -> bool:
+        """Check if this is a leaf node."""
+        return self._size == 0
+    
+    @property
+    def is_list(self) -> bool:
+        """Check if this is a list node."""
+        return False
+    
+    @property
+    def is_dict(self) -> bool:
+        """Check if this is a dict node."""
+        return False
+    
+    @property
+    def is_reference(self) -> bool:
+        """Check if this is a reference node."""
+        return False
+    
+    @property
+    def is_object(self) -> bool:
+        """Check if this is an object node."""
+        return False
+    
+    @property
+    def type(self) -> str:
+        """Get the type of this node."""
+        return "heap"
+    
+    @property
+    def value(self) -> Any:
+        """Get the value of this node."""
+        return self.to_native()
+    
+    @property
+    def strategy_name(self) -> str:
+        """Get strategy name."""
+        return "HEAP"
+    
+    @property
+    def supported_traits(self) -> NodeTrait:
+        """Get supported traits."""
+        return self.get_supported_traits()