HomeSort by relevance Sort by last modified time
    Searched refs:NodeSet (Results 1 - 16 of 16) 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 462 result = new NodeSet(input.iterator());
  /external/webkit/WebCore/xml/
XPathNodeSet.h 40 class NodeSet : public FastAllocBase {
42 NodeSet() : m_isSorted(true), m_subtreesAreDisjoint(false) { }
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.
54 void append(const NodeSet& nodeSet) { m_nodes.append(nodeSet.m_nodes); }
62 // NodeSet itself doesn't check if it contains nodes in document order - the caller should tell it if it does not.
XPathValue.h 42 static PassRefPtr<ValueData> create(const NodeSet& nodeSet) { return adoptRef(new ValueData(nodeSet)); }
45 NodeSet m_nodeSet;
50 ValueData(const NodeSet& nodeSet) : m_nodeSet(nodeSet) { }
65 Value(const NodeSet& value) : m_type(NodeSetValue), m_bool(false), m_number(0), m_data(ValueData::create(value)) {}
72 Value(NodeSet& value, const AdoptTag&) : m_type(NodeSetValue), m_bool(false), m_number(0), m_data(ValueData::create()) { value.swap(m_data->m_nodeSet); }
81 const NodeSet& toNodeSet() const
    [all...]
XPathPath.cpp 59 NodeSet& nodes = v.modifiableNodeSet();
64 NodeSet newNodes;
104 NodeSet nodes;
112 void LocationPath::evaluate(NodeSet& nodes) const
118 NodeSet newNodes;
132 NodeSet matches;
200 NodeSet& nodes = v.modifiableNodeSet();
XPathValue.cpp 46 const NodeSet& Value::toNodeSet() const
52 DEFINE_STATIC_LOCAL(NodeSet, emptyNodeSet, ());
59 NodeSet& Value::modifiableNodeSet()
XPathNodeSet.cpp 135 void NodeSet::sort() const
172 void NodeSet::reverse()
186 Node* NodeSet::firstNode() const
195 Node* NodeSet::anyNode() const
XPathPath.h 63 void evaluate(NodeSet& nodes) const; // nodes is an input/output parameter
XPathResult.h 80 XPath::NodeSet m_nodeSet; // FIXME: why duplicate the node set stored in m_value?
XPathStep.h 82 void evaluate(Node* context, NodeSet&) const;
92 void nodesInAxis(Node* context, NodeSet&) const;
XPathPredicate.cpp 111 const NodeSet& lhsSet = lhs.toNodeSet();
116 const NodeSet& rhsSet = rhs.toNodeSet();
150 const NodeSet& rhsSet = rhs.toNodeSet();
168 // Neither side is a NodeSet.
237 NodeSet& resultSet = lhsResult.modifiableNodeSet();
238 const NodeSet& rhsNodes = rhs.toNodeSet();
XPathResult.cpp 155 const NodeSet& nodes = m_value.toNodeSet();
210 const NodeSet& nodes = m_value.toNodeSet();
XPathStep.cpp 114 void Step::evaluate(Node* context, NodeSet& nodes) const
125 NodeSet newNodes;
236 void Step::nodesInAxis(Node* context, NodeSet& nodes) const
XPathFunctions.cpp 324 const NodeSet& nodes = a.toNodeSet();
336 NodeSet result;
634 const NodeSet& nodes = a.toNodeSet();
  /libcore/luni/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...]
  /libcore/luni/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 883 milliseconds