HomeSort by relevance Sort by last modified time
    Searched refs:NodeSet (Results 1 - 25 of 34) sorted by null

1 2

  /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...]
XPathValue.h 42 static PassRefPtrWillBeRawPtr<ValueData> create(const NodeSet& nodeSet) { return adoptRefWillBeNoop(new ValueData(nodeSet)); }
43 static PassRefPtrWillBeRawPtr<ValueData> create(PassOwnPtrWillBeRawPtr<NodeSet> nodeSet) { return adoptRefWillBeNoop(new ValueData(nodeSet)); }
46 NodeSet& nodeSet() { return *m_nodeSet; }
51 ValueData() : m_nodeSet(NodeSet::create()) { }
52 explicit ValueData(const NodeSet& nodeSet) : m_nodeSet(NodeSet::create(nodeSet)) {
    [all...]
XPathValue.cpp 51 const NodeSet& Value::toNodeSet(EvaluationContext* context) const
57 DEFINE_STATIC_LOCAL(OwnPtrWillBePersistent<NodeSet>, emptyNodeSet, (NodeSet::create()));
61 return m_data->nodeSet();
64 NodeSet& Value::modifiableNodeSet(EvaluationContext& context)
73 return m_data->nodeSet();
80 return !m_data->nodeSet().isEmpty();
128 if (m_data->nodeSet().isEmpty())
130 return stringValue(m_data->nodeSet().firstNode());
XPathPath.cpp 64 NodeSet& nodes = v.modifiableNodeSet(evaluationContext);
68 OwnPtrWillBeRawPtr<NodeSet> newNodes(NodeSet::create());
127 OwnPtrWillBeRawPtr<NodeSet> nodes(NodeSet::create());
134 void LocationPath::evaluate(EvaluationContext& context, NodeSet& nodes) const
140 OwnPtrWillBeRawPtr<NodeSet> newNodes(NodeSet::create());
154 OwnPtrWillBeRawPtr<NodeSet> matches(NodeSet::create())
    [all...]
XPathNodeSet.cpp 44 PassOwnPtrWillBeRawPtr<NodeSet> NodeSet::create(const NodeSet& other)
46 OwnPtrWillBeRawPtr<NodeSet> nodeSet = NodeSet::create();
47 nodeSet->m_isSorted = other.m_isSorted;
48 nodeSet->m_subtreesAreDisjoint = other.m_subtreesAreDisjoint;
49 nodeSet->m_nodes.appendVector(other.m_nodes);
50 return nodeSet.release()
    [all...]
XPathResult.h 88 XPath::NodeSet& nodeSet() { return *m_nodeSet; }
92 OwnPtrWillBeMember<XPath::NodeSet> m_nodeSet; // FIXME: why duplicate the node set stored in m_value?
XPathPredicate.cpp 119 const NodeSet& lhsSet = lhs.toNodeSet(&context);
126 const NodeSet& rhsSet = rhs.toNodeSet(&context);
171 const NodeSet& rhsSet = rhs.toNodeSet(&context);
191 // Neither side is a NodeSet.
257 NodeSet& resultSet = lhsResult.modifiableNodeSet(context);
258 const NodeSet& rhsNodes = rhs.toNodeSet(&context);
XPathResult.cpp 60 m_nodeSet = NodeSet::create(m_value.toNodeSet(&context));
108 nodeSet().sort();
161 const NodeSet& nodes = m_value.toNodeSet(0);
198 if (m_nodeSetPosition + 1 > nodeSet().size())
201 Node* node = nodeSet()[m_nodeSetPosition];
215 const NodeSet& nodes = m_value.toNodeSet(0);
XPathStep.h 103 void evaluate(EvaluationContext&, Node* context, NodeSet&) const;
114 void nodesInAxis(EvaluationContext&, Node* context, NodeSet&) const;
XPathPath.h 63 void evaluate(EvaluationContext&, NodeSet&) const; // nodes is an input/output parameter
XPathStep.cpp 129 void Step::evaluate(EvaluationContext& evaluationContext, Node* context, NodeSet& nodes) const
139 OwnPtrWillBeRawPtr<NodeSet> newNodes(NodeSet::create());
258 void Step::nodesInAxis(EvaluationContext& evaluationContext, Node* context, NodeSet& nodes) const
  /libcore/luni/src/main/java/java/util/prefs/
NodeSet.java 8 class NodeSet implements NodeList {
12 public NodeSet(Iterator<Node> nodes) {
  /external/chromium_org/components/bookmarks/browser/
bookmark_client.cc 28 const NodeSet& nodes,
bookmark_client.h 36 typedef std::set<const BookmarkNode*> NodeSet;
63 const NodeSet& nodes,
bookmark_index.h 29 // Index) maps from a lower case string to the set (type NodeSet) of
53 typedef std::set<const BookmarkNode*> NodeSet;
54 typedef std::map<base::string16, NodeSet> Index;
bookmark_index.cc 79 NodeSet nodes;
83 NodeSet::const_iterator nodes_begin() const;
87 NodeSet::const_iterator nodes_end() const;
90 BookmarkIndex::NodeSet::const_iterator
95 BookmarkIndex::NodeSet::const_iterator BookmarkIndex::Match::nodes_end() const {
173 NodeSet nodes;
180 for (NodeSet::const_iterator n = i->nodes_begin(); n != i->nodes_end(); ++n)
298 NodeSet intersection;
317 NodeSet intersection;
  /external/chromium_org/v8/src/compiler/
node.h 68 typedef std::set<Node*, std::less<Node*>, zone_allocator<Node*> > NodeSet;
69 typedef NodeSet::iterator NodeSetIter;
70 typedef NodeSet::reverse_iterator NodeSetRIter;
graph-visualizer.cc 39 NodeSet all_nodes_;
40 NodeSet white_nodes_;
268 all_nodes_(NodeSet::key_compare(), NodeSet::allocator_type(zone)),
269 white_nodes_(NodeSet::key_compare(), NodeSet::allocator_type(zone)),
verifier.cc 49 : reached_from_start(NodeSet::key_compare(),
50 NodeSet::allocator_type(zone)),
51 reached_from_end(NodeSet::key_compare(),
52 NodeSet::allocator_type(zone)) {}
58 NodeSet reached_from_start;
59 NodeSet reached_from_end;
248 for (NodeSet::iterator it = visitor.reached_from_end.begin();
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
HitTestResult.h 52 typedef WillBeHeapListHashSet<RefPtrWillBeMember<Node> > NodeSet;
127 // If m_rectBasedTestResult is 0 then set it to a new NodeSet. Return *m_rectBasedTestResult. Lazy allocation makes
128 // sense because the NodeSet is seldom necessary, and it's somewhat expensive to allocate and initialize. This method does
130 const NodeSet& rectBasedTestResult() const;
136 NodeSet& mutableRectBasedTestResult(); // See above.
153 mutable OwnPtrWillBeMember<NodeSet> m_rectBasedTestResult;
HitTestResult.cpp 89 // Only copy the NodeSet in case of rect hit test.
90 m_rectBasedTestResult = adoptPtrWillBeNoop(other.m_rectBasedTestResult ? new NodeSet(*other.m_rectBasedTestResult) : 0);
110 // Only copy the NodeSet in case of rect hit test.
111 m_rectBasedTestResult = adoptPtrWillBeNoop(other.m_rectBasedTestResult ? new NodeSet(*other.m_rectBasedTestResult) : 0);
434 NodeSet& set = mutableRectBasedTestResult();
435 for (NodeSet::const_iterator it = other.m_rectBasedTestResult->begin(), last = other.m_rectBasedTestResult->end(); it != last; ++it)
440 const HitTestResult::NodeSet& HitTestResult::rectBasedTestResult() const
443 m_rectBasedTestResult = adoptPtrWillBeNoop(new NodeSet);
447 HitTestResult::NodeSet& HitTestResult::mutableRectBasedTestResult()
450 m_rectBasedTestResult = adoptPtrWillBeNoop(new NodeSet);
    [all...]
  /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;
  /external/chromium_org/components/enhanced_bookmarks/
metadata_accessor.h 25 typedef std::set<const BookmarkNode*> NodeSet;
  /external/chromium_org/chrome/browser/bookmarks/
chrome_bookmark_client.h 54 const NodeSet& nodes,

Completed in 995 milliseconds

1 2