Lines Matching refs:to
15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
59 static void sortBlock(unsigned from, unsigned to, WillBeHeapVector<NodeSetVector>& parentMatrix, bool mayContainAttributeNodes)
61 // Should not call this function with less that two nodes to sort.
62 ASSERT(from + 1 < to);
64 for (unsigned i = from; i < to; ++i) {
79 for (unsigned i = from + 1; i < to; ++i) {
93 // document order. Find it and move it to the beginning.
94 for (unsigned i = from; i < to; ++i) {
97 if (from + 2 < to)
98 sortBlock(from + 1, to, parentMatrix, mayContainAttributeNodes);
106 // the children of the element. The namespace nodes are defined to occur
112 for (unsigned i = sortedEnd; i < to; ++i) {
118 if (to - sortedEnd > 1)
119 sortBlock(sortedEnd, to, parentMatrix, mayContainAttributeNodes);
125 // node-set. Sort it according to this subdivision, and recursively sort
128 for (unsigned i = from; i < to; ++i)
134 // If parentNodes contains the node, perform a linear search to move its
135 // children in the node-set to the beginning.
137 for (unsigned i = groupEnd; i < to; ++i) {
189 // It is not possible to just assign the result to m_nodes, because some
256 unsigned to = m_nodes.size() - 1;
257 while (from < to) {
258 m_nodes[from].swap(m_nodes[to]);
260 --to;
269 // FIXME: fully sorting the node-set just to find its first node is
