Module data_structure

Encompasses some basic structures

Structs

BSearchTree

Implementation of a binary search tree

BTreeTable

Implementation a tree map with the standard library

BinaryHeapQueue

Implementation of priority queues with the standard library

Deque

Implementation of deques with the standard library

ListStack

Implementation of stacks using the standard library

OrdVecTable

Implementation of a tree map based on an ordered Vec.

PriorityQueue

Implementation of priority queues using a Vec structure

Queue

Implementation of the First In First Out concept (namely a queue), with the standard library

SepChainTable

Implementation of a separate chaining based symbol table

Stack

Implementation of the First In Last Out concept, relatively from scratch

UnordVecTable

Implementation of a tree map based on an unordered Vec.

VecStack

Implementation of stacks using a fixed size Vec with capacity doubling when full and size halving when 25% full

Enums

Orientation

Defines the orientation of a priority queue (min oriented or max oriented)