pure-python-ds 1.1.0

A strictly typed, 100% test-covered data structures and algorithms library.

pure-python-ds 🚀

A strictly-typed, 100% test-covered, and benchmarked Data Structures & Algorithms library.

🏗️ Architecture & Engineering

This library is engineered for Systems Architects and developers who require predictable performance and strict type safety. Every structure is built using Python's __slots__ to ensure a minimal memory footprint and high-speed attribute access.

[Image of a software architecture diagram showing layers of data structures and algorithms]

🛡️ Technical Milestones

• 100% Test Coverage: Verified 100% line coverage across the entire core library using pytest and coverage.py.
• Performance Benchmarked: Custom AVL Tree implementation demonstrated search operations up to 436x faster than standard Python list lookups in large-scale datasets.
• Type Safety: 100% mypy compliance with strict type hinting for all inputs and return values.

🛠️ Key Features

1. Linear Structures

• Linked Lists: Singly and Doubly Linked Lists with $O(1)$ head/tail operations.
• Stacks & Queues: Built on optimized nodes for strict LIFO/FIFO behavior.
• Hash Tables: Linear probing implementation with dynamic resizing.

2. Hierarchical & Network Structures

• AVL Trees: Self-balancing trees with rotation logic guaranteeing $O(\log n)$ performance.
• Red-Black Trees: Memory-optimized nodes with $O(\log n)$ height guarantees.
• Graphs: Adjacency-list based supporting Dijkstra’s, Bellman-Ford, Kruskal’s (via custom DSU), Prim's, A* Search, BFS, and DFS.
• Bloom Filters: Space-efficient probabilistic bit-array structures.

3. Advanced Data Structures

• Segment Trees: Range Query/Point Update in $O(\log n)$.
• Tries: Space-efficient prefix trees for string operations.
• Heaps & Priority Queues: Min/Max Binary Heaps and native PriorityQueue wrappers for $O(1)$ optimal access.
• LRU Caches: Optimized $O(1)$ mapping mapping backed by Doubly Linked Lists.

4. Algorithms Module (New in v1.1.0!)

• Sorting: Quick Sort, Heap Sort, Merge Sort, Insertion Sort, and Radix Sort.
• Searching: Binary, Linear, Jump, and Exponential Search.
• Dynamic Programming: 0-1 Knapsack, LCS, LIS, Edit Distance, and Memoized Fibonacci.
• String Matching: Knuth-Morris-Pratt (KMP) & Rabin-Karp implementations.