DeeTreeIndex: Dee Reference Manual

DeeTreeIndex

DeeTreeIndex — A DeeTreeIndex backed by a balanced binary tree

struct

    GObject
    ╰── DeeIndex
        ╰── DeeTreeIndex

#include <dee.h>

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`
reader	The DeeModelReader used to extract terms from the model

A newly allocated tree index. Free with g_object_unref().

struct DeeTreeIndex;

All fields in the DeeTreeIndex structure are private and should never be accessed directly