/** * @return The number of planes in the provided {@link Img}. */ private int getPlaneCount(final Img<?> img) { // PlanarImg case if (PlanarImg.class.isAssignableFrom(img.getClass())) { final PlanarImg<?, ?> planarImg = (PlanarImg<?, ?>) img; return planarImg.numSlices(); } // General case int count = 1; for (int d = 2; d < img.numDimensions(); d++) { count *= img.dimension(d); } return count; }
/** * @return The number of planes in the provided {@link Img}. */ private int getPlaneCount(final Img<?> img) { // PlanarImg case if (PlanarImg.class.isAssignableFrom(img.getClass())) { final PlanarImg<?, ?> planarImg = (PlanarImg<?, ?>) img; return planarImg.numSlices(); } // General case int count = 1; for (int d = 2; d < img.numDimensions(); d++) { count *= img.dimension(d); } return count; }
public PlanarCursor( final PlanarImg< T, ? > container ) { super( container.numDimensions() ); this.type = container.createLinkedType(); this.container = container; lastIndex = ( ( n > 1 ) ? container.dimensions[ 1 ] : 1 ) * container.dimensions[ 0 ] - 1; lastSliceIndex = container.numSlices() - 1; reset(); }
public PlanarCursor( final PlanarImg< T, ? > container ) { super( container.numDimensions() ); this.type = container.createLinkedType(); this.container = container; lastIndex = ( ( n > 1 ) ? container.dimensions[ 1 ] : 1 ) * container.dimensions[ 0 ] - 1; lastSliceIndex = container.numSlices() - 1; reset(); }
public PlanarLocalizingCursor( final PlanarImg< T, ? > container ) { super( container.numDimensions() ); this.type = container.createLinkedType(); this.container = container; lastIndex = ( ( n > 1 ) ? container.dimensions[ 1 ] : 1 ) * container.dimensions[ 0 ] - 1; lastSliceIndex = container.numSlices() - 1; max = new int[ n ]; for ( int d = 0; d < n; ++d ) max[ d ] = ( int ) container.max( d ); reset(); }
public PlanarLocalizingCursor( final PlanarImg< T, ? > container ) { super( container.numDimensions() ); this.type = container.createLinkedType(); this.container = container; lastIndex = ( ( n > 1 ) ? container.dimensions[ 1 ] : 1 ) * container.dimensions[ 0 ] - 1; lastSliceIndex = container.numSlices() - 1; max = new int[ n ]; for ( int d = 0; d < n; ++d ) max[ d ] = ( int ) container.max( d ); reset(); }