antlr3-leftN (3) Linux Manual Page
ANTLR3_INT_TRIE_NODE_struct –
Structure that defines an element/node in an ANTLR3_INT_TRIE.
Synopsis
#include <antlr3collections.h>Data Fields
ANTLR3_UINT32 bitNumThis is the left/right bit index for traversal along the nodes.
pANTLR3_TRIE_ENTRY buckets
This is the data bucket(s) that the key indexes, which may be NULL.
ANTLR3_INTKEY key
This is the actual key that the entry represents if it is a terminal node.
struct ANTLR3_INT_TRIE_NODE_struct * leftN
Pointer to the left node from here when sKey & bitNum = 0.
struct ANTLR3_INT_TRIE_NODE_struct * rightN
Pointer to the right node from here when sKey & bitNum, = 1.
Detailed Description
Structure that defines an element/node in an ANTLR3_INT_TRIE.Field Documentation
ANTLR3_UINT32 ANTLR3_INT_TRIE_NODE_struct::bitNum
This is the left/right bit index for traversal along the nodes. Referenced by antlr3IntTrieNew(), freeIntNode(), intTrieAdd(), and intTrieGet().
pANTLR3_TRIE_ENTRY ANTLR3_INT_TRIE_NODE_struct::buckets
This is the data bucket(s) that the key indexes, which may be NULL. Referenced by freeIntNode(), intTrieAdd(), and intTrieGet().
ANTLR3_INTKEY ANTLR3_INT_TRIE_NODE_struct::key
This is the actual key that the entry represents if it is a terminal node. Referenced by intTrieAdd(), and intTrieGet().
struct ANTLR3_INT_TRIE_NODE_struct* ANTLR3_INT_TRIE_NODE_struct::leftN [read]
Pointer to the left node from here when sKey & bitNum = 0. Referenced by antlr3IntTrieNew(), freeIntNode(), intTrieAdd(), and intTrieGet().
struct ANTLR3_INT_TRIE_NODE_struct* ANTLR3_INT_TRIE_NODE_struct::rightN [read]
Pointer to the right node from here when sKey & bitNum, = 1.Referenced by antlr3IntTrieNew(), freeIntNode(), intTrieAdd(), and intTrieGet().