Metadata-Version: 2.1
Name: ech-datastructures
Version: 0.1.3
Summary: Comprehensive package of Python-native datastructures.
Home-page: https://github.com/rkechols/ech-datastructures
Author: Ryan Echols
Author-email: ryan@shadylakemedia.com
License: GNU GPL v3.0
Keywords: data structure structures datastructure datastructures tool tools util utils utility utilities
Platform: UNKNOWN
Classifier: Development Status :: 3 - Alpha
Classifier: Intended Audience :: Developers
Classifier: License :: OSI Approved :: GNU General Public License v3 (GPLv3)
Classifier: Programming Language :: Python :: 3.8
Classifier: Programming Language :: Python :: 3.9
Classifier: Programming Language :: Python :: 3.10
Classifier: Topic :: Software Development :: Libraries :: Python Modules
Classifier: Topic :: Utilities
Requires-Python: >=3.8
Description-Content-Type: text/markdown
License-File: LICENSE.txt

# ech-datastructures
Comprehensive package of Python-native datastructures.


![example workflow](https://github.com/rkechols/ech-datastructures/actions/workflows/pylint.yml/badge.svg)
![example workflow](https://github.com/rkechols/ech-datastructures/actions/workflows/pytest.yml/badge.svg)


### Planned Datastructures:
  - tree set (AVL)
  - tree map (AVL)
  - ordered list (?) = binary tree (AVL) with duplicates (counts)
  - trie
  - disjoint set (forest)
  - graph (weighted or not, directed or not, sparse or not)


### Implemented Datastructures:
  - Heap (AKA priority queue)


### Will Not Implement:
  - fixed-size array
  - dynamic array (use `list`)
  - linked list (use `collections.deque`)
  - stack (use `collections.deque`)
  - queue (use `collections.deque`)
  - deque (use `collections.deque`)
  - hash set (use `set`)
  - hash map (use `dict`)


## See Also
  - [Standard Library Time Complexities](https://wiki.python.org/moin/TimeComplexity)
  - [Standard Library `collections`](https://docs.python.org/3/library/collections.html)


