| /external/chromium_org/third_party/libxml/src/ |
| 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) {
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 of each orphan element node for attributes in the xml
[all...] |
| /external/libxml2/ |
| c14n.c | 45 int nsCurEnd; /* number of nodes in the set */
50 xmlNodePtr *nodeTab; /* array of nodes in no particular order */
92 static int xmlC14NIsNodeInNodeset (xmlNodeSetPtr nodes,
255 xmlC14NIsNodeInNodeset(xmlNodeSetPtr nodes, xmlNodePtr node, xmlNodePtr parent) {
256 if((nodes != NULL) && (node != NULL)) {
258 return(xmlXPathNodeSetContains(nodes, node));
275 return(xmlXPathNodeSetContains(nodes, (xmlNodePtr)&ns));
572 * Consider a list L containing only namespace nodes in the
579 * namespace node in the node-set (default namespace nodes always
591 * ancestor nodes of each orphan element node for attributes in the xm
[all...] |
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| RewriteRuleSubtreeStream.js | 26 // since this is for making root nodes).
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/ |
| 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.empty
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/injected/ |
| live_regions_deprecated.js | 170 // and just speak any additions (which includes changed nodes).
210 * describing atomic nodes or leaf nodes in the subtree rooted
234 // Recursively add descriptions of child nodes.
|
| /external/chromium_org/chrome/browser/ui/webui/ |
| sync_internals_message_handler.cc | 149 scoped_ptr<base::ListValue> nodes) {
152 id, *nodes);
|
| /external/chromium_org/mojo/services/view_manager/ |
| view_manager_service_impl.h | 139 // to |nodes|, marks |node| as known and recurses.
140 void GetUnknownNodesFrom(const Node* node, std::vector<const Node*>* nodes);
143 // recurse through nodes that were created by this connection.
146 // Adds |node_ids| to roots, returning true if at least one of the nodes was
147 // not already a root. If at least one of the nodes was not already a root
156 // is returned, any nodes that need to be sent to the client are added to
163 // Converts an array of Nodes to NodeDatas. This assumes all the nodes are
164 // valid for the client. The parent of nodes the client is not allowed to see
166 Array<NodeDataPtr> NodesToNodeDatas(const std::vector<const Node*>& nodes);
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/layout_package/ |
| json_results_generator_unittest.py | 181 nodes = path.split("/")
183 for node in nodes:
|
| /external/chromium_org/third_party/jstemplate/ |
| jstemplate_test.js | 165 assertEquals('assertAttributesMatch: number of child nodes',
172 assertEquals('assertAttributesMatch: number of attribute nodes',
299 // Skip pre-processed nodes. Preprocessed nodes are those with a
|
| /external/chromium_org/third_party/openssl/openssl/apps/ |
| 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/deqp/scripts/log/ |
| log_to_xml.py | 81 def findFirstElementByName (nodes, name):
82 for node in nodes:
|
| /external/doclava/src/com/google/doclava/ |
| PageMetadata.java | 54 * to parent/child elements in the tree metadata nodes for all pages.
89 * Given a list of metadata nodes organized by type, sort the
90 * root nodes by type name and render the types and their child
91 * metadata nodes to a json file in the out dir.
93 * @param rootTypeNodesList A list of root metadata nodes, each
191 org.w3c.dom.NodeList nodes = (org.w3c.dom.NodeList) ItempropDescExpr.evaluate(htmlNode, local
193 if (nodes.getLength() > 0) {
194 for (int i = 0; i < nodes.getLength(); i++) {
195 String tx = nodes.item(i).getNodeValue();
203 nodes = (org.w3c.dom.NodeList) FirstParaExpr.evaluate(htmlNode, XPathConstants.NODESET)
[all...] |
| /external/llvm/bindings/ocaml/analysis/ |
| llvm_analysis.mli | 43 include the contents of basic blocks into the nodes.
|
| /external/openssl/apps/ |
| 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";
|
| /prebuilts/python/darwin-x86/2.7.5/share/pretty-printers/libstdcxx/gcc-4.6/ |
| printers.py | 246 nodes = self.head.type.fields ()
247 if len (nodes) != 1:
251 self.head = self.head.cast (nodes[0].type)
258 nodes = self.head.type.fields ()
260 if len (nodes) == 0:
263 if len (nodes) != 2:
264 raise ValueError, "Cannot parse more than 2 nodes in a tuple tree."
270 impl = self.head.cast (nodes[1].type)
273 self.head = self.head.cast (nodes[0].type)
|
| /prebuilts/python/linux-x86/2.7.5/share/pretty-printers/libstdcxx/gcc-4.6/ |
| printers.py | 246 nodes = self.head.type.fields ()
247 if len (nodes) != 1:
251 self.head = self.head.cast (nodes[0].type)
258 nodes = self.head.type.fields ()
260 if len (nodes) == 0:
263 if len (nodes) != 2:
264 raise ValueError, "Cannot parse more than 2 nodes in a tuple tree."
270 impl = self.head.cast (nodes[1].type)
273 self.head = self.head.cast (nodes[0].type)
|
| /external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/ |
| gUnitBaseTest.java | 366 // Walk resulting tree; create tree nodes stream first
367 CommonTreeNodeStream nodes; local
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/chromeos/audio/ |
| cras_audio_handler.cc | 364 // Refresh audio nodes data.
607 // nodes data in GetNodes call, the staled nodes data does not reflect the
646 const AudioNodeList& nodes) {
648 bool output_devices_changed = HasDeviceChange(nodes, false);
649 bool input_devices_changed = HasDeviceChange(nodes, true);
659 for (size_t i = 0; i < nodes.size(); ++i) {
660 AudioDevice device = GetSanitizedAudioDevice(nodes[i]);
679 // If audio nodes change is caused by unplugging some non-active audio
700 LOG_IF(ERROR, log_errors_) << "Failed to retrieve audio nodes data"
[all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| 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/ui/ |
| DataGrid.js | 173 var nodes = [];
181 nodes.push(node);
185 var length = nodes.length;
187 dataGrid.rootNode().appendChild(nodes[i]);
193 var nodes = dataGrid._rootNode.children.slice();
198 for (var i = 0; i < nodes.length; i++) {
199 var value = nodes[i].data[sortColumnIdentifier];
226 nodes.sort(comparator);
228 for (var i = 0; i < nodes.length; i++)
229 dataGrid._rootNode.appendChild(nodes[i])
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/ |
| VisualRefactoring.java | 659 List<Element> nodes = new ArrayList<Element>(); local
681 nodes.add(element);
698 // Figure out the range of selected nodes from the document offsets
706 // Adjust offsets to get rid of surrounding text nodes (if you happened
718 nodes.add(first);
724 nodes.add((Element) node);
742 //for (Element element : nodes) {
747 return nodes;
803 List<UiViewElementNode> nodes = new ArrayList<UiViewElementNode>(infos local
808 nodes.add(node)
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
| selection_util.js | 341 * Version of |previousSibling| that skips nodes that are entirely
343 * of all DOM nodes that gives the sibling node, the node that is
364 * Version of |nextSibling| that skips nodes that are entirely
384 * Version of |lastChild| that skips nodes that are entirely
386 * of all DOM nodes that gives the last of the nodes contained
408 * Version of |firstChild| that skips nodes that are entirely
432 * |data| is a property of text nodes that gives the text of the node.)
564 * window.getSelection() as this will account for IMG nodes, etc.
|
| /external/chromium_org/remoting/webapp/ |
| 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/chromium_org/content/browser/accessibility/ |
| browser_accessibility_win_unittest.cc | 153 // to get new references to two of the three nodes in the tree.
169 // Now delete the manager, and only one of the three nodes in the tree
238 param.update.nodes.push_back(text2);
310 param.update.nodes.push_back(root);
639 msg->update.nodes.push_back(tree1_1);
640 msg->update.nodes.push_back(tree1_2);
664 msg->update.nodes.clear();
665 msg->update.nodes.push_back(tree2_1);
666 msg->update.nodes.push_back(tree2_2);
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/share/gcc-4.8.3/python/libstdcxx/v6/ |
| printers.py | 274 nodes = self.head.type.fields ()
275 if len (nodes) == 1:
277 self.head = self.head.cast (nodes[0].type)
278 elif len (nodes) != 0:
286 nodes = self.head.type.fields ()
288 if len (nodes) == 0:
291 if len (nodes) != 2:
292 raise ValueError, "Cannot parse more than 2 nodes in a tuple tree."
298 impl = self.head.cast (nodes[1].type)
301 self.head = self.head.cast (nodes[0].type
[all...] |
