zzh
/
gatk-3.8
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Documented TraveralEngine 

git-svn-id: file:///humgen/gsa-scr1/gsa-engineering/svn_contents/trunk@30 348d0f76-0448-11de-a6fe-93d51630548a
This commit is contained in:
depristo 2009-03-10 22:09:12 +00:00
parent 716af47dd5
commit 393400deea
1 changed files with 301 additions and 151 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

448
java/src/edu/mit/broad/sting/atk/TraversalEngine.java
View File

@ -22,35 +22,51 @@ import net.sf.functionalj.util.Operators;
public class TraversalEngine { public class TraversalEngine {
// Usage and parameters // Usage and parameters
private File readsFile = null; private List<ReferenceOrderedData> rods = null; // list of reference ordered data objects
private File refFileName = null;
private List<ReferenceOrderedData> rods = null;
private String regionStr = null; //private String regionStr = null; // String dec
private String traversalType = null; //private String traversalType = null; // String describing this traversal type
// How strict should we be with SAM/BAM parsing?
private ValidationStringency strictness = ValidationStringency.STRICT; private ValidationStringency strictness = ValidationStringency.STRICT;
// Time in milliseconds since we initialized this engine
private long startTime = -1; private long startTime = -1;
private long lastProgressPrintTime = -1; private long lastProgressPrintTime = -1; // When was the last time we printed our progress?
private long MAX_PROGRESS_PRINT_TIME = 5 * 1000; // 10 seconds in millisecs
// How long can we go without printing some progress info?
private long MAX_PROGRESS_PRINT_TIME = 10 * 1000; // 10 seconds in millisecs
// Maximum number of reads to process before finishing
private long maxReads = -1; private long maxReads = -1;
private long nRecords = 0;
private SAMFileReader samReader = null; // Name of the reads file, in BAM/SAM format
private ReferenceSequenceFile refFile = null; private File readsFile = null; // the name of the reads file
private ReferenceIterator refIter = null; // iterator over the sam records in the readsFile
private SAMFileReader readStream;
private Iterator<SAMRecord> samReadIter = null; private Iterator<SAMRecord> samReadIter = null;
// The reference data -- filename, refSeqFile, and iterator
private File refFileName = null; // the name of the reference file
private ReferenceSequenceFile refFile = null;
private ReferenceIterator refIter = null;
// Number of records (loci, reads) we've processed
private long nRecords = 0;
// How many reads have we processed, along with those skipped for various reasons
private int nReads = 0; private int nReads = 0;
private int nSkippedReads = 0; private int nSkippedReads = 0;
private int nUnmappedReads = 0; private int nUnmappedReads = 0;
private int nNotPrimary = 0; private int nNotPrimary = 0;
private int nBadAlignments = 0; private int nBadAlignments = 0;
private int nSkippedIndels = 0; private int nSkippedIndels = 0;
// Progress tracker for the sam file
private FileProgressTracker samReadingTracker = null; private FileProgressTracker samReadingTracker = null;
public boolean DEBUGGING = false; public boolean DEBUGGING = false;
public long N_RECORDS_TO_PRINT = 100000;
// Locations we are going to process during the traversal
private GenomeLoc[] locs = null; private GenomeLoc[] locs = null;
// -------------------------------------------------------------------------------------------------------------- // --------------------------------------------------------------------------------------------------------------
@ -58,13 +74,191 @@ public class TraversalEngine {
// Setting up the engine // Setting up the engine
// //
// -------------------------------------------------------------------------------------------------------------- // --------------------------------------------------------------------------------------------------------------
/**
* Creates a new, uninitialized TraversalEngine
*
* @param reads SAM/BAM file of reads
* @param ref Reference file in FASTA format, assumes a .dict file is also available
* @param rods Array of reference ordered data sets
*/
public TraversalEngine(File reads, File ref, ReferenceOrderedData[] rods ) { public TraversalEngine(File reads, File ref, ReferenceOrderedData[] rods ) {
readsFile = reads; readsFile = reads;
refFileName = ref; refFileName = ref;
this.rods = Arrays.asList(rods); this.rods = Arrays.asList(rods);
} }
protected int initialize() { // --------------------------------------------------------------------------------------------------------------
//
// Manipulating the underlying engine parameters
//
// --------------------------------------------------------------------------------------------------------------
//public void setRegion(final String reg) { regionStr = regionStr; }
//public void setTraversalType(final String type) { traversalType = type; }
public void setStrictness( final ValidationStringency s ) { strictness = s; }
public void setMaxReads( final int maxReads ) { this.maxReads = maxReads; }
public void setDebugging( final boolean d ) { DEBUGGING = d; }
// --------------------------------------------------------------------------------------------------------------
//
// functions for dealing locations (areas of the genome we're traversing over)
//
// --------------------------------------------------------------------------------------------------------------
/**
* Parses the location string locStr and sets the traversal engine to only process
* regions specified by the location string. The string is of the form:
* Of the form: loc1;loc2;...
* Where each locN can be:
* Ôchr2Õ, Ôchr2:1000000Õ or Ôchr2:1,000,000-2,000,000Õ
*
* @param locStr
*/
public void setLocation( final String locStr ) {
this.locs = parseGenomeLocs(locStr);
}
/**
* Useful utility function that parses a location string into a coordinate-order sorted
* array of GenomeLoc objects
*
* @param str
* @return Array of GenomeLoc objects corresponding to the locations in the string, sorted by coordinate order
*/
public static GenomeLoc[] parseGenomeLocs( final String str ) {
// Of the form: loc1;loc2;...
// Where each locN can be:
// Ôchr2Õ, Ôchr2:1000000Õ or Ôchr2:1,000,000-2,000,000Õ
StdReflect reflect = new JdkStdReflect();
FunctionN<GenomeLoc> parseOne = reflect.staticFunction(GenomeLoc.class, "parseGenomeLoc", String.class);
Function1<GenomeLoc, String> f1 = parseOne.f1();
Collection<GenomeLoc> result = Functions.map(f1, Arrays.asList(str.split(";")));
GenomeLoc[] locs = (GenomeLoc[])result.toArray(new GenomeLoc[0]);
Arrays.sort(locs);
for ( GenomeLoc l : locs )
System.out.printf(" -> %s%n", l);
System.out.printf(" Locations are: %s%n", Utils.join(" ", Functions.map( Operators.toString, Arrays.asList(locs) ) ) );
return locs;
}
/**
* A key function that returns true if the proposed GenomeLoc curr is within the list of
* locations we are processing in this TraversalEngine
*
* @param curr
* @return true if we should process GenomeLoc curr, otherwise false
*/
public boolean inLocations( GenomeLoc curr ) {
if ( this.locs == null )
return true;
else {
for ( GenomeLoc loc : this.locs ) {
//System.out.printf(" Overlap %s vs. %s => %b%n", loc, curr, loc.overlapsP(curr));
if ( loc.overlapsP(curr) )
return true;
}
return false;
}
}
/**
* Returns true iff we have a specified series of locations to process AND we are past the last
* location in the list. It means that, in a serial processing of the genome, that we are done.
*
* @param curr Current genome Location
* @return true if we are past the last location to process
*/
private boolean pastFinalLocation( GenomeLoc curr ) {
boolean r = locs != null && locs[locs.length-1].compareTo( curr ) == -1 && ! locs[locs.length-1].overlapsP(curr);
//System.out.printf(" pastFinalLocation %s vs. %s => %d => %b%n", locs[locs.length-1], curr, locs[locs.length-1].compareTo( curr ), r);
return r;
}
// --------------------------------------------------------------------------------------------------------------
//
// printing
//
// --------------------------------------------------------------------------------------------------------------
/**
*
* @param curTime (current runtime, in millisecs)
* @return true if the maximum interval (in millisecs) has passed since the last printing
*/
private boolean maxElapsedIntervalForPrinting(final long curTime) {
return (curTime - this.lastProgressPrintTime) > MAX_PROGRESS_PRINT_TIME;
}
/**
* Forward request to printProgress
*
* @param type
* @param loc
*/
public void printProgress(final String type, GenomeLoc loc) {
printProgress( false, type, loc );
}
/**
* Utility routine that prints out process information (including timing) every N records or
* every M seconds, for N and M set in global variables.
*
* @param mustPrint If true, will print out info, regardless of nRecords or time interval
* @param type String to print out describing our atomic traversal type ("read", "locus", etc)
* @param loc Current location
*/
public void printProgress( boolean mustPrint, final String type, GenomeLoc loc ) {
final long nRecords = this.nRecords;
final long curTime = System.currentTimeMillis();
final double elapsed = (curTime - startTime) / 1000.0;
//System.out.printf("Cur = %d, last print = %d%n", curTime, lastProgressPrintTime);
if ( mustPrint || nRecords % N_RECORDS_TO_PRINT == 0 || maxElapsedIntervalForPrinting(curTime)) {
this.lastProgressPrintTime = curTime;
final double secsPer1MReads = (elapsed * 1000000.0) / nRecords;
if ( loc != null )
System.out.printf("[PROGRESS] Traversed to %s, processing %,d %s in %.2f secs (%.2f secs per 1M %s)%n", loc, nRecords, type, elapsed, secsPer1MReads, type);
else
System.out.printf("[PROGRESS] Traversed %,d %s in %.2f secs (%.2f secs per 1M %s)%n", nRecords, type, elapsed, secsPer1MReads, type);
// Currently samReadingTracker will print misleading info if we're not processing the whole file
if ( this.locs == null )
System.out.printf("[PROGRESS] -> %s%n", samReadingTracker.progressMeter());
}
}
/**
* Called after a traversal to print out information about the traversal process
*
* @param type String describing this type of traversal ("loci", "read")
* @param sum The reduce result of the traversal
* @param <T> ReduceType of the traversal
*/
protected <T> void printOnTraversalDone( final String type, T sum ) {
printProgress( true, type, null );
System.out.println("Traversal reduce result is " + sum);
System.out.printf("Traversal skipped %d reads out of %d total (%.2f%%)%n", nSkippedReads, nReads, (nSkippedReads * 100.0) / nReads);
System.out.printf(" -> %d unmapped reads%n", nUnmappedReads );
System.out.printf(" -> %d non-primary reads%n", nNotPrimary );
System.out.printf(" -> %d reads with bad alignments%n", nBadAlignments );
System.out.printf(" -> %d reads with indels%n", nSkippedIndels );
}
// --------------------------------------------------------------------------------------------------------------
//
// Initialization
//
// --------------------------------------------------------------------------------------------------------------
/**
* Initialize the traversal engine. After this point traversals can be run over the data
*
* @return true on success
*/
public boolean initialize() {
lastProgressPrintTime = startTime = System.currentTimeMillis(); lastProgressPrintTime = startTime = System.currentTimeMillis();
loadReference(); loadReference();
//testReference(); //testReference();
@ -86,105 +280,14 @@ public class TraversalEngine {
throw new RuntimeIOException(e); throw new RuntimeIOException(e);
} }
return 0;
}
public void setRegion(final String reg) { regionStr = regionStr; }
public void setTraversalType(final String type) { traversalType = type; }
public void setStrictness( final ValidationStringency s ) { strictness = s; }
public void setMaxReads( final int maxReads ) { this.maxReads = maxReads; }
public void setDebugging( final boolean d ) { DEBUGGING = d; }
// --------------------------------------------------------------------------------------------------------------
//
// functions for dealing locations (areas of the genome we're traversing over)
//
// --------------------------------------------------------------------------------------------------------------
public void setLocation( final String locStr ) {
this.locs = parseGenomeLocs(locStr);
}
public static GenomeLoc[] parseGenomeLocs( final String str ) {
// Of the form: loc1;loc2;...
// Where each locN can be:
// Ôchr2Õ, Ôchr2:1000000Õ or Ôchr2:1,000,000-2,000,000Õ
StdReflect reflect = new JdkStdReflect();
FunctionN<GenomeLoc> parseOne = reflect.staticFunction(GenomeLoc.class, "parseGenomeLoc", String.class);
Function1<GenomeLoc, String> f1 = parseOne.f1();
Collection<GenomeLoc> result = Functions.map(f1, Arrays.asList(str.split(";")));
GenomeLoc[] locs = (GenomeLoc[])result.toArray(new GenomeLoc[0]);
Arrays.sort(locs);
for ( GenomeLoc l : locs )
System.out.printf(" -> %s%n", l);
System.out.printf(" Locations are: %s%n", Utils.join(" ", Functions.map( Operators.toString, Arrays.asList(locs) ) ) );
return locs;
}
public boolean inLocations( GenomeLoc curr ) {
if ( this.locs == null )
return true;
else {
for ( GenomeLoc loc : this.locs ) {
//System.out.printf(" Overlap %s vs. %s => %b%n", loc, curr, loc.overlapsP(curr));
if ( loc.overlapsP(curr) )
return true; return true;
} }
return false;
}
}
public boolean pastFinalLocation( GenomeLoc curr ) {
boolean r = locs != null && locs[locs.length-1].compareTo( curr ) == -1 && ! locs[locs.length-1].overlapsP(curr);
//System.out.printf(" pastFinalLocation %s vs. %s => %d => %b%n", locs[locs.length-1], curr, locs[locs.length-1].compareTo( curr ), r);
return r;
}
// --------------------------------------------------------------------------------------------------------------
//
// functions for dealing with the reference sequence
//
// --------------------------------------------------------------------------------------------------------------
/** /**
* Prepare the reference for stream processing
* *
* @param curTime (current runtime, in millisecs)
* @return true if the maximum interval (in millisecs) has passed since the last printing
*/ */
private boolean maxElapsedIntervalForPrinting(final long curTime) {
return (curTime - this.lastProgressPrintTime) > MAX_PROGRESS_PRINT_TIME;
}
public void printProgress(final String type, GenomeLoc loc) { printProgress( false, type, loc ); }
public void printProgress( boolean mustPrint, final String type, GenomeLoc loc ) {
final long nRecords = this.nRecords;
final long curTime = System.currentTimeMillis();
final double elapsed = (curTime - startTime) / 1000.0;
//System.out.printf("Cur = %d, last print = %d%n", curTime, lastProgressPrintTime);
if ( mustPrint || nRecords % 100000 == 0 || maxElapsedIntervalForPrinting(curTime)) {
this.lastProgressPrintTime = curTime;
final double secsPer1MReads = (elapsed * 1000000.0) / nRecords;
if ( loc != null )
System.out.printf("[PROGRESS] Traversed to %s, processing %d %s %.2f secs (%.2f secs per 1M %s)%n", loc, nRecords, type, elapsed, secsPer1MReads, type);
else
System.out.printf("[PROGRESS] Traversed %d %s %.2f secs (%.2f secs per 1M %s)%n", nRecords, type, elapsed, secsPer1MReads, type);
if ( this.locs == null )
System.out.printf("[PROGRESS] -> %s%n", samReadingTracker.progressMeter());
}
}
// --------------------------------------------------------------------------------------------------------------
//
// functions for dealing with the reference sequence
//
// --------------------------------------------------------------------------------------------------------------
protected void loadReference() { protected void loadReference() {
if ( refFileName!= null ) { if ( refFileName!= null ) {
this.refFile = ReferenceSequenceFileFactory.getReferenceSequenceFile(refFileName); this.refFile = ReferenceSequenceFileFactory.getReferenceSequenceFile(refFileName);
@ -193,29 +296,11 @@ public class TraversalEngine {
} }
} }
protected void testReference() { /**
String line = ""; * Prepare the list of reference ordered data iterators for each of the rods
refIter.seekForward("chr20", 79); *
for ( int i = 0; i < this.maxReads && refIter.hasNext(); i++ ) { * @return A list of ROD iterators for getting data from each ROD
final ReferenceIterator refSite = refIter.next(); */
final char refBase = refSite.getBaseAsChar();
line += refBase;
if ( (i + 1) % 80 == 0 ) {
System.out.println(line);
line = "";
}
//System.out.printf(" Reference: %s:%d %c%n", refSite.getCurrentContig().getName(), refSite.getPosition(), refBase);
}
System.out.println(line);
System.exit(1);
}
// --------------------------------------------------------------------------------------------------------------
//
// dealing with reference ordered data
//
// --------------------------------------------------------------------------------------------------------------
protected List<ReferenceOrderedData.RODIterator> initializeRODs() { protected List<ReferenceOrderedData.RODIterator> initializeRODs() {
// set up reference ordered data // set up reference ordered data
List<ReferenceOrderedData.RODIterator> rodIters = new ArrayList<ReferenceOrderedData.RODIterator>(); List<ReferenceOrderedData.RODIterator> rodIters = new ArrayList<ReferenceOrderedData.RODIterator>();
@ -225,6 +310,38 @@ public class TraversalEngine {
return rodIters; return rodIters;
} }
// protected void testReference() {
// String line = "";
// refIter.seekForward("chr20", 79);
// for ( int i = 0; i < this.maxReads && refIter.hasNext(); i++ ) {
// final ReferenceIterator refSite = refIter.next();
// final char refBase = refSite.getBaseAsChar();
// line += refBase;
// if ( (i + 1) % 80 == 0 ) {
// System.out.println(line);
// line = "";
// }
// //System.out.printf(" Reference: %s:%d %c%n", refSite.getCurrentContig().getName(), refSite.getPosition(), refBase);
// }
// System.out.println(line);
// System.exit(1);
// }
// --------------------------------------------------------------------------------------------------------------
//
// dealing with reference ordered data
//
// --------------------------------------------------------------------------------------------------------------
/**
* Builds a list of the reference ordered datum at loc from each of the iterators. This function
* assumes you are accessing the data in order. You can't use this function for random access. Each
* successive call moves you along the file, consuming all data before loc.
*
* @param rodIters Iterators to access the RODs
* @param loc The location to get the rods at
* @return A list of ReferenceOrderDatum at loc. ROD without a datum at loc will be null in the list
*/
protected List<ReferenceOrderedDatum> getReferenceOrderedDataAtLocus(List<ReferenceOrderedData.RODIterator> rodIters, protected List<ReferenceOrderedDatum> getReferenceOrderedDataAtLocus(List<ReferenceOrderedData.RODIterator> rodIters,
final GenomeLoc loc) { final GenomeLoc loc) {
List<ReferenceOrderedDatum> data = new ArrayList<ReferenceOrderedDatum>(); List<ReferenceOrderedDatum> data = new ArrayList<ReferenceOrderedDatum>();
@ -240,6 +357,13 @@ public class TraversalEngine {
// traversal by loci functions // traversal by loci functions
// //
// -------------------------------------------------------------------------------------------------------------- // --------------------------------------------------------------------------------------------------------------
/**
* Class to filter out un-handle-able reads from the stream. We currently are skipping
* unmapped reads, non-primary reads, unaligned reads, and those with indels. We should
* really change this to handle indel containing reads.
*
*/
class locusStreamFilterFunc implements SamRecordFilter { class locusStreamFilterFunc implements SamRecordFilter {
public boolean filterOut(SAMRecord rec) { public boolean filterOut(SAMRecord rec) {
boolean result = false; boolean result = false;
@ -280,15 +404,30 @@ public class TraversalEngine {
} }
} }
/**
* Traverse by loci -- the key driver of linearly ordered traversal of loci. Provides reads, RODs, and
* the reference base for each locus in the reference to the LocusWalker walker. Supports all of the
* interaction contract implied by the locus walker
*
* @param walker A locus walker object
* @param <M> MapType -- the result of calling map() on walker
* @param <T> ReduceType -- the result of calling reduce() on the walker
* @return 0 on success
*/
protected <M,T> int traverseByLoci(LocusWalker<M,T> walker) { protected <M,T> int traverseByLoci(LocusWalker<M,T> walker) {
walker.initialize(); // prepare the read filtering read iterator and provide it to a new locus iterator
FilteringIterator filterIter = new FilteringIterator(samReadIter, new locusStreamFilterFunc()); FilteringIterator filterIter = new FilteringIterator(samReadIter, new locusStreamFilterFunc());
CloseableIterator<LocusIterator> iter = new LocusIterator(filterIter); CloseableIterator<LocusIterator> iter = new LocusIterator(filterIter);
// Initial the reference ordered data iterators
List<ReferenceOrderedData.RODIterator> rodIters = initializeRODs(); List<ReferenceOrderedData.RODIterator> rodIters = initializeRODs();
// initialize the walker object
walker.initialize();
// Initialize the T sum using the walker
T sum = walker.reduceInit(); T sum = walker.reduceInit();
boolean done = false; boolean done = false;
while ( iter.hasNext() && ! done ) { while ( iter.hasNext() && ! done ) {
this.nRecords++; this.nRecords++;
@ -297,13 +436,20 @@ public class TraversalEngine {
// Poor man's version of index LOL // Poor man's version of index LOL
if ( inLocations(locus.getLocation()) ) { if ( inLocations(locus.getLocation()) ) {
final ReferenceIterator refSite = refIter.seekForward(locus.getContig(), locus.getPosition());
// Jump forward in the reference to this locus location
final ReferenceIterator refSite = refIter.seekForward(locus.getLocation());
final char refBase = refSite.getBaseAsChar(); final char refBase = refSite.getBaseAsChar();
// Iterate forward to get all reference ordered data covering this locus
final List<ReferenceOrderedDatum> rodData = getReferenceOrderedDataAtLocus(rodIters, locus.getLocation()); final List<ReferenceOrderedDatum> rodData = getReferenceOrderedDataAtLocus(rodIters, locus.getLocation());
if ( DEBUGGING ) if ( DEBUGGING )
System.out.printf(" Reference: %s:%d %c%n", refSite.getCurrentContig().getName(), refSite.getPosition(), refBase); System.out.printf(" Reference: %s:%d %c%n", refSite.getCurrentContig().getName(), refSite.getPosition(), refBase);
//
// Execute our contract with the walker. Call filter, map, and reduce
//
final boolean keepMeP = walker.filter(rodData, refBase, locus); final boolean keepMeP = walker.filter(rodData, refBase, locus);
if ( keepMeP ) { if ( keepMeP ) {
M x = walker.map(rodData, refBase, locus); M x = walker.map(rodData, refBase, locus);
@ -323,37 +469,43 @@ public class TraversalEngine {
done = true; done = true;
} }
printProgress( true, "loci", null ); printOnTraversalDone("loci", sum);
System.out.println("Traversal reduce result is " + sum);
System.out.printf("Traversal skipped %d reads out of %d total (%.2f%%)%n", nSkippedReads, nReads, (nSkippedReads * 100.0) / nReads);
System.out.printf(" -> %d unmapped reads%n", nUnmappedReads );
System.out.printf(" -> %d non-primary reads%n", nNotPrimary );
System.out.printf(" -> %d reads with bad alignments%n", nBadAlignments );
System.out.printf(" -> %d reads with indels%n", nSkippedIndels );
walker.onTraveralDone(); walker.onTraveralDone();
return 0; return 0;
} }
// -------------------------------------------------------------------------------------------------------------- /**
// * Traverse by read -- the key driver of linearly ordered traversal of reads. Provides a single read to
// traversal by read functions * the walker object, in coordinate order. Supports all of the
// * interaction contract implied by the read walker
// -------------------------------------------------------------------------------------------------------------- *
* @param walker A read walker object
* @param <M> MapType -- the result of calling map() on walker
* @param <T> ReduceType -- the result of calling reduce() on the walker
* @return 0 on success
*/
protected <M,R> int traverseByRead(ReadWalker<M,R> walker) { protected <M,R> int traverseByRead(ReadWalker<M,R> walker) {
// Initialize the walker
walker.initialize(); walker.initialize();
// Initialize the sum
R sum = walker.reduceInit(); R sum = walker.reduceInit();
boolean done = false; boolean done = false;
while ( samReadIter.hasNext() && ! done ) { while ( samReadIter.hasNext() && ! done ) {
this.nRecords++; this.nRecords++;
// actually get the read and hand it to the walker // get the next read
final SAMRecord read = samReadIter.next(); final SAMRecord read = samReadIter.next();
GenomeLoc loc = new GenomeLoc(read.getReferenceName(), read.getAlignmentStart()); GenomeLoc loc = new GenomeLoc(read.getReferenceName(), read.getAlignmentStart());
if ( inLocations(loc) ) { if ( inLocations(loc) ) {
final boolean keepMeP = walker.filter(null, read);
//
// execute the walker contact
//
final boolean keepMeP = walker.filter(null, read);
if ( keepMeP ) { if ( keepMeP ) {
M x = walker.map(null, read); M x = walker.map(null, read);
sum = walker.reduce(x, sum); sum = walker.reduce(x, sum);
@ -361,19 +513,17 @@ public class TraversalEngine {
if ( this.maxReads > 0 && this.nRecords > this.maxReads ) { if ( this.maxReads > 0 && this.nRecords > this.maxReads ) {
System.out.println("Maximum number of reads encountered, terminating traversal " + this.nRecords); System.out.println("Maximum number of reads encountered, terminating traversal " + this.nRecords);
break; done = true;
}
} }
printProgress("reads", loc); printProgress("reads", loc);
}
if ( pastFinalLocation(loc) ) if ( pastFinalLocation(loc) )
done = true; done = true;
//System.out.printf("Done? %b%n", done); //System.out.printf("Done? %b%n", done);
} }
printProgress( true, "reads", null ); printOnTraversalDone("reads", sum);
System.out.println("Traversal reduce result is " + sum);
walker.onTraveralDone(); walker.onTraveralDone();
return 0; return 0;
} }