Classes | |
class | BinarySearchTree |
A binary search tree and an AVL balanced binary search tree. More... | |
class | AVLBalancedBinarySearchTree |
An AVLBalancedBinarySearchTree is a binary tree that is always balanced. More... | |
class | Heap |
class | CircularLinkedList |
(Circular) Linked List ADT (Doubly Linked Pointer to Node Style) - More... | |
class | LinkedList |
class | List |
Array based implementation of a list. More... | |
class | Map |
class | OrderedChannelHeap |
class | OrderedList |
class | Queue |
A queue implemented as an array with a read and write index. More... | |
class | QueueLinkedList |
A queue implemented using a linked list. Rarely used. More... | |
class | WeightedGraph |
class | SingleProducerConsumer |
A single producer consumer implementation without critical sections. More... | |
Functions | |
template<class key_type> | |
int | defaultMapKeyComparison (const key_type &a, const key_type &b) |
template<class key_type, class data_type> | |
int | defaultOrderedListComparison (const key_type &a, const data_type &b) |
Variables | |
RAK_DLL_EXPORT | LinkedList |
|
The default comparison has to be first so it can be called as a default parameter. It then is followed by MapNode, followed by NodeComparisonFunc |