Package net.imglib2
package net.imglib2
-
ClassDescriptionAbstract implementation of
Cursor
.Abstract implementation ofCursor
.Superclass of abstract EuclideanSpace implementations (accessors, containers, etc).Implementation of theInterval
interface.An abstract class that implements theLocalizable
interface using a long[] array to maintain position.An abstract class that implements theLocalizable
interface using an int[] array to maintain position.Abstract base class for localizingCursor
s.Abstract base class for localizingCursor
s.Implementation of theRealInterval
interface.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.Cursor<T>A Cursor iterates over a set of Localizable elements, for example the image values at the (integer) pixel positions of an image.Defines an extent in n-dimensional discrete space.Interface for objects that can be flagged dirty (useful for access objects that track if their content was modified){Rn}: an N-dimensional Euclidean space.An implementation of dimensionality that can wrap a long[] array.Implementation of theInterval
interface.Implementation of theRealInterval
interface.A flat iteration order on anIterableInterval
.{x∈Zn|mind≤ xd≤maxd;d∈{0… n-1}}AnIterableRealInterval
whose elements are located at integer coordinates.f:Rn∈[0,s]→TTheIterator
interface provides basic functionality for iterating over a set of elements.KDTree<T>KDTree to access values at RealLocalizable positions.KDTree.DimComparator<L extends RealLocalizable>Compare RealLocalizables by comparing their coordinates in dimension d.A KDTreeNode that stores it's value as a Sampler.A KDTreeNode that stores it's value as a reference.KDTreeNode<T>Abstract base class for nodes in a KDTree.TheLocalizable
interface can localize itself in an n-dimensional discrete space.A Point is a position in Euclidean space specified in integer coordinates.A list of data samples at explicitinteger coordinates
.An element that can be positioned in n-dimensional discrete space.RandomAccess<T>f:Zn→Tf:{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.{x∈Rn|mind≤ xd≤maxd;d∈{0… n-1}}TheRealLocalizable
interface can localize itself in an n-dimensional real space.A point is a location in EuclideanSpace.A list of data samples at explicitreal coordinates
.An element that can be positioned in n-dimensional real space.f:Rn→Tf:{x∈Rn|[min,max]→T}Sampler<T>TheSampler
interface provides access to a value whose type is specified by the generic parameter T.An interface which marks an object that is a lightweight wrapper or "view" around actual data.Volatile<T>Something volatile that has a value and is either VALID or INVALID.