Package net.imglib2
-
Interface Summary Interface Description Cursor<T> A Cursor iterates over a set of Localizable elements, for example the image values at the (integer) pixel positions of an image.Dimensions Defines an extent in n-dimensional discrete space.Dirty Interface for objects that can be flagged dirty (useful for access objects that track if their content was modified)EuclideanSpace {Rn}: an N-dimensional Euclidean space.Interval {x∈Zn|mind≤ xd≤maxd;d∈{0… n-1}}IterableInterval<T> AnIterableRealInterval
whose elements are located at integer coordinates.IterableRealInterval<T> f:Rn∈[0,s]→TIterator TheIterator
interface provides basic functionality for iterating over a set of elements.Localizable TheLocalizable
interface can localize itself in an n-dimensional discrete space.Positionable An element that can be positioned in n-dimensional discrete space.RandomAccess<T> RandomAccessible<T> f:Zn→TRandomAccessibleInterval<T> f:{x∈Zn|[min,max]→T}RealCursor<T> A RealCursor iterates over a set of RealLocalizable elements, for example intensity values sampled at a finite set of arbitrary real positions.RealInterval {x∈Rn|mind≤ xd≤maxd;d∈{0… n-1}}RealLocalizable TheRealLocalizable
interface can localize itself in an n-dimensional real space.RealPositionable An element that can be positioned in n-dimensional real space.RealRandomAccess<T> RealRandomAccessible<T> f:Rn→TRealRandomAccessibleRealInterval<T> f:{x∈Rn|[min,max]→T}Sampler<T> TheSampler
interface provides access to a value whose type is specified by the generic parameter T.View An interface which marks an object that is a lightweight wrapper or "view" around actual data. -
Class Summary Class Description AbstractCursor<T> Abstract implementation ofCursor
.AbstractCursorInt<T> Abstract implementation ofCursor
.AbstractEuclideanSpace Superclass of abstract EuclideanSpace implementations (accessors, containers, etc).AbstractInterval Implementation of theInterval
interface.AbstractLocalizable An abstract class that implements theLocalizable
interface using a long[] array to maintain position.AbstractLocalizableInt An abstract class that implements theLocalizable
interface using an int[] array to maintain position.AbstractLocalizingCursor<T> Abstract base class for localizingCursor
s.AbstractLocalizingCursorInt<T> Abstract base class for localizingCursor
s.AbstractRealInterval Implementation of theRealInterval
interface.AbstractRealLocalizable An abstract class that implements theRealLocalizable
interface using an array of doubles to maintain positionAbstractWrappedInterval<I extends Interval> Convenient base class forIterableIntervals
,RandomAccessibleIntervals
, etc that forward theInterval
interface to, for example, their source accessible.AbstractWrappedRealInterval<I extends RealInterval> Convenient base class forIterableRealIntervals
, etc that forward theRealInterval
interface to, for example, their source accessible.FinalDimensions An implementation of dimensionality that can wrap a long[] array.FinalInterval Implementation of theInterval
interface.FinalRealInterval Implementation of theRealInterval
interface.FlatIterationOrder A flat iteration order on anIterableInterval
.KDTree<T> KDTree to access values at RealLocalizable positions.KDTree.DimComparator<L extends RealLocalizable> Compare RealLocalizables by comparing their coordinates in dimension d.KDTree.SamplerNode<T> A KDTreeNode that stores it's value as a Sampler.KDTree.ValueNode<T> A KDTreeNode that stores it's value as a reference.KDTreeNode<T> Abstract base class for nodes in a KDTree.Point A Point is a position in Euclidean space specified in integer coordinates.PointSampleList<T> A list of data samples at explicitinteger coordinates
.RealPoint A point is a location in EuclideanSpace.RealPointSampleList<T> A list of data samples at explicitreal coordinates
.Volatile<T> Something volatile that has a value and is either VALID or INVALID.