| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| ast.py | 21 nodes = {} variable
24 """Abstract base class for ast nodes."""
40 nodes["expression"] = "Expression"
69 def __init__(self, nodes, lineno=None):
70 self.nodes = nodes
74 return tuple(flatten(self.nodes))
78 nodelist.extend(flatten_nodes(self.nodes))
82 return "And(%s)" % (repr(self.nodes),)
101 def __init__(self, nodes, lineno=None)
[all...] |
| /external/chromium_org/chrome/browser/extensions/api/bookmarks/ |
| bookmark_api_helpers.cc | 29 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);
|
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathResult.cpp | 163 const NodeSet& nodes = m_value.toNodeSet(); local
165 return nodes.firstNode();
166 return nodes.anyNode();
217 const NodeSet& nodes = m_value.toNodeSet(); local
218 if (index >= nodes.size())
221 return nodes[index];
|
| /external/chromium_org/third_party/openssl/openssl/crypto/x509v3/ |
| pcy_tree.c | 114 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++)
116 node = sk_X509_POLICY_NODE_value(plev->nodes, i);
316 /* Iterate through all in nodes linking matches */
317 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++)
319 node = sk_X509_POLICY_NODE_value(last->nodes, i);
362 /* Look for matching nodes in previous level */
426 /* Locate unmatched nodes */
451 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++)
453 node = sk_X509_POLICY_NODE_value(last->nodes, i);
461 * nodes
[all...] |
| /external/openssl/crypto/x509v3/ |
| pcy_tree.c | 114 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++)
116 node = sk_X509_POLICY_NODE_value(plev->nodes, i);
316 /* Iterate through all in nodes linking matches */
317 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++)
319 node = sk_X509_POLICY_NODE_value(last->nodes, i);
362 /* Look for matching nodes in previous level */
426 /* Locate unmatched nodes */
451 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++)
453 node = sk_X509_POLICY_NODE_value(last->nodes, i);
461 * nodes
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| LintOverlay.java | 64 Collection<Node> nodes = editor.getLintNodes(); local
65 if (nodes != null && !nodes.isEmpty()) {
68 nodes = Lists.newArrayList(nodes);
86 for (Node node : nodes) {
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
| pytree.py | 57 Compare two nodes for equality.
69 Compare two nodes for inequality.
79 Compare two nodes for equality.
81 This is called by __eq__ and __ne__. It is only called if the two nodes
83 Nodes should be considered equal if they have the same structure,
241 """Concrete implementation for interior nodes."""
251 child nodes, and an optional context keyword argument.
286 """Compare two nodes for equality."""
353 """Concrete implementation for leaf nodes."""
397 """Compare two nodes for equality.""
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
| pytree.py | 57 Compare two nodes for equality.
69 Compare two nodes for inequality.
79 Compare two nodes for equality.
81 This is called by __eq__ and __ne__. It is only called if the two nodes
83 Nodes should be considered equal if they have the same structure,
241 """Concrete implementation for interior nodes."""
251 child nodes, and an optional context keyword argument.
286 """Compare two nodes for equality."""
353 """Concrete implementation for leaf nodes."""
397 """Compare two nodes for equality.""
[all...] |
| /external/chromium_org/mojo/services/view_manager/ |
| test_change_tracker.cc | 108 std::vector<std::string> node_strings(changes[0].nodes.size());
109 for (size_t i = 0; i < changes[0].nodes.size(); ++i)
110 node_strings[i] = "[" + changes[0].nodes[i].ToString() + "]";
151 Array<NodeDataPtr> nodes) {
157 NodeDatasToTestNodes(nodes, &change.nodes);
161 void TestChangeTracker::OnRootsAdded(Array<NodeDataPtr> nodes) {
164 NodeDatasToTestNodes(nodes, &change.nodes);
190 Array<NodeDataPtr> nodes) {
[all...] |
| test_change_tracker.h | 52 std::vector<TestNode> nodes; member in struct:mojo::view_manager::service::Change
69 // Returns a string description of |changes[0].nodes|. Returns an empty string
103 Array<NodeDataPtr> nodes);
104 void OnRootsAdded(Array<NodeDataPtr> nodes);
111 Array<NodeDataPtr> nodes);
|
| view_manager_unittest.cc | 150 void GetNodeTree(Id node_id, std::vector<TestNode>* nodes) {
154 base::Unretained(this), nodes));
157 bool Embed(const std::vector<Id>& nodes) {
161 view_manager_->Embed(kTestServiceURL, Array<Id>::From(nodes),
242 void GotNodeTree(std::vector<TestNode>* nodes, Array<NodeDataPtr> results) {
243 NodeDatasToTestNodes(results, nodes);
302 Array<NodeDataPtr> nodes) OVERRIDE {
304 connection_id, creator_url, next_server_change_id, nodes.Pass());
306 virtual void OnRootsAdded(Array<NodeDataPtr> nodes) OVERRIDE {
307 tracker_.OnRootsAdded(nodes.Pass())
1092 std::vector<TestNode> nodes; local
1104 std::vector<TestNode> nodes; local
1115 std::vector<TestNode> nodes; local
1254 std::vector<TestNode> nodes; local
1294 std::vector<TestNode> nodes; local
[all...] |
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTreeNodeStream.java | 169 // 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]; local
332 nodes[i] = new CommonTree(new CommonToken((i+1)*10));
334 Tree g = nodes[0]
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/functions/ |
| FuncId.java | 43 * Fill in a list with nodes that match a space delimited list if ID
47 * @param docContext The document where the nodes are being looked for.
49 * @param usedrefs List of references for which nodes were found.
50 * @param nodeSet Node set where the nodes will be added to.
51 * @param mayBeMore true if there is another set of nodes to be looked for.
118 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager()); local
119 NodeSetDTM nodeSet = nodes.mutableNodeset();
140 return nodes;
149 return nodes;
|
| /external/chromium_org/chrome/browser/ui/webui/ |
| cookies_tree_model_util.h | 29 // Append the children nodes of |parent| in specified range to |nodes| list.
33 base::ListValue* nodes);
|
| /external/chromium_org/chrome/test/chromedriver/chrome/ |
| dom_tracker.h | 38 bool ProcessNodeList(const base::Value* nodes);
|
| /external/libsepol/src/ |
| node_internal.h | 5 #include <sepol/nodes.h>
|
| /hardware/ti/omap3/omx/core_plugin/omx_core_plugin/ |
| Android.mk | 19 $(PV_TOP)/nodes/pvmediaoutputnode/include \
20 $(PV_TOP)/nodes/pvdownloadmanagernode/config/opencore \
|
| /external/chromium_org/cc/resources/ |
| raster_worker_pool.cc | 230 for (TaskGraph::Node::Vector::iterator it = graph->nodes.begin();
231 it != graph->nodes.end();
249 DCHECK(std::find_if(graph->nodes.begin(),
250 graph->nodes.end(),
252 graph->nodes.end());
253 graph->nodes.push_back(TaskGraph::Node(task, priority, dependencies));
278 std::find_if(graph->nodes.begin(),
279 graph->nodes.end(),
281 if (decode_it == graph->nodes.end())
|
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/res/ |
| DrawableResourceLoader.java | 72 NodeList nodes = xmlDoc.getElementsByTagName("selector"); local
73 if (nodes != null && nodes.getLength() > 0) {
77 nodes = xmlDoc.getElementsByTagName("layer-list");
78 if (nodes != null && nodes.getLength() > 0) {
82 nodes = xmlDoc.getElementsByTagName("animation-list");
83 if (nodes != null && nodes.getLength() > 0) {
|
| /external/zopfli/src/zopfli/ |
| katajainen.c | 33 Nodes forming chains. Also used to represent leaves.
43 Memory pool for nodes.
46 Node* nodes; /* The pool. */ member in struct:NodePool
63 lists: If given, used to mark in-use nodes during garbage collection.
69 if (pool->next >= &pool->nodes[pool->size]) {
73 pool->nodes[i].inuse = 0;
83 pool->next = &pool->nodes[0];
228 pool.nodes = (Node*)malloc(pool.size * sizeof(*pool.nodes));
229 pool.next = pool.nodes;
[all...] |
| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_index.cc | 67 // query as well as the set of nodes that contain those terms in their titles.
72 // The set of nodes matching the terms. As an optimization this is empty
75 // the set of matching nodes is terms.front()->second.
78 // it handles the necessary switching between nodes and terms.front().
79 NodeSet nodes; member in struct:bookmarks::BookmarkIndex::Match
81 // Returns an iterator to the beginning of the matching nodes. See
82 // description of nodes for why this should be used over nodes.begin().
85 // Returns an iterator to the beginning of the matching nodes. See
86 // description of nodes for why this should be used over nodes.end()
179 NodeSet nodes; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 203 nodes = new Graph::Node * [graph->getSize() + 1];
206 nodes[graph->getSize()] = 0;
216 if (nodes)
217 delete[] nodes;
223 nodes[count++] = node;
230 nodes[count++] = node;
235 virtual void *get() const { return nodes[pos]; }
239 Graph::Node **nodes; member in class:nv50_ir::DFSIterator
259 nodes = new Graph::Node * [graph->getSize() + 1];
262 nodes[graph->getSize()] = 0
324 Graph::Node **nodes; member in class:nv50_ir::CFGIterator
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 203 nodes = new Graph::Node * [graph->getSize() + 1];
206 nodes[graph->getSize()] = 0;
216 if (nodes)
217 delete[] nodes;
223 nodes[count++] = node;
230 nodes[count++] = node;
235 virtual void *get() const { return nodes[pos]; }
239 Graph::Node **nodes; member in class:nv50_ir::DFSIterator
259 nodes = new Graph::Node * [graph->getSize() + 1];
262 nodes[graph->getSize()] = 0
324 Graph::Node **nodes; member in class:nv50_ir::CFGIterator
[all...] |
| /external/chromium_org/chrome/browser/ui/bookmarks/ |
| bookmark_utils.cc | 48 // for nodes that are urls, or the URLs for the children of non-url urls.
52 // OpenURLIterator iterator(nodes);
59 explicit OpenURLIterator(const std::vector<const BookmarkNode*>& nodes)
62 parent_(nodes.begin()),
63 end_(nodes.end()) {
112 const std::vector<const BookmarkNode*>& nodes) {
114 OpenURLIterator iterator(nodes);
130 // Returns the total number of descendants nodes.
190 const std::vector<const BookmarkNode*>& nodes,
193 if (!ShouldOpenAll(parent, nodes))
235 std::vector<const BookmarkNode*> nodes; local
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/ |
| node.py | 78 return [x for x in self.nodes() if isinstance(x,cls)]
107 def nodes(self): member in class:Node
111 for j in i.nodes():
165 nodes = [self]
168 while nodes:
169 assert len(nodes)==len(idxs)==len(itemss)
170 node = nodes[-1]
177 nodes.pop(-1)
180 if not nodes:
181 #for node0 in self.nodes()
[all...] |
