OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:previousSibling
(Results
1 - 25
of
153
) sorted by null
1
2
3
4
5
6
7
/external/webkit/Source/WebCore/dom/
TreeWalker.h
50
Node*
previousSibling
(ScriptState*);
60
Node*
previousSibling
() { return
previousSibling
(scriptStateFromNode(mainThreadNormalWorld(), m_current.get())); }
TreeWalker.cpp
126
if (node->
previousSibling
()) {
127
node = node->
previousSibling
();
139
Node* TreeWalker::
previousSibling
(ScriptState* state)
145
for (RefPtr<Node> sibling = node->
previousSibling
(); sibling; ) {
163
sibling = sibling->
previousSibling
();
217
while (Node*
previousSibling
= node->
previousSibling
()) {
218
node =
previousSibling
;
TreeWalker.idl
37
[CallWith=ScriptState] Node
previousSibling
();
PositionIterator.cpp
79
m_anchorNode = m_nodeAfterPositionInAnchor->
previousSibling
();
117
return (!m_anchorNode->hasChildNodes() && !m_offsetInAnchor) || (m_nodeAfterPositionInAnchor && !m_nodeAfterPositionInAnchor->
previousSibling
());
135
return !m_nodeAfterPositionInAnchor->
previousSibling
();
RangeBoundaryPoint.h
134
m_childBeforeBoundary = child->
previousSibling
();
163
m_childBeforeBoundary = m_childBeforeBoundary->
previousSibling
();
ChildNodeList.cpp
86
n = n->
previousSibling
();
ContainerNode.cpp
132
if (refChild->
previousSibling
() == newChild || refChild == newChild) // nothing to do
136
RefPtr<Node> refChildPreviousSibling = refChild->
previousSibling
();
194
ASSERT(!newChild->
previousSibling
());
197
Node* prev = nextChild->
previousSibling
();
225
if (nextChild->
previousSibling
() == newChild || nextChild == newChild) // nothing to do
229
RefPtr<Node> nextChildPreviousSibling = nextChild->
previousSibling
();
266
RefPtr<Node> prev = oldChild->
previousSibling
();
286
if (prev && (prev == child || prev == child->
previousSibling
()))
308
ASSERT(!child->
previousSibling
());
329
ASSERT(next->
previousSibling
() == prev)
[
all
...]
/external/webkit/Source/WebCore/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
()) {
HTMLTableCellElement.cpp
65
for (const Node * node =
previousSibling
(); node; node = node->
previousSibling
()) {
/external/webkit/LayoutTests/fast/dom/TreeWalker/script-tests/
traversal-skip-most.js
21
debug("<br>Testing
previousSibling
")
24
shouldBe("walker.
previousSibling
(); walker.currentNode.id", "'B1'");
previousSiblingLastChildSkip.js
1
description('Test for a specific problem with
previousSibling
that failed in older versions of WebKit.');
21
shouldBe("walker.
previousSibling
(); walker.currentNode.id", "'C2'");
traversal-reject.js
47
debug("<br>Testing
previousSibling
")
50
shouldBe("walker.
previousSibling
(); walker.currentNode.id", "'B1'");
traversal-skip.js
48
debug("<br>Testing
previousSibling
")
51
shouldBe("walker.
previousSibling
(); walker.currentNode.id", "'B1'");
/external/webkit/Source/WebCore/rendering/
RenderCounter.cpp
278
//
previousSibling
accordingly.
292
static bool findPlaceForCounter(RenderObject* counterOwner, const AtomicString& identifier, bool isReset, CounterNode*& parent, CounterNode*&
previousSibling
)
301
previousSibling
= 0;
308
if (
previousSibling
) { // But we already found another counter that we come after.
316
previousSibling
= parent ? currentCounter : 0;
322
ASSERT(
previousSibling
->parent() == currentCounter);
329
ASSERT(currentCounter->parent() ==
previousSibling
->parent());
336
//
previousSibling
, and when we are a sibling of the end counter we must set
previousSibling
341
previousSibling
= currentCounter
[
all
...]
CounterNode.h
59
CounterNode*
previousSibling
() const { return m_previousSibling; }
/external/webkit/Source/WebCore/editing/
ApplyBlockElementCommand.cpp
227
start = firstPositionInOrBeforeNode(end.deprecatedNode()->
previousSibling
());
230
m_endOfLastParagraph = lastPositionInNode(end.deprecatedNode()->
previousSibling
());
235
end = lastPositionInNode(end.deprecatedNode()->
previousSibling
());
260
start = Position(containerNode->
previousSibling
(), start.offsetInContainerNode(), Position::PositionIsOffsetInAnchor);
264
end = Position(containerNode->
previousSibling
(), end.offsetInContainerNode(), Position::PositionIsOffsetInAnchor);
268
m_endOfLastParagraph = Position(containerNode->
previousSibling
(), m_endOfLastParagraph.offsetInContainerNode(), Position::PositionIsOffsetInAnchor);
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;
/external/webkit/Source/WebCore/inspector/front-end/
Section.js
137
get
previousSibling
()
141
curElement = curElement.
previousSibling
;
treeoutline.js
58
child.
previousSibling
= lastChild;
60
child.
previousSibling
= null;
99
child.
previousSibling
= previousChild;
101
child.
previousSibling
= null;
106
nextChild.
previousSibling
= child;
149
if (child.
previousSibling
)
150
child.
previousSibling
.select();
157
if (child.
previousSibling
)
158
child.
previousSibling
.nextSibling = child.nextSibling;
160
child.nextSibling.
previousSibling
= child.previousSibling
[
all
...]
/external/webkit/Source/WebKit/chromium/src/
WebNode.cpp
118
WebNode WebNode::
previousSibling
() const
120
return WebNode(m_private->
previousSibling
());
/external/webkit/LayoutTests/fast/dom/TreeWalker/resources/
TreeWalker-currentNode.js
40
shouldBeNull("w.
previousSibling
()");
47
w.currentNode = subTree.
previousSibling
;
/external/webkit/Source/WebCore/page/
FrameTree.h
50
Frame*
previousSibling
() const { return m_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/webkit/Source/WebCore/rendering/mathml/
RenderMathMLFraction.cpp
175
if (
previousSibling
())
176
refStyle =
previousSibling
()->style();
Completed in 417 milliseconds
1
2
3
4
5
6
7