|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
long >= value
.
Property.DEFAULT
attached for tolerance.
Partitioning.dualPartition(int[],int[],int,int,int[],int,int,int[])
except that it synchronously
partitions double[] rather than int[] arrays.
Partitioning.dualPartition(int[],int[],int,int,int)
except that it synchronously partitions
double[] rather than int[] arrays.
Partitioning.partition(int[],int,int,int[],int,int,int[])
except that this method synchronously
partitions two arrays at the same time; both arrays are partially sorted according to the elements of the primary
array.
Partitioning.partition(int[],int,int,int)
except that this method synchronously partitions two arrays at
the same time; both arrays are partially sorted according to the elements of the primary array.
long <= value
.
Partitioning.partition(int[],int,int,int[],int,int,int[])
except that it generically partitions
arbitrary shaped data (for example matrices or multiple arrays) rather than int[] arrays.
SingularVectorVerifier
to check for convergence
HebbianUpdater
to do the updating work, and the default
AsyncEigenVerifier
to check for convergence in a (single) background thread.
HebbianUpdater
to do the updating work, and the default
AsyncEigenVerifier
to check for convergence in a (single) background thread, with
maxPassesPerEigen set to Integer.MAX_VALUE.
HebbianUpdater
to do the updating work, and the default
AsyncEigenVerifier
to check for convergence in a (single) background thread, with
convergenceTarget set to 0, which means that the solver will not really care about convergence as a loop-exiting
criterion (but will be checking for convergence anyways, so it will be logged and singular values will be
saved).
Vector.getElement(int)
for the given index
(0.0,1.0)
(excluding
0.0 and 1.0).
(0.0,1.0)
(excluding
0.0 and 1.0).
(0.0f,1.0f)
(excluding
0.0f and 1.0f).
(0.0f,1.0f)
(excluding
0.0f and 1.0f).
org.apache.mahout.math.matrix
, without subsetting or supersetting.DoubleMatrix2D
and DoubleMatrix1D
.Partitioning.partition(int[],int,int,int[],int,int,int[])
except that it
synchronously partitions the rows of the given matrix by the values of the given matrix column; This is
essentially the same as partitioning a list of composite objects by some instance variable; In other words, two
entire rows of the matrix are swapped, whenever two column values indicate so.
Partitioning.partition(int[],int,int,int[],int,int,int[])
except that it
synchronously partitions the rows of the given matrix by the values of the given matrix column; This is
essentially the same as partitioning a list of composite objects by some instance variable; In other words, two
entire rows of the matrix are swapped, whenever two column values indicate so.
Partitioning.partition(int[],int,int,int[],int,int,int[])
except that it partitions double[] rather
than int[] arrays.
Partitioning.partition(int[],int,int,int)
except that it partitions double[] rather than
int[] arrays.
Partitioning.partition(int[],int,int,int[],int,int,int[])
except that it partitions Object[] rather
than int[] arrays.
Partitioning.partition(int[],int,int,int)
except that it synchronously partitions the objects of the
given list by the order of the given comparator.
DoubleMatrix2D.viewSelection(int[],int[])
.
(0.0,1.0)
(excluding 0.0 and 1.0).
(0.0,1.0)
(excluding
0.0 and 1.0).
(0.0,1.0)
(excluding
0.0 and 1.0).
(0.0,1.0)
(excluding
0.0 and 1.0).
Partitioning.triplePartition(int[],int[],int[],int,int,int[],int,int,int[])
except that it synchronously
partitions double[] rather than int[] arrays.
Partitioning.triplePartition(int[],int[],int[],int,int,int)
except that it synchronously partitions
double[] rather than int[] arrays.
Partitioning.partition(int[],int,int,int[],int,int,int[])
except that this method synchronously
partitions three arrays at the same time; all three arrays are partially sorted according to the elements of the
primary array.
Partitioning.partition(int[],int,int,int)
except that this method synchronously partitions three arrays
at the same time; all three arrays are partially sorted according to the elements of the primary array.
MersenneTwister
seeded with the given seed.
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |