public void sort(DTMIterator v,Vector keys,XPathContext support) throws javax.xml.transform.TransformerException {
  m_keys=keys;
  int n=v.getLength();
  Vector nodes=new Vector();
  for (int i=0; i < n; i++) {
    NodeCompareElem elem=new NodeCompareElem(v.item(i));
    nodes.addElement(elem);
  }
  Vector scratchVector=new Vector();
  mergesort(nodes,scratchVector,0,n - 1,support);
  for (int i=0; i < n; i++) {
    v.setItem(((NodeCompareElem)nodes.elementAt(i)).m_node,i);
  }
  v.setCurrentPos(0);
}

public void sort ( DTMIterator v , Vector keys , XPathContext support ) throws javax . xml . transform . TransformerException { m_keys = keys ; int n = v . getLength ( ) ; Vector nodes = new Vector ( ) ; for ( int i = 0 ; i < n ; i ++ ) { NodeCompareElem elem = new NodeCompareElem ( v . item ( i ) ) ; nodes . addElement ( elem ) ; } Vector scratchVector = new Vector ( ) ; mergesort ( nodes , scratchVector , 0 , n - 1 , support ) ; for ( int i = 0 ; i < n ; i ++ ) { v . setItem ( ( ( NodeCompareElem ) nodes . elementAt ( i ) ) . m_node , i ) ; } v . setCurrentPos ( 0 ) ; }
given a vector of nodes , sort each node according to the criteria in the keys .
