Top | ![]() |
![]() |
![]() |
![]() |
DeeTreeIndexDeeTreeIndex — A DeeTreeIndex backed by a balanced binary tree |
DeeTreeIndex is an implementation of DeeIndex which is backed
by a balanced binary tree. This means that it in addition to
DEE_TERM_MATCH_EXACT also supports DEE_TERM_MATCH_PREFIX as a flag in
dee_index_lookup()
.
DeeTreeIndex * dee_tree_index_new (DeeModel *model
,DeeAnalyzer *analyzer
,DeeModelReader *reader
);
Create a new tree index.
model |
The model to index |
|
analyzer |
The DeeAnalyzer used to tokenize and filter the terms extracted
by |
|
reader |
The DeeModelReader used to extract terms from the model |