pure-python-ds 1.0.0__tar.gz → 1.0.2__tar.gz

pure_python_ds-1.0.2/PKG-INFO

@@ -0,0 +1,50 @@
+Metadata-Version: 2.4
+Name: pure-python-ds
+Version: 1.0.2
+Summary: A strictly typed, 100% test-covered data structures and algorithms library.
+Author: Parjad Minooei
+Project-URL: Documentation, https://ParjadM.github.io/pure-python-ds/
+Project-URL: Source, https://github.com/ParjadM/pure-python-ds
+Classifier: Programming Language :: Python :: 3.12
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Classifier: Intended Audience :: Developers
+Classifier: Topic :: Software Development :: Libraries :: Python Modules
+Requires-Python: >=3.12
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+
+# pure-python-ds 🚀
+**A strictly-typed, 100% test-covered, and benchmarked Data Structures & Algorithms library.**
+
+[![Python Version](https://img.shields.io/badge/python-3.12-blue.svg)](https://www.python.org/)
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+[![Tests](https://github.com/ParjadM/pure-python-ds/actions/workflows/ci.yml/badge.svg)](https://github.com/ParjadM/pure-python-ds/actions)
+
+## 🏗️ 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, and Kruskal’s (via custom DSU).
+
+### 3. Advanced Data Structures
+* **Segment Trees:** Range Query/Point Update in $O(\log n)$.
+* **Tries:** Space-efficient prefix trees for string operations.
+* **Heaps:** Min/Max Binary Heaps for $O(1)$ priority access.
+

pure_python_ds-1.0.2/README.md

@@ -0,0 +1,33 @@
+# pure-python-ds 🚀
+**A strictly-typed, 100% test-covered, and benchmarked Data Structures & Algorithms library.**
+
+[![Python Version](https://img.shields.io/badge/python-3.12-blue.svg)](https://www.python.org/)
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+[![Tests](https://github.com/ParjadM/pure-python-ds/actions/workflows/ci.yml/badge.svg)](https://github.com/ParjadM/pure-python-ds/actions)
+
+## 🏗️ 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, and Kruskal’s (via custom DSU).
+
+### 3. Advanced Data Structures
+* **Segment Trees:** Range Query/Point Update in $O(\log n)$.
+* **Tries:** Space-efficient prefix trees for string operations.
+* **Heaps:** Min/Max Binary Heaps for $O(1)$ priority access.
+

pure_python_ds-1.0.2/pure_python_ds.egg-info/PKG-INFO

@@ -0,0 +1,50 @@
+Metadata-Version: 2.4
+Name: pure-python-ds
+Version: 1.0.2
+Summary: A strictly typed, 100% test-covered data structures and algorithms library.
+Author: Parjad Minooei
+Project-URL: Documentation, https://ParjadM.github.io/pure-python-ds/
+Project-URL: Source, https://github.com/ParjadM/pure-python-ds
+Classifier: Programming Language :: Python :: 3.12
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Classifier: Intended Audience :: Developers
+Classifier: Topic :: Software Development :: Libraries :: Python Modules
+Requires-Python: >=3.12
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+
+# pure-python-ds 🚀
+**A strictly-typed, 100% test-covered, and benchmarked Data Structures & Algorithms library.**
+
+[![Python Version](https://img.shields.io/badge/python-3.12-blue.svg)](https://www.python.org/)
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+[![Tests](https://github.com/ParjadM/pure-python-ds/actions/workflows/ci.yml/badge.svg)](https://github.com/ParjadM/pure-python-ds/actions)
+
+## 🏗️ 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, and Kruskal’s (via custom DSU).
+
+### 3. Advanced Data Structures
+* **Segment Trees:** Range Query/Point Update in $O(\log n)$.
+* **Tries:** Space-efficient prefix trees for string operations.
+* **Heaps:** Min/Max Binary Heaps for $O(1)$ priority access.
+

{pure_python_ds-1.0.0 → pure_python_ds-1.0.2}/pyproject.toml

@@ -5,7 +5,7 @@ build-backend = "setuptools.build_meta"
 [project]
 # You may need to change this if "pure-python-ds" is already taken on PyPI
 name = "pure-python-ds" 
-version = "1.0.0"
+version = "1.0.2"
 authors = [
   { name="Parjad Minooei" }
 ]

pure_python_ds-1.0.0/PKG-INFO

@@ -1,69 +0,0 @@
-Metadata-Version: 2.4
-Name: pure-python-ds
-Version: 1.0.0
-Summary: A strictly typed, 100% test-covered data structures and algorithms library.
-Author: Parjad Minooei
-Project-URL: Documentation, https://ParjadM.github.io/pure-python-ds/
-Project-URL: Source, https://github.com/ParjadM/pure-python-ds
-Classifier: Programming Language :: Python :: 3.12
-Classifier: License :: OSI Approved :: MIT License
-Classifier: Operating System :: OS Independent
-Classifier: Intended Audience :: Developers
-Classifier: Topic :: Software Development :: Libraries :: Python Modules
-Requires-Python: >=3.12
-Description-Content-Type: text/markdown
-License-File: LICENSE
-Dynamic: license-file
-
-# pure-python-ds 🚀
-
-A high-performance, strictly-typed, and memory-optimized Data Structures and Algorithms library built in Pure Python.
-
-## 🏗️ Architecture Overview
-
-This library was designed with a focus on **Systems Architecture**. By utilizing Python's `__slots__`, every node in this library is memory-optimized to reduce overhead, making it suitable for educational deep-dives and performance-sensitive prototyping.
-
-[Image of a software architecture diagram showing layers of data structures and algorithms]
-
-## 🛠️ Key Features
-
-### 1. Linear Data Structures
-* **Linked Lists:** Singly and Doubly Linked Lists with $O(1)$ head/tail operations.
-* **Stacks & Queues:** Built on top of optimized linked nodes for strict LIFO/FIFO behavior.
-
-### 2. Hierarchical & Network Structures
-* **Binary Search Trees (BST):** Standard ordered trees with recursive and iterative implementations.
-* **AVL Trees:** Self-balancing trees using rotation logic to guarantee $O(\log n)$ performance.
-* **Graphs:** Adjacency-list based implementation supporting both Directed and Undirected networks.
-
-### 3. Advanced Algorithms
-* **Pathfinding:** Dijkstra's Algorithm for finding shortest paths in weighted graphs.
-* **Sorting:** $O(n \log n)$ Merge Sort implementation.
-* **Searching:** $O(\log n)$ Binary Search.
-* **Dynamic Programming:** Memoized Fibonacci and sub-problem optimization.
-
-[Image of a perfectly balanced Binary Search Tree demonstrating O(log n) structure]
-
-## 🚀 Installation
-
-Since the package is in "Editable" mode, you can install it locally to use across your entire system:
-
-```bash
-git clone [https://github.com/ParjadM/pure-python-ds.git](https://github.com/ParjadM/pure-python-ds.git)
-cd pure-python-ds
-pip install -e .
-```
-
-🚀 Technical Milestone: 83% Unit Test Coverage Reached
-Core Engineering Accomplishments:
-
-Robustness Verification: Engineered a comprehensive regression suite achieving 83% total coverage across 15+ complex data structures.
-
-Algorithm Integration: Successfully implemented and verified Kruskal’s MST (using custom DSU), Bellman-Ford, and Dijkstra’s algorithms.
-
-Recursive Tree Logic: Developed and tested memory-safe recursive deletion with rebalancing for AVL and Binary Search Trees.
-
-Performance Optimization: Leveraged __slots__ and Python Generators to ensure O(1) space complexity for tree traversals and minimal memory footprint.
-
-![Coverage](https://img.shields.io/badge/Coverage-83%25-brightgreen?style=for-the-badge&logo=pytest)
-![Build](https://img.shields.io/badge/Build-Passing-success?style=for-the-badge&logo=github-actions)

pure_python_ds-1.0.0/README.md

@@ -1,52 +0,0 @@
-# pure-python-ds 🚀
-
-A high-performance, strictly-typed, and memory-optimized Data Structures and Algorithms library built in Pure Python.
-
-## 🏗️ Architecture Overview
-
-This library was designed with a focus on **Systems Architecture**. By utilizing Python's `__slots__`, every node in this library is memory-optimized to reduce overhead, making it suitable for educational deep-dives and performance-sensitive prototyping.
-
-[Image of a software architecture diagram showing layers of data structures and algorithms]
-
-## 🛠️ Key Features
-
-### 1. Linear Data Structures
-* **Linked Lists:** Singly and Doubly Linked Lists with $O(1)$ head/tail operations.
-* **Stacks & Queues:** Built on top of optimized linked nodes for strict LIFO/FIFO behavior.
-
-### 2. Hierarchical & Network Structures
-* **Binary Search Trees (BST):** Standard ordered trees with recursive and iterative implementations.
-* **AVL Trees:** Self-balancing trees using rotation logic to guarantee $O(\log n)$ performance.
-* **Graphs:** Adjacency-list based implementation supporting both Directed and Undirected networks.
-
-### 3. Advanced Algorithms
-* **Pathfinding:** Dijkstra's Algorithm for finding shortest paths in weighted graphs.
-* **Sorting:** $O(n \log n)$ Merge Sort implementation.
-* **Searching:** $O(\log n)$ Binary Search.
-* **Dynamic Programming:** Memoized Fibonacci and sub-problem optimization.
-
-[Image of a perfectly balanced Binary Search Tree demonstrating O(log n) structure]
-
-## 🚀 Installation
-
-Since the package is in "Editable" mode, you can install it locally to use across your entire system:
-
-```bash
-git clone [https://github.com/ParjadM/pure-python-ds.git](https://github.com/ParjadM/pure-python-ds.git)
-cd pure-python-ds
-pip install -e .
-```
-
-🚀 Technical Milestone: 83% Unit Test Coverage Reached
-Core Engineering Accomplishments:
-
-Robustness Verification: Engineered a comprehensive regression suite achieving 83% total coverage across 15+ complex data structures.
-
-Algorithm Integration: Successfully implemented and verified Kruskal’s MST (using custom DSU), Bellman-Ford, and Dijkstra’s algorithms.
-
-Recursive Tree Logic: Developed and tested memory-safe recursive deletion with rebalancing for AVL and Binary Search Trees.
-
-Performance Optimization: Leveraged __slots__ and Python Generators to ensure O(1) space complexity for tree traversals and minimal memory footprint.
-
-![Coverage](https://img.shields.io/badge/Coverage-83%25-brightgreen?style=for-the-badge&logo=pytest)
-![Build](https://img.shields.io/badge/Build-Passing-success?style=for-the-badge&logo=github-actions)

pure_python_ds-1.0.0/pure_python_ds.egg-info/PKG-INFO

@@ -1,69 +0,0 @@
-Metadata-Version: 2.4
-Name: pure-python-ds
-Version: 1.0.0
-Summary: A strictly typed, 100% test-covered data structures and algorithms library.
-Author: Parjad Minooei
-Project-URL: Documentation, https://ParjadM.github.io/pure-python-ds/
-Project-URL: Source, https://github.com/ParjadM/pure-python-ds
-Classifier: Programming Language :: Python :: 3.12
-Classifier: License :: OSI Approved :: MIT License
-Classifier: Operating System :: OS Independent
-Classifier: Intended Audience :: Developers
-Classifier: Topic :: Software Development :: Libraries :: Python Modules
-Requires-Python: >=3.12
-Description-Content-Type: text/markdown
-License-File: LICENSE
-Dynamic: license-file
-
-# pure-python-ds 🚀
-
-A high-performance, strictly-typed, and memory-optimized Data Structures and Algorithms library built in Pure Python.
-
-## 🏗️ Architecture Overview
-
-This library was designed with a focus on **Systems Architecture**. By utilizing Python's `__slots__`, every node in this library is memory-optimized to reduce overhead, making it suitable for educational deep-dives and performance-sensitive prototyping.
-
-[Image of a software architecture diagram showing layers of data structures and algorithms]
-
-## 🛠️ Key Features
-
-### 1. Linear Data Structures
-* **Linked Lists:** Singly and Doubly Linked Lists with $O(1)$ head/tail operations.
-* **Stacks & Queues:** Built on top of optimized linked nodes for strict LIFO/FIFO behavior.
-
-### 2. Hierarchical & Network Structures
-* **Binary Search Trees (BST):** Standard ordered trees with recursive and iterative implementations.
-* **AVL Trees:** Self-balancing trees using rotation logic to guarantee $O(\log n)$ performance.
-* **Graphs:** Adjacency-list based implementation supporting both Directed and Undirected networks.
-
-### 3. Advanced Algorithms
-* **Pathfinding:** Dijkstra's Algorithm for finding shortest paths in weighted graphs.
-* **Sorting:** $O(n \log n)$ Merge Sort implementation.
-* **Searching:** $O(\log n)$ Binary Search.
-* **Dynamic Programming:** Memoized Fibonacci and sub-problem optimization.
-
-[Image of a perfectly balanced Binary Search Tree demonstrating O(log n) structure]
-
-## 🚀 Installation
-
-Since the package is in "Editable" mode, you can install it locally to use across your entire system:
-
-```bash
-git clone [https://github.com/ParjadM/pure-python-ds.git](https://github.com/ParjadM/pure-python-ds.git)
-cd pure-python-ds
-pip install -e .
-```
-
-🚀 Technical Milestone: 83% Unit Test Coverage Reached
-Core Engineering Accomplishments:
-
-Robustness Verification: Engineered a comprehensive regression suite achieving 83% total coverage across 15+ complex data structures.
-
-Algorithm Integration: Successfully implemented and verified Kruskal’s MST (using custom DSU), Bellman-Ford, and Dijkstra’s algorithms.
-
-Recursive Tree Logic: Developed and tested memory-safe recursive deletion with rebalancing for AVL and Binary Search Trees.
-
-Performance Optimization: Leveraged __slots__ and Python Generators to ensure O(1) space complexity for tree traversals and minimal memory footprint.
-
-![Coverage](https://img.shields.io/badge/Coverage-83%25-brightgreen?style=for-the-badge&logo=pytest)
-![Build](https://img.shields.io/badge/Build-Passing-success?style=for-the-badge&logo=github-actions)