\hypertarget{struct__Trie}{
\section{\_\-Trie Struct Reference}
\label{struct__Trie}\index{\_\-Trie@{\_\-Trie}}
}


{\ttfamily \#include $<$kdbprivate.h$>$}

\subsection*{Data Fields}
\begin{DoxyCompactItemize}
\item 
struct \hyperlink{struct__Trie}{\_\-Trie} $\ast$ \hyperlink{struct__Trie_ae60b70484c5b75a76a9d936c7e6b9370}{children} \mbox{[}MAX\_\-UCHAR\mbox{]}
\item 
char $\ast$ \hyperlink{struct__Trie_af6bc274ad09ef18de2495bdcdf86d54f}{text} \mbox{[}MAX\_\-UCHAR\mbox{]}
\item 
size\_\-t \hyperlink{struct__Trie_ae1f924ab4e6d8c7eb8064d7eae21bf3f}{textlen} \mbox{[}MAX\_\-UCHAR\mbox{]}
\item 
\hyperlink{struct__Backend}{Backend} $\ast$ \hyperlink{struct__Trie_acc978e56b19aa3c483b4e54755697380}{value} \mbox{[}MAX\_\-UCHAR\mbox{]}
\item 
\hyperlink{struct__Backend}{Backend} $\ast$ \hyperlink{struct__Trie_ac5c6b4bddcccb23eb0bd26ffade7eb43}{empty\_\-value}
\end{DoxyCompactItemize}


\subsection{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 \hyperlink{group__kdb_ga28e385fd9cb7ccfe0b2f1ed2f62453a1}{kdbGet()} and \hyperlink{group__kdb_ga11436b058408f83d303ca5e996832bcf}{kdbSet()} in a hierachy where backends are mounted -\/ you need the backend mounted closest to the parentKey. 

\subsection{Field Documentation}
\hypertarget{struct__Trie_ae60b70484c5b75a76a9d936c7e6b9370}{
\index{\_\-Trie@{\_\-Trie}!children@{children}}
\index{children@{children}!_Trie@{\_\-Trie}}
\subsubsection[{children}]{\setlength{\rightskip}{0pt plus 5cm}struct {\bf \_\-Trie}$\ast$ {\bf \_\-Trie::children}\mbox{[}MAX\_\-UCHAR\mbox{]}}}
\label{struct__Trie_ae60b70484c5b75a76a9d936c7e6b9370}
The children building up the trie recursively \hypertarget{struct__Trie_ac5c6b4bddcccb23eb0bd26ffade7eb43}{
\index{\_\-Trie@{\_\-Trie}!empty\_\-value@{empty\_\-value}}
\index{empty\_\-value@{empty\_\-value}!_Trie@{\_\-Trie}}
\subsubsection[{empty\_\-value}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Backend}$\ast$ {\bf \_\-Trie::empty\_\-value}}}
\label{struct__Trie_ac5c6b4bddcccb23eb0bd26ffade7eb43}
Pointer to a backend for the empty string \char`\"{}\char`\"{} \hypertarget{struct__Trie_af6bc274ad09ef18de2495bdcdf86d54f}{
\index{\_\-Trie@{\_\-Trie}!text@{text}}
\index{text@{text}!_Trie@{\_\-Trie}}
\subsubsection[{text}]{\setlength{\rightskip}{0pt plus 5cm}char$\ast$ {\bf \_\-Trie::text}\mbox{[}MAX\_\-UCHAR\mbox{]}}}
\label{struct__Trie_af6bc274ad09ef18de2495bdcdf86d54f}
Text identifying this node \hypertarget{struct__Trie_ae1f924ab4e6d8c7eb8064d7eae21bf3f}{
\index{\_\-Trie@{\_\-Trie}!textlen@{textlen}}
\index{textlen@{textlen}!_Trie@{\_\-Trie}}
\subsubsection[{textlen}]{\setlength{\rightskip}{0pt plus 5cm}size\_\-t {\bf \_\-Trie::textlen}\mbox{[}MAX\_\-UCHAR\mbox{]}}}
\label{struct__Trie_ae1f924ab4e6d8c7eb8064d7eae21bf3f}
Length of the text \hypertarget{struct__Trie_acc978e56b19aa3c483b4e54755697380}{
\index{\_\-Trie@{\_\-Trie}!value@{value}}
\index{value@{value}!_Trie@{\_\-Trie}}
\subsubsection[{value}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Backend}$\ast$ {\bf \_\-Trie::value}\mbox{[}MAX\_\-UCHAR\mbox{]}}}
\label{struct__Trie_acc978e56b19aa3c483b4e54755697380}
Pointer to a backend 

The documentation for this struct was generated from the following file:\begin{DoxyCompactItemize}
\item 
kdbprivate.h\end{DoxyCompactItemize}
