HomeSort by relevance Sort by last modified time
    Searched refs:firstNode (Results 1 - 25 of 58) sorted by null

1 2 3

  /external/chromium_org/third_party/WebKit/Source/core/editing/
SimplifyMarkupCommand.h 35 static PassRefPtrWillBeRawPtr<SimplifyMarkupCommand> create(Document& document, Node* firstNode, Node* nodeAfterLast)
37 return adoptRefWillBeNoop(new SimplifyMarkupCommand(document, firstNode, nodeAfterLast));
43 SimplifyMarkupCommand(Document&, Node* firstNode, Node* nodeAfterLast);
SimplifyMarkupCommand.cpp 37 SimplifyMarkupCommand::SimplifyMarkupCommand(Document& document, Node* firstNode, Node* nodeAfterLast)
38 : CompositeEditCommand(document), m_firstNode(firstNode), m_nodeAfterLast(nodeAfterLast)
SpellCheckRequester.cpp 160 if (!range || !range->firstNode() || !range->firstNode()->renderer())
  /external/chromium_org/third_party/WebKit/Source/core/html/
CollectionIndexCache.h 143 NodeType* firstNode = collection.traverseToFirstElement();
144 if (!firstNode) {
149 setCachedNode(firstNode, 0);
150 return index ? nodeAfterCachedNode(collection, index) : firstNode;
163 NodeType* firstNode = collection.traverseToFirstElement();
164 ASSERT(firstNode);
165 setCachedNode(firstNode, 0);
166 return index ? nodeAfterCachedNode(collection, index) : firstNode;
HTMLElement.cpp 632 static void setHasDirAutoFlagRecursively(Node* firstNode, bool flag, Node* lastNode = 0)
634 firstNode->setSelfOrAncestorHasDirAutoAttribute(flag);
636 Node* node = firstNode->firstChild();
642 node = NodeTraversal::nextSkippingChildren(*node, firstNode);
648 node = NodeTraversal::next(*node, firstNode);
    [all...]
  /libcore/dom/src/test/java/org/w3c/domts/level1/core/
hc_namednodemapinuseattributeerr.java 68 Element firstNode;
76 firstNode = (Element) elementList.item(0);
79 setAttr = firstNode.setAttributeNode(domesticAttr);
namednodemapinuseattributeerr.java 69 Element firstNode;
77 firstNode = (Element) elementList.item(0);
80 setAttr = firstNode.setAttributeNode(domesticAttr);
  /external/chromium_org/third_party/WebKit/Source/web/
FindInPageCoordinates.cpp 133 if (!range || !range->firstNode())
136 return findInPageRectFromAbsoluteRect(RenderObject::absoluteBoundingBoxRectForRange(range), range->firstNode()->renderer());
TextFinder.cpp 581 if (m_activeMatch->firstNode() && m_activeMatch->firstNode()->renderer()) {
582 m_activeMatch->firstNode()->renderer()->scrollRectToVisible(
  /external/chromium_org/third_party/WebKit/Source/core/xml/
XPathNodeSet.h 56 Node* firstNode() const;
XPathValue.cpp 130 return stringValue(m_data->nodeSet().firstNode());
XPathResult.cpp 165 return nodes.firstNode();
XPathFunctions.cpp 399 Node* node = a.toNodeSet().firstNode();
413 Node* node = a.toNodeSet().firstNode();
427 Node* node = a.toNodeSet().firstNode();
XPathNodeSet.cpp 267 Node* NodeSet::firstNode() const
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/
cso_hash.c 152 struct cso_node *firstNode = oldBuckets[i];
153 while (firstNode != e) {
154 unsigned h = firstNode->key;
155 struct cso_node *lastNode = firstNode;
167 *beforeFirstNode = firstNode;
168 firstNode = afterLastNode;
  /external/mesa3d/src/gallium/auxiliary/cso_cache/
cso_hash.c 152 struct cso_node *firstNode = oldBuckets[i];
153 while (firstNode != e) {
154 unsigned h = firstNode->key;
155 struct cso_node *lastNode = firstNode;
167 *beforeFirstNode = firstNode;
168 firstNode = afterLastNode;
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/
MoveHandler.java 184 INode firstNode = null;
188 firstNode = mDraggedNodes.iterator().next();
189 firstBounds = firstNode.getBounds();
227 if (firstNode != null) {
228 int baseline = firstNode.getBaseline();
231 edge = new Segment(b.y + baseline, b.x, b.x2(), firstNode, null, BASELINE,
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
RenderListItem.cpp 103 Node* firstNode = 0;
108 if (!firstNode)
109 firstNode = parent;
115 return firstNode;
FastTextAutosizer.cpp     [all...]
TextAutosizer.cpp     [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
LinkedBlockingDeque.java 1034 abstract Node<E> firstNode();
1042 next = firstNode();
1063 return firstNode();
    [all...]
  /external/chromium_org/third_party/WebKit/Source/wtf/
LinkedHashSet.h 192 iterator begin() { return makeIterator(firstNode()); }
194 const_iterator begin() const { return makeConstIterator(firstNode()); }
256 Node* firstNode() { return reinterpret_cast<Node*>(m_anchor.m_next); }
257 const Node* firstNode() const { return reinterpret_cast<const Node*>(m_anchor.m_next); }
524 return firstNode()->m_value;
531 return firstNode()->m_value;
  /external/chromium_org/ui/file_manager/file_manager/foreground/js/photo/
ribbon.js 131 var firstNode = persistentNodes[0];
132 if (firstNode.previousSibling) {
134 firstNode.previousSibling.removeAttribute('vanishing');
  /external/chromium_org/ui/file_manager/gallery/js/
ribbon.js 131 var firstNode = persistentNodes[0];
132 if (firstNode.previousSibling) {
134 firstNode.previousSibling.removeAttribute('vanishing');
  /external/chromium_org/third_party/WebKit/Source/core/dom/
Range.h 107 Node* firstNode() const;

Completed in 237 milliseconds

1 2 3