OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:nextSibling
(Results
1 - 25
of
331
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/libcore/luni/src/main/java/javax/xml/transform/dom/
DOMResult.java
100
* <p>In practice, <code>node</code> and <code>
nextSibling
</code> should be
106
* <p>Use <code>
nextSibling
</code> to specify the child node
108
* If <code>
nextSibling
</code> is not a sibling of <code>node</code>,
110
* If <code>node</code> is <code>null</code> and <code>
nextSibling
</code> is not <code>null</code>,
112
* If <code>
nextSibling
</code> is <code>null</code>,
119
* @param
nextSibling
The child node where the result nodes should be inserted before.
121
* @throws IllegalArgumentException If <code>
nextSibling
</code> is not a sibling of <code>node</code>.
122
* @throws IllegalArgumentException If <code>node</code> is <code>null</code> and <code>
nextSibling
</code> is not <code>null</code>.
126
public DOMResult(Node node, Node
nextSibling
) {
129
if (
nextSibling
!= null)
[
all
...]
/external/chromium_org/third_party/WebKit/Source/core/html/
HTMLTableRowsCollection.cpp
62
for (child = previous->
nextSibling
(); child; child = child->
nextSibling
()) {
72
child = previous->parentNode()->
nextSibling
();
73
for (; child; child = child->
nextSibling
()) {
75
for (Node* grandchild = child->firstChild(); grandchild; grandchild = grandchild->
nextSibling
()) {
86
child = previous->
nextSibling
();
88
child = previous->parentNode()->
nextSibling
();
89
for (; child; child = child->
nextSibling
()) {
93
for (Node* grandchild = child->firstChild(); grandchild; grandchild = grandchild->
nextSibling
()) {
104
child = previous->parentNode()->
nextSibling
();
[
all
...]
HTMLTableRowElement.cpp
74
for (Node *row = head->firstChild(); row; row = row->
nextSibling
()) {
82
for (Node *node = table->firstChild(); node; node = node->
nextSibling
()) {
85
for (Node* row = section->firstChild(); row; row = row->
nextSibling
()) {
95
for (Node *row = foot->firstChild(); row; row = row->
nextSibling
()) {
/external/chromium_org/third_party/WebKit/Source/core/svg/
SVGElementInstanceList.cpp
41
for (SVGElementInstance* instance = m_rootInstance->firstChild(); instance; instance = instance->
nextSibling
())
51
instance = instance->
nextSibling
();
/external/chromium_org/third_party/WebKit/Source/core/dom/
MutationRecord.h
47
static PassRefPtr<MutationRecord> createChildList(PassRefPtr<Node> target, PassRefPtr<NodeList> added, PassRefPtr<NodeList> removed, PassRefPtr<Node> previousSibling, PassRefPtr<Node>
nextSibling
);
65
virtual Node*
nextSibling
() { return 0; }
NodeTraversal.cpp
79
ASSERT(!current->
nextSibling
());
81
if (current->
nextSibling
())
82
return current->
nextSibling
();
89
ASSERT(!current->
nextSibling
());
94
if (current->
nextSibling
())
95
return current->
nextSibling
();
132
if (!current->
nextSibling
())
134
Node* next = current->
nextSibling
();
ChildListMutationScope.cpp
80
return isEmpty() || (m_lastAdded == child->previousSibling() && m_nextSibling == child->
nextSibling
());
94
m_nextSibling = child->
nextSibling
();
117
m_nextSibling = child->
nextSibling
();
120
m_nextSibling = child->
nextSibling
();
MutationRecord.idl
39
readonly attribute Node
nextSibling
;
TreeWalker.idl
35
[CallWith=ScriptState] Node
nextSibling
();
Text.cpp
71
parentNode()->insertBefore(newText.get(),
nextSibling
(), es);
102
while ((n = n->
nextSibling
())) {
119
Node* onePastEndText = endText->
nextSibling
();
121
for (const Node* n = startText; n != onePastEndText; n = n->
nextSibling
()) {
132
for (const Node* n = startText; n != onePastEndText; n = n->
nextSibling
()) {
155
n = nodeToRemove->
nextSibling
();
160
Node* onePastEndText = endText->
nextSibling
();
161
for (RefPtr<Node> n =
nextSibling
(); n && n != onePastEndText && n->isTextNode() && n->parentNode() == parent;) {
163
n = nodeToRemove->
nextSibling
();
232
first = first->
nextSibling
();
[
all
...]
MutationRecord.cpp
47
ChildListRecord(PassRefPtr<Node> target, PassRefPtr<NodeList> added, PassRefPtr<NodeList> removed, PassRefPtr<Node> previousSibling, PassRefPtr<Node>
nextSibling
)
52
, m_nextSibling(
nextSibling
)
62
virtual Node*
nextSibling
() OVERRIDE { return m_nextSibling.get(); }
140
virtual Node*
nextSibling
() OVERRIDE { return m_record->
nextSibling
(); }
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
)));
TreeWalker.cpp
96
if (node->
nextSibling
()) {
97
node = node->
nextSibling
();
179
Node* TreeWalker::
nextSibling
(ScriptState* state)
185
for (RefPtr<Node> sibling = node->
nextSibling
(); sibling; ) {
203
sibling = sibling->
nextSibling
();
269
while (Node*
nextSibling
= NodeTraversal::nextSkippingChildren(node.get(), root())) {
270
node =
nextSibling
;
NodeTraversal.h
104
node = node->
nextSibling
();
198
if (current->
nextSibling
())
199
return current->
nextSibling
();
212
if (current->
nextSibling
())
213
return current->
nextSibling
();
222
if (current->
nextSibling
())
223
return current->
nextSibling
();
234
if (current->
nextSibling
())
235
return current->
nextSibling
();
ContainerNodeAlgorithms.cpp
60
for (Node* child = node->firstChild(); child; child = child->
nextSibling
()) {
97
for (Node* child = node->firstChild(); child; child = child->
nextSibling
()) {
133
for (Node* child = node->firstChild(); child; child = child->
nextSibling
())
TreeWalker.h
52
Node*
nextSibling
(ScriptState*);
/external/chromium_org/third_party/WebKit/Source/core/editing/
MergeIdenticalElementsCommand.cpp
42
ASSERT(m_element1->
nextSibling
() == m_element2);
47
if (m_element1->
nextSibling
() != m_element2 || !m_element1->rendererIsEditable() || !m_element2->rendererIsEditable())
53
for (Node* child = m_element1->firstChild(); child; child = child->
nextSibling
())
81
for (Node* child = m_element2->firstChild(); child && child != atChild; child = child->
nextSibling
())
WrapContentsInDummySpanCommand.cpp
45
for (Node* child = m_element->firstChild(); child; child = child->
nextSibling
())
70
for (Node* child = m_dummySpan->firstChild(); child; child = child->
nextSibling
())
RemoveNodePreservingChildrenCommand.cpp
45
for (Node* child = m_node->firstChild(); child; child = child->
nextSibling
())
/external/chromium_org/chrome/browser/resources/
about_credits.js
8
var licence = o.
nextSibling
;
12
licence = licence.
nextSibling
;
/external/chromium_org/third_party/WebKit/Source/core/rendering/
RenderObjectChildList.cpp
94
oldChild->previousSibling()->setNextSibling(oldChild->
nextSibling
());
95
if (oldChild->
nextSibling
())
96
oldChild->
nextSibling
()->setPreviousSibling(oldChild->previousSibling());
99
setFirstChild(oldChild->
nextSibling
());
127
// where child->parent() ends up being owner but child->
nextSibling
()->parent()
RenderTableCol.cpp
121
for (RenderObject* child = firstChild(); child; child = child->
nextSibling
())
151
RenderObject* next =
nextSibling
();
155
next = parent()->
nextSibling
();
157
for (; next && !next->isRenderTableCol(); next = next->
nextSibling
()) {
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/
TextImpl.java
133
Node
nextSibling
= getNextSibling();
134
if (
nextSibling
== null) {
138
short nodeType =
nextSibling
.getNodeType();
140
? (TextImpl)
nextSibling
/external/jsilver/src/com/google/clearsilver/jsilver/data/
NestedMapData.java
70
private NestedMapData
nextSibling
= null;
105
curr = curr.
nextSibling
;
116
sym.lastChild.
nextSibling
= data;
136
prevSibling.
nextSibling
=
nextSibling
;
138
parent.firstChild =
nextSibling
;
140
if (
nextSibling
!= null) {
141
nextSibling
.prevSibling = prevSibling;
272
return
nextSibling
== null;
276
return
nextSibling
;
[
all
...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/
treeoutline.js
111
previousChild.
nextSibling
= child;
120
child.
nextSibling
= nextChild;
122
child.
nextSibling
= null;
167
else if (child.
nextSibling
)
168
child.
nextSibling
.select();
174
child.previousSibling.
nextSibling
= child.
nextSibling
;
175
if (child.
nextSibling
)
176
child.
nextSibling
.previousSibling = child.previousSibling;
186
child.
nextSibling
= null
[
all
...]
Section.js
147
childElement = childElement.
nextSibling
;
169
get
nextSibling
()
173
curElement = curElement.
nextSibling
;
Completed in 249 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>