HomeSort by relevance Sort by last modified time
    Searched refs:m_nodes (Results 1 - 13 of 13) sorted by null

  /external/chromium_org/third_party/WebKit/Source/core/dom/shadow/
ContentDistribution.h 43 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...]
ContentDistribution.cpp 36 m_nodes.swap(other.m_nodes);
44 size_t size = m_nodes.size();
46 m_nodes.append(node);
77 visitor->trace(m_nodes);
ElementShadow.cpp 53 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[i]->renderer()
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/xml/
XPathNodeSet.h 42 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.appendVector(nodeSet.m_nodes);
81 WillBeHeapVector<RefPtrWillBeMember<Node> > m_nodes; member in class:blink::XPath::NodeSet
    [all...]
XPathNodeSet.cpp 49 nodeSet->m_nodes.appendVector(other.m_nodes);
161 unsigned nodeCount = m_nodes.size();
177 Node* n = m_nodes[i].get();
189 // It is not possible to just assign the result to m_nodes, because some
196 const_cast<WillBeHeapVector<RefPtrWillBeMember<Node> >&>(m_nodes).swap(sortedNodes);
217 unsigned nodeCount = m_nodes.size();
220 Node* node = m_nodes[i].get();
229 for (Node* n = findRootNode(m_nodes.first().get()); n; n = NodeTraversal::next(*n)) {
247 const_cast<WillBeHeapVector<RefPtrWillBeMember<Node> >&>(m_nodes).swap(sortedNodes)
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/dom/
DocumentOrderedList.h 48 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
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()->compareDocumentPosition(node, Node::TreatShadowTreesAsComposed) & Node::DOCUMENT_POSITION_FOLLOWING);
64 m_nodes.add(node);
69 m_nodes.remove(const_cast<Node*>(node))
    [all...]
StaticNodeList.h 63 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/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 106 RawPtrWillBeMember<WillBeHeapVector<RawPtrWillBeMember<Node> > > const m_nodes; member in class:blink::MarkupAccumulator
MarkupAccumulator.cpp 101 : m_nodes(nodes)
177 if (m_nodes)
178 m_nodes->append(&node);
markup.cpp 184 if (m_nodes)
185 m_nodes->append(&node);
    [all...]
  /prebuilts/tools/common/m2/repository/xalan/xalan/2.6.0/
xalan-2.6.0.jar 

Completed in 364 milliseconds