#include "EST_Item.h"

Go to the source code of this file.
Functions | |
| int | in_list (const EST_Item *c, const EST_Item *l) |
| EST_Item * | add_after (const EST_Item *n, EST_Item *p=0) |
| EST_Item * | add_before (const EST_Item *n, EST_Item *p=0) |
| void | remove_item_list (EST_Relation *rel, EST_Item *n) |
Given a node l, return true if c after it in a list relation.
Definition at line 47 of file item_aux.cc.
Add a item after node n, and return the new item. If n is the first item in the list, the new item becomes the head of the list, otherwise it is inserted between n and it's previous current item. If p is 0, make a new node for the new item, otherwise add p to this relation as the next item in n's relation.
Add a item before node n, and return the new item. If n is the first item in the list, the new item becomes the head of the list, otherwise it is inserted between n and it's previous current item. If p is 0, make a new node for the new item, otherwise add p to this relation as the previous item in n's relation.
| void remove_item_list | ( | EST_Relation * | rel, |
| EST_Item * | n | ||
| ) |
Remove the given item.
Definition at line 72 of file item_aux.cc.