Data Fields
tommy_trie_inplace_node_struct Struct Reference

Trie node. More...

#include <tommytrieinp.h>

Data Fields

struct tommy_trie_inplace_node_structnext
 Next element. More...
 
struct tommy_trie_inplace_node_structprev
 Circular previous element. More...
 
void * data
 Pointer to the data. More...
 
struct tommy_trie_inplace_node_structmap [TOMMY_TRIE_INPLACE_TREE_MAX]
 Branches of the node. More...
 
tommy_key_t key
 Used to store the key or the hash. More...
 

Detailed Description

Trie node.

This is the node that you have to include inside your objects.

Field Documentation

◆ next

struct tommy_trie_inplace_node_struct* tommy_trie_inplace_node_struct::next

Next element.

0 if it's the last.

◆ prev

struct tommy_trie_inplace_node_struct* tommy_trie_inplace_node_struct::prev

Circular previous element.

◆ data

void* tommy_trie_inplace_node_struct::data

Pointer to the data.

◆ map

struct tommy_trie_inplace_node_struct* tommy_trie_inplace_node_struct::map[TOMMY_TRIE_INPLACE_TREE_MAX]

Branches of the node.

◆ key

tommy_key_t tommy_trie_inplace_node_struct::key

Used to store the key or the hash.


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