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

  /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...]
XPathNodeSet.cpp 140 unsigned nodeCount = m_nodes.size();
151 Node* n = m_nodes[i].get();
163 // It is not possible to just assign the result to m_nodes, because some nodes may get dereferenced and destroyed.
169 const_cast<Vector<RefPtr<Node> >& >(m_nodes).swap(sortedNodes);
174 if (m_nodes.isEmpty())
178 unsigned to = m_nodes.size() - 1;
180 m_nodes[from].swap(m_nodes[to]);
192 return m_nodes.at(0).get();
200 return m_nodes.at(0).get()
    [all...]
  /external/webkit/Source/WebCore/bindings/v8/custom/
V8NamedNodesCollection.cpp 40 if (index < m_nodes.size())
41 return m_nodes[index].get();
47 for (unsigned i = 0; i < m_nodes.size(); ++i) {
48 Node* node = m_nodes[i].get();
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/dom/
StaticNodeList.cpp 38 return m_nodes.size();
43 if (index < m_nodes.size())
44 return m_nodes[index].get();
50 size_t length = m_nodes.size();
52 Node* node = m_nodes[i].get();
StaticHashSetNodeList.cpp 39 m_nodes.swap(nodes);
52 return m_nodes.size();
57 if (index < (unsigned) m_nodes.size()) {
58 ListHashSet<RefPtr<Node> >::const_iterator it = m_nodes.begin();
68 ListHashSet<RefPtr<Node> >::const_iterator it = m_nodes.begin();
69 ListHashSet<RefPtr<Node> >::const_iterator end = m_nodes.end();
StaticNodeList.h 56 m_nodes.swap(nodes);
58 Vector<RefPtr<Node> > m_nodes; member in class:WebCore::StaticNodeList
StaticHashSetNodeList.h 65 ListHashSet<RefPtr<Node> > m_nodes; member in class:WebCore::StaticHashSetNodeList
  /external/webkit/Source/JavaScriptCore/runtime/
JSArray.cpp     [all...]
  /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/webkit/Source/WebCore/editing/
MarkupAccumulator.cpp 77 : m_nodes(nodes)
127 if (m_nodes)
128 m_nodes->append(node);
MarkupAccumulator.h 104 Vector<Node*>* const m_nodes; member in class:WebCore::MarkupAccumulator
markup.cpp 155 if (m_nodes)
156 m_nodes->append(node);
    [all...]
  /external/webkit/Source/WebCore/platform/graphics/android/context/
PlatformGraphicsContextRecording.cpp 360 , m_nodes(nodes)
366 drawWithClipRecursive(static_cast<int>(m_nodes.size()) - 1, bounds, 0);
398 RecordingData* recordingData = m_nodes[index];
426 const Vector<RecordingData*>& m_nodes; member in class:WebCore::ClippingPainter
    [all...]
  /prebuilts/tools/common/m2/internal/xalan/xalan/2.6.0/
xalan-2.6.0.jar 

Completed in 265 milliseconds