HomeSort by relevance Sort by last modified time
    Searched refs:deep (Results 26 - 50 of 100) sorted by null

12 3 4

  /external/v8/test/mjsunit/
deep-recursion.js 29 * @fileoverview Check that flattening deep trees of cons strings does not
43 var deep = newdeep("foo", default_depth);
44 assertEquals('f', deep[0]);
  /external/webkit/LayoutTests/dom/html/level1/core/
hc_nodeclonegetparentnull.js 78 The duplicate node returned by the "cloneNode(deep)"
82 "cloneNode(deep)" method with deep=false. The
hc_nodeclonenodefalse.js 78 The "cloneNode(deep)" method returns a copy of the node
79 only if deep=false.
82 "cloneNode(deep)" method with deep=false. The
hc_nodeclonenodetrue.js 78 The "cloneNode(deep)" method returns a copy of the node
79 and the subtree under it if deep=true.
82 "cloneNode(deep)" method with deep=true. The
  /external/webkit/LayoutTests/dom/xhtml/level1/core/
hc_nodeclonegetparentnull.js 78 The duplicate node returned by the "cloneNode(deep)"
82 "cloneNode(deep)" method with deep=false. The
hc_nodeclonenodefalse.js 78 The "cloneNode(deep)" method returns a copy of the node
79 only if deep=false.
82 "cloneNode(deep)" method with deep=false. The
hc_nodeclonenodetrue.js 78 The "cloneNode(deep)" method returns a copy of the node
79 and the subtree under it if deep=true.
82 "cloneNode(deep)" method with deep=true. The
  /external/webkit/Source/WebCore/dom/
ContainerNode.h 72 virtual void insertedIntoTree(bool deep);
73 virtual void removedFromTree(bool deep);
Attr.h 79 virtual PassRefPtr<Node> cloneNode(bool deep);
ProcessingInstruction.h 71 virtual PassRefPtr<Node> cloneNode(bool deep);
  /external/webkit/Source/WebCore/html/
HTMLFormControlElement.h 114 virtual void insertedIntoTree(bool deep);
115 virtual void removedFromTree(bool deep);
HTMLCollection.cpp 92 bool deep = true; local
115 deep = false;
123 current = nextNodeOrSibling(m_base.get(), previous, deep);
125 for (; current; current = nextNodeOrSibling(m_base.get(), current, deep)) {
HTMLImageElement.cpp 236 void HTMLImageElement::insertedIntoTree(bool deep)
249 HTMLElement::insertedIntoTree(deep);
252 void HTMLImageElement::removedFromTree(bool deep)
257 HTMLElement::removedFromTree(deep);
HTMLFormControlElement.cpp 184 void HTMLFormControlElement::insertedIntoTree(bool deep)
190 HTMLElement::insertedIntoTree(deep);
193 void HTMLFormControlElement::removedFromTree(bool deep)
196 HTMLElement::removedFromTree(deep);
HTMLObjectElement.cpp 495 void HTMLObjectElement::insertedIntoTree(bool deep)
498 HTMLPlugInImageElement::insertedIntoTree(deep);
501 void HTMLObjectElement::removedFromTree(bool deep)
504 HTMLPlugInImageElement::removedFromTree(deep);
  /external/chromium/net/disk_cache/
block_files.h 43 // Removes an entry from the block files. If deep is true, the storage is zero
46 void DeleteBlock(Addr address, bool deep);
  /external/webkit/Tools/android/flex-2.5.4a/MISC/
alloca.c 148 char *deep; /* For stack depth measure. */ member in struct:hdr::__anon13515
180 if ((STACK_DIR > 0 && hp->h.deep > depth)
181 || (STACK_DIR < 0 && hp->h.deep < depth))
205 ((header *) new)->h.deep = depth;
  /libcore/luni/src/main/java/org/w3c/dom/
Document.java 229 * Note that the <code>deep</code> parameter has no effect on
233 * <dd>If the <code>deep</code> option
251 * <code>importNode</code> <code>deep</code> parameter was set to
262 * copied. If a <code>deep</code> import is requested, the descendants
268 * copied, even if a <code>deep</code> import is requested, since the
279 * Note that the <code>deep</code> parameter has no effect on this type
285 * source node.Note that the <code>deep</code> parameter has no effect
292 * that the <code>deep</code> parameter has no effect on these types of
296 * @param deep If <code>true</code>, recursively import the subtree under
313 boolean deep)
    [all...]
Node.java 414 * contains unless it is a deep clone. This includes text contained in
421 * deep clone or not. Cloning an <code>EntityReference</code>
423 * <code>Entity</code> is available, no matter whether this is a deep
432 * @param deep If <code>true</code>, recursively clone the subtree under
437 public Node cloneNode(boolean deep);
    [all...]
  /ndk/sources/host-tools/sed-4.2.1/lib/
alloca.c 139 char *deep; /* For stack depth measure. */ member in struct:hdr::__anon16789
174 if ((STACK_DIR > 0 && hp->h.deep > depth)
175 || (STACK_DIR < 0 && hp->h.deep < depth))
212 new->h.deep = depth;
  /external/clang/test/SemaCXX/
cstyle-cast.cpp 26 // Cast away deep consts and volatiles.
188 ppint *deep = (ppint*)(p3); local
189 (void)(fnptr*)(deep);
functional-cast.cpp 55 // Cast away deep consts and volatiles.
254 ppint *deep = pppint(p3); local
256 (void)fnptrp(deep);
  /dalvik/tests/074-gc-thrash/src/
Main.java 111 Deep deep = new Deep(); local
116 deep.start();
127 deep.join();
194 class Deep extends Thread {
224 System.err.println("Deep: " + i + " strong=" + strong[i] +
239 System.err.println("Deep: weak still has " + i);
244 System.out.println("Deep: iters=" + iter / MAX_DEPTH);
305 return new String("Deep" + val)
    [all...]
  /libcore/luni/src/main/java/org/apache/harmony/xml/dom/
DocumentImpl.java 216 * @param deep true to recursively copy any child nodes; false to do no such
219 Node cloneOrImportNode(short operation, Node node, boolean deep) {
222 if (deep) {
225 copy.appendChild(cloneOrImportNode(operation, list.item(i), deep));
233 public Node importNode(Node importedNode, boolean deep) {
234 return cloneOrImportNode(UserDataHandler.NODE_IMPORTED, importedNode, deep);
  /external/webkit/LayoutTests/dom/xhtml/level3/core/
nodeisequalnode13.js 79 Document with deep=false. Using isEqualNode check if the original and the imported
80 Element Node are not equal. Now import it once more with deep=true and using isEqual

Completed in 382 milliseconds

12 3 4