## DeeTreeIndex DeeTreeIndex — A DeeTreeIndex backed by a balanced binary tree |

## Synopsis

    #include <dee.h>

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

## Object Hierarchy

      GObject
       +----DeeIndex
             +----DeeTreeIndex

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

## Details

### struct DeeTreeIndex

    struct DeeTreeIndex;

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

### struct DeeTreeIndexClass

    struct DeeTreeIndexClass {
      DeeIndexClass     parent_class;
    };

### dee_tree_index_new ()

    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
Returns : | A newly allocated tree index. Free with `g_object_unref()`.