Searched refs:previousSibling (Results 26 - 50 of 164) sorted by relevance

1234567

/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DCounterNode.h59 CounterNode* previousSibling() const { return m_previousSibling; } function in class:blink::CounterNode
H A DRenderCounter.cpp168 // previousSibling accordingly.
182 static bool findPlaceForCounter(RenderObject& counterOwner, const AtomicString& identifier, bool isReset, RefPtr<CounterNode>& parent, RefPtr<CounterNode>& previousSibling) argument
191 previousSibling = nullptr;
208 previousSibling = parent ? currentCounter : 0;
215 // In these cases the identified previousSibling will be invalid as its parent is different from
220 previousSibling = previousSiblingProtector.get();
231 previousSibling = previousSiblingProtector.get();
237 // previousSibling, and when we are a sibling of the end counter we must set previousSibling
242 previousSibling
[all...]
H A DRenderVTTCue.cpp140 for (RenderObject* box = previousSibling(); box; box = box->previousSibling()) {
H A DRenderTableCol.h63 if (previousSibling())
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ui/
H A DViewportDataGrid.js282 if (child.previousSibling)
283 child.previousSibling.nextSibling = child.nextSibling;
285 child.nextSibling.previousSibling = child.previousSibling;
H A Dtreeoutline.js113 child.previousSibling = previousChild;
115 child.previousSibling = null;
120 nextChild.previousSibling = child;
166 if (child.previousSibling)
167 child.previousSibling.select();
174 if (child.previousSibling)
175 child.previousSibling.nextSibling = child.nextSibling;
177 child.nextSibling.previousSibling = child.previousSibling;
188 child.previousSibling
[all...]
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DElementTraversal.h90 static ElementType* previousSibling(const Node&);
92 static ElementType* previousSibling(const Node&, MatchFunc);
189 node = node->previousSibling();
199 element = Traversal<ElementType>::previousSibling(*element);
356 inline ElementType* Traversal<ElementType>::previousSibling(const Node& current) function in class:blink::Traversal
358 Node* node = current.previousSibling();
360 node = node->previousSibling();
366 inline ElementType* Traversal<ElementType>::previousSibling(const Node& current, MatchFunc isMatch) function in class:blink::Traversal
368 ElementType* element = Traversal<ElementType>::previousSibling(current);
370 element = Traversal<ElementType>::previousSibling(*elemen
[all...]
H A DRangeBoundaryPoint.h146 m_childBeforeBoundary = child.previousSibling();
173 m_childBeforeBoundary = m_childBeforeBoundary->previousSibling();
H A DContainerNode.cpp209 if (refChild->previousSibling() == newChild || refChild == newChild)
263 ASSERT(!newChild.previousSibling());
266 Node* prev = nextChild.previousSibling();
303 if (nextChild.previousSibling() == newChild || &nextChild == newChild) // nothing to do
362 if (next && (next->previousSibling() == newChild || next == newChild)) // nothing to do
564 Node* prev = child->previousSibling();
604 Node* prev = oldChild.previousSibling();
940 } else if (o->previousSibling()) {
941 o = o->previousSibling();
948 prev = o->previousSibling();
[all...]
H A DContainerNode.h167 node.previousSibling(),
174 static ChildrenChange forRemoval(Node& node, Node* previousSibling, Node* nextSibling, ChildrenChangeSource byParser) argument
178 previousSibling,
H A DPseudoElement.cpp95 ASSERT(!previousSibling());
/external/guava/guava/src/com/google/common/collect/
H A DLinkedListMultimap.java117 Node<K, V> previousSibling; // the previous node with the same key field in class:LinkedListMultimap.Node
204 node.previousSibling = keyTail;
210 node.previousSibling = nextSibling.previousSibling;
213 if (nextSibling.previousSibling == null) { // nextSibling was key head
216 nextSibling.previousSibling.nextSibling = node;
224 nextSibling.previousSibling = node;
246 if (node.previousSibling != null) {
247 node.previousSibling.nextSibling = node.nextSibling;
254 node.nextSibling.previousSibling
[all...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DLinkedListMultimap.java113 Node<K, V> previousSibling; // the previous node with the same key field in class:LinkedListMultimap.Node
200 node.previousSibling = keyTail;
206 node.previousSibling = nextSibling.previousSibling;
209 if (nextSibling.previousSibling == null) { // nextSibling was key head
212 nextSibling.previousSibling.nextSibling = node;
220 nextSibling.previousSibling = node;
242 if (node.previousSibling != null) {
243 node.previousSibling.nextSibling = node.nextSibling;
250 node.nextSibling.previousSibling
[all...]
/external/chromium_org/third_party/WebKit/Source/core/editing/
H A DApplyStyleCommand.cpp501 if (before ? currentNode->previousSibling() : currentNode->nextSibling())
895 RefPtrWillBeRawPtr<Node> previousSibling = element.previousSibling(); local
902 runStart = previousSibling ? previousSibling->nextSibling() : parent->firstChild();
904 runEnd = nextSibling ? nextSibling->previousSibling() : parent->lastChild();
1218 Node* prevNode = text->previousSibling();
1248 if (!parentElement || !parentElement->previousSibling())
1250 Node* firstTextNode = parentElement->previousSibling()->lastChild();
1285 if (startNode->previousSibling())
1371 RefPtrWillBeRawPtr<Node> previousSibling = element->previousSibling(); local
[all...]
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/
H A DComposedTreeWalker.cpp60 for (const Node* sibling = node; sibling; sibling = (direction == TraversalDirectionForward ? sibling->nextSibling() : sibling->previousSibling())) {
107 if (Node* found = traverseSiblings(direction == TraversalDirectionForward ? node->nextSibling() : node->previousSibling(), direction))
H A DComposedTreeWalker.h58 void previousSibling();
138 inline void ComposedTreeWalker::previousSibling() function in class:blink::ComposedTreeWalker
/external/chromium_org/third_party/WebKit/Source/core/html/
H A DHTMLTableCellElement.cpp75 for (const HTMLTableCellElement* element = Traversal<HTMLTableCellElement>::previousSibling(*this); element; element = Traversal<HTMLTableCellElement>::previousSibling(*element))
H A DHTMLTableRowElement.cpp108 n = n->previousSibling();
/external/chromium_org/third_party/WebKit/Source/web/
H A DWebNode.cpp116 WebNode WebNode::previousSibling() const function in class:blink::WebNode
118 return WebNode(m_private->previousSibling());
/external/chromium_org/ui/webui/resources/js/cr/ui/
H A Dtree.js668 var previousSibling = item.previousElementSibling;
669 return previousSibling ? getLastHelper(previousSibling) : item.parentItem;
/external/chromium_org/third_party/WebKit/Source/core/page/
H A DFrameTree.cpp93 Frame* FrameTree::previousSibling() const function in class:blink::FrameTree
97 return m_thisFrame->client()->previousSibling();
360 if (Frame* prevSibling = previousSibling())
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
H A DDTMDocumentImpl.java81 int previousSibling = 0; // previous sibling - no previous sibling field in class:DTMDocumentImpl
214 nodes.writeEntry(previousSibling,2,slotnumber);
701 // previousSibling = 0;
800 // nodes.writeEntry(previousSibling, 2, NULL);
803 // previousSibling = currentParent;
857 // previousSibling = ourslot; // Should attributes be previous siblings
871 // //previousSibling = ourslot;
922 // previousSibling = ourslot;
971 // previousSibling = ourslot;
2104 previousSibling
[all...]
/external/chromium_org/components/autofill/content/renderer/
H A Dform_autofill_util.cc198 previous = previous.previousSibling();
295 WebNode previous = parent.previousSibling();
301 previous = previous.previousSibling();
324 WebNode previous = parent.previousSibling();
329 previous = previous.previousSibling();
358 if (node.previousSibling().isNull()) {
366 node = node.previousSibling();
388 WebNode previous = parent.previousSibling();
390 previous = previous.previousSibling();
/external/chromium_org/third_party/WebKit/public/web/
H A DWebNode.h100 BLINK_EXPORT WebNode previousSibling() const;
/external/chromium_org/third_party/polymer/components-chromium/core-layout-trbl/
H A Dcore-slide-extracted.js151 e = e.previousSibling;

Completed in 584 milliseconds

1234567