/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | BufferedTreeNodeStream.java | 35 /** A buffered stream of tree nodes. Nodes can be from a tree of ANY kind. 37 * This node stream sucks all nodes out of the tree specified in 40 * includes pointers to DOWN and UP and EOF nodes. 64 return i<nodes.size(); 70 if ( current < nodes.size() ) { 71 return nodes.get(current); 77 throw new RuntimeException("cannot remove nodes from stream"); 81 // all these navigation nodes are shared and hence they 89 * This buffer includes pointers to DOWN, UP, and EOF nodes. 97 protected List nodes; field in class:BufferedTreeNodeStream [all...] |
/external/chromium_org/content/renderer/accessibility/ |
H A D | renderer_accessibility_browsertest.cc | 69 return event.update.nodes.size(); 112 EXPECT_EQ(event.update.nodes.size(), 2U); 113 EXPECT_EQ(event.update.nodes[0].id, 1); 114 EXPECT_EQ(event.update.nodes[0].role, 116 EXPECT_EQ(event.update.nodes[0].state, 120 EXPECT_EQ(event.update.nodes[0].child_ids.size(), 1U); 133 EXPECT_EQ(event.update.nodes[0].id, 1); 134 EXPECT_EQ(event.update.nodes[0].role, 136 EXPECT_EQ(event.update.nodes[0].state, 139 EXPECT_EQ(event.update.nodes[ [all...] |
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
H A D | CommonTreeNodeStream.as | 34 /** A buffered stream of tree nodes. Nodes can be from a tree of ANY kind. 36 * This node stream sucks all nodes out of the tree specified in 39 * includes pointers to DOWN and UP and EOF nodes. 54 // all these navigation nodes are shared and hence they 62 * This buffer includes pointers to DOWN, UP, and EOF nodes. 70 protected var nodes:Array; 72 /** Pull nodes from which tree? */ 81 /** Reuse same DOWN, UP navigation nodes unless this is true */ 84 /** The index into the nodes list of the current node (next node 85 * to consume). If -1, nodes arra [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRStreamEnumerator.h | 39 NSMutableArray *nodes; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
H A D | ANTLRStreamEnumerator.h | 39 NSMutableArray *nodes; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
H A D | ANTLRStreamEnumerator.h | 39 NSMutableArray *nodes; variable
|
/external/chromium_org/chrome/browser/resources/sync_internals/ |
H A D | sync_search.js | 51 // Put all nodes into one big list that ignores the type. 52 var nodes = node_map. 53 map(function(x) { return x.nodes; }). 59 callback(nodes.filter(function(elem) { 98 doSearch(query, function(nodes, error) { 104 'Found ' + nodes.length + ' nodes in ' + 109 for (var i = 0; i < nodes.length; ++i) { 110 nodes[i].toString = function() { 114 resultsDataModel.push.apply(resultsDataModel, nodes); [all...] |
/external/chromium_org/components/bookmarks/browser/ |
H A D | bookmark_client.cc | 27 const NodeSet& nodes, 26 GetTypedCountForNodes( const NodeSet& nodes, NodeTypedCountPairs* node_typed_count_pairs) argument
|
H A D | bookmark_expanded_state_tracker.h | 18 // BookmarkExpandedStateTracker is used to track a set of expanded nodes. The 19 // nodes are persisted in preferences. If an expanded node is removed from the 29 // The set of expanded nodes. 30 void SetExpandedNodes(const Nodes& nodes); 50 void UpdatePrefs(const Nodes& nodes);
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
H A D | RecognitionException.as | 93 * imaginary nodes w/o line/col info. We now search backwards looking 124 var nodes:TreeNodeStream = TreeNodeStream(input); 125 this.node = nodes.LT(1); 126 var adaptor:TreeAdaptor = nodes.treeAdaptor; 133 var priorNode:Object = nodes.LT(i); 144 priorNode = nodes.LT(i); 172 var nodes:TreeNodeStream = TreeNodeStream(input); 173 var adaptor:TreeAdaptor = nodes.treeAdaptor;
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
H A D | RecognitionException.java | 92 * imaginary nodes w/o line/col info. We now search backwards looking 124 TreeNodeStream nodes = (TreeNodeStream)input; 125 this.node = nodes.LT(1); 126 TreeAdaptor adaptor = nodes.getTreeAdaptor(); 133 Object priorNode = nodes.LT(i); 144 priorNode = nodes.LT(i); 172 TreeNodeStream nodes = (TreeNodeStream)input; 173 TreeAdaptor adaptor = nodes.getTreeAdaptor();
|
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
H A D | RecognitionException.js | 106 * imaginary nodes w/o line/col info. We now search backwards looking 117 var nodes = input, 124 this.node = nodes.LT(1); 125 var adaptor = nodes.getTreeAdaptor(), 132 priorNode = nodes.LT(i); 143 priorNode = nodes.LT(i); 173 var nodes = this.input; 174 var adaptor = nodes.getTreeAdaptor();
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Graph.java | 40 List<Node> edges; // points at which nodes? 53 protected Map<Object,Node> nodes = new HashMap<Object,Node>(); field in class:Graph 63 Node existing = nodes.get(a); 66 nodes.put(a, n); 84 while ( visited.size() < nodes.size() ) { 87 for (Iterator it = nodes.values().iterator(); it.hasNext();) {
|
/external/opencv/cv/src/ |
H A D | _cvkdtree.hpp | 69 int dim; // split dimension; >=0 for nodes, -1 for leaves 78 node_array nodes; // node storage member in class:CvKDTree 173 int i = nodes.size(); 174 node & n = *nodes.insert(nodes.end(), node()); 184 int i = nodes.size(); 186 node & n = *nodes.insert(nodes.end(), node()); 192 nodes[i].left = left; 194 nodes[ [all...] |
/external/chromium_org/third_party/libaddressinput/src/java/src/com/android/i18n/addressinput/ |
H A D | LookupKey.java | 111 this.mNodes = builder.nodes; 137 if (newKeyBuilder.nodes.containsKey(hierarchyField)) { 138 newKeyBuilder.nodes.remove(hierarchyField); 142 if (!newKeyBuilder.nodes.containsKey(hierarchyField)) { 202 parentKeyBuilder.nodes.remove(mostGranularField); 286 private Map<AddressField, String> nodes = new EnumMap<AddressField, String>( field in class:LookupKey.Builder 309 this.nodes.put(field, oldKey.mNodes.get(field)); 317 * node in the hierarchy is empty, all the descendant nodes' values will be neglected. For 349 this.nodes.put(HIERARCHY[0], substr); 359 this.nodes [all...] |
/external/chromium_org/third_party/jinja2/ |
H A D | ext.py | 13 from jinja2 import nodes namespace 103 list of multiple nodes. 115 return nodes.ExtensionAttribute(self.identifier, name, lineno=lineno) 120 :meth:`attr` + :class:`jinja2.nodes.Call`. 126 return nodes.Call(self.attr(name, lineno=lineno), args, kwargs, 245 variables[name.value] = var = nodes.Name(name.value, 'load') 248 if isinstance(var, nodes.Call): 249 plural_expr = nodes.Name('_trans', 'load') 251 plural_expr_assignment = nodes.Assign( 252 nodes [all...] |
/external/chromium_org/chrome/browser/resources/ |
H A D | about_stats.js | 40 /* Do the filter work. Hide all nodes matching node.*/ 56 var nodes = document.getElementsByName('counter'); 57 filterMatching(text, nodes, getCounterNameFromCounterNode); 58 var nodes = document.getElementsByName('timer'); 59 filterMatching(text, nodes, getTimerNameFromTimerNode); 64 var nodes = document.getElementsByName('counter'); 65 for (var i = 0, node; node = nodes[i]; i++) { 79 var nodes = document.getElementsByName('counter'); 80 for (var i = nodes.length - 1; i >= 0; i--) { 81 var node = nodes[ [all...] |
/external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
H A D | KeyTable.java | 113 * @return a set of nodes referenced by the key named <CODE>name</CODE> and the reference <CODE>ref</CODE>. If no node is referenced by this key, an empty node set is returned. 241 XNodeSet nodes = (XNodeSet) m_refsTable.get(ref); 242 if (nodes == null) 244 nodes = new XNodeSet(node, xctxt.getDTMManager()); 245 nodes.nextNode(); 246 m_refsTable.put(ref, nodes); 252 // in each nodeset. We use nodes.nextNode after each entry so we can 254 if (nodes.getCurrentNode() != node) { 255 nodes.mutableNodeset().addNode(node); 256 nodes [all...] |
/external/chromium_org/chrome/browser/extensions/api/bookmarks/ |
H A D | bookmark_api_helpers.h | 29 // Add a JSON representation of |node| to the JSON |nodes|. 32 std::vector<linked_ptr<api::bookmarks::BookmarkTreeNode> >* nodes, 38 api::bookmarks::BookmarkTreeNode> >* nodes,
|
/external/chromium_org/chrome/browser/ui/views/bookmarks/ |
H A D | bookmark_drag_drop_views.cc | 26 const std::vector<const BookmarkNode*>& nodes, 29 DCHECK(!nodes.empty()); 33 BookmarkNodeData drag_data(nodes); 42 if (bookmark_utils::CanAllBeEditedByUser(model->client(), nodes)) 140 std::vector<const BookmarkNode*> nodes = data.GetNodes(model, profile_path); local 141 for (size_t i = 0; i < nodes.size(); ++i) { 143 // nodes being dragged. 144 const BookmarkNode* node = nodes[i]; 146 drop_parent->GetIndexOf(nodes[i]) : -1; 25 DragBookmarks(Profile* profile, const std::vector<const BookmarkNode*>& nodes, gfx::NativeView view, ui::DragDropTypes::DragEventSource source) argument
|
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | StaticNodeList.cpp | 37 PassRefPtrWillBeRawPtr<StaticNodeList> StaticNodeList::adopt(WillBeHeapVector<RefPtrWillBeMember<Node> >& nodes) argument 40 nodeList->m_nodes.swap(nodes);
|
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/speech_rules/ |
H A D | mathml_store_util.js | 119 * for an mfenced expression starting with the first node in nodes. 147 * @param {Array.<Node>} nodes A node array. 150 * mfenced expression starting with the first node in nodes. 152 cvox.MathmlStoreUtil.mfencedSeparators = function(nodes, context) { 161 * Iterates over the list of content nodes of the parent of the given nodes. 162 * @param {Array.<Node>} nodes A node array. 167 cvox.MathmlStoreUtil.contentIterator = function(nodes, context) { 168 if (nodes.length > 0) { 169 var contentNodes = cvox.XpathUtil.evalXPath('../../content/*', nodes[ [all...] |
/external/chromium_org/chrome/browser/ui/bookmarks/ |
H A D | bookmark_drag_drop.h | 21 const std::vector<const BookmarkNode*>& nodes, 25 // Drops the bookmark nodes that are in |data| onto |parent_node| at |index|.
|
/external/chromium_org/components/query_parser/ |
H A D | query_parser.h | 88 // Parses |query|, returning the nodes that constitute the valid words in the 90 // the nodes passes to the caller. 92 QueryNodeStarVector* nodes); 94 // Returns true if the string text matches the query nodes created by a call 98 const QueryNodeStarVector& nodes, 101 // Returns true if all of the |words| match the query |nodes| created by a 104 const QueryNodeStarVector& nodes); 115 // Does the work of parsing |query|; creates nodes in |root| as appropriate.
|
/external/chromium_org/third_party/freetype/src/cache/ |
H A D | ftcmru.c | 177 list->nodes = NULL; 187 while ( list->nodes ) 188 FTC_MruList_Remove( list, list->nodes ); 210 first = list->nodes; 221 FTC_MruNode_Up( &list->nodes, node ); 247 node = list->nodes->prev; 253 FTC_MruNode_Up( &list->nodes, node ); 260 FTC_MruNode_Remove( &list->nodes, node ); 273 FTC_MruNode_Prepend( &list->nodes, node ); 311 FTC_MruNode_Remove( &list->nodes, nod [all...] |