#include <mootTrieVector.h>
Inheritance diagram for moot::TrieVector< DataT, CharT, UCharT >:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Default constructor |
|
Destructor |
|
Clear |
|
Build transition table from the map of pending keys |
|
Check whether this trie is compiled |
|
Get default data (read-write) |
|
Get default data (read-only) |
|
Ensure that this trie is compiled |
|
Daughter lookup, iterator, read-only |
|
Daughter lookup, iterator, read/write Find the daughter of the node @from on label @lab. On success, returns an iterator pointing to the daughter. Returns end() if no such daughter exists.
|
|
Daughter lookup, NodeId, read-only |
|
Forward lookup, read-only |
|
Forward lookup, read/write Lookup longest match (of up to @trie_maxlen characters) for string @s, reading from left to right. Returns a iterator pointing to the deepest matching node and sets *@matchlen to the number of characters actually matched. Returns end() on failure. |
|
Mother lookup, iterator, read-only |
|
Mother lookup, iterator, read/write Find the mother of the node @to. On success, returns an iterator pointing to the mother. Returns end() if @to is the root node.
|
|
Mother lookup, NodeId, read-only |
|
Daughter lookup, iterator, read-only |
|
Daughter iteration, read/write Find the first daughter of the node @from. On success, returns an iterator pointing to the daughter. Returns end() if no such daughter exists.
|
|
Get maximum length for this trie (read/write) |
|
Get maximum length for this trie (read-only) |
|
Get depth of node with id @nodeid |
|
Get depth of node @node |
|
Get full path to node with id @nodeid as a string |
|
Get full path to node @node as a reverse string |
|
Get full path to node with id @nodeid as a string |
|
Get full path to node @node as a string |
|
Reverse lookup, read-only |
|
Reverse lookup, read/write Like find_longest(), but reads backwards from the end of @s. |
|
Canonicalize case of a string @s |
|
Insert a prefix-key into the pending-queue, using trie-internal maximum length |
|
Insert a prefix-key into the pending-queue, giving maximum length |
|
Create and return a valid prefix-key of up to @trie_maxlen characters from @s |
|
Create and return a valid prefix-key of up to @max_len characters from @s |
|
Assign valid prefix-key of up to @max_len characters from @s to @dst |
|
Insert a suffix-key into the pending-queue, using trie-internal maximum length |
|
Insert a suffix-key into the pending-queue, giving maximum length |
|
Create and return a valid suffix-key of up to @trie_maxlen characters from @s |
|
Create and return a valid suffix-key of up to @max_len characters from @s |
|
Assign valid suffix-key of up to @max_len characters from @s to @dst |
|
|
|
|