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.8.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | 17cad0be676e36b4b38ebb1d310cf44326220bdc93ed250848a59fc17f6b641b |
|
MD5 | 5b96997491401ce5402e8ad00ee1025b |
|
BLAKE2b-256 | a3b4ff2fcba4a42d8c10ed1564cb3e6ea116a1ca79272747f89d2e75d80cc175 |