| /external/antlr/antlr-3.4/runtime/Python/tests/ |
| t047treeparser.py | 64 nodes = antlr3.tree.CommonTreeNodeStream(r.tree)
65 nodes.setTokenStream(tStream)
66 walker = self.getWalker(nodes)
113 nodes = antlr3.tree.CommonTreeNodeStream(r.tree)
114 nodes.setTokenStream(tStream)
115 walker = self.getWalker(nodes)
|
| /external/chromium_org/chrome/browser/extensions/api/bookmarks/ |
| bookmark_api_helpers.cc | 26 std::vector<linked_ptr<BookmarkTreeNode> >* nodes,
33 nodes->push_back(new_node);
88 std::vector<linked_ptr<BookmarkTreeNode> >* nodes,
90 return AddNodeHelper(node, nodes, recurse, false);
94 std::vector<linked_ptr<BookmarkTreeNode> >* nodes,
96 return AddNodeHelper(node, nodes, recurse, true);
|
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathResult.cpp | 155 const NodeSet& nodes = m_value.toNodeSet(); local
157 return nodes.firstNode();
159 return nodes.anyNode();
210 const NodeSet& nodes = m_value.toNodeSet(); local
211 if (index >= nodes.size())
214 return nodes[index];
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| 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); local
242 if (nodes == null)
244 nodes = new XNodeSet(node, xctxt.getDTMManager());
245 nodes.nextNode();
246 m_refsTable.put(ref, nodes);
250 // Nodes are passed to this method in document order. Since we need to
252 // in each nodeset. We use nodes.nextNode after each entry so we can
254 if (nodes.getCurrentNode() != node) {
255 nodes.mutableNodeset().addNode(node)
[all...] |
| /external/chromium/chrome/browser/history/ |
| query_parser.h | 76 // Parses the query words in query, returning the nodes that constitute the
79 // Ownership of the nodes passes to the caller.
81 std::vector<QueryNode*>* nodes);
90 // Returns true if the string text matches the query nodes created by a call
94 const std::vector<QueryNode*>& nodes,
98 // Does the work of parsing a query; creates nodes in QueryNodeList as
|
| /external/llvm/lib/CodeGen/ |
| SpillPlacement.h | 47 Node *nodes; member in class:llvm::SpillPlacement
49 // Nodes that are active in the current computation. Owned by the prepare()
53 // Nodes with active links. Populated by scanActiveBundles.
56 // Nodes that went positive during the last call to scanActiveBundles or
66 SpillPlacement() : MachineFunctionPass(ID), nodes(0) {}
121 /// Return true is there are any positive nodes.
|
| /system/core/sh/ |
| Android.mk | 20 nodes.c \
45 p4 edit init.c nodes.c nodes.h token.h
51 sh ./mknodes.sh nodetypes nodes.c.pat .
|
| /external/chromium_org/content/browser/accessibility/ |
| browser_accessibility_mac.h | 26 virtual void DetachTree(std::vector<BrowserAccessibility*>* nodes) OVERRIDE;
|
| /external/chromium_org/third_party/WebKit/Source/core/inspector/ |
| InspectorMemoryAgent.h | 53 virtual void getDOMCounters(ErrorString*, int* documents, int* nodes, int* jsEventListeners);
|
| /external/chromium_org/chrome/browser/bookmarks/ |
| bookmark_utils.h | 25 // Clones bookmark node, adding newly created nodes to |parent| starting at
35 // Copies nodes onto the clipboard. If |remove_nodes| is true the nodes are
36 // removed after copied to the clipboard. The nodes are copied in such a way
39 const std::vector<const BookmarkNode*>& nodes,
42 // Pastes from the clipboard. The new nodes are added to |parent|, unless
43 // |parent| is null in which case this does nothing. The nodes are inserted
44 // at |index|. If |index| is -1 the nodes are added to the end.
58 // only nodes of type url.
61 std::vector<const BookmarkNode*>* nodes);
[all...] |
| bookmark_node_data.cc | 110 const std::vector<const BookmarkNode*>& nodes) {
111 ReadFromVector(nodes);
127 const std::vector<const BookmarkNode*>& nodes) {
130 if (nodes.empty())
133 for (size_t i = 0; i < nodes.size(); ++i)
134 elements.push_back(Element(nodes[i]));
247 std::vector<const BookmarkNode*> nodes; local
250 return nodes;
256 nodes.clear();
257 return nodes;
265 std::vector<const BookmarkNode*> nodes = GetNodes(profile); local
[all...] |
| /external/chromium_org/chrome/browser/history/ |
| query_parser.h | 82 // Parses |query|, returning the nodes that constitute the valid words in the
84 // the nodes passes to the caller.
86 std::vector<QueryNode*>* nodes);
88 // Returns true if the string text matches the query nodes created by a call
92 const std::vector<QueryNode*>& nodes,
95 // Returns true if all of the |words| match the query |nodes| created by a
98 const std::vector<QueryNode*>& nodes);
105 // Does the work of parsing |query|; creates nodes in |root| as appropriate.
|
| /external/chromium_org/third_party/freetype/src/cache/ |
| 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, node )
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/x509v3/ |
| pcy_lib.c | 115 if (level->nodes)
116 n += sk_X509_POLICY_NODE_num(level->nodes);
130 return sk_X509_POLICY_NODE_value(level->nodes, i);
|
| /external/freetype/src/cache/ |
| 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, node )
[all...] |
| /external/openssl/crypto/x509v3/ |
| pcy_lib.c | 115 if (level->nodes)
116 n += sk_X509_POLICY_NODE_num(level->nodes);
130 return sk_X509_POLICY_NODE_value(level->nodes, i);
|
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/res/ |
| XpathResourceXmlLoader.java | 23 NodeList nodes = (NodeList) stringsXPath.evaluate(document, XPathConstants.NODESET); local
24 for (int i = 0; i < nodes.getLength(); i++) {
25 Node node = nodes.item(i);
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_node_data.cc | 105 const std::vector<const BookmarkNode*>& nodes) {
106 ReadFromVector(nodes);
113 const std::vector<const BookmarkNode*>& nodes) {
116 if (nodes.empty())
119 for (size_t i = 0; i < nodes.size(); ++i)
120 elements.push_back(Element(nodes[i]));
293 std::vector<const BookmarkNode*> nodes; local
296 return nodes;
302 nodes.clear();
303 return nodes;
311 std::vector<const BookmarkNode*> nodes = GetNodes(profile); local
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/tree-parser/ |
| basic.rb | 37 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
38 nodes.token_stream = tokens
39 walker = FlatListWalker::TreeParser.new( nodes )
73 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
74 nodes.token_stream = tokens
75 walker = SimpleTreeWalker::TreeParser.new( nodes )
112 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
113 nodes.token_stream = tokens
114 walker = FlatVsTreeDecisionWalker::TreeParser.new( nodes )
150 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| FuncKey.java | 61 XNodeSet nodes = null; local
138 nodes = new XNodeSet(upi);
143 nodes = kmgr.getNodeSetDTMByKey(xctxt, docContext, keyname,
146 nodes.setRoot(xctxt.getCurrentNode(), xctxt);
149 return nodes;
|
| /libcore/dom/src/test/java/org/w3c/domts/level2/core/ |
| documentimportnode21.java | 40 * second element node whose tagName is address and import these nodes into another document.
41 * Verify if the nodes have been imported correctly by checking the nodeNames of the
42 * imported nodes, since they are imported into a new document which doesnot have thes defined,
43 * the imported nodes should not have any children.
44 * Now import the entityRef nodes into the same document and verify if the nodes have been
45 * imported correctly by checking the nodeNames of the imported nodes, and by checking the
46 * value of the replacement text of the imported nodes.
97 NodeList nodes; local
120 nodes = entRefImp2.getChildNodes()
[all...] |
| /external/chromium_org/chrome/browser/ui/bookmarks/ |
| bookmark_utils.cc | 38 // for nodes that are urls, or the URLs for the children of non-url urls.
42 // OpenURLIterator iterator(nodes);
49 explicit OpenURLIterator(const std::vector<const BookmarkNode*>& nodes)
52 parent_(nodes.begin()),
53 end_(nodes.end()) {
102 const std::vector<const BookmarkNode*>& nodes) {
104 OpenURLIterator iterator(nodes);
120 // Returns the total number of descendants nodes.
147 const std::vector<const BookmarkNode*>& nodes,
150 if (!ShouldOpenAll(parent, nodes))
192 std::vector<const BookmarkNode*> nodes; local
[all...] |
| /external/chromium_org/chrome/browser/resources/ |
| 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[i]
[all...] |
| /external/chromium_org/chrome/browser/ui/views/bookmarks/ |
| bookmark_drag_drop_views.cc | 23 const std::vector<const BookmarkNode*>& nodes,
25 DCHECK(!nodes.empty());
29 BookmarkNodeData drag_data(nodes);
113 std::vector<const BookmarkNode*> nodes = data.GetNodes(profile); local
114 for (size_t i = 0; i < nodes.size(); ++i) {
116 // nodes being dragged.
117 const BookmarkNode* node = nodes[i];
119 drop_parent->GetIndexOf(nodes[i]) : -1;
|
| /external/smack/src/org/jivesoftware/smackx/provider/ |
| VCardProvider.java | 142 List<Node> nodes = new ArrayList<Node>(childNodeCount); local
144 nodes.add(childNodes.item(i));
148 for (Node n : nodes) {
166 NodeList nodes = document.getElementsByTagName("USERID"); local
167 if (nodes == null) return;
168 for (int i = 0; i < nodes.getLength(); i++) {
169 Element element = (Element) nodes.item(i);
183 NodeList nodes = allPhones.item(i).getChildNodes(); local
187 for (int j = 0; j < nodes.getLength(); j++) {
188 Node node = nodes.item(j)
249 NodeList nodes = document.getElementsByTagName(tag); local
[all...] |
