Interface RealInterval

All Superinterfaces:
EuclideanSpace
All Known Subinterfaces:
Img<T>, Interval, IterableInterval<T>, IterableRealInterval<T>, NativeImg<T,A>, RandomAccessibleInterval<T>, RealRandomAccessibleRealInterval<T>, SubIntervalIterable<T>
All Known Implementing Classes:
AbstractCellImg, AbstractConvertedIterableInterval, AbstractConvertedIterableRandomAccessibleInterval, AbstractConvertedIterableRealInterval, AbstractConvertedRandomAccessibleInterval, AbstractImg, AbstractInterval, AbstractListImg, AbstractLongListImg, AbstractNativeImg, AbstractRealInterval, AbstractWrappedInterval, AbstractWrappedRealInterval, ARGBScreenImage, ArrayImg, ArrayImgAWTScreenImage, BiConvertedIterableInterval, BiConvertedIterableRealInterval, BiConvertedRandomAccessibleInterval, BiConvertedRealRandomAccessibleRealInterval, ByteAWTScreenImage, Cell, CellGrid.CellIntervals, CellImg, CompositeIntervalView, ConvertedIterableInterval, ConvertedIterableRealInterval, ConvertedRandomAccessibleInterval, ConvertedRealRandomAccessibleRealInterval, DiscreteFrequencyDistribution, DoubleAWTScreenImage, FinalInterval, FinalRealInterval, FloatAWTScreenImage, Grid.CellIntervals, Histogram1d, HistogramNd, ImgView, IntAWTScreenImage, IntervalIterator, IntervalView, IterableRandomAccessibleInterval, IterableTransformBuilder.IterableIntervalView, IterableTransformBuilder.Slice, IterableTransformBuilder.SubInterval, KDTree, LazyCellImg, LazyCellImg.LazyCells, ListImg, LocalizingIntervalIterator, LocalizingRealIntervalIterator, LocalizingZeroMinIntervalIterator, NtreeCursor, NtreeImg, OffsetableIntervalIterator, OffsetableLocalizingIntervalIterator, PlanarImg, PointSampleList, RandomAccessibleIntervalCursor, RealPointSampleList, ShortAWTScreenImage, StackView, SubsampleIntervalView, UnsignedByteAWTScreenImage, UnsignedIntAWTScreenImage, UnsignedShortAWTScreenImage, WriteConvertedIterableInterval, WriteConvertedIterableRandomAccessibleInterval, WriteConvertedIterableRealInterval, WriteConvertedRandomAccessibleInterval, ZeroMinIntervalIterator
public interface RealInterval extends EuclideanSpace

{x∈Rn|mind≤ xd≤maxd;d∈{0… n-1}}

An RealInterval over the real source domain. Note that this does not imply that for all coordinates in the RealInterval function values exist or can be generated. It only defines where the minimum and maximum source coordinates are. E.g. an IterableRealInterval has a limited number of values and a source coordinate for each. By that, minimum and maximum are defined but the RealInterval does not define a value for all coordinates in between.

  • Method Details

    • realMin

      double realMin(int d)
      Get the minimum in dimension d.
      Parameters:
      d - dimension
      Returns:
      minimum in dimension d.

    • realMin

      default void realMin(double[] min)
      Write the minimum of each dimension into double[].
      Parameters:
      min -

    • realMin

      default void realMin(RealPositionable min)
      Sets a RealPositionable to the minimum of this Interval
      Parameters:
      min -

    • realMax

      double realMax(int d)
      Get the maximum in dimension d.
      Parameters:
      d - dimension
      Returns:
      maximum in dimension d.

    • realMax

      default void realMax(double[] max)
      Write the maximum of each dimension into double[].
      Parameters:
      max -

    • realMax

      default void realMax(RealPositionable max)
      Sets a RealPositionable to the maximum of this Interval
      Parameters:
      max -

    • minAsDoubleArray

      default double[] minAsDoubleArray()
      Allocates a new double array with the minimum of this RealInterval. Please note that his method allocates a new array each time which introduces notable overhead in both compute and memory. If you query it frequently, you should allocate a dedicated array first and reuse it with realMin(double[]).
      Returns:
      the min

    • minAsRealPoint

      default RealPoint minAsRealPoint()
      Allocates a new RealPoint with the minimum of this RealInterval. Please note that his method allocates a new RealPoint each time which introduces notable overhead in both compute and memory. If you query it frequently, you should allocate a dedicated RealPoint first and reuse it with realMin(RealPositionable).
      Returns:
      the min

    • maxAsDoubleArray

      default double[] maxAsDoubleArray()
      Allocates a new double array with the maximum of this RealInterval. Please note that his method allocates a new array each time which introduces notable overhead in both compute and memory. If you query it frequently, you should allocate a dedicated array first and reuse it with realMax(double[]).
      Returns:
      the max

    • maxAsRealPoint

      default RealPoint maxAsRealPoint()
      Allocates a new RealPoint with the maximum of this RealInterval. Please note that his method allocates a new RealPoint each time which introduces notable overhead in both compute and memory. If you query it frequently, you should allocate a dedicated RealPoint first and reuse it with realMax(RealPositionable).
      Returns:
      the max