Searched defs:nodes (Results 26 - 50 of 209) sorted by relevance

123456789

/external/chromium_org/third_party/WebKit/Source/core/inspector/
H A DInspectorMemoryAgent.cpp43 void InspectorMemoryAgent::getDOMCounters(ErrorString*, int* documents, int* nodes, int* jsEventListeners) argument
46 *nodes = InspectorCounters::counterValue(InspectorCounters::NodeCounter);
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-node-cache.cc36 Node* nodes[arraysize(constants)]; local
41 *cache.Find(graph.zone(), k) = nodes[i] = node;
46 CHECK_EQ(nodes[i], *cache.Find(graph.zone(), k));
55 Node** nodes = graph.zone()->NewArray<Node*>(kSize); local
60 nodes[i] = graph.NewNode(common.Int32Constant(v));
61 *cache.Find(graph.zone(), v) = nodes[i];
69 CHECK_EQ(nodes[i], *pos);
96 Node** nodes = graph.zone()->NewArray<Node*>(kSize); local
101 nodes[i] = graph.NewNode(common.Int32Constant(i));
102 *cache.Find(graph.zone(), v) = nodes[
140 Node* nodes[kSize]; local
[all...]
/external/clang/test/CodeGenCXX/
H A Dconstructor-template.cpp17 A nodes; member in struct:B
39 List<BinomialNode<T>*> nodes; member in class:BinomialNode
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DDomFront.java39 private final ArrayList<SsaBasicBlock> nodes; field in class:DomFront
64 nodes = meth.getBlocks();
66 int szNodes = nodes.size();
80 int szNodes = nodes.size();
84 SsaBasicBlock node = nodes.get(i);
124 int szNodes = nodes.size();
127 SsaBasicBlock node = nodes.get(i);
152 int szNodes = nodes.size();
159 SsaBasicBlock domParent = nodes.get(info.idom);
160 domParent.addDomChild(nodes
[all...]
/external/doclava/src/com/google/doclava/
H A DHierarchy.java27 HashMap<String, TreeSet<String>> nodes = new HashMap<String, TreeSet<String>>();
32 TreeSet<String> me = nodes.get(name);
35 nodes.put(name, me);
41 TreeSet<String> s = nodes.get(sname);
44 nodes.put(sname, s);
51 * Set<String> keys = nodes.keySet(); for (String n: keys) { System.out.println("class: " + n);
53 * TreeSet<String> values = nodes.get(n); for (String v: values) {
57 int depth = depth(nodes, "java.lang.Object");
62 recurse(nodes, "java.lang.Object", hdf.getChild("classes.0"), depth, depth);
65 Set<String> keys = nodes
76 depth(HashMap<String, TreeSet<String>> nodes, String name) argument
94 recurse(HashMap<String, TreeSet<String>> nodes, String name, Data hdf, int totalDepth, int remainingDepth) argument
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DBstInOrderPathTest.java180 BstInOrderPath<SimpleNode> path, SimpleNode... nodes) {
183 ASSERT.that(pathToList(path)).hasContentsInOrder(nodes);
188 BstInOrderPath<SimpleNode> path, SimpleNode... nodes) {
191 ASSERT.that(pathToList(path)).hasContentsInOrder(nodes);
179 testNextPathIs( BstInOrderPath<SimpleNode> path, SimpleNode... nodes) argument
187 testPrevPathIs( BstInOrderPath<SimpleNode> path, SimpleNode... nodes) argument
/external/llvm/utils/
H A DDSAextract.py3 #this is a script to extract given named nodes from a dot file, with
5 # x and y are both nodes specified to be kept.
19 #nodes in the file
35 <output_file> [list of nodes to extract]'
66 #for the node (it will be Node(hex number)) to our set of nodes
96 #check to make sure that both nodes are in the node list
98 nodes = arrowexp.split(buffer) variable
99 nodes[0] = string.strip(nodes[0])
100 nodes[
[all...]
/external/pdfium/core/src/fxcodec/fx_libopenjpeg/libopenjpeg20/
H A Dtgt.h72 opj_tgt_node_t *nodes; member in struct:opj_tgt_tree
73 OPJ_UINT32 nodes_size; /* maximum size taken by nodes */
/external/smack/src/org/jivesoftware/smackx/
H A DOfflineMessageManager.java129 * @param nodes the list of stamps that uniquely identifies offline message.
135 public Iterator<Message> getMessages(final List<String> nodes) throws XMPPException { argument
138 for (String node : nodes) {
151 return nodes.contains(info.getNode());
231 * @param nodes the list of stamps that uniquely identifies offline message.
235 public void deleteMessages(List<String> nodes) throws XMPPException { argument
237 for (String node : nodes) {
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DTreeIterator.cs37 /** Return a node stream from a doubly-linked tree whose nodes
40 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
50 // navigation nodes to return during walk and at end
55 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
58 protected Queue<object> nodes; field in class:Antlr.Runtime.Tree.TreeIterator
70 nodes = new Queue<object>();
105 nodes.Enqueue( eof );
112 if ( nodes != null && nodes
[all...]
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DTreeIterator.java36 /** Return a node stream from a doubly-linked tree whose nodes
39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
47 // navigation nodes to return during walk and at end
52 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
55 protected FastQueue nodes; field in class:TreeIterator
65 nodes = new FastQueue();
74 nodes.clear();
79 if ( nodes!=null && nodes
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRBufferedTreeNodeStream.h48 NSMutableArray *nodes; variable
67 NSMutableArray *nodes; variable
87 @property (retain, getter=getNodes, setter=setNodes:) NSMutableArray *nodes; variable
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRBufferedTreeNodeStream.h48 NSMutableArray *nodes; variable
67 NSMutableArray *nodes; variable
87 @property (retain, getter=getNodes, setter=setNodes:) NSMutableArray *nodes; variable
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
H A DANTLRBufferedTreeNodeStream.h48 NSMutableArray *nodes; variable
67 NSMutableArray *nodes; variable
87 @property (retain, getter=getNodes, setter=setNodes:) NSMutableArray *nodes; variable
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRBufferedTreeNodeStream.h49 __strong AMutableArray *nodes; variable
68 AMutableArray *nodes; variable
88 @property (retain, getter=getNodes, setter=setNodes:) AMutableArray *nodes; variable
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DGraph.java40 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/chromium_org/chrome/test/chromedriver/chrome/
H A Ddom_tracker.cc40 const base::Value* nodes; local
41 if (!params.Get("nodes", &nodes))
42 return Status(kUnknownError, "DOM.setChildNodes missing 'nodes'");
44 if (!ProcessNodeList(nodes)) {
46 base::JSONWriter::Write(nodes, &json);
48 "DOM.setChildNodes has invalid 'nodes': " + json);
69 bool DomTracker::ProcessNodeList(const base::Value* nodes) { argument
71 if (!nodes->GetAsList(&nodes_list))
/external/chromium_org/components/bookmarks/browser/
H A Dbookmark_expanded_state_tracker_unittest.cc80 BookmarkExpandedStateTracker::Nodes nodes; local
81 nodes.insert(model_->bookmark_bar_node());
82 tracker->SetExpandedNodes(nodes);
83 EXPECT_EQ(nodes, tracker->GetExpandedNodes());
88 nodes.insert(n1);
89 tracker->SetExpandedNodes(nodes);
90 EXPECT_EQ(nodes, tracker->GetExpandedNodes());
92 // Remove the folder, which should remove it from the list of expanded nodes.
94 nodes.erase(n1);
96 EXPECT_EQ(nodes, tracke
105 BookmarkExpandedStateTracker::Nodes nodes; local
[all...]
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DStaticNodeList.h46 static PassRefPtrWillBeRawPtr<StaticNodeTypeList> adopt(WillBeHeapVector<RefPtrWillBeMember<NodeType> >& nodes);
73 PassRefPtrWillBeRawPtr<StaticNodeTypeList<NodeType> > StaticNodeTypeList<NodeType>::adopt(WillBeHeapVector<RefPtrWillBeMember<NodeType> >& nodes) argument
76 nodeList->m_nodes.swap(nodes);
/external/chromium_org/third_party/polymer/components-chromium/core-layout-grid/
H A Dcore-layout-grid-extracted.js6 nodes: null,
23 this.nodes = this.parentNode.children.array().filter(
43 if (!this.nodes || this.auto) {
46 layout(this.layout, this.nodes);
129 var nodes; variable
137 var node = nodes[col - 1];
154 var node = nodes[row - 1];
251 nodes = anodes;
254 nodes.forEach(unposition);
276 nodes
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/
H A DITreeNodeStreamFixture.cs73 /// Test a tree with four nodes - ^(101 ^(102 103) 104)
196 // stream has 7 real + 6 nav nodes
233 // stream has 7 real + 6 nav nodes
280 // stream has 7 real + 6 nav nodes
321 // stream has 7 real + 6 nav nodes
349 // stream has 7 real + 6 nav nodes
374 // stream has 9 real + 8 nav nodes
421 // stream has 9 real + 8 nav nodes
480 // stream has 9 real + 8 nav nodes
592 /// Use Consume() to advance N nodes int
642 GetStringOfEntireStreamContentsWithNodeTypesOnly(ITreeNodeStream nodes) argument
[all...]
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
H A DTestTreeNodeStream.java169 // stream has 7 real + 6 nav nodes
200 // stream has 7 real + 6 nav nodes
224 stream.mark(); // keep saving nodes though
245 // stream has 7 real + 6 nav nodes
284 // stream has 7 real + 6 nav nodes
307 // stream has 7 real + 6 nav nodes
328 // stream has 8 real + 10 nav nodes
330 CommonTree[] nodes = new CommonTree[n];
332 nodes[i] = new CommonTree(new CommonToken((i+1)*10));
334 Tree g = nodes[
360 toNodesOnlyString(TreeNodeStream nodes) argument
[all...]
/external/chromium_org/chrome/browser/extensions/api/bookmarks/
H A Dbookmark_api_helpers.cc29 std::vector<linked_ptr<BookmarkTreeNode> >* nodes,
37 nodes->push_back(new_node);
97 std::vector<linked_ptr<BookmarkTreeNode> >* nodes,
99 return AddNodeHelper(client, node, nodes, recurse, false);
104 std::vector<linked_ptr<BookmarkTreeNode> >* nodes,
106 return AddNodeHelper(client, node, nodes, recurse, true);
27 AddNodeHelper(ChromeBookmarkClient* client, const BookmarkNode* node, std::vector<linked_ptr<BookmarkTreeNode> >* nodes, bool recurse, bool only_folders) argument
95 AddNode(ChromeBookmarkClient* client, const BookmarkNode* node, std::vector<linked_ptr<BookmarkTreeNode> >* nodes, bool recurse) argument
102 AddNodeFoldersOnly(ChromeBookmarkClient* client, const BookmarkNode* node, std::vector<linked_ptr<BookmarkTreeNode> >* nodes, bool recurse) argument
/external/chromium_org/chrome/browser/history/android/
H A Dbookmark_model_sql_handler_unittest.cc89 std::vector<const BookmarkNode*> nodes; local
90 bookmark_model_->GetNodesByURL(row.url(), &nodes);
91 ASSERT_EQ(1u, nodes.size());
92 EXPECT_EQ(row.title(), nodes[0]->GetTitle());
93 const BookmarkNode* parent = nodes[0]->parent();
110 std::vector<const BookmarkNode*> nodes; local
111 bookmark_model_->GetNodesByURL(row.url(), &nodes);
112 ASSERT_EQ(1u, nodes.size());
113 EXPECT_EQ(row.title(), nodes[0]->GetTitle());
114 const BookmarkNode* parent = nodes[
148 std::vector<const BookmarkNode*> nodes; local
[all...]
/external/chromium_org/chrome/browser/ui/bookmarks/
H A Dbookmark_context_menu_controller_unittest.cc104 std::vector<const BookmarkNode*> nodes; local
105 nodes.push_back(model_->bookmark_bar_node()->GetChild(0));
107 NULL, NULL, NULL, profile_.get(), NULL, nodes[0]->parent(), nodes);
146 std::vector<const BookmarkNode*> nodes; local
147 nodes.push_back(model_->bookmark_bar_node()->GetChild(0));
149 NULL, NULL, NULL, profile_.get(), NULL, nodes[0]->parent(), nodes);
165 std::vector<const BookmarkNode*> nodes; local
166 nodes
185 std::vector<const BookmarkNode*> nodes; local
204 std::vector<const BookmarkNode*> nodes; local
224 std::vector<const BookmarkNode*> nodes; local
251 std::vector<const BookmarkNode*> nodes; local
262 std::vector<const BookmarkNode*> nodes; local
291 std::vector<const BookmarkNode*> nodes; local
309 std::vector<const BookmarkNode*> nodes; local
[all...]

Completed in 3252 milliseconds

123456789