| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| NodeTraversal.cpp | 104 if (current->previousSibling()) {
105 Node* previous = current->previousSibling();
117 if (current->previousSibling())
118 return current->previousSibling();
122 if (current->previousSibling())
123 return current->previousSibling();
142 ASSERT(!current->previousSibling());
146 if (current->previousSibling())
147 return current->previousSibling();
158 if (current->previousSibling())
[all...] |
| MutationRecord.h | 47 static PassRefPtr<MutationRecord> createChildList(PassRefPtr<Node> target, PassRefPtr<NodeList> added, PassRefPtr<NodeList> removed, PassRefPtr<Node> previousSibling, PassRefPtr<Node> nextSibling);
64 virtual Node* previousSibling() { return 0; }
|
| ChildListMutationScope.cpp | 80 return isEmpty() || (m_lastAdded == child->previousSibling() && m_nextSibling == child->nextSibling());
93 m_previousSibling = child->previousSibling();
116 m_previousSibling = child->previousSibling();
118 m_lastAdded = child->previousSibling();
|
| MutationRecord.idl | 38 readonly attribute Node previousSibling;
|
| TreeWalker.cpp | 129 if (node->previousSibling()) {
130 node = node->previousSibling();
142 Node* TreeWalker::previousSibling(ScriptState* state)
148 for (RefPtr<Node> sibling = node->previousSibling(); sibling; ) {
166 sibling = sibling->previousSibling();
220 while (Node* previousSibling = node->previousSibling()) {
221 node = previousSibling;
|
| TreeWalker.idl | 34 [CallWith=ScriptState] Node previousSibling();
|
| MutationRecord.cpp | 47 ChildListRecord(PassRefPtr<Node> target, PassRefPtr<NodeList> added, PassRefPtr<NodeList> removed, PassRefPtr<Node> previousSibling, PassRefPtr<Node> nextSibling)
51 , m_previousSibling(previousSibling)
61 virtual Node* previousSibling() OVERRIDE { return m_previousSibling.get(); }
139 virtual Node* previousSibling() OVERRIDE { return m_record->previousSibling(); }
169 PassRefPtr<MutationRecord> MutationRecord::createChildList(PassRefPtr<Node> target, PassRefPtr<NodeList> added, PassRefPtr<NodeList> removed, PassRefPtr<Node> previousSibling, PassRefPtr<Node> nextSibling)
171 return adoptRef(static_cast<MutationRecord*>(new ChildListRecord(target, added, removed, previousSibling, nextSibling)));
|
| PositionIterator.cpp | 81 m_anchorNode = m_nodeAfterPositionInAnchor->previousSibling();
112 return (!m_anchorNode->hasChildNodes() && !m_offsetInAnchor) || (m_nodeAfterPositionInAnchor && !m_nodeAfterPositionInAnchor->previousSibling());
130 return !m_nodeAfterPositionInAnchor->previousSibling();
|
| TreeWalker.h | 51 Node* previousSibling(ScriptState*);
|
| NodeRenderingTraversal.cpp | 77 Node* previousSibling(const Node* node)
84 walker.previousSibling();
|
| NodeRenderingTraversal.h | 70 Node* previousSibling(const Node*);
|
| ContainerNode.cpp | 244 if (refChild->previousSibling() == newChild || refChild == newChild) // nothing to do
292 ASSERT(!newChild->previousSibling());
295 Node* prev = nextChild->previousSibling();
319 if (nextChild->previousSibling() == newChild || nextChild == newChild) // nothing to do
331 childrenChanged(true, newChild->previousSibling(), nextChild, 1);
371 if (next && (next->previousSibling() == newChild || next == newChild)) // nothing to do
493 Node* prev = child->previousSibling();
535 Node* prev = oldChild->previousSibling();
826 } else if (o->previousSibling()) {
827 o = o->previousSibling();
[all...] |
| RangeBoundaryPoint.h | 143 m_childBeforeBoundary = child->previousSibling();
172 m_childBeforeBoundary = m_childBeforeBoundary->previousSibling();
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderObjectChildList.cpp | 93 if (oldChild->previousSibling())
94 oldChild->previousSibling()->setNextSibling(oldChild->nextSibling());
96 oldChild->nextSibling()->setPreviousSibling(oldChild->previousSibling());
101 setLastChild(oldChild->previousSibling());
140 RenderObject* previousSibling = beforeChild->previousSibling();
141 if (previousSibling)
142 previousSibling->setNextSibling(newChild);
143 newChild->setPreviousSibling(previousSibling);
|
| CounterNode.h | 59 CounterNode* previousSibling() const { return m_previousSibling; }
|
| RenderCounter.cpp | 168 // previousSibling accordingly.
182 static bool findPlaceForCounter(RenderObject* counterOwner, const AtomicString& identifier, bool isReset, RefPtr<CounterNode>& parent, RefPtr<CounterNode>& previousSibling)
191 previousSibling = 0;
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 = currentCounter
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLTableRowsCollection.cpp | 119 for (Node* child = table->lastChild(); child; child = child->previousSibling()) {
121 for (Node* grandchild = child->lastChild(); grandchild; grandchild = grandchild->previousSibling()) {
128 for (Node* child = table->lastChild(); child; child = child->previousSibling()) {
132 for (Node* grandchild = child->lastChild(); grandchild; grandchild = grandchild->previousSibling()) {
139 for (Node* child = table->lastChild(); child; child = child->previousSibling()) {
141 for (Node* grandchild = child->lastChild(); grandchild; grandchild = grandchild->previousSibling()) {
|
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| ApplyBlockElementCommand.cpp | 229 start = firstPositionInOrBeforeNode(endContainer->previousSibling());
232 m_endOfLastParagraph = lastPositionInOrAfterNode(endContainer->previousSibling());
236 end = lastPositionInNode(endContainer->previousSibling());
258 if (text == start.containerNode() && text->previousSibling() && text->previousSibling()->isTextNode()) {
260 start = Position(toText(text->previousSibling()), start.offsetInContainerNode());
262 if (text == end.containerNode() && text->previousSibling() && text->previousSibling()->isTextNode()) {
264 end = Position(toText(text->previousSibling()), end.offsetInContainerNode());
269 if (text->previousSibling()->isTextNode(
[all...] |
| ModifySelectionListLevel.cpp | 151 if (!start->renderer()->previousSibling())
178 Node* previousItem = startListChild->renderer()->previousSibling()->node();
261 Node* previousItem = startListChild->renderer()->previousSibling() ? startListChild->renderer()->previousSibling()->node() : 0;
|
| ApplyStyleCommand.cpp | 483 if (before ? currentNode->previousSibling() : currentNode->nextSibling())
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| Section.js | 163 childElement = childElement.previousSibling;
179 get previousSibling()
183 curElement = curElement.previousSibling;
|
| treeoutline.js | 112 child.previousSibling = previousChild;
114 child.previousSibling = null;
119 nextChild.previousSibling = child;
165 if (child.previousSibling)
166 child.previousSibling.select();
173 if (child.previousSibling)
174 child.previousSibling.nextSibling = child.nextSibling;
176 child.nextSibling.previousSibling = child.previousSibling;
187 child.previousSibling = null
[all...] |
| /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/core/dom/shadow/ |
| ComposedShadowTreeWalker.h | 63 void previousSibling();
154 inline void ComposedShadowTreeWalker::previousSibling()
|
