- All Known Subinterfaces:
Access1D<N>,Access1D.Aggregatable<N>,Access1D.Collectable<N,,R> Access1D.Sliceable<N>,Access1D.Visitable<N>,Access2D<N>,Access2D.Aggregatable<N>,Access2D.Collectable<N,,R> Access2D.Sliceable<N>,Access2D.Visitable<N>,AccessAnyD<N>,AccessAnyD.Aggregatable<N>,AccessAnyD.Collectable<N,,R> AccessAnyD.Sliceable<N>,AccessAnyD.Visitable<N>,Bidiagonal<N>,Cholesky<N>,DecompositionStore<N>,Eigenvalue<N>,Eigenvalue.Generalised<N>,Eigenvalue.Spectral<N>,ElementsSupplier<N>,Factory1D.Builder<I>,Factory2D.Builder<I>,FactoryAnyD.Builder<I>,Hessenberg<N>,Householder<N>,HouseholderReference<N>,InvertibleFactor<N>,LDL<N>,LDU<N>,LU<N>,Matrix2D<N,,M> MatrixDecomposition<N>,MatrixDecomposition.Determinant<N>,MatrixDecomposition.EconomySize<N>,MatrixDecomposition.Hermitian<N>,MatrixDecomposition.Ordered<N>,MatrixDecomposition.Pivoting<N>,MatrixDecomposition.RankRevealing<N>,MatrixDecomposition.Solver<N>,MatrixDecomposition.Updatable<N>,MatrixDecomposition.Values<N>,MatrixStore<N>,Mutate1D,Mutate1D.Fillable<N>,Mutate1D.Mixable<N>,Mutate1D.Modifiable<N>,Mutate1D.ModifiableReceiver<N>,Mutate1D.Receiver<N>,Mutate1D.Sortable,Mutate2D,Mutate2D.Exchangeable,Mutate2D.Fillable<N>,Mutate2D.Mixable<N>,Mutate2D.Modifiable<N>,Mutate2D.ModifiableReceiver<N>,Mutate2D.Receiver<N>,MutateAnyD,MutateAnyD.Fillable<N>,MutateAnyD.Mixable<N>,MutateAnyD.Modifiable<N>,MutateAnyD.ModifiableReceiver<N>,MutateAnyD.Receiver<N>,Operate2D<N,,P> PhysicalStore<N>,PolynomialFunction<N>,QR<N>,SingularValue<N>,SparseStructure2D,Structure1D.Logical<S,,B> Structure2D,Structure2D.Logical<S,,B> Structure2D.ReducibleTo1D<R>,Structure2D.Reshapable,StructureAnyD,StructureAnyD.Logical<S,,B> StructureAnyD.ReducibleTo1D<R>,StructureAnyD.ReducibleTo2D<R>,StructureAnyD.Reshapable,TransformableRegion<N>,Tridiagonal<N>
- All Known Implementing Classes:
Access1D.SelectionView,Access2D.ColumnView,Access2D.RowView,Access2D.SelectionView,AccessAnyD.MatrixView,AccessAnyD.SelectionView,AccessAnyD.VectorView,AnyTensor,Array1D,Array2D,ArrayAnyD,ArrayC128,ArrayH256,ArrayQ128,ArrayR032,ArrayR064,ArrayR128,ArrayR256,ArrayZ008,ArrayZ016,ArrayZ032,ArrayZ064,BasicArray,BasicMatrix,BufferArray,ColumnsSupplier,ColumnsSupplier.SingleView,ComplexNumber,ConstraintsMetaData,DataBatch,DataSeries,DenseArray,DiagonalStore,Equation,ExplicitTimeSeries,GenericStore,Householder.Generic,Householder.Primitive32,Householder.Primitive64,ImageData,ImplicitTimeSeries,IndexedMap.MappedPrimitives,InvertibleFactor.IdentityFactor,Keyed1D,Keyed2D,LongToNumberMap,MatrixC128,MatrixC128.DenseReceiver,MatrixC128.SparseReceiver,MatrixH256,MatrixH256.DenseReceiver,MatrixH256.SparseReceiver,MatrixQ128,MatrixQ128.DenseReceiver,MatrixQ128.SparseReceiver,MatrixR032,MatrixR032.DenseReceiver,MatrixR032.SparseReceiver,MatrixR064,MatrixR064.DenseReceiver,MatrixR064.SparseReceiver,MatrixR128,MatrixR128.DenseReceiver,MatrixR128.SparseReceiver,MatrixTensor,NumberList,OffHeapArray,Optimisation.Result,PlainArray,PolynomialC128,PolynomialQ128,PolynomialR032,PolynomialR064,PolynomialR128,PolynomialR256,Primitive1D,Primitive2D,PrimitiveAnyD,PrimitiveArray,PrimitiveSeries,PrimitiveTimeSeries,Quaternion,R032Store,R064CSC,R064CSC.Builder,R064CSR,R064CSR.Builder,R064Store,RawStore,ReferenceTypeArray,RowsSupplier,RowsSupplier.SingleView,SampleSet,ScalarArray,SparseArray,SparseQDLDL,SparseStore,SparseStore.Builder,VectorTensor
- Functional Interface:
- This is a functional interface and can therefore be used as the assignment target for a lambda expression or method reference.
A (fixed size) 1-dimensional data structure.
- Author:
- apete
-
Nested Class Summary
Nested ClassesModifier and TypeInterfaceDescriptionstatic classstatic interfacestatic final classstatic interfaceStructure1D.Logical<S extends Structure1D,B extends Structure1D.Logical<S, B>> static final classstatic interface -
Method Summary
Modifier and TypeMethodDescriptiondefault longcount()The total number of elements in this structure.static intindex(long index) static <T> Structure1D.IndexMapper<T> mapper()static int[]newDecreasingRange(int first, int count) static long[]newDecreasingRange(long first, int count) static int[]newIncreasingRange(int first, int count) static long[]newIncreasingRange(long first, int count) static long[]replaceNullOrEmptyWithFull(long[] suggested, int fullSize) intsize()The total number of elements in this structure.static int[]toIntIndexes(long[] indexes) static long[]toLongIndexes(int[] indexes)
-
Method Details
-
index
static int index(long index) -
mapper
- Returns:
- A very simple implementation - you better come up with something else.
-
newDecreasingRange
static int[] newDecreasingRange(int first, int count) -
newDecreasingRange
static long[] newDecreasingRange(long first, int count) -
newIncreasingRange
static int[] newIncreasingRange(int first, int count) -
newIncreasingRange
static long[] newIncreasingRange(long first, int count) -
replaceNullOrEmptyWithFull
static long[] replaceNullOrEmptyWithFull(long[] suggested, int fullSize) -
toIntIndexes
static int[] toIntIndexes(long[] indexes) -
toLongIndexes
static long[] toLongIndexes(int[] indexes) -
count
default long count()The total number of elements in this structure.You only need to implement this method if the structure can contain more than Integer.MAX_VALUE elements.
-
size
int size()The total number of elements in this structure.
-