| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRTreeIterator.h | 48 ANTLRFastQueue *nodes; variable
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRTreeIterator.h | 48 ANTLRFastQueue *nodes; variable
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRTreeIterator.h | 48 ANTLRFastQueue *nodes; variable
|
| /external/antlr/antlr-3.4/runtime/Python/unittests/ |
| testdottreegen.py | 32 " $nodes$\n" +
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| tree.rb | 89 Mainly, it customizes a few methods specifically to deal with tree nodes
95 assumptions about the class of the actual nodes it processes. One consequence of
98 construction and analysis of your tree nodes.
187 ############################################ Tree Nodes ############################################
200 tree nodes as well as the methods trees need to implement.
211 tree nodes
214 [siblings] all other nodes sharing the same parent as some node
453 value) and contains zero or more child tree nodes. Additionally, it tracks
677 * copying and creating tree nodes and tokens
678 * defining parent-child relationships between nodes
[all...] |
| dot.rb | 43 Abstract Syntax Tree nodes.
78 | <%= @nodes.join("\n ") %>
109 tree_template = Context.new( tree_template, :nodes => [], :edges => [] )
125 tree_template[ :nodes ] << parent_node_template
134 tree_template[ :nodes ] << node_template
|
| /external/chromium/chrome/browser/ui/gtk/bookmarks/ |
| bookmark_utils_gtk.h | 69 // Pickle a vector of nodes into a GtkSelection.
70 void WriteBookmarksToSelection(const std::vector<const BookmarkNode*>& nodes,
|
| /external/v8/src/ |
| ast.cc | 688 return ListCaptureRegisters(nodes());
724 ZoneList<RegExpTree*>* nodes = this->nodes(); local
725 for (int i = 0; i < nodes->length(); i++) {
726 RegExpTree* node = nodes->at(i);
735 ZoneList<RegExpTree*>* nodes = this->nodes(); local
736 for (int i = nodes->length() - 1; i >= 0; i--) {
737 RegExpTree* node = nodes->at(i);
817 for (int i = 0; i < that->nodes()->length(); i++)
[all...] |
| /external/webkit/Source/WebCore/loader/archive/cf/ |
| LegacyWebArchive.h | 57 static PassRefPtr<LegacyWebArchive> create(const String& markupString, Frame*, const Vector<Node*>& nodes);
|
| /external/webkit/PerformanceTests/SunSpider/tests/parse-only/ |
| concat-jquery-mootools-prototype.js | 871 // Convert html string into DOM nodes
968 // don't set attributes on text and comment nodes
1100 // (IE returns comment nodes in a '*' query)
[all...] |
| /external/freetype/src/base/ |
| ftdbgmem.c | 115 FT_ULong nodes; member in struct:FT_MemTableRec_
260 new_size = ft_mem_closest_prime( table->nodes );
317 table->nodes = 0;
395 table->nodes = 0;
593 table->nodes++;
600 if ( table->nodes * 3 < table->size ||
601 table->size * 3 < table->nodes )
656 table->nodes--;
665 if ( table->nodes * 3 < table->size ||
666 table->size * 3 < table->nodes )
[all...] |
| /external/icu4c/common/ |
| stringtriebuilder.cpp | 37 StringTrieBuilder::StringTrieBuilder() : nodes(NULL) {}
48 nodes=uhash_openSize(hashStringTrieNode, equalStringTrieNodes, NULL,
51 if(nodes==NULL) {
54 uhash_setKeyDeleter(nodes, uprv_deleteUObject);
61 uhash_close(nodes);
62 nodes=NULL;
163 // Write the sub-nodes in reverse order: The jump lengths are deltas from
193 // Write the split-branch nodes.
307 // Create the split-branch nodes.
326 const UHashElement *old=uhash_find(nodes, newNode)
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| exceptions.py | 105 # imaginary nodes w/o line/col info. We now search backwards looking
136 def extractInformationFromTreeNodeStream(self, nodes):
140 self.node = nodes.LT(1)
141 adaptor = nodes.adaptor
148 priorNode = nodes.LT(i)
159 priorNode = nodes.LT(i)
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| FuncDocument.java | 103 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager()); local
104 return nodes;
144 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager()); local
145 NodeSetDTM mnl = nodes.mutableNodeset();
196 // nodes.mutableNodeset().addNode(newDoc);
210 return nodes;
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_model.cc | 166 std::vector<const BookmarkNode*> nodes = local
168 return nodes.empty() ? bookmark_bar_node_ : nodes[0];
325 std::vector<const BookmarkNode*>* nodes) {
330 nodes->push_back(*i);
337 std::vector<const BookmarkNode*> nodes; local
338 GetNodesByURL(url, &nodes);
339 if (nodes.empty())
342 std::sort(nodes.begin(), nodes.end(), &bookmark_utils::MoreRecentlyAdded)
789 std::vector<const BookmarkNode*> nodes; local
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| SelectionManager.java | 539 public void select(Collection<INode> nodes) {
540 List<CanvasViewInfo> infos = new ArrayList<CanvasViewInfo>(nodes.size());
541 for (INode node : nodes) {
1101 List<INode> nodes = new ArrayList<INode>(); local
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| GrammarAST.java | 50 * class to track variables for many different kinds of nodes. It wastes
51 * space for nodes that don't need the values and OO principles cry out
75 /** This is used for TREE_BEGIN nodes to point into
81 /** Rule ref nodes, token refs, set, and NOT set refs need to track their
402 List<GrammarAST> nodes = new ArrayList<GrammarAST>(); local
403 _findAllType(ttype, nodes);
404 return nodes;
407 public void _findAllType(int ttype, List<GrammarAST> nodes) {
409 if ( this.getType()==ttype ) nodes.add(this);
413 child._findAllType(ttype, nodes);
[all...] |
| /external/webkit/LayoutTests/dom/html/level1/core/ |
| hc_textsplittextone.js | 79 two Text nodes at the specified offset keeping each node
85 Text nodes keeping both of them in the tree. This test
87 to ensure that the two nodes are indeed siblings.
|
| /external/webkit/LayoutTests/dom/xhtml/level1/core/ |
| hc_textsplittextone.js | 79 two Text nodes at the specified offset keeping each node
85 Text nodes keeping both of them in the tree. This test
87 to ensure that the two nodes are indeed siblings.
|
| /ndk/build/core/ |
| definitions-graph.mk | 117 # specific graph nodes. The following helper functions help implement
124 # _ndk_mod_tree_visitors lists all visited nodes, used to clean all
146 # dependencies / children nodes. Here are a few helper functions that
152 # _ndk_mod_list current result (list of nodes).
198 # we use the -ndk-mod-tree-xxx functions to flag 'visited' nodes
295 # $1: list of nodes
307 # Return the topologically ordered closure of all nodes from a top-level
315 # nodes for <name>.
316 # Return: list of nodes, include $1, which will always be the first.
332 # Given a closure list of nodes, count their incoming edges
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| DotTreeGenerator.cs | 102 var nodes = DefineNodes( tree, adaptor );
106 foreach ( var s in nodes )
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Utility/Antlr.Utility.Tree/ |
| DOTTreeGenerator.cs | 99 var nodes = DefineNodes(tree, adaptor);
103 foreach (var s in nodes)
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| DotTreeGenerator.cs | 102 var nodes = DefineNodes( tree, adaptor );
106 foreach ( var s in nodes )
|
| /external/libsepol/ |
| Android.mk | 27 src/nodes.c \
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
| ast.ml | 5 (* expr - Base type for all expression nodes. *)
|
