_Trie Struct Reference

#include <kdbprivate.h>

Data Fields
struct _Trie *	children [MAX_UCHAR]
char *	text [MAX_UCHAR]
size_t	textlen [MAX_UCHAR]
Backend *	value [MAX_UCHAR]
Backend *	empty_value

---

Detailed Description

The private trie structure.

A trie is a data structure which can handle the longest prefix matching very fast. This is exactly what needs to be done when using kdbGet() and kdbSet() in a hierachy where backends are mounted - you need the backend mounted closest to the parentKey.

---

Field Documentation

struct _Trie* _Trie::children[MAX_UCHAR]

The children building up the trie recursively

Backend* _Trie::empty_value

Pointer to a backend for the empty string ""

char* _Trie::text[MAX_UCHAR]

Text identifying this node

size_t _Trie::textlen[MAX_UCHAR]

Length of the text

Backend* _Trie::value[MAX_UCHAR]

Pointer to a backend

---

The documentation for this struct was generated from the following file:

• kdbprivate.h