pandusha 0.2.0__tar.gz

pandusha-0.2.0/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

pandusha-0.2.0/PKG-INFO

@@ -0,0 +1,107 @@
+Metadata-Version: 2.4
+Name: pandusha
+Version: 0.2.0
+Summary: Pandusha — A clean, modular Python library for fundamental Data Structures & Algorithms. Built incrementally, starting from Linked Lists (SLL & DLL) and expanding towards a complete DSA toolkit.
+Author: Yasemin Serdengeçti, Cem Berk Çakır
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/Agueria/pandusha
+Project-URL: Repository, https://github.com/Agueria/pandusha
+Project-URL: Issues, https://github.com/Agueria/pandusha/issues
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Developers
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.8
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+
+# Pandusha
+
+Pandusha is a small educational Python library for practicing data structures
+and algorithms. Version 0.2 focuses on a stable, test-covered foundation:
+linked lists were cleaned up, Pythonic helpers were added, and the roadmap now
+includes heaps, hash tables, tries, graph algorithms, sorting, searching, and
+dynamic programming examples.
+
+## Current Content
+
+- Linked lists: `LinkedList`, `DoublyLinkedList`
+- Linear structures: `Stack`, `Queue`
+- Trees: `BinarySearchTree`, `AVLTree`
+- Graphs: `Graph` with BFS, DFS, unweighted shortest path, Dijkstra, and topological sort
+- Other structures: `MinHeap`, `MaxHeap`, `PriorityQueue`, `HashTable`, `Trie`, `DisjointSet`
+- Sorting: `bubble_sort`, `selection_sort`, `insertion_sort`, `merge_sort`, `quick_sort`, `heap_sort`
+- Searching: `linear_search`, `binary_search`, `jump_search`
+- Dynamic programming: `fibonacci_memo`, `fibonacci_tabulation`, `climbing_stairs`, `coin_change_min`
+
+## Installation
+
+Pandusha is not published on PyPI yet. Use the source directly:
+
+```bash
+git clone https://github.com/Agueria/pandusha.git
+cd pandusha
+```
+
+For local development:
+
+```bash
+python3 -m pip install -e .
+python3 -m pytest -q
+python3 -m compileall src tests
+```
+
+Without editable install, run examples with `PYTHONPATH=src`.
+
+## Examples
+
+```python
+from pandusha import LinkedList, MinHeap, binary_search, merge_sort
+
+linked = LinkedList(1)
+linked.append(2)
+linked.append(3)
+print(list(linked))  # [1, 2, 3]
+
+heap = MinHeap([5, 1, 3])
+print(heap.remove())  # 1
+
+print(merge_sort([3, 1, 2]))  # [1, 2, 3]
+print(binary_search([1, 2, 3], 2))  # 1
+```
+
+## API Style
+
+Existing educational method names are kept where possible. Pythonic helpers are
+also available on the relevant structures:
+
+- `len(structure)`
+- `list(structure)`
+- `repr(structure)`
+- `is_empty()`
+- `to_list()`
+- `clear()` for linked lists
+
+## License
+
+Pandusha is distributed under the Apache License 2.0. See `LICENSE`.
+
+## Changelog
+
+### 0.2.0
+
+- Fixed linked list and doubly linked list edge cases.
+- Added Pythonic helpers and controlled package exports.
+- Added Heap, HashTable, Trie, DisjointSet, and AVLTree.
+- Added sorting, searching, graph, BST traversal, and DP helpers.
+- Added pytest coverage for public behavior and examples.
+- Updated docs and package metadata.
+
+### 0.1.0
+
+- Added initial LinkedList, DoublyLinkedList, Stack, Queue, BinarySearchTree, and Graph implementations.

pandusha-0.2.0/README.md

@@ -0,0 +1,85 @@
+# Pandusha
+
+Pandusha is a small educational Python library for practicing data structures
+and algorithms. Version 0.2 focuses on a stable, test-covered foundation:
+linked lists were cleaned up, Pythonic helpers were added, and the roadmap now
+includes heaps, hash tables, tries, graph algorithms, sorting, searching, and
+dynamic programming examples.
+
+## Current Content
+
+- Linked lists: `LinkedList`, `DoublyLinkedList`
+- Linear structures: `Stack`, `Queue`
+- Trees: `BinarySearchTree`, `AVLTree`
+- Graphs: `Graph` with BFS, DFS, unweighted shortest path, Dijkstra, and topological sort
+- Other structures: `MinHeap`, `MaxHeap`, `PriorityQueue`, `HashTable`, `Trie`, `DisjointSet`
+- Sorting: `bubble_sort`, `selection_sort`, `insertion_sort`, `merge_sort`, `quick_sort`, `heap_sort`
+- Searching: `linear_search`, `binary_search`, `jump_search`
+- Dynamic programming: `fibonacci_memo`, `fibonacci_tabulation`, `climbing_stairs`, `coin_change_min`
+
+## Installation
+
+Pandusha is not published on PyPI yet. Use the source directly:
+
+```bash
+git clone https://github.com/Agueria/pandusha.git
+cd pandusha
+```
+
+For local development:
+
+```bash
+python3 -m pip install -e .
+python3 -m pytest -q
+python3 -m compileall src tests
+```
+
+Without editable install, run examples with `PYTHONPATH=src`.
+
+## Examples
+
+```python
+from pandusha import LinkedList, MinHeap, binary_search, merge_sort
+
+linked = LinkedList(1)
+linked.append(2)
+linked.append(3)
+print(list(linked))  # [1, 2, 3]
+
+heap = MinHeap([5, 1, 3])
+print(heap.remove())  # 1
+
+print(merge_sort([3, 1, 2]))  # [1, 2, 3]
+print(binary_search([1, 2, 3], 2))  # 1
+```
+
+## API Style
+
+Existing educational method names are kept where possible. Pythonic helpers are
+also available on the relevant structures:
+
+- `len(structure)`
+- `list(structure)`
+- `repr(structure)`
+- `is_empty()`
+- `to_list()`
+- `clear()` for linked lists
+
+## License
+
+Pandusha is distributed under the Apache License 2.0. See `LICENSE`.
+
+## Changelog
+
+### 0.2.0
+
+- Fixed linked list and doubly linked list edge cases.
+- Added Pythonic helpers and controlled package exports.
+- Added Heap, HashTable, Trie, DisjointSet, and AVLTree.
+- Added sorting, searching, graph, BST traversal, and DP helpers.
+- Added pytest coverage for public behavior and examples.
+- Updated docs and package metadata.
+
+### 0.1.0
+
+- Added initial LinkedList, DoublyLinkedList, Stack, Queue, BinarySearchTree, and Graph implementations.

pandusha-0.2.0/pyproject.toml

@@ -0,0 +1,36 @@
+[build-system]
+requires = ["setuptools>=77.0", "wheel"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "pandusha"
+version = "0.2.0"
+description = "Pandusha — A clean, modular Python library for fundamental Data Structures & Algorithms. Built incrementally, starting from Linked Lists (SLL & DLL) and expanding towards a complete DSA toolkit."
+readme = "README.md"
+requires-python = ">=3.8"
+license = "Apache-2.0"
+license-files = ["LICENSE"]
+authors = [
+    {name = "Yasemin Serdengeçti, Cem Berk Çakır"}
+]
+classifiers = [
+    "Development Status :: 3 - Alpha",
+    "Intended Audience :: Developers",
+    "Programming Language :: Python :: 3",
+    "Programming Language :: Python :: 3.8",
+    "Programming Language :: Python :: 3.9",
+    "Programming Language :: Python :: 3.10",
+    "Programming Language :: Python :: 3.11",
+    "Programming Language :: Python :: 3.12",
+]
+
+[project.urls]
+Homepage = "https://github.com/Agueria/pandusha"
+Repository = "https://github.com/Agueria/pandusha"
+Issues = "https://github.com/Agueria/pandusha/issues"
+
+[tool.setuptools.packages.find]
+where = ["src"]
+
+[tool.setuptools.package-dir]
+"" = "src"

pandusha-0.2.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

pandusha-0.2.0/src/pandusha/__init__.py

@@ -0,0 +1,60 @@
+"""Pandusha - educational data structures and algorithms library."""
+
+from .avl_tree import AVLTree
+from .binary_search_tree import BinarySearchTree
+from .disjoint_set import DisjointSet
+from .doubly_linked_list import DoublyLinkedList
+from .dynamic_programming import (
+    climbing_stairs,
+    coin_change_min,
+    fibonacci_memo,
+    fibonacci_tabulation,
+)
+from .graph import Graph
+from .hash_table import HashTable
+from .heap import MaxHeap, MinHeap, PriorityQueue
+from .linked_list import LinkedList
+from .queue import Queue
+from .searching import binary_search, jump_search, linear_search
+from .sorting import (
+    bubble_sort,
+    heap_sort,
+    insertion_sort,
+    merge_sort,
+    quick_sort,
+    selection_sort,
+)
+from .stack import Stack
+from .trie import Trie
+
+__version__ = "0.2.0"
+__author__ = "Cem Berk Çakır, Yasemin Serdengeçti"
+
+__all__ = [
+    "AVLTree",
+    "BinarySearchTree",
+    "DisjointSet",
+    "DoublyLinkedList",
+    "Graph",
+    "HashTable",
+    "LinkedList",
+    "MaxHeap",
+    "MinHeap",
+    "PriorityQueue",
+    "Queue",
+    "Stack",
+    "Trie",
+    "binary_search",
+    "bubble_sort",
+    "climbing_stairs",
+    "coin_change_min",
+    "fibonacci_memo",
+    "fibonacci_tabulation",
+    "heap_sort",
+    "insertion_sort",
+    "jump_search",
+    "linear_search",
+    "merge_sort",
+    "quick_sort",
+    "selection_sort",
+]

pandusha-0.2.0/src/pandusha/avl_tree.py

@@ -0,0 +1,111 @@
+"""AVL tree implementation."""
+
+
+class AVLNode:
+    def __init__(self, value):
+        self.value = value
+        self.left = None
+        self.right = None
+        self.height = 1
+
+
+class AVLTree:
+    def __init__(self):
+        self.root = None
+        self.length = 0
+
+    def __iter__(self):
+        return iter(self.in_order())
+
+    def __len__(self):
+        return self.length
+
+    def __repr__(self):
+        return f"AVLTree({self.in_order()!r})"
+
+    def is_empty(self):
+        return self.root is None
+
+    def insert(self, value):
+        if self.contains(value):
+            return False
+        self.root = self._insert(self.root, value)
+        self.length += 1
+        return True
+
+    def contains(self, value):
+        current = self.root
+        while current is not None:
+            if value == current.value:
+                return True
+            current = current.left if value < current.value else current.right
+        return False
+
+    def in_order(self):
+        values = []
+
+        def walk(node):
+            if node is None:
+                return
+            walk(node.left)
+            values.append(node.value)
+            walk(node.right)
+
+        walk(self.root)
+        return values
+
+    def to_list(self):
+        return self.in_order()
+
+    def height(self):
+        return self._height(self.root)
+
+    def _insert(self, node, value):
+        if node is None:
+            return AVLNode(value)
+        if value < node.value:
+            node.left = self._insert(node.left, value)
+        else:
+            node.right = self._insert(node.right, value)
+        return self._rebalance(node)
+
+    def _height(self, node):
+        return node.height if node is not None else 0
+
+    def _balance(self, node):
+        return self._height(node.left) - self._height(node.right) if node is not None else 0
+
+    def _update_height(self, node):
+        node.height = 1 + max(self._height(node.left), self._height(node.right))
+
+    def _rebalance(self, node):
+        self._update_height(node)
+        balance = self._balance(node)
+
+        if balance > 1:
+            if self._balance(node.left) < 0:
+                node.left = self._rotate_left(node.left)
+            return self._rotate_right(node)
+        if balance < -1:
+            if self._balance(node.right) > 0:
+                node.right = self._rotate_right(node.right)
+            return self._rotate_left(node)
+        return node
+
+    def _rotate_left(self, node):
+        new_root = node.right
+        moved_subtree = new_root.left
+        new_root.left = node
+        node.right = moved_subtree
+        self._update_height(node)
+        self._update_height(new_root)
+        return new_root
+
+    def _rotate_right(self, node):
+        new_root = node.left
+        moved_subtree = new_root.right
+        new_root.right = node
+        node.left = moved_subtree
+        self._update_height(node)
+        self._update_height(new_root)
+        return new_root