Comprehensive package of Python-native datastructures.
Project description
ech-datastructures
Comprehensive package of Python-native datastructures.
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
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
ech-datastructures-0.1.2.tar.gz
(16.0 kB
view hashes)
Built Distribution
Close
Hashes for ech_datastructures-0.1.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 20f3607b4e4575438a5352241eeebadcde332c9f630a97895baf214b6c8f605a |
|
MD5 | 654197c513be35affc73e083f28d626a |
|
BLAKE2b-256 | 5df1ca5e7a246755cd4b9246f491f13a97c8bd64e83ec6f2c1a09e5e04258a14 |