Intrusive Containers
Classes

Intrusive Singly Linked List. More...

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

class  ListInRoot< R, N, n >
 
class  ListInNode< R, N, n >
 
class  ListInRoot< R, N, n >
 
class  ListInNode< R, N, n >
 

Detailed Description

Intrusive Singly Linked List.

This file defines a pair of templates (ListInRoot and ListInNode) that implement an intrusive singly linked list.

Overview

ListInRoot and ListInNode provide a simple API to allow classes to provide a basic List <-> Node relationship (1 List holding many Nodes), with a singly linked list. (c.f. DListin.h, DListInRoot, and DListInNode for doubly linked list)

To create this relationship, the class to act as the list derives from the template ListInRoot, and the class to act as the Node from ListInNode, both with a first parameter of the class name of the List clase, and a second parameter of the Node clasee. There is an optional integral 3rd parameter to allow the classes to inherent from these multiple times if you need to represent multiple simultaneous relationships. This inheretance should be public, or you need to add the ListInRoot and ListInNode templates as friends.

At the point of decleration, both classes need to be declared, so you will typically have a forward of the other class before the definition of the class. At the point of usage of members, generally the full definition of both classes is needed to instance the code for the template.

Inside this file, the following types have the following meanings:

R: The "user" type that will be derived from ListInRoot

N: The "user" type that will be derived from ListInNode

n: The integer parameter for the template to allow multiple useage

Root: The particular instance of ListInRoot<R, N, n> being used

Node: The particular instance of ListInNode<R, N, n> being used

node: will have type N*, to be used when walking the list.

Invarients
  • if root->first_ != NULL:
    • root->first_->root_ == root
  • if node->root_ == NULL:
    • node->next_ == NULL
  • if node->next_ != NULL:
    • node->next_->root_ == node->root_
See also
DListIn.h