Interface RandomAccessibleInterval<T>
- All Superinterfaces:
Dimensions, EuclideanSpace, Interval, Iterable<T>, IterableInterval<T>, IterableRealInterval<T>, RandomAccessible<T>, RealInterval, Typed<T>
- All Known Implementing Classes:
AbstractCellImg, AbstractConvertedIterableRandomAccessibleInterval, AbstractConvertedRandomAccessibleInterval, AbstractImg, AbstractListImg, AbstractLongListImg, AbstractNativeImg, ARGBScreenImage, ArrayImg, ArrayImgAWTScreenImage, BiConvertedRandomAccessibleInterval, ByteAWTScreenImage, CellGrid.CellIntervals, CellImg, CompositeIntervalView, ConvertedRandomAccessibleInterval, DiscreteFrequencyDistribution, DoubleAWTScreenImage, FloatAWTScreenImage, Grid.CellIntervals, Histogram1d, HistogramNd, ImgView, IntAWTScreenImage, IntervalView, IterableRandomAccessibleInterval, LazyCellImg, LazyCellImg.LazyCells, ListImg, NtreeImg, PlanarImg, ShortAWTScreenImage, StackView, SubsampleIntervalView, UnsignedByteAWTScreenImage, UnsignedIntAWTScreenImage, UnsignedShortAWTScreenImage, WriteConvertedIterableRandomAccessibleInterval, WriteConvertedRandomAccessibleInterval
f:{x∈Zn|[min,max]→T}
A function over an n-dimensional integer interval that can create a random
access Sampler.
By convention, a RandomAccessibleInterval represents a function that is defined at all coordinates of the interval.
There is no guarantee regarding whether the function is defined outside the
bounds of its interval. If the function is known to be defined for
out-of-bounds values in a particular interval, the
RandomAccessible.randomAccess(Interval) method should be used to access those
values—whereas the RandomAccessible.randomAccess() (no arguments) method is
not intended to access out-of-bounds values. See
RandomAccessible.randomAccess() for related discussion.
-
Method Summary
Modifier and TypeMethodDescriptioncursor()Returns aRealCursorthat iterates with optimal speed without calculating the location at each iteration step.default ObjectReturns the iteration order of thisIterableRealInterval.Returns aRealLocalizableIteratorthat calculates its location at each iteration step.default longsize()Returns the number of elements in thisFunction.Methods inherited from interface Dimensions
dimensions, dimensions, dimensionsAsLongArray, dimensionsAsPointMethods inherited from interface EuclideanSpace
numDimensionsMethods inherited from interface Interval
dimension, max, max, max, maxAsLongArray, maxAsPoint, min, min, min, minAsLongArray, minAsPoint, realMax, realMinMethods inherited from interface IterableInterval
localizingSpliterator, spliteratorMethods inherited from interface IterableRealInterval
firstElement, getType, iterator, parallelStream, streamMethods inherited from interface RandomAccessible
getAt, getAt, getAt, randomAccess, randomAccessMethods inherited from interface RealInterval
maxAsDoubleArray, maxAsRealPoint, minAsDoubleArray, minAsRealPoint, realMax, realMax, realMin, realMin
-
Method Details
-
cursor
Description copied from interface:IterableRealIntervalReturns a
RealCursorthat iterates with optimal speed without calculating the location at each iteration step. Localization is performed on demand.Use this where localization is required rarely/ not for each iteration.
- Specified by:
cursorin interfaceIterableInterval<T>- Specified by:
cursorin interfaceIterableRealInterval<T>- Returns:
- fast iterating iterator
-
localizingCursor
Description copied from interface:IterableRealIntervalReturns a
RealLocalizableIteratorthat calculates its location at each iteration step. That is, localization is performed with optimal speed.Use this where localization is required often/ for each iteration.
- Specified by:
localizingCursorin interfaceIterableInterval<T>- Specified by:
localizingCursorin interfaceIterableRealInterval<T>- Returns:
- fast localizing iterator
-
size
default long size()Description copied from interface:IterableRealIntervalReturns the number of elements in this
Function.- Specified by:
sizein interfaceIterableRealInterval<T>- Returns:
- number of elements
-
iterationOrder
Description copied from interface:IterableRealIntervalReturns the iteration order of thisIterableRealInterval. If the returned object equals (Object.equals(Object)) the iteration order of anotherIterableRealIntervalf then they can be copied by synchronous iteration. That is, having anIteratoron this and anotherIteratoron f, moving both in synchrony will point both of them to corresponding locations in their source domain. In other words, this and f have the same iteration order and means and the same number of elements.- Specified by:
iterationOrderin interfaceIterableRealInterval<T>- Returns:
- the iteration order of this
IterableRealInterval. - See Also:
-