Searched refs:leftN (Results 1 – 2 of 2) sorted by relevance
1806 trie->root->leftN = trie->root; in antlr3IntTrieNew()1842 nextNode = thisNode->leftN; /* Examine the left node from the root */ in intTrieGet()1862 nextNode = nextNode->leftN; /* 0 is left */ in intTrieGet()1929 nextNode = trie->root->leftN; /* And assume we start to the left */ in intTrieAdd()1950 nextNode = nextNode->leftN; in intTrieAdd()2086 entNode = trie->root->leftN; in intTrieAdd()2106 entNode = entNode->leftN; in intTrieAdd()2156 nextNode->leftN = entNode; /* Terminates at previous position */ in intTrieAdd()2162 nextNode->leftN = nextNode; /* Terminates with itself */ in intTrieAdd()2176 thisNode->leftN = nextNode; in intTrieAdd()[all …]
354 …struct ANTLR3_INT_TRIE_NODE_struct * leftN; /**< Pointer to the left node from here when sKey … member