| /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...] |
| /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/chromium_org/chrome/browser/autocomplete/ |
| bookmark_provider.cc | 250 std::vector<const BookmarkNode*> nodes; local
251 bookmark_model_->GetNodesByURL(url, &nodes);
252 DCHECK_GE(std::min(arraysize(kURLCountBoost), nodes.size()), 1U);
254 kURLCountBoost[std::min(arraysize(kURLCountBoost), nodes.size()) - 1];
|
| /external/chromium_org/chrome/browser/ui/bookmarks/ |
| bookmark_utils.h | 36 // Opens all the bookmarks in |nodes| that are of type url and all the child
37 // bookmarks that are of type url for folders in |nodes|. |initial_disposition|
42 const std::vector<const BookmarkNode*>& nodes,
|
| /external/chromium_org/content/common/ |
| accessibility_messages.h | 48 // Vector of nodes in the tree that need to be updated before
50 IPC_STRUCT_MEMBER(std::vector<content::AccessibilityNodeData>, nodes)
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
| InsertionPoint.cpp | 64 // Attempt not to reattach nodes that would be distributed to the exact same
72 // If the new distribution is larger than the old one, reattach all nodes in
77 // If the old distribution is larger than the new one, reattach all nodes in
88 // If we hit the end of either list above we need to reattach all remaining nodes.
104 // inserted in the wrong place later. This also lets distributed nodes benefit from
186 Vector<RefPtr<Node> > nodes; local
187 nodes.reserveInitialCapacity(m_distribution.size());
189 nodes.uncheckedAppend(m_distribution.at(i));
191 return StaticNodeList::adopt(nodes);
|
| /external/chromium_org/third_party/WebKit/Source/core/events/ |
| EventPath.cpp | 63 // At this time, SVG nodes are not supported in non-<use> shadow trees.
189 Vector<RefPtr<Node> > nodes; local
190 nodes.reserveInitialCapacity(size());
193 nodes.append(at(j).node());
195 at(i).adoptEventPath(nodes);
|
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathNodeSet.cpp | 48 ASSERT(from + 1 < to); // Should not call this function with less that two nodes to sort.
78 // One of the nodes is the common ancestor => it is the first in document order.
90 // The attribute nodes and namespace nodes of an element occur before the children of the element.
91 // The namespace nodes are defined to occur before the attribute nodes.
92 // The relative order of namespace nodes is implementation-dependent.
93 // The relative order of attribute nodes is implementation-dependent.
95 // FIXME: namespace nodes are not implemented.
108 // Children nodes of the common ancestor induce a subdivision of our node-set
194 HashSet<Node*> nodes; local
[all...] |
| XPathPath.h | 61 void evaluate(NodeSet& nodes) const; // nodes is an input/output parameter
|
| /external/chromium_org/third_party/mesa/src/src/gallium/docs/source/exts/ |
| formatting.py | 6 import docutils.nodes namespace
|
| /external/mesa3d/src/gallium/docs/source/exts/ |
| formatting.py | 6 import docutils.nodes namespace
|
| /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...] |
| /packages/apps/UnifiedEmail/src/com/android/mail/lib/html/parser/ |
| HtmlDocument.java | 32 * HtmlDocument is a container for a list of html nodes, and represents the
41 private final List<Node> nodes; field in class:HtmlDocument
45 * @param nodes list of html nodes
47 public HtmlDocument(List<Node> nodes) {
48 this.nodes = nodes;
51 /** Gets the list of nodes */
53 return nodes;
58 StringBuilder sb = new StringBuilder(nodes.size() * 10)
1166 private final List<Node> nodes = new ArrayList<Node>(); field in class:HtmlDocument.Builder
[all...] |
| /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
| HtmlDocument.java | 33 * HtmlDocument is a container for a list of html nodes, and represents the
42 private final List<Node> nodes; field in class:HtmlDocument
46 * @param nodes list of html nodes
48 public HtmlDocument(List<Node> nodes) {
49 this.nodes = nodes;
52 /** Gets the list of nodes */
54 return nodes;
59 StringBuilder sb = new StringBuilder(nodes.size() * 10)
1167 private final List<Node> nodes = new ArrayList<Node>(); field in class:HtmlDocument.Builder
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| future.py | 27 for s in stmt.nodes:
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_urllib.py | 161 nodes = []
163 nodes.extend([new_node, Newline()])
164 nodes.append(new_nodes[-1])
165 node.replace(nodes)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| future.py | 27 for s in stmt.nodes:
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_urllib.py | 161 nodes = []
163 nodes.extend([new_node, Newline()])
164 nodes.append(new_nodes[-1])
165 node.replace(nodes)
|
| /external/chromium_org/third_party/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/chromium_org/third_party/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;
391 table->nodes = 0;
588 table->nodes++;
595 if ( table->nodes * 3 < table->size ||
596 table->size * 3 < table->nodes )
651 table->nodes--;
660 if ( table->nodes * 3 < table->size ||
661 table->size * 3 < table->nodes )
[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;
391 table->nodes = 0;
588 table->nodes++;
595 if ( table->nodes * 3 < table->size ||
596 table->size * 3 < table->nodes )
651 table->nodes--;
660 if ( table->nodes * 3 < table->size ||
661 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...] |
