Classes | |
| class | catalogable |
| A base class for objects that can be stored in the object_catalog. More... | |
| class | list |
| Implements a guarded, doubly linked list structure. More... | |
| class | node |
| An object representing the interstitial cell in most linked data structures. More... | |
| class | basket |
| the basket class holds an object and supports connecting them as nodes. More... | |
| class | object_catalog |
| Provides a generalized listing service for catalogable objects. More... | |
| class | objcat_iterator |
| this structure is used to make the find operation thread safe. More... | |
| class | objcat_locket |
| provides write access to the item pointed to by the objcat_iterator. More... | |
| class | objcat_isolater |
| allows a catalogable to be manipulated without locking the entire list. More... | |
| class | ordered_list |
| Adds an ordering, insertion sort, and find function to the list class. More... | |
| class | ordered_node |
| Adds an ordering function for comparison, with exact and inexact matching. More... | |
| class | packable_tree |
| A tree object that can be packed into an array of bytes and unpacked again. More... | |
| class | packable_tree_factory |
| class | path |
| A method for tracing a route from a tree's root to a particular node. More... | |
| class | safe_list |
| Implements a thread safe list. More... | |
| class | safe_list_read_iterator |
| the iterator used for reading the list. More... | |
| class | safe_list_write_iterator |
| the iterator used for writing the list. More... | |
| class | safe_node |
| A simple virtual base class for objects that can be in a safe_list. More... | |
| class | symbol_tree |
| A symbol table that supports scope nesting and/or trees of symbol tables. More... | |
| class | tree |
| A dynamically linked tree with an arbitrary number of branches. More... | |
Enumerations | |
| enum | tree_commands { BRANCHES_FOLLOW, ATTACH_BRANCHES, FINISH } |
Functions | |
| istring | hier_prefix (int depth, int kids) |
Variables | |
| const int | PREVIOUS = 0 |
| const int | NEXT = 1 |
| const int | BACKWARDS_BRANCH = 0 |
| enum nodes::tree_commands |
| istring nodes::hier_prefix | ( | int | depth, | |
| int | kids | |||
| ) |
Definition at line 175 of file symbol_tree.cpp.
References string_manipulation::indentation().
Referenced by nodes::symbol_tree::text_form().
| const int nodes::BACKWARDS_BRANCH = 0 |
Definition at line 32 of file tree.cpp.
Referenced by nodes::tree::attach(), nodes::tree::insert(), nodes::tree::parent(), nodes::tree::prune_index(), nodes::tree::root(), and nodes::tree::tree().
| const int nodes::NEXT = 1 |
Definition at line 37 of file list.cpp.
Referenced by nodes::list::append(), nodes::list::elements(), nodes::list::empty(), nodes::list::insert(), nodes::list::items_from_head(), nodes::list::list(), nodes::list::iterator::operator++(), nodes::list::remove(), and nodes::list::set_index().
| const int nodes::PREVIOUS = 0 |
Definition at line 36 of file list.cpp.
Referenced by nodes::list::append(), nodes::list::insert(), nodes::list::items_from_tail(), nodes::list::list(), nodes::list::iterator::operator--(), and nodes::list::remove().
1.5.1