Searched refs:leftN (Results 1 – 4 of 4) sorted by relevance
1847 trie->root->leftN = trie->root; in antlr3IntTrieNew()1883 nextNode = thisNode->leftN; /* Examine the left node from the root */ in intTrieGet()1903 nextNode = nextNode->leftN; /* 0 is left */ in intTrieGet()1969 nextNode = trie->root->leftN; /* And assume we start to the left */ in intTrieAdd()1990 nextNode = nextNode->leftN; in intTrieAdd()2126 entNode = trie->root->leftN; in intTrieAdd()2146 entNode = entNode->leftN; in intTrieAdd()2196 nextNode->leftN = entNode; /* Terminates at previous position */ in intTrieAdd()2202 nextNode->leftN = nextNode; /* Terminates with itself */ in intTrieAdd()2216 thisNode->leftN = nextNode; in intTrieAdd()[all …]
86 void set_leftN( IntTrieNode* leftN );
72 ANTLR_INLINE void IntTrieNode<ImplTraits, DataType>::set_leftN( IntTrieNode* leftN ) argument74 m_leftN = leftN;
354 …struct ANTLR3_INT_TRIE_NODE_struct * leftN; /**< Pointer to the left node from here when sKey … member