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

  /libcore/luni/src/main/java/java/util/prefs/
NodeSet.java 8 class NodeSet implements NodeList {
12 public NodeSet(Iterator<Node> nodes) {
XMLParser.java 435 result = new NodeSet(input.iterator());
  /external/chromium_org/third_party/WebKit/Source/core/xml/
XPathNodeSet.h 38 class NodeSet {
41 NodeSet() : m_isSorted(true), m_subtreesAreDisjoint(false) { }
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.
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
    [all...]
XPathPath.cpp 56 NodeSet& nodes = v.modifiableNodeSet();
61 NodeSet newNodes;
111 NodeSet nodes;
119 void LocationPath::evaluate(NodeSet& nodes) const
125 NodeSet newNodes;
139 NodeSet matches;
207 NodeSet& nodes = v.modifiableNodeSet();
XPathValue.cpp 43 const NodeSet& Value::toNodeSet() const
49 DEFINE_STATIC_LOCAL(NodeSet, emptyNodeSet, ());
56 NodeSet& Value::modifiableNodeSet()
XPathResult.h 80 XPath::NodeSet m_nodeSet; // FIXME: why duplicate the node set stored in m_value?
XPathNodeSet.cpp 137 void NodeSet::sort() const
192 void NodeSet::traversalSort() const
232 void NodeSet::reverse()
246 Node* NodeSet::firstNode() const
255 Node* NodeSet::anyNode() const
XPathPredicate.cpp 106 const NodeSet& lhsSet = lhs.toNodeSet();
111 const NodeSet& rhsSet = rhs.toNodeSet();
145 const NodeSet& rhsSet = rhs.toNodeSet();
163 // Neither side is a NodeSet.
232 NodeSet& resultSet = lhsResult.modifiableNodeSet();
233 const NodeSet& rhsNodes = rhs.toNodeSet();
XPathResult.cpp 155 const NodeSet& nodes = m_value.toNodeSet();
210 const NodeSet& nodes = m_value.toNodeSet();
XPathStep.h 101 void evaluate(Node* context, NodeSet&) const;
111 void nodesInAxis(Node* context, NodeSet&) const;
XPathPath.h 61 void evaluate(NodeSet& nodes) const; // nodes is an input/output parameter
XPathStep.cpp 117 void Step::evaluate(Node* context, NodeSet& nodes) const
128 NodeSet newNodes;
241 void Step::nodesInAxis(Node* context, NodeSet& nodes) const
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/
HitTestResult.h 50 typedef ListHashSet<RefPtr<Node> > NodeSet;
122 // If m_rectBasedTestResult is 0 then set it to a new NodeSet. Return *m_rectBasedTestResult. Lazy allocation makes
123 // sense because the NodeSet is seldom necessary, and it's somewhat expensive to allocate and initialize. This method does
125 const NodeSet& rectBasedTestResult() const;
130 NodeSet& mutableRectBasedTestResult(); // See above.
146 mutable OwnPtr<NodeSet> m_rectBasedTestResult;
HitTestResult.cpp 93 // Only copy the NodeSet in case of rect hit test.
94 m_rectBasedTestResult = adoptPtr(other.m_rectBasedTestResult ? new NodeSet(*other.m_rectBasedTestResult) : 0);
114 // Only copy the NodeSet in case of rect hit test.
115 m_rectBasedTestResult = adoptPtr(other.m_rectBasedTestResult ? new NodeSet(*other.m_rectBasedTestResult) : 0);
471 NodeSet& set = mutableRectBasedTestResult();
472 for (NodeSet::const_iterator it = other.m_rectBasedTestResult->begin(), last = other.m_rectBasedTestResult->end(); it != last; ++it)
477 const HitTestResult::NodeSet& HitTestResult::rectBasedTestResult() const
480 m_rectBasedTestResult = adoptPtr(new NodeSet);
484 HitTestResult::NodeSet& HitTestResult::mutableRectBasedTestResult()
487 m_rectBasedTestResult = adoptPtr(new NodeSet);
    [all...]
  /external/chromium/chrome/browser/bookmarks/
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;
bookmark_index.h 34 // Index) maps from a lower case string to the set (type NodeSet) of
55 typedef std::set<const BookmarkNode*> NodeSet;
56 typedef std::map<string16, NodeSet> Index;
  /external/chromium_org/chrome/browser/bookmarks/
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;
bookmark_index.h 33 // 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;
  /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/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...]
  /external/chromium_org/third_party/WebKit/Source/web/
WebPluginContainerImpl.cpp 493 const HitTestResult::NodeSet& nodes = result.rectBasedTestResult();
  /prebuilts/tools/common/m2/internal/xalan/xalan/2.6.0/
xalan-2.6.0.jar 

Completed in 560 milliseconds