Overview Usage Performance Notes Links | tst 0.68 - 23 Jan 2009 |
See http://www.cs.princeton.edu/~rs/strings/
rasmus ekman 2005 -- rasmus.ekman@abc.se
version 0.67 (March 10, 2006) (pre-beta: still some interface issues)
Version history: 0.68: refurbish node type, look for '///#' to see changes 0.67: added levenshtein search. 0.66: added combinatorial ("scrabble") search. Fixed map/set iterators. 0.65: first public relase.
Available from http://abc.se/~re/code/tst/
Download: http://abc.se/~re/code/tst/ternary_tree.zip
Namespaces | |
namespace | containers |
namespace | containers::tst_detail |
Classes | |
class | ternary_tree |
Ternary search tree (trie) is a sorted container for strings, with advanced search possibilities (wildcard and near-match searches), and fast lookup (similar to hash_map, 3-6 times faster than map) - It is typically used for dictionaries. More... | |
class | ternary_tree::key_compare |
Key comparator, defined in terms of a lexicographical_compare using the char_compare object. More... | |
struct | ternary_tree::find_result |
Defines | |
#define | TERNARY_TREE_INCLUDE_GUARD |
#define | TST_NODE_COUNT_TYPE size_type |
#define | TST_INIT_FASTMAP |
#define TERNARY_TREE_INCLUDE_GUARD |
#define TST_NODE_COUNT_TYPE size_type |
#define TST_INIT_FASTMAP |
ternary_tree 0.68 -- by rasmus ekman -- Page generated with Doxygen 1.5.6 on 23 Jan 2009 |