HomeSort by relevance Sort by last modified time
    Searched full:subtree (Results 51 - 75 of 354) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/apache-xml/src/main/java/org/apache/xalan/extensions/
ExpressionVisitor.java 60 * @return true to continue the visit in the subtree, if any.
  /external/chromium/third_party/libjingle/source/talk/base/
taskparent.h 51 // should be defined in a unique manner for the given subtree. This
  /external/webkit/Source/WebCore/rendering/svg/
RenderSVGShadowTreeRootContainer.cpp 84 // Attach subtree, as if it was a regular non-shadow tree
SVGTextLayoutAttributesBuilder.h 36 // measures all characters in the RenderSVGText subtree and extracts kerning/ligature information.
  /development/tools/elftree/
elftree.c 259 " -S Duplicate entire subtree when a duplicate is found\n"
260 " -P Show duplicates, but only include subtree once\n"
  /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
TreeParser.as 88 input.consume(); // not subtree, consume 1 node and return
91 // current node is a subtree, skip to corresponding UP.
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
TreeFilter.cs 43 subtree in our original tree? In what order should we visit nodes?
67 apply them to a particular subtree. The final piece of the tree
TreePatternParser.cs 76 object subtree = ParseTree();
77 adaptor.AddChild(root, subtree);
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
TreePatternParser.cs 88 object subtree = ParseTree();
89 adaptor.AddChild( root, subtree );
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
TreeFilter.java 39 subtree in our original tree? In what order should we visit nodes?
63 apply them to a particular subtree. The final piece of the tree
TreePatternParser.java 75 Object subtree = parseTree(); local
76 adaptor.addChild(root, subtree);
  /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
TreeParser.js 58 this.input.consume(); // not subtree, consume 1 node and return
61 // current node is a subtree, skip to corresponding UP.
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
ANTLRTreeParser.m 125 [input consume]; // not subtree, consume 1 node and return
128 // current node is a subtree, skip to corresponding UP.
ANTLRTreePatternParser.m 113 id<ANTLRBaseTree> subtree = [self parseTree];
114 [adaptor addChild:subtree toTree:root];
  /external/apache-xml/src/main/java/org/apache/xalan/templates/
AVTPartXPath.java 61 * the current subtree.
63 * @return true if traversal outside the context node's subtree can occur.
  /external/apache-xml/src/main/java/org/apache/xpath/functions/
Function2Args.java 120 * the current subtree.
122 * @return true if traversal outside the context node's subtree can occur.
Function3Args.java 118 * the current subtree.
120 * @return true if traversal outside the context node's subtree can occur.
FunctionDef1Arg.java 159 * the current subtree.
161 * @return true if traversal outside the context node's subtree can occur.
FunctionMultiArgs.java 139 * the current subtree.
141 * @return true if traversal outside the context node's subtree can occur.
FunctionOneArg.java 99 * the current subtree.
101 * @return true if traversal outside the context node's subtree can occur.
  /external/apache-xml/src/main/java/org/apache/xpath/operations/
Operation.java 63 * the current subtree.
65 * @return true if traversal outside the context node's subtree can occur.
  /external/apache-xml/src/main/java/org/apache/xpath/patterns/
UnionPattern.java 56 * the current subtree.
58 * @return true if traversal outside the context node's subtree can occur.
  /external/openfst/src/include/fst/
heap.h 161 // Heapify subtree rooted at index i.
182 // Insert (update) element at subtree rooted at index i
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
heap.h 148 // heapify subtree rooted at index i.
169 // insert(update) element at subtree rooted at index i
  /external/webkit/Source/ThirdParty/ANGLE/src/compiler/
IntermTraverse.cpp 14 // but their subtree will still be traversed.
15 // Nodes with children can have their whole subtree skipped

Completed in 1050 milliseconds

1 23 4 5 6 7 8 91011>>