Searched refs:nodes (Results 201 - 225 of 447) sorted by relevance

1234567891011>>

/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Ddot.rb43 Abstract Syntax Tree nodes.
78 | <%= @nodes.join("\n ") %>
109 tree_template = Context.new( tree_template, :nodes => [], :edges => [] )
125 tree_template[ :nodes ] << parent_node_template
134 tree_template[ :nodes ] << node_template
/external/apache-xml/src/main/java/org/apache/xalan/templates/
H A DFuncDocument.java103 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager());
104 return nodes;
144 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager());
145 NodeSetDTM mnl = nodes.mutableNodeset();
196 // nodes.mutableNodeset().addNode(newDoc);
210 return nodes;
/external/chromium_org/mojo/services/view_manager/
H A Dview_manager_service_impl.cc23 // Places |node| in |nodes| and recurses through the children.
24 void GetDescendants(const Node* node, std::vector<const Node*>* nodes) { argument
28 nodes->push_back(node);
32 GetDescendants(children[i], nodes);
57 // We're about to destroy all our nodes. Detach any views from them.
263 return false; // Both nodes must be valid.
405 std::vector<const Node*>* nodes) {
409 nodes->push_back(node);
413 GetUnknownNodesFrom(children[i], nodes);
490 // On getting a new parent we may need to communicate new nodes t
403 GetUnknownNodesFrom( const Node* node, std::vector<const Node*>* nodes) argument
517 NodesToNodeDatas( const std::vector<const Node*>& nodes) argument
631 std::vector<const Node*> nodes; local
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_ra.cpp663 inline RIG_Node *getNode(const LValue *v) const { return &nodes[v->id]; }
693 RIG_Node *nodes; member in class:nv50_ir::GCRA
722 if (!nodes[i].colors)
726 nodes[i].f,nodes[i].reg,nodes[i].colors,
727 nodes[i].weight,
728 nodes[i].degree, nodes[i].degreeLimit);
730 for (Graph::EdgeIterator ei = nodes[
[all...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_ra.cpp663 inline RIG_Node *getNode(const LValue *v) const { return &nodes[v->id]; }
693 RIG_Node *nodes; member in class:nv50_ir::GCRA
722 if (!nodes[i].colors)
726 nodes[i].f,nodes[i].reg,nodes[i].colors,
727 nodes[i].weight,
728 nodes[i].degree, nodes[i].degreeLimit);
730 for (Graph::EdgeIterator ei = nodes[
[all...]
/external/chromium_org/net/tools/tld_cleanup/
H A Dmake_dafsa_unittest.py137 """Tests a sequence of nodes are preoperly expanded."""
569 """Tests we can reverse both edges and nodes in a diamond."""
598 nodes = [ node1 ]
599 self.assertEqual(make_dafsa.top_sort(source), nodes)
602 """Tests nodes in a diamond can be sorted."""
615 nodes = make_dafsa.top_sort(source)
616 self.assertLess(nodes.index(node1), nodes.index(node2))
617 self.assertLess(nodes.index(node2), nodes
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/sources/
H A DNavigatorView.js269 var nodes = this._uiSourceCodeNodes.values();
270 for (var i = 0; i < nodes.length; ++i)
271 nodes[i].dispose();
529 var nodes = this._uiSourceCodeNodes.values();
530 for (var i = 0; i < nodes.length; ++i) {
531 var uiSourceCode = nodes[i].uiSourceCode();
1392 var nodes = [];
1395 nodes.push(treeNode);
1403 for (var i = 0; i < nodes.length; ++i) {
1404 delete nodes[
[all...]
/external/chromium_org/third_party/handlebar/
H A Dhandlebar.py155 # [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
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DGrammarAST.java50 * class to track variables for many different kinds of nodes. It wastes
51 * space for nodes that don't need the values and OO principles cry out
75 /** This is used for TREE_BEGIN nodes to point into
81 /** Rule ref nodes, token refs, set, and NOT set refs need to track their
402 List<GrammarAST> nodes = new ArrayList<GrammarAST>();
403 _findAllType(ttype, nodes);
404 return nodes;
407 public void _findAllType(int ttype, List<GrammarAST> nodes) { argument
409 if ( this.getType()==ttype ) nodes.add(this);
413 child._findAllType(ttype, nodes);
[all...]
/external/doclava/res/assets/templates/assets/
H A Ddoclava-developer-docs.js449 var nodes = $("#header-tabs").find("."+lang);
450 for (i=0; i < nodes.length; i++) { // for each node in this language
451 var node = $(nodes[i]);
463 var nodes = $("#side-nav").find("."+lang);
464 for (i=0; i < nodes.length; i++) { // for each node in this language
465 var node = $(nodes[i]);
/external/chromium_org/chrome/browser/sync/test/integration/
H A Dbookmarks_helper.cc135 // Returns the number of nodes of node type |node_type| in |model| whose
141 // Walk through the model tree looking for bookmark nodes of node type
726 std::vector<const BookmarkNode*> nodes; local
727 GetBookmarkModel(profile)->GetNodesByURL(node->url(), &nodes);
728 EXPECT_TRUE(nodes.size() >= 1);
729 for (std::vector<const BookmarkNode*>::const_iterator it = nodes.begin();
730 it != nodes.end(); ++it) {
742 std::vector<const BookmarkNode*> nodes; local
743 GetBookmarkModel(profile)->GetNodesByURL(url, &nodes);
744 return !nodes
748 std::vector<const BookmarkNode*> nodes; local
[all...]
/external/chromium_org/mojo/services/public/cpp/view_manager/lib/
H A Dview_manager_client_impl.cc62 const Array<NodeDataPtr>& nodes) {
66 for (size_t i = 0; i < nodes.size(); ++i) {
67 if (last_node && nodes[i]->parent_id == last_node->id()) {
70 while (parents.back()->id() != nodes[i]->parent_id)
76 nodes[i]->node_id,
77 nodes[i]->view_id,
78 nodes[i]->bounds.To<gfx::Rect>());
674 Array<NodeDataPtr> nodes) {
681 AddRoot(BuildNodeTree(this, nodes));
684 void ViewManagerClientImpl::OnRootsAdded(Array<NodeDataPtr> nodes) { argument
61 BuildNodeTree(ViewManagerClientImpl* client, const Array<NodeDataPtr>& nodes) argument
670 OnViewManagerConnectionEstablished( ConnectionSpecificId connection_id, const String& creator_url, Id next_server_change_id, Array<NodeDataPtr> nodes) argument
701 OnNodeHierarchyChanged( Id node_id, Id new_parent_id, Id old_parent_id, Id server_change_id, mojo::Array<NodeDataPtr> nodes) argument
[all...]
/external/chromium_org/third_party/openssl/openssl/apps/
H A DCA.sh58 echo "usage: $0 -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify" >&2
96 -newreq-nodes)
98 $REQ -new -nodes -keyout newreq.pem -out newreq.pem $DAYS
/external/deqp/scripts/log/
H A Dlog_to_xml.py81 def findFirstElementByName (nodes, name):
82 for node in nodes:
/external/libsepol/
H A DAndroid.mk27 src/nodes.c \
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/
H A Dast.ml5 (* expr - Base type for all expression nodes. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/
H A Dast.ml5 (* expr - Base type for all expression nodes. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/
H A Dast.ml5 (* expr - Base type for all expression nodes. *)
/external/okhttp/samples/crawler/src/main/java/com/squareup/okhttp/sample/
H A DCrawler.java36 import org.jsoup.nodes.Document;
37 import org.jsoup.nodes.Element;
/external/openssl/apps/
H A DCA.sh58 echo "usage: $0 -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify" >&2
96 -newreq-nodes)
98 $REQ -new -nodes -keyout newreq.pem -out newreq.pem $DAYS
/external/apache-xml/src/main/java/org/apache/xalan/transformer/
H A DNodeSorter.java35 * This class can sort vectors of DOM nodes according to a select pattern.
65 * Given a vector of nodes, sort each node according to
87 // based on the input vector of nodes
88 Vector nodes = new Vector();
94 nodes.addElement(elem);
99 mergesort(nodes, scratchVector, 0, n - 1, support);
101 // return sorted vector of nodes
104 v.setItem(((NodeCompareElem) nodes.elementAt(i)).m_node, i);
114 * Return the results of a compare of two nodes.
122 * @return The results of the compare of the two nodes
[all...]
/external/chromium_org/cc/resources/
H A Dtask_graph_runner_perftest.cc234 DCHECK(graph->nodes.empty());
240 graph->nodes.push_back(TaskGraph::Node(it->get(), 0u, 0u));
246 graph->nodes.push_back(TaskGraph::Node(it->get(), 0u, leaf_tasks.size()));
265 graph->nodes.push_back(TaskGraph::Node(it->get(), 0u, tasks.size()));
/external/chromium_org/chrome/browser/ui/ash/accessibility/
H A Dautomation_manager_ash.cc106 content::AXEventNotificationDetails detail(update.nodes,
/external/chromium_org/content/common/
H A Daccessibility_messages.h51 IPC_STRUCT_TRAITS_MEMBER(nodes)
/external/chromium_org/third_party/WebKit/Source/web/tests/
H A DTouchActionTest.cpp204 RefPtrWillBePersistent<WebCore::StaticNodeList> nodes = root->querySelectorAll("[expected-action]", es); local
207 for (unsigned index = 0; index < nodes->length(); index++) {
208 WebCore::Element* element = toElement(nodes->item(index));
210 ASSERT_TRUE(nodes->item(index)->isElementNode());

Completed in 1010 milliseconds

1234567891011>>