public boolean[][][] checkOutCoverage(String[] paths){
  if (paths == null || paths.length == 0) {
    logger.warning("No paths for DTED data given.");
    return null;
  }
  logger.fine("checking out DTED at paths:");
  for (int d1=0; d1 < paths.length; d1++) {
    if (logger.isLoggable(Level.FINE)) {
      logger.fine("       " + paths[d1]);
    }
    if (!BinaryFile.exists(paths[d1])) {
      paths[d1]=null;
      logger.fine("       - path invalid, ignoring.");
    }
  }
  CoverageWandererCallback callback=new CoverageWandererCallback();
  Wanderer wanderer=new Wanderer(callback);
  for (int pathNum=0; pathNum < paths.length; pathNum++) {
    wanderer.handleEntry(new File(paths[pathNum]));
  }
  return callback.getCoverage();
}

public boolean [ ] [ ] [ ] checkOutCoverage ( String [ ] paths ) { if ( paths == null || paths . length == 0 ) { logger . warning ( "No paths for DTED data given." ) ; return null ; } logger . fine ( "checking out DTED at paths:" ) ; for ( int d1 = 0 ; d1 < paths . length ; d1 ++ ) { if ( logger . isLoggable ( Level . FINE ) ) { logger . fine ( "       " + paths [ d1 ] ) ; } if ( ! BinaryFile . exists ( paths [ d1 ] ) ) { paths [ d1 ] = null ; logger . fine ( "       - path invalid, ignoring." ) ; } } CoverageWandererCallback callback = new CoverageWandererCallback ( ) ; Wanderer wanderer = new Wanderer ( callback ) ; for ( int pathNum = 0 ; pathNum < paths . length ; pathNum ++ ) { wanderer . handleEntry ( new File ( paths [ pathNum ] ) ) ; } return callback . getCoverage ( ) ; }
the method that cycles through all the paths , looking for the frames . this takes time , so it ' s only done when a coverage file can ' t be found .
