|
Colt 1.1.0 | |||||||||
PREV NEXT | FRAMES NO FRAMES |
boolean
elements; abstract.byte
elements; abstract.char
elements; abstract.int
, float
, etc.double
elements; abstract.float
elements; abstract.int
elements; abstract.int
, float
, etc.long
elements; abstract.int
, float
, etc.int
, float
, etc.int
, double
, etc.int
, double
, etc.int
, double
, etc.short
elements; abstract.DoubleMatrix2D
; concentrates most functionality of this package.from
(inclusive) and to
(inclusive) to the receiver.
from
(inclusive) and to
(inclusive) to the receiver.
from
(inclusive) and to
(inclusive) to the receiver.
from
(inclusive) and to
(inclusive) to the receiver.
from
(inclusive) and to
(inclusive) to the receiver.
from
(inclusive) and to
(inclusive) to the receiver.
from
(inclusive) and to
(inclusive) to the receiver.
from
(inclusive) and to
(inclusive) to the receiver.
from
(inclusive) and to
(inclusive) to the receiver.
boolean
elements; implemented with arrays.byte
elements; implemented with arrays.otherFrom
(inclusive) and otherTo
(inclusive) before the specified position into the receiver.
otherFrom
(inclusive) and otherTo
(inclusive) before the specified position into the receiver.
otherFrom
(inclusive) and otherTo
(inclusive) before the specified position into the receiver.
otherFrom
(inclusive) and otherTo
(inclusive) before the specified position into the receiver.
otherFrom
(inclusive) and otherTo
(inclusive) before the specified position into the receiver.
otherFrom
(inclusive) and otherTo
(inclusive) before the specified position into the receiver.
otherFrom
(inclusive) and otherTo
(inclusive) before the specified position into the receiver.
otherFrom
(inclusive) and otherTo
(inclusive) before the specified position into the receiver.
otherFrom
(inclusive) and otherTo
(inclusive) before the specified position into the receiver.
char
elements; implemented with arrays.long >= value
.
cern.colt.matrix
, without subsetting or supersetting.DoubleMatrix2D
and DoubleMatrix1D
.BitMatrix
produces a new BitMatrix
that is equal to it.
BitVector
produces a new BitVector
that is equal to it.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
clone()
and casts the result.
Property.DEFAULT
attached for tolerance.
double
elements; implemented with arrays.AbstractDoubleList
to be viewed and treated as a JDK 1.2 AbstractList
.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.
float
elements; implemented with arrays.AbstractFloatList
to be viewed and treated as a JDK 1.2 AbstractList
.Former
via method create();
Implementations of can use existing libraries such as corejava.PrintfFormat or corejava.Format or other.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.
int
elements; implemented with arrays.AbstractIntList
to be viewed and treated as a JDK 1.2 AbstractList
.LUDecomposition
, avoiding unnecessary memory allocation and copying.long
elements; implemented with arrays.AbstractLongList
to be viewed and treated as a JDK 1.2 AbstractList
.(0.0,1.0)
(excluding 0.0 and 1.0).
(0.0f,1.0f)
(excluding 0.0f and 1.0f).
>= desiredCapacity
and very close to desiredCapacity
(within 11% if desiredCapacity >= 1000
).
>= desiredCapacity
and very close to desiredCapacity
(within 11% if desiredCapacity >= 1000
).
Object
elements; implemented with arrays.ObjectArrayList
to be viewed and treated as a JDK 1.2 AbstractList
.from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
from
, inclusive, and to
, inclusive.
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.
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 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.
DoubleMatrix2D.viewSelection(int[],int[])
.
from
to index to
to the bits of value
.
from
to index to
to the bits of value
.
(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).
from
, inclusive and to
, inclusive.
from
, inclusive and to
, inclusive.
from
, inclusive and to
, inclusive.
from
, inclusive and to
, inclusive.
from
, inclusive and to
, inclusive.
from
, inclusive and to
, inclusive.
from
, inclusive and to
, inclusive.
from
, inclusive and to
, inclusive.
from
, inclusive and to
, inclusive.
from
, inclusive and to
, inclusive.
from
, inclusive and to
, inclusive.
from
(inclusive) and to
(inclusive) with the other list's
part between otherFrom
and otherTo
.
from
(inclusive) and to
(inclusive) with the other list's
part between otherFrom
and otherTo
.
from
(inclusive) and to
(inclusive) with the other list's
part between otherFrom
and otherTo
.
from
(inclusive) and to
(inclusive) with the other list's
part between otherFrom
and otherTo
.
from
(inclusive) and to
(inclusive) with the other list's
part between otherFrom
and otherTo
.
from
(inclusive) and to
(inclusive) with the other list's
part between otherFrom
and otherTo
.
from
(inclusive) and to
(inclusive) with the other list's
part between otherFrom
and otherTo
.
from
(inclusive) and to
(inclusive) with the other list's
part between otherFrom
and otherTo
.
from
(inclusive) and to
(inclusive) with the other list's
part between otherFrom
and otherTo
.
from
(inclusive) with all the elements of the specified collection.
from
(inclusive) with all the elements of the specified collection.
from
(inclusive) with all the elements of the specified collection.
from
(inclusive) with all the elements of the specified collection.
from
(inclusive) with all the elements of the specified collection.
from
(inclusive) with all the elements of the specified collection.
from
(inclusive) with all the elements of the specified collection.
from
(inclusive) with all the elements of the specified collection.
from
(inclusive) with all the elements of the specified collection.
from
(inclusive) with all the elements of the specified collection.
array[middle]
is put in
array[first]
, array[middle+1]
is put in
array[first+1]
, etc.
short
elements; implemented with arrays.long
elements; implemented with arrays; not efficient; just to demonstrate which methods you must override to implement a fully functional list.from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
from
(inclusive) and to
(inclusive).
SmpBlas.allocateBlas(int, cern.colt.matrix.linalg.Blas)
.
edu.oswego.cs.dl.util.concurrent.FJTaskRunnerGroup#stats
.
times
times the receiver.
times
times the receiver.
times
times the receiver.
times
times the receiver.
times
times the receiver.
times
times the receiver.
times
times the receiver.
times
times the receiver.
times
times the receiver.
java.util.ArrayList
containing all the elements in the receiver.
java.util.ArrayList
containing all the elements in the receiver.
java.util.ArrayList
containing all the elements in the receiver.
java.util.ArrayList
containing all the elements in the receiver.
java.util.ArrayList
containing all the elements in the receiver.
java.util.ArrayList
containing all the elements in the receiver.
java.util.ArrayList
containing all the elements in the receiver.
java.util.ArrayList
containing all the elements in the receiver.
java.util.ArrayList
containing all the elements in the receiver.
java.util.ArrayList
containing all the elements in the receiver.
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.
Property.ZERO
attached for tolerance.
|
Colt 1.1.0 | |||||||||
PREV NEXT | FRAMES NO FRAMES |