HomeSort by relevance Sort by last modified time
    Searched defs:Tree (Results 1 - 11 of 11) sorted by null

  /external/clang/utils/TableGen/
ClangASTNodesEmitter.cpp 25 const ChildMap &Tree,
30 ChildIterator i = Tree.lower_bound(Base), e = Tree.upper_bound(Base);
55 if (Tree.find(R) != Tree.end()) {
57 = EmitNode(Tree, OS, R);
108 ChildMap Tree;
114 Tree.insert(std::make_pair(R->getValueAsDef("Base"), R));
116 Tree.insert(std::make_pair(&Root, R));
119 EmitNode(Tree, OS, &Root)
    [all...]
  /external/antlr/src/org/antlr/runtime/tree/
Tree.java 28 package org.antlr.runtime.tree;
34 /** What does a tree look like? ANTLR has a number of support classes
39 * NOTE: When constructing trees, ANTLR can build any kind of tree; it can
42 * This is a tree node without any payload; just navigation and factory stuff.
44 public interface Tree {
45 public static final Tree INVALID_NODE = new CommonTree(Token.INVALID_TOKEN);
47 Tree getChild(int i);
51 // Tree tracks parent and child index now > 3.0
53 public Tree getParent();
55 public void setParent(Tree t)
    [all...]
  /frameworks/base/media/libdrm/mobile1/src/xml/
xml_tinyparser.c 714 XML_TREE *Tree;
719 if (NULL == (Tree = (XML_TREE *) xml_malloc(sizeof(XML_TREE))))
721 memset(Tree, 0, sizeof(XML_TREE));
723 strncpy((char *)Tree->tag, (char *)++buffer, tagLen);
741 if (NULL != Tree->attr) // no attribute now
742 Tree->last_attr->next = attr;
744 Tree->attr = attr;
745 Tree->last_attr = attr;
751 strncpy((char *)Tree->value, (char *)pValue, valueLen);
756 return Tree;
    [all...]
  /external/llvm/utils/TableGen/
CodeGenDAGPatterns.cpp 807 /// getOperandNum - Return the node corresponding to operand #OpNo in tree
    [all...]
  /cts/tools/signature-tools/lib/
stringtemplate.jar 
  /prebuilt/darwin-x86/swt/
swt.jar 
  /prebuilt/darwin-x86_64/swt/
swt.jar 
  /prebuilt/linux-x86/swt/
swt.jar 
  /prebuilt/linux-x86_64/swt/
swt.jar 
  /prebuilt/windows/swt/
swt.jar 
  /prebuilt/windows-x86_64/swt/
swt.jar 

Completed in 1091 milliseconds