| Methods Summary |
|---|
| private void | addRecord(com.sun.org.apache.xalan.internal.xsltc.dom.NodeSortRecord record)
if (_free == _data.length) {
NodeSortRecord[] newArray = new NodeSortRecord[_data.length * 2];
System.arraycopy(_data, 0, newArray, 0, _free);
_data = newArray;
}
_data[_free++] = record;
|
| public com.sun.org.apache.xml.internal.dtm.DTMAxisIterator | cloneIterator()Clone a SortingIterator by cloning its source
iterator and then sharing the factory and the array of
NodeSortRecords.
try {
final SortingIterator clone = (SortingIterator) super.clone();
clone._source = _source.cloneIterator();
clone._factory = _factory; // shared between clones
clone._data = _data; // shared between clones
clone._free = _free;
clone._current = _current;
clone.setRestartable(false);
return clone.reset();
}
catch (CloneNotSupportedException e) {
BasisLibrary.runTimeError(BasisLibrary.ITERATOR_CLONE_ERR,
e.toString());
return null;
}
|
| public int | getLast()
return _free;
|
| public int | getPosition()
return _current == 0 ? 1 : _current;
|
| public void | gotoMark()
_source.gotoMark();
_current = _markedNode;
|
| public int | next()
return _current < _free ? _data[_current++].getNode() : END;
|
| private int | partition(int p, int r)
final NodeSortRecord x = _data[(p + r) >>> 1];
int i = p - 1;
int j = r + 1;
while (true) {
while (x.compareTo(_data[--j]) < 0);
while (x.compareTo(_data[++i]) > 0);
if (i < j) {
final NodeSortRecord t = _data[i];
_data[i] = _data[j];
_data[j] = t;
}
else {
return(j);
}
}
|
| private void | quicksort(int p, int r)
while (p < r) {
final int q = partition(p, r);
quicksort(p, q);
p = q + 1;
}
|
| public void | setMark()
_source.setMark();
_markedNode = _current;
|
| public com.sun.org.apache.xml.internal.dtm.DTMAxisIterator | setStartNode(int node)
try {
_source.setStartNode(_startNode = node);
_data = new NodeSortRecord[INIT_DATA_SIZE];
_free = 0;
// gather all nodes from the source iterator
while ((node = _source.next()) != END) {
addRecord(_factory.makeNodeSortRecord(node,_free));
}
// now sort the records
quicksort(0, _free - 1);
_current = 0;
return this;
}
catch (Exception e) {
return this;
}
|
