HomeSort by relevance Sort by last modified time
    Searched refs:NodeSet (Results 1 - 25 of 29) 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 40 static PassRefPtrWillBeRawPtr<ValueData> create(const NodeSet& nodeSet) { return adoptRefWillBeNoop(new ValueData(nodeSet)); }
41 static PassRefPtrWillBeRawPtr<ValueData> create(PassOwnPtrWillBeRawPtr<NodeSet> nodeSet) { return adoptRefWillBeNoop(new ValueData(nodeSet)); }
44 NodeSet& nodeSet() { return *m_nodeSet; }
49 ValueData() : m_nodeSet(NodeSet::create()) { }
50 explicit ValueData(const NodeSet& nodeSet) : m_nodeSet(NodeSet::create(nodeSet)) {
    [all...]
XPathValue.cpp 51 const NodeSet& Value::toNodeSet() const
57 DEFINE_STATIC_LOCAL(OwnPtrWillBePersistent<NodeSet>, emptyNodeSet, (NodeSet::create()));
61 return m_data->nodeSet();
64 NodeSet& Value::modifiableNodeSet()
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 63 NodeSet& nodes = v.modifiableNodeSet();
68 OwnPtrWillBeRawPtr<NodeSet> newNodes(NodeSet::create());
128 OwnPtrWillBeRawPtr<NodeSet> nodes(NodeSet::create());
136 void LocationPath::evaluate(NodeSet& nodes) const
142 OwnPtrWillBeRawPtr<NodeSet> newNodes(NodeSet::create());
156 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 83 XPath::NodeSet& nodeSet() { return *m_nodeSet; }
87 OwnPtrWillBeMember<XPath::NodeSet> m_nodeSet; // FIXME: why duplicate the node set stored in m_value?
XPathPredicate.cpp 119 const NodeSet& lhsSet = lhs.toNodeSet();
126 const NodeSet& rhsSet = rhs.toNodeSet();
171 const NodeSet& rhsSet = rhs.toNodeSet();
191 // Neither side is a NodeSet.
257 NodeSet& resultSet = lhsResult.modifiableNodeSet();
258 const NodeSet& rhsNodes = rhs.toNodeSet();
XPathResult.cpp 58 m_nodeSet = NodeSet::create(m_value.toNodeSet());
110 nodeSet().sort();
163 const NodeSet& nodes = m_value.toNodeSet();
200 if (m_nodeSetPosition + 1 > nodeSet().size())
203 Node* node = nodeSet()[m_nodeSetPosition];
217 const NodeSet& nodes = m_value.toNodeSet();
XPathStep.h 103 void evaluate(Node* context, NodeSet&) const;
114 void nodesInAxis(Node* context, NodeSet&) const;
XPathPath.h 63 void evaluate(NodeSet&) const; // nodes is an input/output parameter
XPathStep.cpp 129 void Step::evaluate(Node* context, NodeSet& nodes) const
140 OwnPtrWillBeRawPtr<NodeSet> newNodes(NodeSet::create());
261 void Step::nodesInAxis(Node* context, NodeSet& nodes) const
XPathFunctions.cpp 323 const NodeSet& nodes = a.toNodeSet();
335 OwnPtrWillBeRawPtr<NodeSet> result(NodeSet::create());
650 const NodeSet& nodes = a.toNodeSet();
  /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 27 const NodeSet& nodes,
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;
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 {
179 NodeSet nodes;
186 for (NodeSet::const_iterator n = i->nodes_begin(); n != i->nodes_end(); ++n)
308 NodeSet intersection;
327 NodeSet intersection;
  /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;
HitTestResult.cpp 90 // Only copy the NodeSet in case of rect hit test.
91 m_rectBasedTestResult = adoptPtrWillBeNoop(other.m_rectBasedTestResult ? new NodeSet(*other.m_rectBasedTestResult) : 0);
111 // Only copy the NodeSet in case of rect hit test.
112 m_rectBasedTestResult = adoptPtrWillBeNoop(other.m_rectBasedTestResult ? new NodeSet(*other.m_rectBasedTestResult) : 0);
460 NodeSet& set = mutableRectBasedTestResult();
461 for (NodeSet::const_iterator it = other.m_rectBasedTestResult->begin(), last = other.m_rectBasedTestResult->end(); it != last; ++it)
466 const HitTestResult::NodeSet& HitTestResult::rectBasedTestResult() const
469 m_rectBasedTestResult = adoptPtrWillBeNoop(new NodeSet);
473 HitTestResult::NodeSet& HitTestResult::mutableRectBasedTestResult()
476 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 22 typedef std::set<const BookmarkNode*> NodeSet;
  /external/chromium_org/chrome/browser/bookmarks/
chrome_bookmark_client.h 54 const NodeSet& nodes,
chrome_bookmark_client.cc 124 const NodeSet& nodes,
130 for (NodeSet::const_iterator i = nodes.begin(); i != nodes.end(); ++i) {
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
DTMNodeProxy.java 27 import org.apache.xpath.NodeSet;
764 NodeSet nodeSet = new NodeSet(size);
767 nodeSet.addNode((Node) listVector.elementAt(i));
769 return (NodeList) nodeSet;
889 NodeSet nodeSet = new NodeSet(size);
892 nodeSet.addNode((Node)listVector.elementAt(i))
    [all...]

Completed in 382 milliseconds

1 2