/external/chromium_org/tools/grit/grit/tool/ |
H A D | android2grd.py | 295 nodes = android_string.childNodes 297 for i, node in enumerate(nodes): 298 # Handle text nodes. 320 # Handle other nodes. 324 is_last_node = (i == len(nodes) - 1) 326 (is_last_node or nodes[i + 1].nodeType == Node.ELEMENT_NODE)):
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
H A D | RFC3280CertPathUtilities.java | 1022 List nodes = policyNodes[k]; 1023 for (int l = 0; l < nodes.size(); l++) 1025 PKIXPolicyNode node2 = (PKIXPolicyNode)nodes.get(l); 1411 List nodes = policyNodes[j]; 1413 for (int k = 0; k < nodes.size(); k++) 1415 PKIXPolicyNode node = (PKIXPolicyNode)nodes.get(k); 1437 List nodes = policyNodes[i]; 1438 for (int j = 0; j < nodes.size(); j++) 1440 PKIXPolicyNode node = (PKIXPolicyNode)nodes.get(j); 2466 List nodes [all...] |
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | Range.cpp | 709 // in which case the last lot of nodes either goes from the first or last 731 if (processStart && originalStart.container() != commonRoot) // processStart contains nodes before m_start. 761 NodeVector nodes; local 763 nodes.append(n); 764 processNodes(action, nodes, commonRoot, fragment, es); 832 // FIXME: Should we assert that some nodes never appear here? 841 Vector<RefPtr<Node> > nodes; local 845 nodes.append(n); 847 processNodes(action, nodes, container, result, es); 854 void Range::processNodes(ActionType action, Vector<RefPtr<Node> >& nodes, PassRefPt argument 895 NodeVector nodes; local [all...] |
/external/chromium_org/third_party/libxml/src/ |
H A D | c14n.c | 43 int nsCurEnd; /* number of nodes in the set */ 48 xmlNodePtr *nodeTab; /* array of nodes in no particular order */ 90 static int xmlC14NIsNodeInNodeset (xmlNodeSetPtr nodes, 253 xmlC14NIsNodeInNodeset(xmlNodeSetPtr nodes, xmlNodePtr node, xmlNodePtr parent) { argument 254 if((nodes != NULL) && (node != NULL)) { 256 return(xmlXPathNodeSetContains(nodes, node)); 273 return(xmlXPathNodeSetContains(nodes, (xmlNodePtr)&ns)); 570 * Consider a list L containing only namespace nodes in the 577 * namespace node in the node-set (default namespace nodes always 589 * ancestor nodes o 1967 xmlC14NDocSaveTo(xmlDocPtr doc, xmlNodeSetPtr nodes, int mode, xmlChar ** inclusive_ns_prefixes, int with_comments, xmlOutputBufferPtr buf) argument 2002 xmlC14NDocDumpMemory(xmlDocPtr doc, xmlNodeSetPtr nodes, int mode, xmlChar ** inclusive_ns_prefixes, int with_comments, xmlChar ** doc_txt_ptr) argument 2073 xmlC14NDocSave(xmlDocPtr doc, xmlNodeSetPtr nodes, int mode, xmlChar ** inclusive_ns_prefixes, int with_comments, const char *filename, int compression) argument [all...] |
/external/libxml2/ |
H A D | c14n.c | 43 int nsCurEnd; /* number of nodes in the set */ 48 xmlNodePtr *nodeTab; /* array of nodes in no particular order */ 90 static int xmlC14NIsNodeInNodeset (xmlNodeSetPtr nodes, 253 xmlC14NIsNodeInNodeset(xmlNodeSetPtr nodes, xmlNodePtr node, xmlNodePtr parent) { argument 254 if((nodes != NULL) && (node != NULL)) { 256 return(xmlXPathNodeSetContains(nodes, node)); 273 return(xmlXPathNodeSetContains(nodes, (xmlNodePtr)&ns)); 570 * Consider a list L containing only namespace nodes in the 577 * namespace node in the node-set (default namespace nodes always 589 * ancestor nodes o 1967 xmlC14NDocSaveTo(xmlDocPtr doc, xmlNodeSetPtr nodes, int mode, xmlChar ** inclusive_ns_prefixes, int with_comments, xmlOutputBufferPtr buf) argument 2002 xmlC14NDocDumpMemory(xmlDocPtr doc, xmlNodeSetPtr nodes, int mode, xmlChar ** inclusive_ns_prefixes, int with_comments, xmlChar ** doc_txt_ptr) argument 2073 xmlC14NDocSave(xmlDocPtr doc, xmlNodeSetPtr nodes, int mode, xmlChar ** inclusive_ns_prefixes, int with_comments, const char *filename, int compression) argument [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/ |
H A D | wizard.rb | 88 # extract nodes matching a pattern 94 # iterate through the tree and extract nodes with pattern labels 278 to validate tree structures as well as to extract nodes that match the pattern. 360 nodes = [] 361 visit( tree, type ) { | t, | nodes << t } 362 return nodes 474 nodes = context.split( /\s+/ ) 476 while tree = @adaptor.parent( tree ) and node = nodes.pop 478 node = nodes.pop or return( true ) 486 return( false ) if tree.nil? and not nodes [all...] |
/external/chromium/chrome/browser/extensions/ |
H A D | extension_bookmarks_module.cc | 347 std::vector<const BookmarkNode*> nodes; local 348 bookmark_utils::GetMostRecentlyAddedEntries(model, number_of_items, &nodes); 349 std::vector<const BookmarkNode*>::iterator i = nodes.begin(); 350 for (; i != nodes.end(); ++i) { 374 std::vector<const BookmarkNode*> nodes; local 377 lang, &nodes); 378 std::vector<const BookmarkNode*>::iterator i = nodes.begin(); 379 for (; i != nodes.end(); ++i) {
|
/external/chromium/chrome/browser/ui/webui/ |
H A D | cookies_tree_model_util.cc | 188 ListValue* nodes) { 193 nodes->Append(dict); 187 GetChildNodeList(CookieTreeNode* parent, int start, int count, ListValue* nodes) argument
|
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/layout_package/ |
H A D | json_results_generator_unittest.py | 181 nodes = path.split("/") 183 for node in nodes:
|
/external/chromium_org/third_party/openssl/openssl/apps/ |
H A D | CA.pl.in | 8 # CA -newreq[-nodes] ... will generate a certificate request 67 print STDERR "usage: CA -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify\n"; 79 } elsif (/^-newreq-nodes$/) { 81 system ("$REQ -new -nodes -keyout newkey.pem -out newreq.pem $DAYS"); 167 print STDERR "usage: CA -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify\n";
|
/external/llvm/bindings/ocaml/analysis/ |
H A D | llvm_analysis.mli | 43 include the contents of basic blocks into the nodes.
|
/external/openssl/apps/ |
H A D | CA.pl.in | 8 # CA -newreq[-nodes] ... will generate a certificate request 67 print STDERR "usage: CA -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify\n"; 79 } elsif (/^-newreq-nodes$/) { 81 system ("$REQ -new -nodes -keyout newkey.pem -out newreq.pem $DAYS"); 167 print STDERR "usage: CA -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify\n";
|
/external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/ |
H A D | gUnitBaseTest.java | 366 // Walk resulting tree; create tree nodes stream first 367 CommonTreeNodeStream nodes; 369 nodes = new CommonTreeNodeStream(customTreeAdaptor, tree); 372 nodes = new CommonTreeNodeStream(tree); 374 // AST nodes have payload that point into token stream 375 nodes.setTokenStream(tokens); 376 // Create a tree walker attached to the nodes stream 380 Object[] treeParArgs = new Object[]{nodes}; // assign value to tree parser's args
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | RenderNamedFlowThread.cpp | 65 // The flow thread can be destroyed without unregistering the content nodes if the document is destroyed. 66 // This can lead to problems because the nodes are still marked as belonging to a flow thread. 145 // based on their corresponding nodes DOM order. The list is needed to avoid searching the whole DOM. 197 // If the regions belong to different nodes, compare their position in the DOM. 437 // The content nodes list contains those nodes with -webkit-flow-into: flow. 438 // An element with display:none should also be listed among those nodes. 439 // The list of nodes is ordered. 585 Vector<Node*> nodes; local 589 if (!isContainedInNodes(nodes, nod [all...] |
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
H A D | BaseTreeAdaptor.as | 13 * expensive: we have to create a hashtable with all tree nodes in it. 25 * If you specify your own kind of tree nodes, you will likely have to 105 * constructing these nodes so we should have this control for 213 /** Tell me how to create a token for use with imaginary token nodes. 225 /** Tell me how to create a token for use with imaginary token nodes.
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
H A D | DataGrid.js | 179 var nodes = []; 187 nodes.push(node); 191 var length = nodes.length; 193 dataGrid.rootNode().appendChild(nodes[i]); 199 var nodes = dataGrid._rootNode.children.slice(); 204 for (var i = 0; i < nodes.length; i++) { 205 var value = nodes[i].data[sortColumnIdentifier]; 232 nodes.sort(comparator); 234 for (var i = 0; i < nodes.length; i++) 235 dataGrid._rootNode.appendChild(nodes[ [all...] |
/external/chromium_org/content/browser/accessibility/ |
H A D | browser_accessibility_win_unittest.cc | 150 // to get new references to two of the three nodes in the tree. 166 // Now delete the manager, and only one of the three nodes in the tree 231 param.nodes.push_back(text); 303 param.nodes.push_back(root); 613 msg->nodes.push_back(tree1_1); 614 msg->nodes.push_back(tree1_2); 638 msg->nodes.clear(); 639 msg->nodes.push_back(tree2_1); 640 msg->nodes.push_back(tree2_2);
|
/external/chromium/chrome/browser/ui/gtk/bookmarks/ |
H A D | bookmark_bar_gtk.cc | 462 // We only care about nodes on the bookmark bar. 481 // We only care about nodes on the bookmark bar. 982 std::vector<const BookmarkNode*> nodes; local 984 nodes.push_back(node); 987 nodes.push_back(node); 991 nodes.push_back(parent); 997 window, this, profile_, page_navigator_, parent, nodes)); 1294 std::vector<const BookmarkNode*> nodes = local 1300 DCHECK(!nodes.empty()); 1301 for (std::vector<const BookmarkNode*>::iterator it = nodes [all...] |
/external/antlr/antlr-3.4/runtime/Python/antlr3/ |
H A D | treewizard.py | 310 In order to create nodes and navigate, this class needs a TreeAdaptor. 313 iterating over the various nodes with a particular type. 370 """Walk the entire tree and make a node name to nodes mapping. 418 """Return a List of tree nodes with token type ttype""" 420 nodes = [] 423 nodes.append(tree) 427 return nodes 466 all nodes of that type (this is faster than the pattern match). 524 on the various nodes and '.' (dot) as the node/subtree wildcard, 526 the labels pointing at the appropriate nodes [all...] |
/external/chromium/chrome/common/extensions/docs/js/ |
H A D | api_page_generator.js | 272 var nodes = root.getElementsByTagName("*"); 273 for (var i = 0; i < nodes.length; i++) { 274 var n = nodes[i] 303 // will not effect any nodes.
|
/external/chromium_org/remoting/webapp/ |
H A D | format_iq.js | 112 * @param {Node} query Xml query node with jingleinfo in the child nodes. 117 var nodes = query.childNodes; 120 for (var i = 0; i < nodes.length; i++) { 122 var node = nodes[i]; 173 * info contained in child nodes. 248 * child nodes. 272 * nodes. 328 * @param {Node} jingle Xml node with jingle action contained in child nodes. 349 * @param {Node} error Xml node containing error information in child nodes.
|
/external/doclava/res/assets/templates/assets/ |
H A D | doclava-developer-reference.js | 190 // perform api level toggling because new nodes are new to the DOM 235 var nodes = data; 237 for (var i in nodes) { 238 var d = nodes[i];
|
/external/chromium/net/disk_cache/ |
H A D | rankings.h | 100 CacheRankingsBlock* nodes[3]; // Nodes on the first three lists. member in struct:disk_cache::Rankings::Iterator 130 // Controls tracking of nodes used for enumerations. 176 // Checks the links between two consecutive nodes.
|
/external/chromium_org/chrome/browser/sync/glue/ |
H A D | bookmark_change_processor.h | 128 // Update transaction version of |model| and |nodes| to |new_version| if 133 const std::vector<const BookmarkNode*>& nodes); 172 // Remove all sync nodes, except the permanent nodes. 180 // Remove all the sync nodes associated with |node| and its children.
|
/external/chromium_org/chrome/browser/ui/cocoa/bookmarks/ |
H A D | bookmark_editor_base_controller.h | 101 // Expands the set of BookmarkNodes in |nodes|. 102 - (void)expandNodes:(const BookmarkExpandedStateTracker::Nodes&)nodes; 172 // Create any newly added folders. New folders are nodes in folderTreeArray
|