DeeTreeIndex

DeeTreeIndex — A DeeTreeIndex backed by a balanced binary tree

Functions

Types and Values

struct DeeTreeIndex

Object Hierarchy

    GObject
    ╰── DeeIndex
        ╰── DeeTreeIndex

Includes

#include <dee.h>

Description

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().

Functions

dee_tree_index_new ()

DeeTreeIndex *
dee_tree_index_new (DeeModel *model,
                    DeeAnalyzer *analyzer,
                    DeeModelReader *reader);

Create a new tree index.

Parameters

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

 

Returns

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

Types and Values

struct DeeTreeIndex

struct DeeTreeIndex;

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