OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:m_nodes
(Results
1 - 15
of
15
) sorted by null
/external/chromium_org/third_party/WebKit/Source/core/dom/
DocumentOrderedList.cpp
37
if (
m_nodes
.isEmpty()) {
38
m_nodes
.add(node);
43
iterator begin =
m_nodes
.begin();
44
iterator end =
m_nodes
.end();
52
m_nodes
.insertBefore(followingNode, node);
58
m_nodes
.insertBefore(followingNode, node);
63
ASSERT(
m_nodes
.isEmpty() ||
m_nodes
.last()->compareDocumentPositionInternal(node, Node::TreatShadowTreesAsComposed) & Node::DOCUMENT_POSITION_FOLLOWING);
64
m_nodes
.add(node);
69
m_nodes
.remove(node)
[
all
...]
DocumentOrderedList.h
46
bool isEmpty() const { return
m_nodes
.isEmpty(); }
47
void clear() {
m_nodes
.clear(); }
51
iterator begin() { return
m_nodes
.begin(); }
52
iterator end() { return
m_nodes
.end(); }
55
ListHashSet<Node*, 32>
m_nodes
;
member in class:WebCore::DocumentOrderedList
StaticNodeList.cpp
38
return
m_nodes
.size();
43
if (index <
m_nodes
.size())
44
return
m_nodes
[index].get();
50
size_t length =
m_nodes
.size();
52
Node* node =
m_nodes
[i].get();
NamedNodesCollection.cpp
39
if (index <
m_nodes
.size())
40
return
m_nodes
[index].get();
46
for (unsigned i = 0; i <
m_nodes
.size(); ++i) {
47
Node* node =
m_nodes
[i].get();
NamedNodesCollection.h
49
virtual unsigned length() const OVERRIDE { return
m_nodes
.size(); }
55
:
m_nodes
(nodes) { }
57
Vector<RefPtr<Node> >
m_nodes
;
member in class:WebCore::NamedNodesCollection
StaticNodeList.h
46
nodeList->
m_nodes
.swap(nodes);
62
Vector<RefPtr<Node> >
m_nodes
;
member in class:WebCore::StaticNodeList
/external/chromium_org/third_party/WebKit/Source/core/xml/
XPathNodeSet.h
43
size_t size() const { return
m_nodes
.size(); }
44
bool isEmpty() const { return !
m_nodes
.size(); }
45
Node* operator[](unsigned i) const { return
m_nodes
.at(i).get(); }
46
void reserveCapacity(size_t newCapacity) {
m_nodes
.reserveCapacity(newCapacity); }
47
void clear() {
m_nodes
.clear(); }
48
void swap(NodeSet& other) { std::swap(m_isSorted, other.m_isSorted); std::swap(m_subtreesAreDisjoint, other.m_subtreesAreDisjoint);
m_nodes
.swap(other.
m_nodes
); }
51
void append(Node* node) {
m_nodes
.append(node); }
52
void append(PassRefPtr<Node> node) {
m_nodes
.append(node); }
53
void append(const NodeSet& nodeSet) {
m_nodes
.append(nodeSet.m_nodes);
78
Vector<RefPtr<Node> >
m_nodes
;
member in class:WebCore::XPath::NodeSet
[
all
...]
XPathNodeSet.cpp
143
unsigned nodeCount =
m_nodes
.size();
159
Node* n =
m_nodes
[i].get();
171
// It is not possible to just assign the result to
m_nodes
, because some nodes may get dereferenced and destroyed.
177
const_cast<Vector<RefPtr<Node> >&>(
m_nodes
).swap(sortedNodes);
198
unsigned nodeCount =
m_nodes
.size();
201
Node* node =
m_nodes
[i].get();
210
for (Node* n = findRootNode(
m_nodes
.first().get()); n; n = NodeTraversal::next(n)) {
230
const_cast<Vector<RefPtr<Node> >&>(
m_nodes
).swap(sortedNodes);
235
if (
m_nodes
.isEmpty())
239
unsigned to =
m_nodes
.size() - 1
[
all
...]
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/
ContentDistributor.h
49
PassRefPtr<Node> first() const { return
m_nodes
.first(); }
50
PassRefPtr<Node> last() const { return
m_nodes
.last(); }
51
PassRefPtr<Node> at(size_t index) const { return
m_nodes
.at(index); }
53
size_t size() const { return
m_nodes
.size(); }
54
bool isEmpty() const { return
m_nodes
.isEmpty(); }
57
void clear() {
m_nodes
.clear(); m_indices.clear(); }
66
const Vector<RefPtr<Node> >& nodes() const { return
m_nodes
; }
69
Vector<RefPtr<Node> >
m_nodes
;
member in class:WebCore::ContentDistribution
ContentDistributor.cpp
41
m_nodes
.swap(other.
m_nodes
);
47
size_t size =
m_nodes
.size();
49
m_nodes
.append(node);
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/
DOM2DTM.java
104
protected Vector
m_nodes
= new Vector();
field in class:DOM2DTM
185
int nodeIndex =
m_nodes
.size();
246
m_nodes
.addElement(node);
316
return
m_nodes
.size();
456
for(int i=0;i<
m_nodes
.size();++i)
609
return (Node)
m_nodes
.elementAt(identity);
621
return (Node)
m_nodes
.elementAt(nodeIdentity);
636
if (identity >=
m_nodes
.size())
668
int len =
m_nodes
.size();
675
if (
m_nodes
.elementAt(i) == node
[
all
...]
/external/chromium_org/third_party/WebKit/Source/core/editing/
MarkupAccumulator.h
107
Vector<Node*>* const
m_nodes
;
member in class:WebCore::MarkupAccumulator
MarkupAccumulator.cpp
104
:
m_nodes
(nodes)
176
if (
m_nodes
)
177
m_nodes
->append(node);
markup.cpp
169
if (
m_nodes
)
170
m_nodes
->append(node);
[
all
...]
/prebuilts/tools/common/m2/internal/xalan/xalan/2.6.0/
xalan-2.6.0.jar
Completed in 264 milliseconds