| /external/webkit/LayoutTests/dom/xhtml/level1/core/ |
| hc_nodechildnodesempty.js | 81 contain any nodes.
85 NodeList returned should not have any nodes.
|
| hc_textparseintolistofelements.js | 80 EntityReference nodes and two Text nodes. After
|
| /external/webkit/LayoutTests/dom/xhtml/level2/core/ |
| hc_nodedocumentfragmentnormalize1.js | 78 Create a document fragment with two adjacent text nodes, normalize and see if the text nodes
|
| /external/webkit/LayoutTests/dom/xhtml/level3/core/ |
| documentadoptnode24.js | 80 attached attribute nodes if there are any. If the node has a parent it is first removed
82 For Element Nodes, specified attribute nodes of the source element are adopted, Default
|
| nodeinsertbefore11.js | 81 Using insertBefore on a DocumentFragment node attempt to insert a child nodes before
82 other permissible nodes and verify the contents/name of each inserted node.
|
| nodeinsertbefore18.js | 83 Using insertBefore on an Element node attempt to insert new Comment/PI and CDATA nodes
84 before each other and verify the names of the newly inserted nodes.
|
| nodesetuserdata05.js | 86 Invoke setUserData on a new Attr to set its UserData to two Document nodes
88 verify if the returned nodes are Equal.
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gre/ |
| NodeProxy.java | 79 * @param factory A {@link NodeFactory} to create unique children nodes.
202 List<INode> nodes = new ArrayList<INode>(uiChildren.size()); local
205 nodes.add(mFactory.create((UiViewElementNode) uiChild));
209 return nodes.toArray(new INode[nodes.size()]);
497 * If there are any pending changes in these nodes, apply them now
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
| RFC3280CertPathUtilities.java | 1022 List nodes = policyNodes[k]; local
1411 List nodes = policyNodes[j]; local
1437 List nodes = policyNodes[i]; local
2466 List nodes = policyNodes[j]; local
2546 List nodes = policyNodes[j]; local
[all...] |
| /external/webkit/Source/WebCore/dom/ |
| Range.cpp | 705 // in which case the last lot of nodes either goes from the first or last
727 if (processStart && m_start.container() != commonRoot) // processStart contains nodes before m_start.
749 NodeVector nodes; local
751 nodes.append(n);
752 processNodes(action, nodes, commonRoot, fragment, ec);
821 // FIXME: Should we assert that some nodes never appear here?
830 Vector<RefPtr<Node> > nodes; local
834 nodes.append(n);
836 processNodes(action, nodes, container, result, ec);
843 void Range::processNodes(ActionType action, Vector<RefPtr<Node> >& nodes, PassRefPtr<Node> oldContainer, PassRefPtr<Node> newContainer, ExceptionCode& ec
882 NodeVector nodes; local
[all...] |
| /external/libxml2/ |
| 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/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/chrome/browser/extensions/ |
| 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/ |
| cookies_tree_model_util.cc | 188 ListValue* nodes) {
193 nodes->Append(dict);
|
| /external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/jst/ |
| 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/chrome/common/extensions/docs/examples/extensions/benchmark/ |
| script.js | 38 //The avg is the depth of each node divided by the num of nodes.
|
| /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";
|
| /external/quake/quake/src/QW/client/ |
| r_light.c | 128 R_MarkLights ( l, 1<<i, cl.worldmodel->nodes );
250 r = RecursiveLightPoint (cl.worldmodel->nodes, p, end);
|
| /external/quake/quake/src/WinQuake/ |
| r_light.cpp | 128 R_MarkLights ( l, 1<<i, cl.worldmodel->nodes );
250 r = RecursiveLightPoint (cl.worldmodel->nodes, p, end);
|
| /external/webkit/LayoutTests/fast/dom/TreeWalker/resources/ |
| TreeWalker-currentNode.js | 18 debug("Test that we handle setting the currentNode to arbitrary nodes not under the root element.");
|
| /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/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/webkit/Source/WebCore/inspector/front-end/ |
| ResourcesPanel.js | 583 var nodes = []; variable
591 nodes.push(node);
595 var length = nodes.length;
597 dataGrid.appendChild(nodes[i]);
605 var nodes = dataGrid.children.slice();
610 for (var i = 0; i < nodes.length; i++) {
611 if (isNaN(Number(nodes[i].data[sortColumnIdentifier])))
632 nodes.sort(comparator);
634 for (var i = 0; i < nodes.length; i++)
635 dataGrid.appendChild(nodes[i])
[all...] |
