#include <sent/stddefs.h>
#include <sent/ptree.h>
ptree.cのインクルード依存関係図
関数 | |
int | testbit (char *str, int bitplace) |
int | where_the_bit_differ (char *str1, char *str2) |
static PATNODE * | new_node () |
PATNODE * | make_ptree (char **words, int *data, int wordsnum, int bitplace) |
void | disp_ptree (PATNODE *node, int level) |
static int | testbit_local (int bitplace) |
static int | ptree_search_data_r (PATNODE *node) |
int | ptree_search_data (char *str, PATNODE *node) |
PATNODE * | ptree_make_root_node (int data) |
static void | ptree_add_entry_at (char *str, int bitloc, int data, PATNODE **parentlink) |
void | ptree_add_entry (char *str, int data, char *matchstr, PATNODE **rootnode) |
void | free_ptree (PATNODE *node) |
変数 | |
static char * | tmp_str |
Local work area: current string we are searching for. | |
static int | maxbitplace |
Local work area: Maximum bit length of tmp_str. |
ptree.c で定義されています。
|
String bit test function.
参照元 aptree_add_entry_at(), make_ptree(), ptree_add_entry_at(), と where_the_bit_differ(). |
|
Find in which bit the two strings differ, starting from the head.
参照元 aptree_add_entry(), と ptree_add_entry(). |
|
Allocate a new node.
|
|
Make a patricia tree for given string arrays. Recursively called by descending the scan bit.
参照元 make_ptree(), と ngram_make_lookup_tree(). |
|
Output a tree structure in text for debug, traversing pre-order
参照元 disp_ptree(). |
|
Local bit test function for search.
|
|
Recursive function to search the data in the tree
参照元 ptree_search_data(). |
|
Search for the data whose key string matches the given string.
参照元 ngram_lookup_word(), と set_unigram(). |
|
Make a root node of a index tree.
参照元 ptree_add_entry(), と set_unigram(). |
|
Insert a new node to the existing index tree.
参照元 ptree_add_entry(). |
|
Insert a new node to the index tree.
参照元 set_unigram(). |
|
Free all the sub nodes from specified node.
参照元 free_ptree(), と ngram_info_free(). |