* long)
*/
public Object keepInMemory(long start, long count) throws IOException {
count = (start + count <= this.length ? count : this.length - start);
task = new SuperProgressTask("indexer");
final int first = (this.factor == 0 ? 0 : (int) start / this.factor);
final int end =
(this.factor == 0 ? 1 : (int) (start + count) / this.factor) + 1;