No project description provided
Project description
JoelData
Simple data types I to use in my projects.
Documentation
Stack
FIFO (like a stack of cups)
from joeldata import Stack
my_stack=Stack()
push(item)
- adds new itempop() -> item
- removes itempeek() -> item
- see top item without removingis_empty() -> bool
Queue
LIFO (like a line at a store)
from joeldata import Queue
my_q=Queue()
enqueue(item)
- add new itemdequeue() -> item
- remove an itempeek() -> item
- see the item that next to be dequeuedis_empty() -> bool
BST (aliased to Binary Search Tree)
Stores a list of numbers in a tree where each node can have up to two chiuldren. The left node is always less than the parent node and the right node is always greater than the parent node.
from joeldata import BST
my_bst=BST()
add(item)
- adds an item to the BSTsearch(value) -> bool
- sees if a value is in the BSTinorder() -> item[]
- returns the items as an array in orderremove(item)
- removes an item from the BST
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
joeldata-1.0.2.tar.gz
(6.7 kB
view hashes)