| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_cpickle.py | 204 nodes = [Node() for i in range(500)]
205 for n in nodes:
206 n.connections = list(nodes)
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| SelectionOverlay.java | 157 private void paintSelectionFeedback(GCWrapper gcWrapper, List<NodeProxy> nodes,
161 // Group nodes into parent/child groups
163 for (INode node : nodes) {
173 for (INode node : nodes) {
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeWizard.cs | 52 * In order to create nodes and navigate, this class needs a TreeAdaptor.
55 * iterating over the various nodes with a particular type.
133 * nodes such as function definition nodes (you'll want to seek
135 * dynamic searches; i.e., go find me all PLUS nodes.
205 * Walk the entire tree and make a node name to nodes mapping.
242 public FindTreeWizardVisitor(IList nodes) {
243 _nodes = nodes;
266 /** <summary>Return a List of tree nodes with token type ttype</summary> */
268 IList nodes = new List<object>()
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| TreeWizard.cs | 53 * In order to create nodes and navigate, this class needs a TreeAdaptor.
56 * iterating over the various nodes with a particular type.
151 * nodes such as function definition nodes (you'll want to seek
153 * dynamic searches; i.e., go find me all PLUS nodes.
232 * Walk the entire tree and make a node name to nodes mapping.
275 public FindTreeWizardVisitor( IList nodes )
277 _nodes = nodes;
305 /** <summary>Return a List of tree nodes with token type ttype</summary> */
308 IList nodes = new List<object>()
[all...] |
| /external/chromium_org/ui/keyboard/resources/ |
| touch_fuzzing.js | 192 * The branch for nodes that failed the decision test.
198 * The branch for nodes that passed the decision test.
306 * @param {Array} nodes The array to convert.
309 var createBinaryTree = function(start, end, nodes) {
313 var root = new DecisionNode(nodes[midpoint]);
314 root.fail = createBinaryTree(start, midpoint - 1, nodes);
315 root.pass = createBinaryTree(midpoint + 1, end, nodes);
428 var nodes = row.children;
429 for (var k = 0 ; k < nodes.length; k++) {
430 layout.add(new Key(nodes[k]))
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| MoveHandler.java | 65 // Compute list of nodes being dragged within the layout, if any
66 List<INode> nodes = new ArrayList<INode>(); local
70 nodes.add(view.node);
73 mDraggedNodes = nodes;
75 mHorizontalDeps = mDependencyGraph.dependsOn(nodes, false /* verticalEdge */);
76 mVerticalDeps = mDependencyGraph.dependsOn(nodes, true /* verticalEdge */);
|
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| regcomp.c | 318 for (node_cnt = 0; node_cnt < init_state->nodes.nelem; ++node_cnt)
320 Idx node = init_state->nodes.elems[node_cnt];
321 re_token_type_t type = dfa->nodes[node].type;
325 re_set_fastmap (fastmap, icase, dfa->nodes[node].opr.c);
335 *p++ = dfa->nodes[node].opr.c;
337 && dfa->nodes[node].type == CHARACTER
338 && dfa->nodes[node].mb_partial)
339 *p++ = dfa->nodes[node].opr.c;
355 bitset_word_t w = dfa->nodes[node].opr.sbcset[i];
364 re_charset_t *cset = dfa->nodes[node].opr.mbcset
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
| dom_util.js | 190 * subtree for visible nodes. This option exists for performance tuning.
305 * @param {boolean=} opt_allowHidden Allows hidden nodes during descent.
518 * Wraps getName_ with marking and unmarking nodes so that infinite loops
524 * @param {boolean=} opt_allowHidden Allows hidden nodes in name computation.
545 * @param {boolean=} opt_allowHidden Allows hidden nodes in name computation.
584 * @param {boolean=} opt_allowHidden Allows hidden nodes in name computation.
656 * @param {boolean=} opt_allowHidden Allow hidden nodes in name computation.
657 * @return {string} The concatenated text of all child nodes.
774 // Count the number of parent nodes until there is a shared parent; the
963 // Exclude script nodes
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/heap_snapshot_worker/ |
| HeapSnapshot.js | 822 this._nodes = profile.nodes;
844 var nodes = this._nodes;
845 var nodesLength = nodes.length;
946 this._progress.updateStatus("Buiding dominated nodes\u2026");
955 var nodes = this._nodes;
964 edgeIndex += nodes[nodeOrdinal * nodeFieldCount + nodeEdgeCountOffset] * edgeFieldsCount;
[all...] |
| /external/chromium_org/third_party/handlebar/ |
| handlebar.py | 155 # [0] is the stack of nodes that |found_key| has been found in.
184 # |found_node_list| will be all the nodes that |key| has been found in.
192 # Check all the nodes not yet checked for |key|.
202 # The nodes will have been found in reverse stack order. After extending
203 # the found nodes, the freshest value will be at the tip of the stack.
410 def __init__(self, nodes):
411 assert nodes
412 self._nodes = nodes
931 nodes = []
944 nodes += self._ParseNextOpenToken(tokens
[all...] |
| /external/chromium_org/third_party/webtreemap/src/ |
| webtreemap.js | 15 // Size of border around nodes.
99 // Given a list of rectangles |nodes|, the 1-d space available
105 function selectSpan(nodes, space, start) {
109 var node = nodes[start];
114 for (var end = start; node = nodes[end]; ++end) {
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| cgraph.h | 42 The symtab_node is inherited by cgraph and varpol nodes. */
57 During WPA output it is used to mark nodes that are present in
74 /* Circular list of nodes in the same comdat group if non-NULL. */
329 /* A cgraph node set is a collection of cgraph nodes. A cgraph node
334 vec<cgraph_node_ptr> nodes; member in struct:cgraph_node_set_def
340 /* A varpool node set is a collection of varpool nodes. A varpool node
345 vec<varpool_node_ptr> nodes; member in struct:varpool_node_set_def
476 /* Ordering of all cgraph nodes. */
[all...] |
| /external/chromium_org/chrome/browser/ui/views/bookmarks/ |
| bookmark_menu_delegate.cc | 229 // Dropping after these nodes makes no sense.
300 std::vector<const BookmarkNode*> nodes; local
301 nodes.push_back(menu_id_to_node_map_[id]);
303 (nodes[0]->parent() == GetBookmarkModel()->other_node() &&
304 nodes[0]->parent()->child_count() == 1);
311 nodes[0]->parent(),
312 nodes,
387 // to support different parents, but this would need to prune any nodes whose
388 // parent has been removed. As all nodes currently have the same parent, there
392 // Remove any descendants of the removed nodes in |node_to_menu_map_|
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/page/ |
| TouchAdjustment.cpp | 90 // Accept nodes that has a CSS effect when touched.
112 // This function tries to match the nodes that receive special context-menu items in
126 // If the context menu gesture will trigger a selection all selectable nodes are valid targets.
159 // selected or auto-selectable parts of text nodes.
243 // Compiles a list of subtargets of all the relevant target nodes.
252 // A node matching the NodeFilter is called a responder. Candidate nodes must either be a
277 // Insert the detected responder for all the visited nodes.
289 // Skip nodes who's responders are ancestors of other responders. This gives preference to
484 bool findBestClickableCandidate(Node*& targetNode, IntPoint& targetPoint, const IntPoint& touchHotspot, const IntRect& touchArea, const WillBeHeapVector<RefPtrWillBeMember<Node> >& nodes)
488 TouchAdjustment::compileSubtargetList(nodes, subtargets, TouchAdjustment::nodeRespondsToTapGesture, TouchAdjustment::appendBasicSubtargetsForN (…)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathFunctions.cpp | 323 const NodeSet& nodes = a.toNodeSet(); local
324 for (size_t i = 0; i < nodes.size(); ++i) {
325 String str = stringValue(nodes[i]);
351 // If there are several nodes with the same id, id() should return the first one.
367 // The local part of an XPath expanded-name matches DOM local name for most node types, except for namespace nodes and processing instruction nodes.
368 // But note that Blink does not support namespace nodes.
650 const NodeSet& nodes = a.toNodeSet(); local
654 for (unsigned i = 0; i < nodes.size(); i++)
655 sum += Value(stringValue(nodes[i])).toNumber()
[all...] |
| /external/chromium_org/third_party/libxml/src/include/libxml/ |
| xpathInternals.h | 383 xmlXPathDistinctSorted (xmlNodeSetPtr nodes);
385 xmlXPathDistinct (xmlNodeSetPtr nodes);
392 xmlXPathNodeLeadingSorted (xmlNodeSetPtr nodes,
398 xmlXPathNodeLeading (xmlNodeSetPtr nodes,
405 xmlXPathNodeTrailingSorted (xmlNodeSetPtr nodes,
411 xmlXPathNodeTrailing (xmlNodeSetPtr nodes,
|
| /external/libxml2/include/libxml/ |
| xpathInternals.h | 385 xmlXPathDistinctSorted (xmlNodeSetPtr nodes);
387 xmlXPathDistinct (xmlNodeSetPtr nodes);
394 xmlXPathNodeLeadingSorted (xmlNodeSetPtr nodes,
400 xmlXPathNodeLeading (xmlNodeSetPtr nodes,
407 xmlXPathNodeTrailingSorted (xmlNodeSetPtr nodes,
413 xmlXPathNodeTrailing (xmlNodeSetPtr nodes,
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| pycodegen.py | 338 # The first few visitor methods handle nodes that generator new
377 for decorator in node.decorators.nodes:
379 ndecorators = len(node.decorators.nodes)
520 for child in node.nodes[:-1]:
524 self.visit(node.nodes[-1])
959 dups = len(node.nodes) - 1
960 for i in range(len(node.nodes)):
961 elt = node.nodes[i]
988 self.emit(op, len(node.nodes))
989 for child in node.nodes
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| pycodegen.py | 338 # The first few visitor methods handle nodes that generator new
377 for decorator in node.decorators.nodes:
379 ndecorators = len(node.decorators.nodes)
520 for child in node.nodes[:-1]:
524 self.visit(node.nodes[-1])
959 dups = len(node.nodes) - 1
960 for i in range(len(node.nodes)):
961 elt = node.nodes[i]
988 self.emit(op, len(node.nodes))
989 for child in node.nodes
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeWizard.java | 42 * In order to create nodes and navigate, this class needs a TreeAdaptor.
45 * iterating over the various nodes with a particular type.
107 * nodes such as function definition nodes (you'll want to seek
109 * dynamic searches; i.e., go find me all PLUS nodes.
167 /** Walk the entire tree and make a node name to nodes mapping.
199 /** Return a List of tree nodes with token type ttype */
201 final List nodes = new ArrayList(); local
204 nodes.add(t);
207 return nodes;
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/template-output/ |
| template-output.rb | 398 nodes = ANTLR3::AST::CommonTreeNodeStream.new( tree )
399 nodes.token_stream = tokens
400 tree_parser = TreeRewriteTG::TreeParser.new( nodes )
|
| /external/chromium_org/content/renderer/accessibility/ |
| renderer_accessibility_complete.cc | 197 // possibly nodes attached to a different document.
217 for (size_t i = 0; i < event_msg.update.nodes.size(); ++i) {
218 locations_[event_msg.update.nodes[i].id] =
219 event_msg.update.nodes[i].location;
|
| /external/chromium_org/native_client_sdk/src/doc/_sphinxext/ |
| devsite_builder.py | 14 from docutils import nodes namespace
156 # nodes.
186 isinstance(node.parent.parent, nodes.document)):
352 literal = nodes.literal_block(code, code)
|
| /external/chromium_org/net/tools/tld_cleanup/ |
| make_dafsa.py | 21 source node and ending at a common sink node. All internal nodes contain
25 The following python represention is used for nodes:
33 one to one linked nodes are replaced by nodes with the labels joined.
234 """Creates reverse nodes.
254 """Generates a new DAFSA where internal nodes are merged if there is a one to
270 """Create new nodes"""
286 """Generates a new DAFSA where nodes that represent the same word lists
304 """Generates list of nodes in topological sort order."""
324 nodes = [
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| ContainerNode.h | 62 // for a Node Vector that is used to store child Nodes of a given Node.
160 // Notifies the node that it's list of children have changed (either by adding or removing child nodes), or a child
309 inline void getChildNodes(Node& node, NodeVector& nodes)
311 ASSERT(!nodes.size());
313 nodes.append(child);
|
