How to use

NodeSorter

in

org.apache.xalan.transformer

NodeSorter sorter = new NodeSorter(xctxt);
sourceNodes.setShouldCacheNodes(true);
sourceNodes.runTo(-1);
 sorter.sort(sourceNodes, keys, xctxt);
 sourceNodes.setCurrentPos(0);

mergesort(a, b, l, m, support);
mergesort(a, b, m + 1, r, support);
  compVal = -1;
 else
  compVal = compare((NodeCompareElem) b.elementAt(i),
           (NodeCompareElem) b.elementAt(j), 0, support);

mergesort(nodes, scratchVector, 0, n - 1, support);

result = compare(n1, n2, kIndex + 1, support);
result = compare(n1, n2, kIndex + 1, support);

mergesort(nodes, scratchVector, 0, n - 1, support);

result = compare(n1, n2, kIndex + 1, support);
result = compare(n1, n2, kIndex + 1, support);

NodeSorter sorter = new NodeSorter(xctxt);
sourceNodes.setShouldCacheNodes(true);
sourceNodes.runTo(-1);
 sorter.sort(sourceNodes, keys, xctxt);
 sourceNodes.setCurrentPos(0);

mergesort(a, b, l, m, support);
mergesort(a, b, m + 1, r, support);
  compVal = -1;
 else
  compVal = compare((NodeCompareElem) b.elementAt(i),
           (NodeCompareElem) b.elementAt(j), 0, support);

mergesort(nodes, scratchVector, 0, n - 1, support);

result = compare(n1, n2, kIndex + 1, support);
result = compare(n1, n2, kIndex + 1, support);

NodeSorter sorter = new NodeSorter(xctxt);
sourceNodes.setShouldCacheNodes(true);
sourceNodes.runTo(-1);
 sorter.sort(sourceNodes, keys, xctxt);
 sourceNodes.setCurrentPos(0);

mergesort(a, b, l, m, support);
mergesort(a, b, m + 1, r, support);
  compVal = -1;
 else
  compVal = compare((NodeCompareElem) b.elementAt(i),
           (NodeCompareElem) b.elementAt(j), 0, support);

mergesort(nodes, scratchVector, 0, n - 1, support);

result = compare(n1, n2, kIndex + 1, support);
result = compare(n1, n2, kIndex + 1, support);

NodeSorter sorter = new NodeSorter(xctxt);
sourceNodes.setShouldCacheNodes(true);
sourceNodes.runTo(-1);
 sorter.sort(sourceNodes, keys, xctxt);
 sourceNodes.setCurrentPos(0);

mergesort(a, b, l, m, support);
mergesort(a, b, m + 1, r, support);
  compVal = -1;
 else
  compVal = compare((NodeCompareElem) b.elementAt(i),
           (NodeCompareElem) b.elementAt(j), 0, support);

mergesort(nodes, scratchVector, 0, n - 1, support);

result = compare(n1, n2, kIndex + 1, support);
result = compare(n1, n2, kIndex + 1, support);

NodeSorter sorter = new NodeSorter(xctxt);
sourceNodes.setShouldCacheNodes(true);
sourceNodes.runTo(-1);
 sorter.sort(sourceNodes, keys, xctxt);
 sourceNodes.setCurrentPos(0);

mergesort(a, b, l, m, support);
mergesort(a, b, m + 1, r, support);
  compVal = -1;
 else
  compVal = compare((NodeCompareElem) b.elementAt(i),
           (NodeCompareElem) b.elementAt(j), 0, support);