| /external/webkit/Source/WebCore/xml/ |
| D | XPathNodeSet.h | 45 size_t size() const { return m_nodes.size(); } in size()
46 bool isEmpty() const { return !m_nodes.size(); } in isEmpty()
47 Node* operator[](unsigned i) const { return m_nodes.at(i).get(); }
48 void reserveCapacity(size_t newCapacity) { m_nodes.reserveCapacity(newCapacity); } in reserveCapacity()
49 void clear() { m_nodes.clear(); } in clear()
50 …ted); std::swap(m_subtreesAreDisjoint, other.m_subtreesAreDisjoint); m_nodes.swap(other.m_nodes); } in swap()
53 void append(Node* node) { m_nodes.append(node); } in append()
54 void append(PassRefPtr<Node> node) { m_nodes.append(node); } in append()
55 void append(const NodeSet& nodeSet) { m_nodes.append(nodeSet.m_nodes); } in append()
65 bool isSorted() const { return m_isSorted || m_nodes.size() < 2; } in isSorted()
[all …]
|
| D | XPathNodeSet.cpp | 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()
|
| /external/webkit/Source/WebCore/dom/ |
| D | StaticHashSetNodeList.cpp | 39 m_nodes.swap(nodes); in StaticHashSetNodeList()
52 return m_nodes.size(); in length()
57 if (index < (unsigned) m_nodes.size()) { in item()
58 ListHashSet<RefPtr<Node> >::const_iterator it = m_nodes.begin(); in item()
68 ListHashSet<RefPtr<Node> >::const_iterator it = m_nodes.begin(); in itemWithName()
69 ListHashSet<RefPtr<Node> >::const_iterator end = m_nodes.end(); in itemWithName()
|
| D | StaticNodeList.cpp | 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()
|
| D | StaticNodeList.h | 56 m_nodes.swap(nodes); in StaticNodeList()
58 Vector<RefPtr<Node> > m_nodes; variable
|
| D | StaticHashSetNodeList.h | 65 ListHashSet<RefPtr<Node> > m_nodes; variable
|
| /external/webkit/Source/WebCore/bindings/v8/custom/ |
| D | V8NamedNodesCollection.cpp | 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()
|
| D | V8NamedNodesCollection.h | 49 virtual unsigned length() const { return m_nodes.size(); } in length()
55 : m_nodes(nodes) { } in V8NamedNodesCollection()
57 Vector<RefPtr<Node> > m_nodes; variable
|
| /external/webkit/Source/JavaScriptCore/runtime/ |
| D | JSArray.cpp | 997 Vector<AVLTreeNodeForArrayCompare> m_nodes; member
1005 handle get_less(handle h) { return m_nodes[h].lt & 0x7FFFFFFF; } in get_less()
1006 void set_less(handle h, handle lh) { m_nodes[h].lt &= 0x80000000; m_nodes[h].lt |= lh; } in set_less()
1007 handle get_greater(handle h) { return m_nodes[h].gt & 0x7FFFFFFF; } in get_greater()
1008 void set_greater(handle h, handle gh) { m_nodes[h].gt &= 0x80000000; m_nodes[h].gt |= gh; } in set_greater()
1012 if (m_nodes[h].gt & 0x80000000) in get_balance_factor()
1014 return static_cast<unsigned>(m_nodes[h].lt) >> 31; in get_balance_factor()
1020 m_nodes[h].lt &= 0x7FFFFFFF; in set_balance_factor()
1021 m_nodes[h].gt &= 0x7FFFFFFF; in set_balance_factor()
1023 m_nodes[h].lt |= 0x80000000; in set_balance_factor()
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| D | DOM2DTM.java | 104 protected Vector m_nodes = new Vector(); field in DOM2DTM
185 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 …]
|
| /external/webkit/Source/WebCore/editing/ |
| D | MarkupAccumulator.cpp | 77 : m_nodes(nodes) in MarkupAccumulator()
127 if (m_nodes) in appendStartTag()
128 m_nodes->append(node); in appendStartTag()
|
| D | MarkupAccumulator.h | 104 Vector<Node*>* const m_nodes; variable
|
| D | markup.cpp | 155 if (m_nodes) in wrapWithNode()
156 m_nodes->append(node); in wrapWithNode()
|
| /external/webkit/Source/WebCore/platform/graphics/android/context/ |
| D | PlatformGraphicsContextRecording.cpp | 359 , m_nodes(nodes) in ClippingPainter()
365 drawWithClipRecursive(static_cast<int>(m_nodes.size()) - 1, bounds, 0); in draw()
397 RecordingData* recordingData = m_nodes[index]; in drawWithClipRecursive()
425 const Vector<RecordingData*>& m_nodes; member in WebCore::ClippingPainter
|
| /external/webkit/Source/WebCore/ |
| D | ChangeLog-2010-12-06 | 79822 …::MarkupAccumulatorWrapper::MarkupAccumulatorWrapper): Takes vector of nodes and set it to m_nodes.
79823 (WebCore::MarkupAccumulatorWrapper::insertOpenTag): Adds node to m_nodes.
79824 (WebCore::MarkupAccumulatorWrapper::wrapWithNode): Adds node to m_nodes.
|