OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:m_nodes
(Results
1 - 7
of
7
) sorted by null
/external/webkit/Source/WebCore/dom/
StaticHashSetNodeList.h
65
ListHashSet<RefPtr<Node> >
m_nodes
;
member in class:WebCore::StaticHashSetNodeList
StaticNodeList.h
56
m_nodes
.swap(nodes);
58
Vector<RefPtr<Node> >
m_nodes
;
member in class:WebCore::StaticNodeList
/external/webkit/Source/WebCore/bindings/v8/custom/
V8NamedNodesCollection.h
49
virtual unsigned length() const { return
m_nodes
.size(); }
55
:
m_nodes
(nodes) { }
57
Vector<RefPtr<Node> >
m_nodes
;
member in class:WebCore::V8NamedNodesCollection
/external/webkit/Source/WebCore/xml/
XPathNodeSet.h
45
size_t size() const { return
m_nodes
.size(); }
46
bool isEmpty() const { return !
m_nodes
.size(); }
47
Node* operator[](unsigned i) const { return
m_nodes
.at(i).get(); }
48
void reserveCapacity(size_t newCapacity) {
m_nodes
.reserveCapacity(newCapacity); }
49
void clear() {
m_nodes
.clear(); }
50
void swap(NodeSet& other) { std::swap(m_isSorted, other.m_isSorted); std::swap(m_subtreesAreDisjoint, other.m_subtreesAreDisjoint);
m_nodes
.swap(other.
m_nodes
); }
53
void append(Node* node) {
m_nodes
.append(node); }
54
void append(PassRefPtr<Node> node) {
m_nodes
.append(node); }
55
void append(const NodeSet& nodeSet) {
m_nodes
.append(nodeSet.m_nodes);
78
Vector<RefPtr<Node> >
m_nodes
;
member in class:WebCore::XPath::NodeSet
[
all
...]
/external/webkit/Source/WebCore/editing/
MarkupAccumulator.h
104
Vector<Node*>* const
m_nodes
;
member in class:WebCore::MarkupAccumulator
/frameworks/base/tools/localize/
XMLHandler.h
189
vector<XMLNode*>
m_nodes
;
member in class:NodeHandler
/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
...]
Completed in 1308 milliseconds