inner_mark_tree Class Reference
#include <bookmark_tree.h>
Inheritance diagram for inner_mark_tree:
Collaboration diagram for inner_mark_tree:
Public Member Functions | |
| inner_mark_tree (const basis::astring &node_name, int uid, int max_bits=2) | |
 Public Member Functions inherited from nodes::symbol_tree | |
| symbol_tree (const basis::astring &node_name, int estimated_elements=100) | |
| creates a symbol_tree node with the "node_name". More... | |
| virtual | ~symbol_tree () |
| all child nodes will be deleted too. More... | |
| DEFINE_CLASS_NAME ("symbol_tree") | |
| int | children () const |
| returns the number of children of this node. More... | |
| const basis::astring & | name () const |
| returns the name of this node. More... | |
| int | estimated_elements () const |
| returns the number of bits in this node's table. More... | |
| symbol_tree * | branch (int index) const |
| returns the "index"th branch. More... | |
| void | rehash (int estimated_elements) |
| resizes the underlying symbol_table for this node. More... | |
| void | hash_appropriately (int estimated_elements) |
| resizes the hashing parameter to limit bucket sizes. More... | |
| bool | add (symbol_tree *to_add) |
| adds a child to this symbol_tree. More... | |
| virtual basis::outcome | prune (tree *to_zap) |
| removes a sub-tree "to_zap". More... | |
| symbol_tree * | find (const basis::astring &to_find, find_methods how, basis::string_comparator_function *comp=NULL_POINTER) |
| returns the node specified by "to_find" or NULL_POINTER. More... | |
| void | sort () |
| sorts the sub-nodes of this symbol_tree. More... | |
| basis::astring | text_form () const |
| traverses the tree to build a textual list of the nodes. More... | |
| Public Member Functions inherited from nodes::tree | |
| tree () | |
| constructs a new tree with a root and zero branches. More... | |
| virtual | ~tree () |
| destroys the tree by recursively destroying all child tree nodes. More... | |
| DEFINE_CLASS_NAME ("tree") | |
| virtual int | which (tree *branch_to_find) const |
| Returns the branch number for a particular branch in this tree. More... | |
| virtual int | branches () const |
| Returns the number of branches currently connected to this tree. More... | |
| virtual tree * | parent () const |
| Returns the tree node that is the immediate ancestor of this one. More... | |
| virtual tree * | root () const |
| Locates and returns the absolute root of the tree containing this tree. More... | |
| virtual int | depth () const |
| Returns the distance of "this" from the root. The root's depth is 0. More... | |
| virtual void | attach (tree *new_branch) |
| Attaches the specified branch to the current tree. More... | |
| virtual void | insert (int branch_place, tree *new_branch) |
| inserts "new_branch" before the branches starting at "branch_place". More... | |
| virtual basis::outcome | prune_index (int branch_to_cut) |
| Removes the branch at the specified index from this tree. More... | |
| iterator | start (traversal_directions direction) const |
| Returns a fresh iterator positioned at this tree node. More... | |
| virtual bool | generate_path (path &to_follow) const |
| Returns the path to "this" path_tree from its root. More... | |
| Public Member Functions inherited from nodes::node | |
| node (int number_of_links=0) | |
| the constructor provides for "number_of_links" links initially. More... | |
| virtual | ~node () |
| the destructor simply invalidates the node. More... | |
| int | links () const |
| Returns the number of links the node currently holds. More... | |
| void | set_link (int link_number, node *new_link) |
| Connects the node "new_link" to this node. More... | |
| node * | get_link (int link_number) const |
| Returns the node that is connected to the specified "link_number". More... | |
| void | zap_link (int link_number) |
| the specified link is removed from the node. More... | |
| void | insert_link (int where, node *to_add=NULL_POINTER) |
| adds a new link prior to the position specified in "where". More... | |
| int | which (node *to_find) const |
| locates the index where "to_find" lives in our list of links. More... | |
Public Attributes | |
| listo_links | _links |
| int | _uid |
Additional Inherited Members | |
| Public Types inherited from nodes::symbol_tree | |
| enum | find_methods { just_branches , recurse_downward , recurse_upward } |
| Public Types inherited from nodes::tree | |
| enum | traversal_directions { prefix , infix , postfix , to_branches , reverse_branches } |
| enum | elevator_directions { TOWARD_ROOT , AWAY_FROM_ROOT } |
Detailed Description
Definition at line 130 of file bookmark_tree.h.
Constructor & Destructor Documentation
◆ inner_mark_tree()
|
inline |
Definition at line 136 of file bookmark_tree.h.
Member Data Documentation
◆ _links
| listo_links inner_mark_tree::_links |
Definition at line 133 of file bookmark_tree.h.
Referenced by bookmark_tree::process_comment(), and bookmark_tree::process_link().
◆ _uid
| int inner_mark_tree::_uid |
Definition at line 134 of file bookmark_tree.h.
The documentation for this class was generated from the following file:
- /opt/feistymeow.org/feisty_meow/nucleus/applications/bookmark_tools/bookmark_tree.h
