Searched defs:m_nodes (Results 1 - 7 of 7) sorted by relevance

/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DDocumentOrderedList.h48 bool isEmpty() const { return m_nodes.isEmpty(); }
49 void clear() { m_nodes.clear(); }
50 size_t size() const { return m_nodes.size(); }
54 iterator begin() { return m_nodes.begin(); }
55 iterator end() { return m_nodes.end(); }
60 WillBeHeapListHashSet<RawPtrWillBeMember<Node>, 32> m_nodes; member in class:blink::FINAL
H A DStaticNodeList.h63 return m_nodes.capacity() * sizeof(RefPtrWillBeMember<NodeType>);
66 WillBeHeapVector<RefPtrWillBeMember<NodeType> > m_nodes; member in class:blink::FINAL
76 nodeList->m_nodes.swap(nodes);
90 return m_nodes.size();
96 if (index < m_nodes.size())
97 return m_nodes[index].get();
104 visitor->trace(m_nodes);
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/
H A DContentDistribution.h43 ContentDistribution() { m_nodes.reserveInitialCapacity(32); }
45 PassRefPtrWillBeRawPtr<Node> first() const { return m_nodes.first(); }
46 PassRefPtrWillBeRawPtr<Node> last() const { return m_nodes.last(); }
47 PassRefPtrWillBeRawPtr<Node> at(size_t index) const { return m_nodes.at(index); }
49 size_t size() const { return m_nodes.size(); }
50 bool isEmpty() const { return m_nodes.isEmpty(); }
53 void clear() { m_nodes.clear(); m_indices.clear(); }
54 void shrinkToFit() { m_nodes.shrinkToFit(); }
63 const WillBeHeapVector<RefPtrWillBeMember<Node> >& nodes() const { return m_nodes; }
68 WillBeHeapVector<RefPtrWillBeMember<Node> > m_nodes; member in class:blink::FINAL
[all...]
H A DElementShadow.cpp53 WillBeHeapVector<RawPtrWillBeMember<Node>, 32> m_nodes; member in class:blink::FINAL
65 m_nodes.clear();
76 m_nodes.append(insertionPoint->at(i));
78 m_nodes.append(child);
81 m_distributed.resize(m_nodes.size());
89 for (size_t i = 0; i < m_nodes.size(); ++i) {
93 if (isHTMLContentElement(*insertionPoint) && !toHTMLContentElement(insertionPoint)->canSelectNode(m_nodes, i))
96 Node* node = m_nodes[i];
119 for (size_t i = 0; i < m_nodes.size(); ++i) {
122 if (m_nodes[
[all...]
/external/chromium_org/third_party/WebKit/Source/core/editing/
H A DMarkupAccumulator.h106 RawPtrWillBeMember<WillBeHeapVector<RawPtrWillBeMember<Node> > > const m_nodes; member in class:blink::MarkupAccumulator
/external/chromium_org/third_party/WebKit/Source/core/xml/
H A DXPathNodeSet.h42 void trace(Visitor* visitor) { visitor->trace(m_nodes); }
44 size_t size() const { return m_nodes.size(); }
45 bool isEmpty() const { return !m_nodes.size(); }
46 Node* operator[](unsigned i) const { return m_nodes.at(i).get(); }
47 void reserveCapacity(size_t newCapacity) { m_nodes.reserveCapacity(newCapacity); }
48 void clear() { m_nodes.clear(); }
49 void swap(NodeSet& other) { std::swap(m_isSorted, other.m_isSorted); std::swap(m_subtreesAreDisjoint, other.m_subtreesAreDisjoint); m_nodes.swap(other.m_nodes); }
52 void append(PassRefPtrWillBeRawPtr<Node> node) { m_nodes.append(node); }
53 void append(const NodeSet& nodeSet) { m_nodes
81 WillBeHeapVector<RefPtrWillBeMember<Node> > m_nodes; member in class:blink::XPath::NodeSet
[all...]
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/
H A DDOM2DTM.java104 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
[all...]

Completed in 219 milliseconds