template<class T>
class CMDRSCHAINEDLIST< T >
This class describes a chained list of items (https://en.wikipedia.org/wiki/Linked_list). It can be called also a linked list. This is an elegant way to build a list without any big allocation, bypassing the needs to estimate a minimum size and to increase or decrease this size during execution. The disadvantage is a slower and more complex way to access to an item on the list, and a more complex way to add a new item.
To start, a chained list needs a starting pointer referencing the first item of the list. After that, each item have a pointer to the next item. If this pointer is NULL, this is the end of the list !
The 'T' type can be of any type, including base types like int or char. But keep in mind that each item must save a pointer to the next item. If the size of the pointer is greater than the size of the item itself, consider using a true array...
A notion of 'current item' is used, to let the user of the list to move through the list without doing a loop itself...
Definition at line 33 of file Chain.hpp.