Data Structures packages with pure python
Project description
Pure Data Structures
Data structures package for python, written in pure python code, not dependent on any other libraries or built-in function. Any performance is not measured enough (or you can benchmark yourself using cProfile
). Even though, i'm pretty confident this scenarios are using Big-O-Notation references (average - worst scenario for time complexity).
List of Data Structures
- Stack
- Stack + Linked List
- Queue
- List
- List + Ordered List
Installation
For python 2.7 :
pip install pure-datastructures
For python 3.6 or higher :
pip3 install pure-datastructures
If you facing a trouble while perform installation, make sure :
- You already activated virtual environment (Recommended)
- Using root access (Not Recommended)
- Or, using verbosity flag
--user
Usage
Quick example using Ordered List :
import ds
scenario = ds.OrderedList()
# basic insertion
scenario.add(70)
scenario.add(13)
scenario.add(-3)
# calculate size of array with `size()`
print(scenario.size())
# searching value through array with `search_obj()`
print(scenario.search_obj(5))
Full pledged documentation will be coming out very soon.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Hashes for pure-datastructures-0.0.9.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | 94a30bfef817028f4efbf3a77f912304061bab9a7a9299115d25e5ffb5b80c17 |
|
MD5 | 2f38b97b4bc22839b4f3f6ddbf5409e1 |
|
BLAKE2b-256 | 3b74849a422583bebf4c1cea357c66ccb85381978c1171004ddbf90bee6d43b4 |