![]() |
![]() |
![]() |
Dee Reference Manual | ![]() |
---|---|---|---|---|
Top | Description | Object Hierarchy |
DeeTreeIndexDeeTreeIndex — A DeeTreeIndex backed by a balanced binary tree |
#include <dee.h> struct DeeTreeIndex; struct DeeTreeIndexClass; DeeTreeIndex * dee_tree_index_new (DeeModel *model
,DeeAnalyzer *analyzer
,DeeModelReader *reader
);
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()
.
struct DeeTreeIndex;
All fields in the DeeTreeIndex structure are private and should never be accessed directly
DeeTreeIndex * dee_tree_index_new (DeeModel *model
,DeeAnalyzer *analyzer
,DeeModelReader *reader
);
Create a new tree index.
|
The model to index |
|
The DeeAnalyzer used to tokenize and filter the terms extracted
by reader
|
|
The DeeModelReader used to extract terms from the model |
Returns : |
A newly allocated tree index. Free with g_object_unref() . |