Experimental Code
Code Written To Experiment With Various Techniques And Otherwise Not Very Useful...
|
This file is to be included at the end of Iterator.h. More...
Namespaces | |
DoubleLinkedListImpl | |
Implementation Details of a DoubleLinkedList. | |
Classes | |
class | DoubleLinkedList |
DoubleLinkedList which can be iterated via DoubleLinkedList::iterator. More... | |
class | Iterator |
Iterator class that works genericly on a List containing Node elements with data of type T. More... | |
class | NoSortMetrics |
Do-nothing Metric-collector for major actions done by ListMergeSort. More... | |
class | ListMergeSort |
Merge Sort algorithm using lists to hold the data. More... | |
class | PointerLess |
Comparison of two pointers values using operator<. More... | |
Functions | |
template<class T , class List , class Node > | |
void | swap (Iterator< T, List, Node > &a, Iterator< T, List, Node > &b) |
Swap the values at a and b. More... | |
template<class T , class List , class Node > | |
void | moveBefore (Iterator< T, List, Node > &a, Iterator< T, List, Node > &b) |
Move the value at a before b. More... | |
This file is to be included at the end of Iterator.h.
Namespace of the Experiment Code.
void Experiment::moveBefore | ( | Iterator< T, List, Node > & | a, |
Iterator< T, List, Node > & | b | ||
) |
Move the value at a before b.
T | the type of data held by the Nodes |
List | the type of list this iterates |
Node | the type of Node in the list |
Definition at line 100 of file Iterator.h.
void Experiment::swap | ( | Iterator< T, List, Node > & | a, |
Iterator< T, List, Node > & | b | ||
) |
Swap the values at a and b.
T | the type of data held by the Nodes |
List | the type of list this iterates |
Node | the type of Node in the list |
Definition at line 86 of file Iterator.h.