@Override public void reset() { this.driver.reset(); }
public LocalizingIntervalIterator( final long[] min, final long[] max ) { super( min, max ); position = new long[ n ]; reset(); }
@Override public boolean hasNext() { return driver.hasNext(); }
@Override public void fwd() { driver.fwd(); if ( driver.getIndex() == centralPositionIndex ) driver.fwd(); for ( int d = 0; d < numDimensions; ++d ) randomAccess.setPosition( positionMinus1[ d ] + driver.getLongPosition( d ), d ); }
static public IntervalIterator create( final Interval interval ) { final int n = interval.numDimensions(); for ( int d = 0; d < n; ++d ) if ( interval.min( d ) != 0 ) return new IntervalIterator( interval ); return new ZeroMinIntervalIterator( interval ); }
/** * Adjust the offset and reset the iterator * * @param min * - new offset */ public void setMin( final int[] min ) { for ( int d = 0; d < n; ++d ) { this.min[ d ] = min[ d ]; this.max[ d ] = this.dimensions[ d ] + min[ d ] - 1; } reset(); }
/** * Adjust the offset and reset the iterator * * @param min * - new offset */ public void setMin( final long[] min ) { for ( int d = 0; d < n; ++d ) { this.min[ d ] = min[ d ]; this.max[ d ] = this.dimensions[ d ] + min[ d ] - 1; } reset(); } }
static public IntervalIterator create( final Interval interval ) { final int n = interval.numDimensions(); for ( int d = 0; d < n; ++d ) if ( interval.min( d ) != 0 ) return new IntervalIterator( interval ); return new ZeroMinIntervalIterator( interval ); }
@Override public boolean hasNext() { return driver.hasNext(); }
@Override public void reset() { this.driver.reset(); }
public LocalizingIntervalIterator( final long[] dimensions ) { super( dimensions ); position = new long[ n ]; reset(); }
/** * Adjust the offset and reset the iterator * * @param min * - new offset */ public void setMin( final int[] min ) { for ( int d = 0; d < n; ++d ) { this.min[ d ] = min[ d ]; this.max[ d ] = this.dimensions[ d ] + min[ d ] - 1; } reset(); }
/** * Adjust the offset and reset the iterator * * @param min * - new offset */ public void setMin( final int[] min ) { for ( int d = 0; d < n; ++d ) { this.min[ d ] = min[ d ]; this.max[ d ] = this.dimensions[ d ] + min[ d ] - 1; } reset(); }
public LocalizingIntervalIterator( final long[] min, final long[] max ) { super( min, max ); position = new long[ n ]; reset(); }
/** * Adjust the offset and reset the iterator * * @param min * - new offset */ public void setMin( final long[] min ) { for ( int d = 0; d < n; ++d ) { this.min[ d ] = min[ d ]; this.max[ d ] = this.dimensions[ d ] + min[ d ] - 1; } reset(); } }
/** * Adjust the offset and reset the iterator * * @param min * - new offset */ public void setMin( final int[] min ) { for ( int d = 0; d < n; ++d ) { this.min[ d ] = min[ d ]; this.max[ d ] = this.dimensions[ d ] + min[ d ] - 1; } reset(); }
public LocalizingIntervalIterator( final Interval interval ) { super( interval ); position = new long[ n ]; reset(); }
/** * Adjust the offset and reset the iterator * * @param min * - new offset */ public void setMin( final long[] min ) { for ( int d = 0; d < n; ++d ) { this.min[ d ] = min[ d ]; this.max[ d ] = this.dimensions[ d ] + min[ d ] - 1; } reset(); } }
public LocalizingIntervalIterator( final long[] dimensions ) { super( dimensions ); position = new long[ n ]; reset(); }
public LocalizingIntervalIterator( final Interval interval ) { super( interval ); position = new long[ n ]; reset(); }