Searched refs:m_nodes (Results 1 – 15 of 15) sorted by relevance
43 size_t size() const { return m_nodes.size(); } in size()44 bool isEmpty() const { return !m_nodes.size(); } in isEmpty()45 Node* operator[](unsigned i) const { return m_nodes.at(i).get(); }46 void reserveCapacity(size_t newCapacity) { m_nodes.reserveCapacity(newCapacity); } in reserveCapacity()47 void clear() { m_nodes.clear(); } in clear()48 …ted); std::swap(m_subtreesAreDisjoint, other.m_subtreesAreDisjoint); m_nodes.swap(other.m_nodes); } in swap()51 void append(Node* node) { m_nodes.append(node); } in append()52 void append(PassRefPtr<Node> node) { m_nodes.append(node); } in append()53 void append(const NodeSet& nodeSet) { m_nodes.append(nodeSet.m_nodes); } in append()63 bool isSorted() const { return m_isSorted || m_nodes.size() < 2; } in isSorted()[all …]
142 unsigned nodeCount = m_nodes.size(); in sort()158 Node* n = m_nodes[i].get(); in sort()176 const_cast<Vector<RefPtr<Node> >&>(m_nodes).swap(sortedNodes); in sort()197 unsigned nodeCount = m_nodes.size(); in traversalSort()200 Node* node = m_nodes[i].get(); in traversalSort()209 for (Node* n = findRootNode(m_nodes.first().get()); n; n = NodeTraversal::next(*n)) { in traversalSort()229 const_cast<Vector<RefPtr<Node> >&>(m_nodes).swap(sortedNodes); in traversalSort()234 if (m_nodes.isEmpty()) in reverse()238 unsigned to = m_nodes.size() - 1; in reverse()240 m_nodes[from].swap(m_nodes[to]); in reverse()[all …]
37 if (m_nodes.isEmpty()) { in add()38 m_nodes.add(node); in add()43 iterator begin = m_nodes.begin(); in add()44 iterator end = m_nodes.end(); in add()52 m_nodes.insertBefore(followingNode, node); in add()58 m_nodes.insertBefore(followingNode, node); in add()63 …ASSERT(m_nodes.isEmpty() || m_nodes.last()->compareDocumentPositionInternal(node, Node::TreatShado… in parserAdd()64 m_nodes.add(node); in parserAdd()69 m_nodes.remove(const_cast<Node*>(node)); in remove()
46 bool isEmpty() const { return m_nodes.isEmpty(); } in isEmpty()47 void clear() { m_nodes.clear(); } in clear()51 iterator begin() { return m_nodes.begin(); } in begin()52 iterator end() { return m_nodes.end(); } in end()55 ListHashSet<Node*, 32> m_nodes;
38 return m_nodes.size(); in length()43 if (index < m_nodes.size()) in item()44 return m_nodes[index].get(); in item()50 size_t length = m_nodes.size(); in namedItem()52 Node* node = m_nodes[i].get(); in namedItem()
39 if (index < m_nodes.size()) in item()40 return m_nodes[index].get(); in item()46 for (unsigned i = 0; i < m_nodes.size(); ++i) { in namedItem()47 Node* node = m_nodes[i].get(); in namedItem()
49 virtual unsigned length() const OVERRIDE { return m_nodes.size(); } in length()55 : m_nodes(nodes) { } in NamedNodesCollection()57 Vector<RefPtr<Node> > m_nodes; variable
46 nodeList->m_nodes.swap(nodes); in adopt()60 Vector<RefPtr<Node> > m_nodes;
43 ContentDistribution() { m_nodes.reserveInitialCapacity(32); } in ContentDistribution()45 PassRefPtr<Node> first() const { return m_nodes.first(); } in first()46 PassRefPtr<Node> last() const { return m_nodes.last(); } in last()47 PassRefPtr<Node> at(size_t index) const { return m_nodes.at(index); } in at()49 size_t size() const { return m_nodes.size(); } in size()50 bool isEmpty() const { return m_nodes.isEmpty(); } in isEmpty()53 void clear() { m_nodes.clear(); m_indices.clear(); } in clear()54 void shrinkToFit() { m_nodes.shrinkToFit(); } in shrinkToFit()63 const Vector<RefPtr<Node> >& nodes() const { return m_nodes; } in nodes()66 Vector<RefPtr<Node> > m_nodes;
36 m_nodes.swap(other.m_nodes); in swap()44 size_t size = m_nodes.size(); in append()46 m_nodes.append(node); in append()
49 Vector<Node*, 32> m_nodes; member in WebCore::DistributionPool61 m_nodes.clear(); in clear()72 m_nodes.append(insertionPoint->at(i)); in populateChildren()74 m_nodes.append(child); in populateChildren()77 m_distributed.resize(m_nodes.size()); in populateChildren()85 for (size_t i = 0; i < m_nodes.size(); ++i) { in distributeTo()89 …ContentElement(insertionPoint) && !toHTMLContentElement(insertionPoint)->canSelectNode(m_nodes, i)) in distributeTo()92 Node* node = m_nodes[i]; in distributeTo()115 for (size_t i = 0; i < m_nodes.size(); ++i) { in detachNonDistributedNodes()118 if (m_nodes[i]->renderer()) in detachNonDistributedNodes()[all …]
104 protected Vector m_nodes = new Vector(); field in DOM2DTM185 int nodeIndex = m_nodes.size(); in addNode()246 m_nodes.addElement(node); in addNode()316 return m_nodes.size(); in getNumberOfNodes()456 for(int i=0;i<m_nodes.size();++i) in nextNode()609 return (Node) m_nodes.elementAt(identity); in getNode()621 return (Node) m_nodes.elementAt(nodeIdentity); in lookupNode()636 if (identity >= m_nodes.size()) in getNextNodeIdentity()668 int len = m_nodes.size(); in getHandleFromNode()675 if (m_nodes.elementAt(i) == node) in getHandleFromNode()[all …]
107 Vector<Node*>* const m_nodes; variable
104 : m_nodes(nodes) in MarkupAccumulator()176 if (m_nodes) in appendStartTag()177 m_nodes->append(node); in appendStartTag()
170 if (m_nodes) in wrapWithNode()171 m_nodes->append(node); in wrapWithNode()