pkstruct 0.1.1__tar.gz → 0.1.3__tar.gz

{pkstruct-0.1.1 → pkstruct-0.1.3}/.gitignore

@@ -212,6 +212,7 @@ PKSTRUCT-INFO
 # Development artifacts
 # ==========================================
 *.history
+AGENTS.md
+requirements-dev.txt
 
-.github/
 .gitlab-ci.yml

{pkstruct-0.1.1 → pkstruct-0.1.3}/CHANGELOG.md

@@ -5,6 +5,29 @@ All notable changes to pkstruct will be documented in this file.
 The format follows [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
 and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
 
+## [0.1.3] - 2026-06-16
+
+### Fixed
+- README PriorityQueue examples corrected: `push()`/`pop()` → `enqueue()`/`dequeue()`
+- README BST traversal examples corrected: use `pkstruct.trees.traversal` module, `zigzag` → `zigzag_order`
+- `__version__` bumped to 0.1.3
+
+## [0.1.2] - 2026-06-16
+
+### Added
+- CONTRIBUTING.md, CODE_OF_CONDUCT.md, MAINTAINERS.md with project governance
+- Issue templates (bug report, feature request) and PR template
+- `py.typed` marker already present for PEP 561 compliance
+
+### Changed
+- README restructured: added "Why pkstruct?" section, removed maintainer-only publishing docs
+- pyproject.toml: updated author list with founders, expanded keywords, added classifiers
+- Badge URLs fixed to match `prnvvv/pkstruct` repository
+
+### Removed
+- AGENTS.md and requirements-dev.txt removed from repository (gitignored)
+- .github/ removed from .gitignore so templates are tracked
+
 ## [0.1.1] - 2026-06-02
 
 ### Added

{pkstruct-0.1.1 → pkstruct-0.1.3}/MANIFEST.in

@@ -1,7 +1,6 @@
 include README.md
 include LICENSE
 include CHANGELOG.md
-include SECURITY.md
 recursive-include src/pkstruct *.py *.pyi
 global-exclude __pycache__
 global-exclude *.py[co]

{pkstruct-0.1.1 → pkstruct-0.1.3}/PKG-INFO

@@ -1,12 +1,11 @@
 Metadata-Version: 2.4
 Name: pkstruct
-Version: 0.1.1
-Summary: Industrial-grade data structures and algorithms toolkit for Python
-Project-URL: Homepage, https://github.com/pkstruct/pkstruct
-Project-URL: Repository, https://github.com/pkstruct/pkstruct
-Project-URL: Documentation, https://pkstruct.readthedocs.io
-Project-URL: Bug Tracker, https://github.com/pkstruct/pkstruct/issues
-Author: pkstruct Contributors
+Version: 0.1.3
+Summary: A production-grade Python library providing comprehensive data structures and algorithms with type hints, thread safety, and extensive testing
+Project-URL: Homepage, https://github.com/prnvvv/pkstruct
+Project-URL: Repository, https://github.com/prnvvv/pkstruct
+Project-URL: Documentation, https://github.com/prnvvv/pkstruct#readme
+Author-email: Prannavakhanth <prannavakhanth12@gmail.com>, Priyanka Kaliraj <pri2303k@gmail.com>
 License: MIT License
         
         Copyright (c) 2026 Prannavakhanth
@@ -29,11 +28,13 @@ License: MIT License
         OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
         SOFTWARE.
 License-File: LICENSE
-Keywords: algorithms,collections,data-structures,dsa,linked-list
+Keywords: algorithms,avl-tree,b-tree,binary-search-tree,bplus-tree,collections,competitive-programming,data-structures,deque,dsa,fenwick-tree,graph,graph-algorithms,interval-tree,interview,linked-list,queue,red-black-tree,segment-tree,stack,tree
 Classifier: Development Status :: 5 - Production/Stable
 Classifier: Intended Audience :: Developers
 Classifier: Intended Audience :: Education
 Classifier: License :: OSI Approved :: MIT License
+Classifier: Natural Language :: English
+Classifier: Operating System :: OS Independent
 Classifier: Programming Language :: Python :: 3
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
@@ -60,12 +61,12 @@ Description-Content-Type: text/markdown
 
 # pkstruct
 
-**Industrial-grade data structures and algorithms for Python ≥ 3.10**
+**A production-grade Python library providing comprehensive data structures and algorithms with type hints, thread safety, and extensive testing.**
 
 [![PyPI](https://img.shields.io/pypi/v/pkstruct)](https://pypi.org/project/pkstruct/)
 [![Python](https://img.shields.io/pypi/pyversions/pkstruct)](https://pypi.org/project/pkstruct/)
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](LICENSE)
-[![Tests](https://img.shields.io/badge/tests-898_✔️-success)](https://github.com/anomalyco/pkstruct)
+[![Tests](https://img.shields.io/badge/tests-899_✔️-success)](https://github.com/prnvvv/pkstruct)
 [![Type Checked](https://img.shields.io/badge/mypy-strict-blue)](https://github.com/python/mypy)
 [![Code Style](https://img.shields.io/badge/code%20style-ruff-000000)](https://github.com/astral-sh/ruff)
 
@@ -73,6 +74,15 @@ Description-Content-Type: text/markdown
 
 ---
 
+## Why pkstruct?
+
+| Need | pkstruct gives you |
+|------|-------------------|
+| **Interview prep** | Linked lists, trees, graphs with LeetCode-style helpers (palindrome, cycle detection, LCA, topological sort, etc.) |
+| **Production code** | Thread-safe structures (`threading.RLock`), strict type hints, 899+ tests |
+| **Learning DSA** | Consistent API across all structures, built-in ASCII visualization, runtime help system |
+| **Competitive programming** | Drop-in collection of trees (BST, AVL, Red-Black, Fenwick, Segment, Interval) and graph algorithms (Dijkstra, Kruskal, Tarjan, etc.) |
+
 ## 📦 Installation
 
 ```bash
@@ -289,7 +299,7 @@ ArrayStack().daily_temperatures([73, 74, 75]) # [1, 1, 0]
 q = LinkedQueue([1, 2, 3])
 q.enqueue(4)
 q.dequeue()      # 1
-q.peek()         # 2
+q.front()        # 2
 
 # LeetCode extras
 LinkedQueue().sliding_window_maximum([1,3,-1,-3,5,3,6,7], 3)  # [3,3,5,5,6,7]
@@ -302,9 +312,9 @@ cq.dequeue()     # 1
 
 # ── Priority Queue (min-heap) ──
 pq = PriorityQueue()
-pq.push("task1", priority=3)
-pq.push("task2", priority=1)
-pq.pop()         # "task2"
+pq.enqueue("task1", priority=3)
+pq.enqueue("task2", priority=1)
+pq.dequeue()     # "task2"
 
 # LeetCode extras
 PriorityQueue().kth_largest([3,2,1,5,6,4], 2)  # 5
@@ -313,10 +323,10 @@ PriorityQueue().top_k_frequent([1,1,1,2,2,3], 2)  # [1, 2]
 # ── Deque ──
 d = LinkedDeque([1, 2, 3])
 d.append(4)
-d.appendleft(0)
-d.pop()          # 4
-d.popleft()      # 0
-d.rotate(2)      # rotate right by 2
+d.append(0, side="left")   # append to left side
+d.pop()                    # 4 (from right)
+d.pop(side="left")         # 0 (from left)
+d.rotate(2)                # rotate right by 2
 ```
 
 ### Linear — Utilities
@@ -363,17 +373,17 @@ run_full_benchmark()                            # full suite
 bst = BinarySearchTree()
 bst.insert(10, value="ten")
 bst.insert(5, value="five")
-bst[5]                       # "five"  (via __getitem__)
 bst.search(10)               # ("ten", Node)
 bst.delete(5)
 len(bst)                     # 1
 
-# Traversals
-list(bst.inorder())          # [5, 10, 15]
-list(bst.preorder())         # [10, 5, 15]
-list(bst.postorder())        # [5, 15, 10]
-list(bst.level_order())      # [10, 5, 15]
-list(bst.zigzag())           # [10, 15, 5]
+# Traversals (via standalone functions)
+from pkstruct.trees.traversal import inorder, preorder, postorder, levelorder
+list(inorder(bst.root))          # [5, 10, 15]
+list(preorder(bst.root))         # [10, 5, 15]
+list(postorder(bst.root))        # [5, 15, 10]
+list(levelorder(bst.root))       # [10, 5, 15]
+list(bst.zigzag_order())          # [10, 15, 5]
 
 # Navigation Shortcuts
 bst.root                     # root node
@@ -484,6 +494,7 @@ from pkstruct.trees.tree_helpers import (
     validate_bst_order, path_to_node,
     level_of_node, max_width,
 )
+from pkstruct.trees.node import TreeNode
 
 # Traversal functions (work on any binary tree root)
 bst = BinarySearchTree()
@@ -738,11 +749,11 @@ run_full_benchmark()
 
 ```bash
 # Clone and install
-git clone https://github.com/anomalyco/pkstruct.git
+git clone https://github.com/prnvvv/pkstruct.git
 cd pkstruct
 pip install -e ".[dev]"
 
-# Run tests (898 tests)
+# Run tests (899 tests)
 pytest -v
 
 # Type check
@@ -752,14 +763,15 @@ mypy src/pkstruct
 ruff check src/pkstruct
 ```
 
-## 📦 Publishing
-
-```bash
-python -m build
-twine check dist/*
-twine upload dist/*
-```
+---
 
 ## 📄 License
 
-MIT © pkstruct Contributors
+MIT © Prannavakhanth & Priyanka Kaliraj
+
+## 🙌 Credits
+
+pkstruct is created and maintained by:
+
+- **Prannavakhanth** ([@prnvvv](https://github.com/prnvvv)) — Founder & Lead Maintainer
+- **Priyanka Kaliraj** ([@pri-23-k](https://github.com/pri-23-k)) — Co-Founder & Maintainer