DataStructures Namespace Reference


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


Detailed Description

The namespace DataStructures was only added to avoid compiler errors for commonly named data structures As these data structures are stand-alone, you can use them outside of RakNet for your own projects if you wish.


Function Documentation

template<class key_type>
int DataStructures::defaultMapKeyComparison const key_type &  a,
const key_type &  b
 

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


Generated on Wed May 3 09:11:56 2006 for RakNet by  doxygen 1.4.6-NO