Searched defs:NodeSet (Results 1 - 5 of 5) sorted by relevance
/external/chromium/chrome/browser/bookmarks/ |
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.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/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.
|
/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;
|
/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...] |
Completed in 657 milliseconds