Searched refs:m_nodes (Results 1 – 10 of 10) sorted by relevance
44 size_t size() const { return m_nodes.size(); } in size()45 bool isEmpty() const { return !m_nodes.size(); } in isEmpty()46 Node* operator[](unsigned i) const { return m_nodes.at(i).get(); }47 void reserveCapacity(size_t newCapacity) { m_nodes.reserveCapacity(newCapacity); } in reserveCapacity()48 void clear() { m_nodes.clear(); } in clear()49 …ted); std::swap(m_subtreesAreDisjoint, other.m_subtreesAreDisjoint); m_nodes.swap(other.m_nodes); } in swap()52 void append(Node* node) { m_nodes.append(node); } in append()53 void append(PassRefPtr<Node> node) { m_nodes.append(node); } in append()54 void append(const NodeSet& nodeSet) { m_nodes.append(nodeSet.m_nodes); } in append()64 bool isSorted() const { return m_isSorted || m_nodes.size() < 2; } in isSorted()[all …]
140 unsigned nodeCount = m_nodes.size(); in sort()151 Node* n = m_nodes[i].get(); in sort()169 const_cast<Vector<RefPtr<Node> >& >(m_nodes).swap(sortedNodes); in sort()174 if (m_nodes.isEmpty()) in reverse()178 unsigned to = m_nodes.size() - 1; in reverse()180 m_nodes[from].swap(m_nodes[to]); in reverse()192 return m_nodes.at(0).get(); in firstNode()200 return m_nodes.at(0).get(); in anyNode()
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 itemWithName()52 Node* node = m_nodes[i].get(); in itemWithName()
56 m_nodes.swap(nodes); in StaticNodeList()58 Vector<RefPtr<Node> > m_nodes; variable
47 , m_nodes(new Vector<RefPtr<Node> >(nodes)) in JSNamedNodesCollection()54 return jsNumber(exec, thisObj->m_nodes->size()); in lengthGetter()60 return toJS(exec, (*thisObj->m_nodes)[slot.index()].get()); in indexGetter()72 if (ok && index < m_nodes->size()) { in getOwnPropertySlot()81 for (unsigned i = 0; i < m_nodes->size(); i++) { in getOwnPropertySlot()82 Node* node = (*m_nodes)[i].get(); in getOwnPropertySlot()
61 OwnPtr<Vector<RefPtr<Node> > > m_nodes; variable
40 if (index < m_nodes.size()) in item()41 return m_nodes[index].get(); in item()47 for (unsigned i = 0; i < m_nodes.size(); ++i) { in itemWithName()48 Node* node = m_nodes[i].get(); in itemWithName()
44 : m_nodes(nodes) { } in V8NamedNodesCollection()45 virtual unsigned length() const { return m_nodes.size(); } in length()50 Vector<RefPtr<Node> > m_nodes;
742 Vector<AVLTreeNodeForArrayCompare> m_nodes; member750 handle get_less(handle h) { return m_nodes[h].lt & 0x7FFFFFFF; } in get_less()751 void set_less(handle h, handle lh) { m_nodes[h].lt &= 0x80000000; m_nodes[h].lt |= lh; } in set_less()752 handle get_greater(handle h) { return m_nodes[h].gt & 0x7FFFFFFF; } in get_greater()753 void set_greater(handle h, handle gh) { m_nodes[h].gt &= 0x80000000; m_nodes[h].gt |= gh; } in set_greater()757 if (m_nodes[h].gt & 0x80000000) in get_balance_factor()759 return static_cast<unsigned>(m_nodes[h].lt) >> 31; in get_balance_factor()765 m_nodes[h].lt &= 0x7FFFFFFF; in set_balance_factor()766 m_nodes[h].gt &= 0x7FFFFFFF; in set_balance_factor()768 m_nodes[h].lt |= 0x80000000; in set_balance_factor()[all …]
602 , m_nodes(nodes) in MarkupAccumulator()613 Vector<Node*>* m_nodes; member in WebCore::MarkupAccumulator628 if (m_nodes) in appendMarkup()629 m_nodes->append(startNode); in appendMarkup()