/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/ |
H A D | ASTParser.stg | 43 retval.tree = <ASTLabelType>(adaptor.errorNode(input, Token(retval.start), input.LT(-1), re)); 44 <! trace("<ruleName> returns "+((CommonTree)retval.tree).toStringTree()); !> 126 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>adaptor.addChild(root_0, <label>.tree); 135 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>root_0 = <ASTLabelType>(adaptor.becomeRoot(<label>.tree, root_0)); 141 <listLabel(elem=label+".tree",...)> 147 <listLabel(elem=label+".tree",...)> 153 <listLabel(elem=label+".tree",...)> 187 retval.tree = <ASTLabelType>(adaptor.rulePostProcessing(root_0)); 188 adaptor.setTokenBoundaries(retval.tree, Token(retval.start), Token(retval.stop));
|
/external/chromium_org/tools/metrics/histograms/ |
H A D | extract_histograms.py | 100 """Recursively normalizes all tag attribute values in the given tree. 168 def _ExtractEnumsFromXmlTree(tree): 169 """Extract all <enum> nodes in the tree into a dictionary.""" 175 for enum in tree.getElementsByTagName('enum'): 233 def _ExtractHistogramsFromXmlTree(tree, enums): 234 """Extract all <histogram> nodes in the tree into a dictionary.""" 240 for histogram in tree.getElementsByTagName('histogram'): 294 def _UpdateHistogramsWithSuffixes(tree, histograms): 302 tree: XML dom tree [all...] |
/external/skia/src/core/ |
H A D | SkPictureRecorder.cpp | 38 SkAutoTUnref<SkBBoxHierarchy> tree((*bbhFactory)(width, height)); 39 SkASSERT(NULL != tree); 40 fPictureRecord = SkNEW_ARGS(SkBBoxHierarchyRecord, (size, recordFlags, tree.get()));
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
H A D | RecognitionException.as | 29 import org.antlr.runtime.tree.Tree; 30 import org.antlr.runtime.tree.TreeNodeStream; 31 import org.antlr.runtime.tree.TreeAdaptor; 32 import org.antlr.runtime.tree.CommonTree; 72 * For parsers. Even when it's a tree parser, token might be set. 76 /** If this is a tree parser exception, node is set to the node with 92 /** If you are parsing a tree node stream, you will encounter som
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
H A D | RewriteRuleNodeStream.as | 2 package org.antlr.runtime.tree { 4 /** Queues up nodes matched on left side of -> in a tree parser. This is
|
H A D | RewriteRuleSubtreeStream.as | 28 package org.antlr.runtime.tree { 38 * tree root node. Also prevents us from duplicating recently-added 42 * Referencing a rule result twice is ok; dup entire tree as 47 * and super.next() doesn't know which to call: dup node or dup tree.
|
H A D | RewriteRuleTokenStream.as | 28 package org.antlr.runtime.tree { 48 /** Don't convert to a tree unless they explicitly call nextTree. 49 * This way we can do hetero tree nodes in rewrite.
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | CommonTreeNodeStream.cs | 45 /** <summary>Pull nodes from which tree?</summary> */ 48 /** <summary>If this tree (root) was created from a token stream, track it.</summary> */ 51 /** <summary>What tree adaptor was used to build these trees</summary> */ 55 /** The tree iterator we are using */ 64 /** <summary>Tracks tree depth. Level=0 means we're at root node level.</summary> */ 67 public CommonTreeNodeStream(object tree) argument 68 : this(new CommonTreeAdaptor(), tree) { 71 public CommonTreeNodeStream(ITreeAdaptor adaptor, object tree) { argument 72 this._root = tree; 199 // we'll have to walk from start to stop in tree; w [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
H A D | CommonTreeNodeStream.cs | 47 /** <summary>Pull nodes from which tree?</summary> */ 50 /** <summary>If this tree (root) was created from a token stream, track it.</summary> */ 53 /** <summary>What tree adaptor was used to build these trees</summary> */ 57 /** The tree iterator we are using */ 66 /** <summary>Tracks tree depth. Level=0 means we're at root node level.</summary> */ 69 public CommonTreeNodeStream( object tree ) 70 : this( new CommonTreeAdaptor(), tree ) 74 public CommonTreeNodeStream( ITreeAdaptor adaptor, object tree ) 76 this._root = tree; 231 // we'll have to walk from start to stop in tree; w [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | RewriteRuleNodeStream.java | 28 package org.antlr.runtime.tree; 32 /** Queues up nodes matched on left side of -> in a tree parser. This is
|
H A D | TreeNodeStream.java | 28 package org.antlr.runtime.tree; 33 /** A stream of tree nodes, accessing nodes from a tree of some kind */ 35 /** Get a tree node at an absolute index i; 0..n-1. 41 /** Get tree node at current input pointer + i ahead where i=1 is next node. 49 * returns a tree node instead of a token. Makes code gen identical 50 * for both parser and tree grammars. :) 59 /** If the tree associated with this stream was created from a TokenStream, 60 * you can specify it here. Used to do rule $text attribute in tree 61 * parser. Optional unless you use tree parse [all...] |
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
H A D | RecognitionException.js | 27 * @param {org.antlr.runtime.CommonTokenStream|org.antlr.runtime.tree.TreeNodeStream|org.antlr.runtime.ANTLRStringStream} input input stream that has an exception. 40 if ( input instanceof org.antlr.runtime.tree.TreeNodeStream ) { 72 * For parsers. Even when it's a tree parser, token might be set. 77 /** If this is a tree parser exception, node is set to the node with 105 /** If you are parsing a tree node stream, you will encounter som 114 * @param {org.antlr.runtime.CommonTokenStream|org.antlr.runtime.tree.TreeNodeStream|org.antlr.runtime.ANTLRStringStream} input input stream that has an exception. 151 else if ( this.node instanceof org.antlr.runtime.tree.Tree) { 154 if ( this.node instanceof org.antlr.runtime.tree.CommonTree) { 172 else if ( this.input instanceof org.antlr.runtime.tree.TreeNodeStream ) {
|
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
H A D | CommonTreeNodeStream.js | 1 /** A buffered stream of tree nodes. Nodes can be from a tree of ANY kind. 3 * This node stream sucks all nodes out of the tree specified in 5 * the tree using an array of Object pointers. The stream necessarily 10 * This stream is most suitable for tree interpreters that need to 11 * jump around a lot or for tree parsers requiring speed (at cost of memory). 13 * but just in bookkeeping, not tree walking etc... 17 org.antlr.runtime.tree.CommonTreeNodeStream = function(adaptor, 18 tree, 22 tree [all...] |
H A D | TreeParser.js | 1 /** A parser for a stream of tree nodes. "tree grammars" result in a subclass 5 org.antlr.runtime.tree.TreeParser = function(input) { 6 org.antlr.runtime.tree.TreeParser.superclass.constructor.call(this, arguments[1]); 11 var TP = org.antlr.runtime.tree.TreeParser; 46 return new org.antlr.runtime.tree.CommonTree(new org.antlr.runtime.CommonToken(expectedTokenType, tokenText)); 49 /** Match '.' in tree parser has special meaning. Skip node or 50 * entire tree if node has children. If children, scan until 83 * * from tree parser errors inline... 91 * the input tree no [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/ |
H A D | AST.stg | 52 getTree: function() { return this.tree; } 66 :{var stream_<it>=new org.antlr.runtime.tree.RewriteRuleTokenStream(this.adaptor,"token <it>");}; separator="\n"> 68 :{var stream_<it>=new org.antlr.runtime.tree.RewriteRuleSubtreeStream(this.adaptor,"rule <it>");}; separator="\n"> 165 <prevRuleRootRef()>.tree = root_0; 169 <! if tree parser and rewrite=true !> 172 <prevRuleRootRef()>.tree = this.adaptor.rulePostProcessing(root_0); 176 retval.tree); 179 <! if parser or tree-parser && rewrite!=true, we need to set result !> 181 <prevRuleRootRef()>.tree = root_0; 184 <prevRuleRootRef()>.tree [all...] |
/external/chromium_org/third_party/bintrees/bintrees/ |
H A D | treemixin.py | 31 get a tree walker object, provides methods to traverse the tree see walker.py 70 * foreach(f, [order]) -> visit all nodes of tree and call f(k, v) for each node, O(n) 82 T[:] is a TreeSlice which represents the whole tree. 84 TreeSlice is a tree wrapper with range check, and contains no references 85 to objects, deleting objects in the associated tree also deletes the object 137 * fromkeys(S[,v]) -> New tree with keys from S and values equal to v. 150 tree = self.__class__() 151 self.foreach(tree.insert, order=-1) 152 return tree [all...] |
/external/chromium_org/third_party/libxslt/libxslt/ |
H A D | numbersInternals.h | 13 #include <libxml/tree.h>
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | TreeMultimapExplicitTest.java | 84 multimap.put("tree", 0); 85 multimap.put("tree", null); 93 TreeMultimap<String, Integer> tree = TreeMultimap.create( 95 tree.put("google", 2); 96 tree.put("google", 6); 97 tree.put("tree", 0); 98 tree.put("tree", 3); 99 ASSERT.that(tree [all...] |
/external/libxml2/ |
H A D | save.h | 15 #include <libxml/tree.h>
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
H A D | IincInsnNode.java | 30 package org.mockito.asm.tree;
|
H A D | JumpInsnNode.java | 30 package org.mockito.asm.tree;
|
H A D | LabelNode.java | 30 package org.mockito.asm.tree;
|
H A D | LineNumberNode.java | 30 package org.mockito.asm.tree;
|
H A D | MultiANewArrayInsnNode.java | 30 package org.mockito.asm.tree;
|
H A D | TryCatchBlockNode.java | 30 package org.mockito.asm.tree;
|