HomeSort by relevance Sort by last modified time
    Searched defs:NodeSet (Results 1 - 9 of 9) sorted by null

  /external/chromium_org/components/enhanced_bookmarks/
metadata_accessor.h 22 typedef std::set<const BookmarkNode*> NodeSet;
  /external/chromium_org/components/bookmarks/browser/
bookmark_client.h 33 typedef std::set<const BookmarkNode*> NodeSet;
58 const NodeSet& nodes,
bookmark_index.h 29 // Index) maps from a lower case string to the set (type NodeSet) of
56 typedef std::set<const BookmarkNode*> NodeSet;
57 typedef std::map<base::string16, NodeSet> Index;
  /libcore/luni/src/main/java/java/util/prefs/
NodeSet.java 8 class NodeSet implements NodeList {
12 public NodeSet(Iterator<Node> nodes) {
  /external/chromium_org/third_party/WebKit/Source/core/xml/
XPathNodeSet.h 37 class NodeSet : public NoBaseWillBeGarbageCollected<NodeSet> {
40 static PassOwnPtrWillBeRawPtr<NodeSet> create() { return adoptPtrWillBeNoop(new NodeSet); }
41 static PassOwnPtrWillBeRawPtr<NodeSet> create(const NodeSet&);
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); }
51 // NodeSet itself does not verify that nodes in it are unique.
53 void append(const NodeSet& nodeSet) { m_nodes.appendVector(nodeSet.m_nodes);
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
HitTestResult.h 50 typedef WillBeHeapListHashSet<RefPtrWillBeMember<Node> > NodeSet;
123 // If m_rectBasedTestResult is 0 then set it to a new NodeSet. Return *m_rectBasedTestResult. Lazy allocation makes
124 // sense because the NodeSet is seldom necessary, and it's somewhat expensive to allocate and initialize. This method does
126 const NodeSet& rectBasedTestResult() const;
132 NodeSet& mutableRectBasedTestResult(); // See above.
148 mutable OwnPtrWillBePersistent<NodeSet> m_rectBasedTestResult;
  /external/apache-xml/src/main/java/org/apache/xpath/
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
66 public NodeSet()
77 public NodeSet(int blocksize)
84 * Create a NodeSet, and copy the members of the
89 public NodeSet(NodeList nodelist)
98 * Create a NodeSet, and copy the members of the
99 * given NodeSet into it
    [all...]
  /external/llvm/include/llvm/CodeGen/PBQP/
RegAllocSolver.h 284 NodeSet::iterator NItr = OptimallyReducibleNodes.begin();
306 NodeSet::iterator NItr = ConservativelyAllocatableNodes.begin();
313 NodeSet::iterator NItr =
341 typedef std::set<NodeId> NodeSet;
342 NodeSet OptimallyReducibleNodes;
343 NodeSet ConservativelyAllocatableNodes;
344 NodeSet NotProvablyAllocatableNodes;
  /prebuilts/tools/common/m2/repository/xalan/xalan/2.6.0/
xalan-2.6.0.jar 

Completed in 253 milliseconds