Next: , Previous: Cache, Up: Data structures

4.5.4 Linked lists

A very comfortable interface for working with general linked lists is implemented. In every structure you would like to include in a linked list, define a special node attribute. During list operations, the structure is referenced only via this attribute. There are functions for inserting new nodes at various positions, walks through the whole linked list, deletion, etc. See lib/slists.h, lib/clists.h (a circular modification) and lib/cclists.h (a counted circular modification) for details. The usage is similar to the AVL-trees (see AVL-Tree).