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

  /external/webkit/WebCore/xml/
XPathNodeSet.h 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(Node* node) { m_nodes.append(node); }
53 void append(PassRefPtr<Node> node) { m_nodes.append(node); }
54 void append(const NodeSet& nodeSet) { m_nodes.append(nodeSet.m_nodes);
77 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/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();
StaticNodeList.h 56 m_nodes.swap(nodes);
58 Vector<RefPtr<Node> > m_nodes; member in class:WebCore::StaticNodeList
  /external/webkit/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 44 : m_nodes(nodes) { }
45 virtual unsigned length() const { return m_nodes.size(); }
50 Vector<RefPtr<Node> > m_nodes; member in class:WebCore::V8NamedNodesCollection
  /external/webkit/JavaScriptCore/runtime/
JSArray.cpp 757 typedef int32_t handle; // Handle is an index into m_nodes vector.
761 Vector<AVLTreeNodeForArrayCompare> m_nodes; member in struct:JSC::AVLTreeAbstractorForArrayCompare
769 handle get_less(handle h) { return m_nodes[h].lt & 0x7FFFFFFF; }
770 void set_less(handle h, handle lh) { m_nodes[h].lt &= 0x80000000; m_nodes[h].lt |= lh; }
771 handle get_greater(handle h) { return m_nodes[h].gt & 0x7FFFFFFF; }
772 void set_greater(handle h, handle gh) { m_nodes[h].gt &= 0x80000000; m_nodes[h].gt |= gh; }
776 if (m_nodes[h].gt & 0x80000000)
778 return static_cast<unsigned>(m_nodes[h].lt) >> 31
    [all...]
  /frameworks/base/tools/localize/
XMLHandler.cpp 709 m_nodes.push_back(root);
728 pretty = m_nodes[m_nodes.size()-1]->Pretty();
735 m_nodes[m_nodes.size()-1]->EditChildren().push_back(n);
737 m_nodes.push_back(n);
744 m_nodes.pop_back();
754 XMLNode* n = XMLNode::NewText(pos, text, m_nodes[m_nodes.size()-1]->Pretty());
755 m_nodes[m_nodes.size()-1]->EditChildren().push_back(n)
    [all...]
XMLHandler.h 189 vector<XMLNode*> m_nodes; member in class:NodeHandler
  /dalvik/libcore/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/WebCore/editing/
markup.cpp 606 , m_nodes(nodes)
617 Vector<Node*>* m_nodes; member in class:WebCore::MarkupAccumulator
632 if (m_nodes)
633 m_nodes->append(startNode);
    [all...]

Completed in 198 milliseconds