/external/chromium_org/third_party/WebKit/Source/core/xml/ |
H A D | XPathNodeSet.h | 38 class NodeSet { class in namespace:WebCore::XPath 41 NodeSet() : m_isSorted(true), m_subtreesAreDisjoint(false) { } function in class:WebCore::XPath::NodeSet 48 void swap(NodeSet& other) { std::swap(m_isSorted, other.m_isSorted); std::swap(m_subtreesAreDisjoint, other.m_subtreesAreDisjoint); m_nodes.swap(other.m_nodes); } 50 // NodeSet itself does not verify that nodes in it are unique. 53 void append(const NodeSet& nodeSet) { m_nodes.append(nodeSet.m_nodes); } 61 // NodeSet itself doesn't check if it contains nodes in document order - the caller should tell it if it does not.
|
H A D | XPathValue.h | 40 static PassRefPtr<ValueData> create(const NodeSet& nodeSet) { return adoptRef(new ValueData(nodeSet)); } 43 NodeSet m_nodeSet; 48 explicit ValueData(const NodeSet& nodeSet) : m_nodeSet(nodeSet) { } 63 Value(const NodeSet& value) : m_type(NodeSetValue), m_bool(false), m_number(0), m_data(ValueData::create(value)) {} 70 Value(NodeSet& value, const AdoptTag&) : m_type(NodeSetValue), m_bool(false), m_number(0), m_data(ValueData::create()) { value.swap(m_data->m_nodeSet); } 79 const NodeSet& toNodeSet() const; 80 NodeSet& modifiableNodeSet();
|
H A D | XPathPath.cpp | 57 NodeSet& nodes = v.modifiableNodeSet(); 62 NodeSet newNodes; 112 NodeSet nodes; 120 void LocationPath::evaluate(NodeSet& nodes) const 126 NodeSet newNodes; 140 NodeSet matches; 208 NodeSet& nodes = v.modifiableNodeSet();
|
H A D | XPathValue.cpp | 43 const NodeSet& Value::toNodeSet() const 49 DEFINE_STATIC_LOCAL(NodeSet, emptyNodeSet, ()); 56 NodeSet& Value::modifiableNodeSet()
|
H A D | XPathStep.h | 84 void evaluate(Node* context, NodeSet&) const; 94 void nodesInAxis(Node* context, NodeSet&) const;
|
H A D | XPathNodeSet.cpp | 138 void NodeSet::sort() const 193 void NodeSet::traversalSort() const 233 void NodeSet::reverse() 247 Node* NodeSet::firstNode() const 256 Node* NodeSet::anyNode() const
|
H A D | XPathPredicate.cpp | 107 const NodeSet& lhsSet = lhs.toNodeSet(); 112 const NodeSet& rhsSet = rhs.toNodeSet(); 146 const NodeSet& rhsSet = rhs.toNodeSet(); 164 // Neither side is a NodeSet. 233 NodeSet& resultSet = lhsResult.modifiableNodeSet(); 234 const NodeSet& rhsNodes = rhs.toNodeSet();
|
H A D | XPathResult.cpp | 155 const NodeSet& nodes = m_value.toNodeSet(); 210 const NodeSet& nodes = m_value.toNodeSet();
|
H A D | XPathPath.h | 61 void evaluate(NodeSet& nodes) const; // nodes is an input/output parameter
|
H A D | XPathResult.h | 80 XPath::NodeSet m_nodeSet; // FIXME: why duplicate the node set stored in m_value?
|
H A D | XPathStep.cpp | 112 void Step::evaluate(Node* context, NodeSet& nodes) const 123 NodeSet newNodes; 234 void Step::nodesInAxis(Node* context, NodeSet& nodes) const
|
H A D | XPathFunctions.cpp | 322 const NodeSet& nodes = a.toNodeSet(); 334 NodeSet result; 637 const NodeSet& nodes = a.toNodeSet();
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | HitTestResult.h | 49 typedef ListHashSet<RefPtr<Node> > NodeSet; typedef in class:WebCore::HitTestResult 116 // If m_rectBasedTestResult is 0 then set it to a new NodeSet. Return *m_rectBasedTestResult. Lazy allocation makes 117 // sense because the NodeSet is seldom necessary, and it's somewhat expensive to allocate and initialize. This method does 119 const NodeSet& rectBasedTestResult() const; 124 NodeSet& mutableRectBasedTestResult(); // See above. 138 mutable OwnPtr<NodeSet> m_rectBasedTestResult;
|
H A D | HitTestResult.cpp | 87 // Only copy the NodeSet in case of rect hit test. 88 m_rectBasedTestResult = adoptPtr(other.m_rectBasedTestResult ? new NodeSet(*other.m_rectBasedTestResult) : 0); 106 // Only copy the NodeSet in case of rect hit test. 107 m_rectBasedTestResult = adoptPtr(other.m_rectBasedTestResult ? new NodeSet(*other.m_rectBasedTestResult) : 0); 453 NodeSet& set = mutableRectBasedTestResult(); 454 for (NodeSet::const_iterator it = other.m_rectBasedTestResult->begin(), last = other.m_rectBasedTestResult->end(); it != last; ++it) 459 const HitTestResult::NodeSet& HitTestResult::rectBasedTestResult() const 462 m_rectBasedTestResult = adoptPtr(new NodeSet); 466 HitTestResult::NodeSet& HitTestResult::mutableRectBasedTestResult() 469 m_rectBasedTestResult = adoptPtr(new NodeSet); [all...] |
/external/chromium/chrome/browser/bookmarks/ |
H A D | bookmark_index.cc | 33 NodeSet nodes; 37 NodeSet::const_iterator nodes_begin() const; 41 NodeSet::const_iterator nodes_end() const; 44 BookmarkIndex::NodeSet::const_iterator 49 BookmarkIndex::NodeSet::const_iterator BookmarkIndex::Match::nodes_end() const { 130 for (NodeSet::const_iterator i = match.nodes_begin(); 207 NodeSet intersection; 226 NodeSet intersection;
|
H A D | bookmark_index.h | 34 // Index) maps from a lower case string to the set (type NodeSet) of 55 typedef std::set<const BookmarkNode*> NodeSet; typedef in class:BookmarkIndex 56 typedef std::map<string16, NodeSet> Index;
|
/external/chromium_org/chrome/browser/bookmarks/ |
H A D | bookmark_index.cc | 34 NodeSet nodes; 38 NodeSet::const_iterator nodes_begin() const; 42 NodeSet::const_iterator nodes_end() const; 45 BookmarkIndex::NodeSet::const_iterator 50 BookmarkIndex::NodeSet::const_iterator BookmarkIndex::Match::nodes_end() const { 138 for (NodeSet::const_iterator i = match.nodes_begin(); 215 NodeSet intersection; 234 NodeSet intersection;
|
H A D | bookmark_index.h | 33 // Index) maps from a lower case string to the set (type NodeSet) of 53 typedef std::set<const BookmarkNode*> NodeSet; typedef in class:BookmarkIndex 54 typedef std::map<string16, NodeSet> Index;
|
/external/apache-xml/src/main/java/org/apache/xpath/ |
H A D | NodeSet.java | 19 * $Id: NodeSet.java 468655 2006-10-28 07:12:06Z minchau $ 36 * <p>The NodeSet class can act as either a NodeVector, 52 * <p>Thought: Should NodeSet really implement NodeList and NodeIterator, 59 public class NodeSet class in inherits:NodeList,NodeIterator,Cloneable,ContextNodeList 66 public NodeSet() method in class:NodeSet 77 public NodeSet(int blocksize) method in class:NodeSet 84 * Create a NodeSet, and copy the members of the 89 public NodeSet(NodeList nodelist) method in class:NodeSet 98 * Create a NodeSet, and copy the members of the 99 * given NodeSet int 103 public NodeSet(NodeSet nodelist) method in class:NodeSet 117 public NodeSet(NodeIterator ni) method in class:NodeSet 130 public NodeSet(Node node) method in class:NodeSet [all...] |
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
H A D | DTMNodeProxy.java | 27 import org.apache.xpath.NodeSet; 764 NodeSet nodeSet = new NodeSet(size); 889 NodeSet nodeSet = new NodeSet(size);
|
/external/chromium_org/third_party/WebKit/Source/web/ |
H A D | WebPluginContainerImpl.cpp | 484 const HitTestResult::NodeSet& nodes = result.rectBasedTestResult();
|