| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderCounter.cpp | 169 // previousSibling accordingly.
183 static bool findPlaceForCounter(RenderObject& counterOwner, const AtomicString& identifier, bool isReset, RefPtr<CounterNode>& parent, RefPtr<CounterNode>& previousSibling)
192 previousSibling = nullptr;
209 previousSibling = parent ? currentCounter : 0;
216 // In these cases the identified previousSibling will be invalid as its parent is different from
221 previousSibling = previousSiblingProtector.get();
232 previousSibling = previousSiblingProtector.get();
238 // previousSibling, and when we are a sibling of the end counter we must set previousSibling
243 previousSibling = currentCounter
[all...] |
| RenderVTTCue.cpp | 140 for (RenderObject* box = previousSibling(); box; box = box->previousSibling()) {
|
| RenderTableCol.h | 62 if (previousSibling())
|
| RenderLineBoxList.cpp | 297 for (curr = child->previousSibling(); curr; curr = curr->previousSibling()) {
353 bool insertedAfterLeadingSpace = box->lineBreakObj() == child->previousSibling();
|
| /external/guava/guava/src/com/google/common/collect/ |
| LinkedListMultimap.java | 117 Node<K, V> previousSibling; // the previous node with the same key
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 = node.previousSibling
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| LinkedListMultimap.java | 113 Node<K, V> previousSibling; // the previous node with the same key
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 = node.previousSibling
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ui/ |
| treeoutline.js | 113 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 = null
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| ApplyStyleCommand.cpp | 499 if (before ? currentNode->previousSibling() : currentNode->nextSibling())
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| RangeBoundaryPoint.h | 145 m_childBeforeBoundary = child.previousSibling();
172 m_childBeforeBoundary = m_childBeforeBoundary->previousSibling();
|
| PseudoElement.cpp | 78 ASSERT(!previousSibling());
|
| ContainerNode.cpp | 205 if (refChild->previousSibling() == newChild || refChild == newChild) // nothing to do
254 ASSERT(!newChild.previousSibling());
257 Node* prev = nextChild.previousSibling();
294 if (nextChild.previousSibling() == newChild || &nextChild == newChild) // nothing to do
350 if (next && (next->previousSibling() == newChild || next == newChild)) // nothing to do
482 Node* prev = child->previousSibling();
521 Node* prev = oldChild.previousSibling();
695 childrenChanged(source == ChildrenChangeSourceParser, root.previousSibling(), root.nextSibling(), 1);
853 } else if (o->previousSibling()) {
854 o = o->previousSibling();
[all...] |
| ElementTraversal.h | 80 static ElementType* previousSibling(const Node&);
203 node = node->previousSibling();
324 inline ElementType* Traversal<ElementType>::previousSibling(const Node& current)
326 Node* node = current.previousSibling();
328 node = node->previousSibling();
|
| Node.idl | 48 [PerWorldBindings] readonly attribute Node previousSibling;
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
| ComposedTreeWalker.cpp | 60 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))
|
| ComposedTreeWalker.h | 59 void previousSibling();
139 inline void ComposedTreeWalker::previousSibling()
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLTableCellElement.cpp | 71 for (const HTMLTableCellElement* element = Traversal<HTMLTableCellElement>::previousSibling(*this); element; element = Traversal<HTMLTableCellElement>::previousSibling(*element))
|
| HTMLTableRowElement.cpp | 111 n = n->previousSibling();
|
| /external/chromium_org/third_party/WebKit/Source/web/ |
| WebNode.cpp | 120 WebNode WebNode::previousSibling() const
122 return WebNode(m_private->previousSibling());
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/xml/dom/ |
| minidom.py | 38 previousSibling = None
102 refChild.previousSibling = newChild
106 newChild.previousSibling = node
108 newChild.previousSibling = None
152 newChild.previousSibling = oldChild.previousSibling
154 oldChild.previousSibling = None
155 if newChild.previousSibling:
156 newChild.previousSibling.nextSibling = newChild
158 newChild.nextSibling.previousSibling = newChil
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/xml/dom/ |
| minidom.py | 38 previousSibling = None
102 refChild.previousSibling = newChild
106 newChild.previousSibling = node
108 newChild.previousSibling = None
152 newChild.previousSibling = oldChild.previousSibling
154 oldChild.previousSibling = None
155 if newChild.previousSibling:
156 newChild.previousSibling.nextSibling = newChild
158 newChild.nextSibling.previousSibling = newChil
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/page/ |
| FrameTree.cpp | 91 Frame* FrameTree::previousSibling() const
95 return m_thisFrame->client()->previousSibling();
358 if (Frame* prevSibling = previousSibling())
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDocumentImpl.java | 81 int previousSibling = 0; // previous sibling - no previous sibling
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;
[all...] |
| /external/chromium_org/chrome/common/extensions/docs/examples/api/downloads/download_filename_controller/ |
| options.js | 34 var sib = rule.node.previousSibling;
62 this.getElement('move-up').disabled = !this.node.previousSibling;
|
| /external/chromium_org/components/autofill/content/renderer/ |
| form_autofill_util.cc | 209 previous = previous.previousSibling();
306 WebNode previous = parent.previousSibling();
312 previous = previous.previousSibling();
335 WebNode previous = parent.previousSibling();
340 previous = previous.previousSibling();
369 if (node.previousSibling().isNull()) {
377 node = node.previousSibling();
399 WebNode previous = parent.previousSibling();
401 previous = previous.previousSibling();
[all...] |
| /external/chromium_org/third_party/WebKit/public/web/ |
| WebNode.h | 102 BLINK_EXPORT WebNode previousSibling() const;
|
