Searched defs:isNilNode (Results 1 - 5 of 5) sorted by relevance

/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3bitset.h103 ANTLR3_BOOLEAN (*isNilNode) (struct ANTLR3_BITSET_struct * bitset); member in struct:ANTLR3_BITSET_struct
H A Dantlr3basetree.h119 ANTLR3_BOOLEAN (*isNilNode) (struct ANTLR3_BASE_TREE_struct * tree); member in struct:ANTLR3_BASE_TREE_struct
H A Dantlr3basetreeadaptor.h85 ANTLR3_BOOLEAN (*isNilNode) (struct ANTLR3_BASE_TREE_ADAPTOR_struct * adaptor, void * t); member in struct:ANTLR3_BASE_TREE_ADAPTOR_struct
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3commontree.c43 static ANTLR3_BOOLEAN isNilNode (pANTLR3_BASE_TREE tree);
303 tree->baseTree.isNilNode = isNilNode;
408 isNilNode (pANTLR3_BASE_TREE tree) function
491 if (tree->isNilNode(tree) == ANTLR3_TRUE)
H A Dantlr3basetreeadaptor.c72 static ANTLR3_BOOLEAN isNilNode (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t);
148 adaptor->isNilNode = (ANTLR3_BOOLEAN (*)(pANTLR3_BASE_TREE_ADAPTOR, void *))
149 isNilNode;
540 * and child isNilNode then it is ok to move children to t via
603 * If oldRoot was null, it's ok, just return newRoot (even if isNilNode).
643 if (newRootTree->isNilNode(newRootTree))
674 if (oldRootTree->isNilNode(oldRootTree))
713 if (root != NULL && root->isNilNode(root))
906 isNilNode (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t) function
908 return t->isNilNode(
[all...]

Completed in 97 milliseconds