Serialized Form
serialVersionUID: 1020l
baseTime
long baseTime
elapsedTime
long elapsedTime
Package cern.colt.bitvector |
columns
int columns
rows
int rows
bits
long[] bits
bits
long[] bits
- The bits of this object. The ith bit is stored in bits[i/64] at
bit position i % 64 (where bit position 0 refers to the least
significant bit and 63 refers to the most significant bit).
-
nbits
int nbits
target
DoubleBufferConsumer target
elements
double[] elements
list
DoubleArrayList list
capacity
int capacity
size
int size
target
DoubleBuffer2DConsumer target
xElements
double[] xElements
yElements
double[] yElements
xList
DoubleArrayList xList
yList
DoubleArrayList yList
capacity
int capacity
size
int size
target
DoubleBuffer3DConsumer target
xElements
double[] xElements
yElements
double[] yElements
zElements
double[] zElements
xList
DoubleArrayList xList
yList
DoubleArrayList yList
zList
DoubleArrayList zList
capacity
int capacity
size
int size
target
IntBufferConsumer target
elements
int[] elements
list
IntArrayList list
capacity
int capacity
size
int size
target
IntBuffer2DConsumer target
xElements
int[] xElements
yElements
int[] yElements
xList
IntArrayList xList
yList
IntArrayList yList
capacity
int capacity
size
int size
target
IntBuffer3DConsumer target
xElements
int[] xElements
yElements
int[] yElements
zElements
int[] zElements
xList
IntArrayList xList
yList
IntArrayList yList
zList
IntArrayList zList
capacity
int capacity
size
int size
target
ObjectBufferConsumer target
elements
Object[] elements
list
ObjectArrayList list
capacity
int capacity
size
int size
size
int size
- The size of the list.
This is a READ_ONLY variable for all methods but setSizeRaw(int newSize) !!!
If you violate this principle in subclasses, you should exactly know what you are doing.
-
size
int size
- The size of the list.
This is a READ_ONLY variable for all methods but setSizeRaw(int newSize) !!!
If you violate this principle in subclasses, you should exactly know what you are doing.
-
size
int size
- The size of the list.
This is a READ_ONLY variable for all methods but setSizeRaw(int newSize) !!!
If you violate this principle in subclasses, you should exactly know what you are doing.
-
size
int size
- The size of the list.
This is a READ_ONLY variable for all methods but setSizeRaw(int newSize) !!!
If you violate this principle in subclasses, you should exactly know what you are doing.
-
size
int size
- The size of the list.
This is a READ_ONLY variable for all methods but setSizeRaw(int newSize) !!!
If you violate this principle in subclasses, you should exactly know what you are doing.
-
size
int size
- The size of the list.
This is a READ_ONLY variable for all methods but setSizeRaw(int newSize) !!!
If you violate this principle in subclasses, you should exactly know what you are doing.
-
size
int size
- The size of the list.
This is a READ_ONLY variable for all methods but setSizeRaw(int newSize) !!!
If you violate this principle in subclasses, you should exactly know what you are doing.
-
size
int size
- The size of the list.
This is a READ_ONLY variable for all methods but setSizeRaw(int newSize) !!!
If you violate this principle in subclasses, you should exactly know what you are doing.
-
elements
boolean[] elements
- The array buffer into which the elements of the list are stored.
The capacity of the list is the length of this array buffer.
-
elements
byte[] elements
- The array buffer into which the elements of the list are stored.
The capacity of the list is the length of this array buffer.
-
elements
char[] elements
- The array buffer into which the elements of the list are stored.
The capacity of the list is the length of this array buffer.
-
distinctValues
long[] distinctValues
elements
MinMaxNumberList elements
elements
double[] elements
- The array buffer into which the elements of the list are stored.
The capacity of the list is the length of this array buffer.
-
elements
float[] elements
- The array buffer into which the elements of the list are stored.
The capacity of the list is the length of this array buffer.
-
elements
int[] elements
- The array buffer into which the elements of the list are stored.
The capacity of the list is the length of this array buffer.
-
elements
long[] elements
- The array buffer into which the elements of the list are stored.
The capacity of the list is the length of this array buffer.
-
minValue
long minValue
bitsPerElement
int bitsPerElement
bits
long[] bits
capacity
int capacity
elements
Object[] elements
- The array buffer into which the elements of the list are stored.
The capacity of the list is the length of this array buffer.
-
size
int size
- The size of the list.
-
elements
short[] elements
- The array buffer into which the elements of the list are stored.
The capacity of the list is the length of this array buffer.
-
elements
long[] elements
- The array buffer into which the elements of the list are stored.
The capacity of the list is the length of this array buffer.
-
size
int size
- The size of the list.
-
distinct
int distinct
- The number of distinct associations in the map; its "size()".
lowWaterMark
int lowWaterMark
- The table capacity c=table.length always satisfies the invariant
c * minLoadFactor <= s <= c * maxLoadFactor, where s=size() is the number of associations currently contained.
The term "c * minLoadFactor" is called the "lowWaterMark", "c * maxLoadFactor" is called the "highWaterMark".
In other words, the table capacity (and proportionally the memory used by this class) oscillates within these constraints.
The terms are precomputed and cached to avoid recalculating them each time put(..) or removeKey(...) is called.
highWaterMark
int highWaterMark
minLoadFactor
double minLoadFactor
- The minimum load factor for the hashtable.
maxLoadFactor
double maxLoadFactor
- The maximum load factor for the hashtable.
table
double[] table
- The hash table keys.
-
values
int[] values
- The hash table values.
-
state
byte[] state
- The state of each hash table entry (FREE, FULL, REMOVED).
-
freeEntries
int freeEntries
- The number of table entries in state==FREE.
-
table
int[] table
- The hash table keys.
-
values
double[] values
- The hash table values.
-
state
byte[] state
- The state of each hash table entry (FREE, FULL, REMOVED).
-
freeEntries
int freeEntries
- The number of table entries in state==FREE.
-
table
int[] table
- The hash table keys.
-
values
int[] values
- The hash table values.
-
state
byte[] state
- The state of each hash table entry (FREE, FULL, REMOVED).
-
freeEntries
int freeEntries
- The number of table entries in state==FREE.
-
table
int[] table
- The hash table keys.
-
values
Object[] values
- The hash table values.
-
state
byte[] state
- The state of each hash table entry (FREE, FULL, REMOVED).
-
freeEntries
int freeEntries
- The number of table entries in state==FREE.
-
table
long[] table
- The hash table keys.
-
values
Object[] values
- The hash table values.
-
state
byte[] state
- The state of each hash table entry (FREE, FULL, REMOVED).
-
freeEntries
int freeEntries
- The number of table entries in state==FREE.
-
Package cern.colt.matrix.doublealgo |
Package cern.colt.matrix.impl |
alignment
String alignment
- The default format string for formatting a single cell value; currently "%G".
format
String format
- The default format string for formatting a single cell value; currently "%G".
minColumnWidth
int minColumnWidth
- The default minimum number of characters a column may have; currently 1.
columnSeparator
String columnSeparator
- The default string separating any two columns from another; currently " ".
rowSeparator
String rowSeparator
- The default string separating any two rows from another; currently "\n".
sliceSeparator
String sliceSeparator
- The default string separating any two slices from another; currently "\n\n".
printShape
boolean printShape
- Tells whether String representations are to be preceded with summary of the shape; currently true.
isNoView
boolean isNoView
size
int size
- the number of cells this matrix (view) has
zero
int zero
- the index of the first element
stride
int stride
- the number of indexes between any two elements, i.e. index(i+1) - index(i).
columns
int columns
- the number of colums and rows this matrix (view) has
rows
int rows
- the number of colums and rows this matrix (view) has
rowStride
int rowStride
- the number of elements between two rows, i.e. index(i+1,j,k) - index(i,j,k).
columnStride
int columnStride
- the number of elements between two columns, i.e. index(i,j+1,k) - index(i,j,k).
rowZero
int rowZero
- the index of the first element
columnZero
int columnZero
- the index of the first element
slices
int slices
- the number of slices this matrix (view) has
rows
int rows
- the number of rows this matrix (view) has
columns
int columns
- the number of columns this matrix (view) has
sliceStride
int sliceStride
- the number of elements between two slices, i.e. index(k+1,i,j) - index(k,i,j).
rowStride
int rowStride
- the number of elements between two rows, i.e. index(k,i+1,j) - index(k,i,j).
columnStride
int columnStride
- the number of elements between two columns, i.e. index(k,i,j+1) - index(k,i,j).
sliceZero
int sliceZero
- the index of the first element
rowZero
int rowZero
- the index of the first element
columnZero
int columnZero
- the index of the first element
elements
double[] elements
- The elements of this matrix.
serialVersionUID: 1020177651l
elements
double[] elements
- The elements of this matrix.
elements are stored in row major, i.e.
index==row*columns + column
columnOf(index)==index%columns
rowOf(index)==index/columns
i.e. {row0 column0..m}, {row1 column0..m}, ..., {rown column0..m}
elements
double[] elements
- The elements of this matrix.
elements are stored in slice major, then row major, then column major, in order of significance, i.e.
index==slice*sliceStride+ row*rowStride + column*columnStride
i.e. {slice0 row0..m}, {slice1 row0..m}, ..., {sliceN row0..m}
with each row storead as
{row0 column0..m}, {row1 column0..m}, ..., {rown column0..m}
elements
Object[] elements
- The elements of this matrix.
elements
Object[] elements
- The elements of this matrix.
elements are stored in row major, i.e.
index==row*columns + column
columnOf(index)==index%columns
rowOf(index)==index/columns
i.e. {row0 column0..m}, {row1 column0..m}, ..., {rown column0..m}
elements
Object[] elements
- The elements of this matrix.
elements are stored in slice major, then row major, then column major, in order of significance, i.e.
index==slice*sliceStride+ row*rowStride + column*columnStride
i.e. {slice0 row0..m}, {slice1 row0..m}, ..., {sliceN row0..m}
with each row storead as
{row0 column0..m}, {row1 column0..m}, ..., {rown column0..m}
indexes
IntArrayList indexes
values
DoubleArrayList values
starts
int[] starts
elements
AbstractIntDoubleMap elements
elements
AbstractIntDoubleMap elements
dummy
int dummy
elements
AbstractIntDoubleMap elements
elements
AbstractIntObjectMap elements
elements
AbstractIntObjectMap elements
elements
AbstractIntObjectMap elements
Package cern.colt.matrix.linalg |
property
Property property
- The property object attached to this instance.
serialVersionUID: 1020l
L
DoubleMatrix2D L
- Array for internal storage of decomposition.
- internal array storage.
n
int n
- Row and column dimension (square matrix).
- matrix dimension.
isSymmetricPositiveDefinite
boolean isSymmetricPositiveDefinite
- Symmetric and positive definite flag.
- is symmetric and positive definite flag.
serialVersionUID: 1020l
n
int n
- Row and column dimension (square matrix).
- matrix dimension.
issymmetric
boolean issymmetric
- Symmetry flag.
- internal symmetry flag.
d
double[] d
- Arrays for internal storage of eigenvalues.
- internal storage of eigenvalues.
e
double[] e
- Arrays for internal storage of eigenvalues.
- internal storage of eigenvalues.
V
double[][] V
- Array for internal storage of eigenvectors.
- internal storage of eigenvectors.
H
double[][] H
- Array for internal storage of nonsymmetric Hessenberg form.
- internal storage of nonsymmetric Hessenberg form.
ort
double[] ort
- Working storage for nonsymmetric algorithm.
- working storage for nonsymmetric algorithm.
serialVersionUID: 1020l
quick
LUDecompositionQuick quick
serialVersionUID: 1020l
LU
DoubleMatrix2D LU
- Array for internal storage of decomposition.
- internal array storage.
pivsign
int pivsign
- pivot sign.
- pivot sign.
piv
int[] piv
- Internal storage of pivot vector.
- pivot vector.
isNonSingular
boolean isNonSingular
algebra
Algebra algebra
tolerance
double tolerance
serialVersionUID: 1020l
QR
DoubleMatrix2D QR
- Array for internal storage of decomposition.
- internal array storage.
m
int m
- Row and column dimensions.
- column dimension.
n
int n
- Row and column dimensions.
- column dimension.
Rdiag
DoubleMatrix1D Rdiag
- Array for internal storage of diagonal of R.
- diagonal of R.
serialVersionUID: 1020l
U
double[][] U
- Arrays for internal storage of U and V.
- internal storage of U.
V
double[][] V
- Arrays for internal storage of U and V.
- internal storage of U.
s
double[] s
- Array for internal storage of singular values.
- internal storage of singular values.
m
int m
- Row and column dimensions.
- row dimension.
n
int n
- Row and column dimensions.
- row dimension.
Package cern.colt.matrix.objectalgo |
randomGenerator
RandomEngine randomGenerator
randomGenerator
RandomEngine randomGenerator
alpha
double alpha
beta
double beta
PDF_CONST
double PDF_CONST
a_last
double a_last
b_last
double b_last
a_
double a_
b_
double b_
t
double t
fa
double fa
fb
double fb
p1
double p1
p2
double p2
c
double c
ml
double ml
mu
double mu
p_last
double p_last
q_last
double q_last
a
double a
b
double b
s
double s
m
double m
D
double D
Dl
double Dl
x1
double x1
x2
double x2
x4
double x4
x5
double x5
f1
double f1
f2
double f2
f4
double f4
f5
double f5
ll
double ll
lr
double lr
z2
double z2
z4
double z4
p3
double p3
p4
double p4
n
int n
p
double p
n_last
int n_last
n_prev
int n_prev
par
double par
np
double np
p0
double p0
q
double q
p_last
double p_last
p_prev
double p_prev
b
int b
m
int m
nm
int nm
pq
double pq
rc
double rc
ss
double ss
xm
double xm
xl
double xl
xr
double xr
ll
double ll
lr
double lr
c
double c
p1
double p1
p2
double p2
p3
double p3
p4
double p4
ch
double ch
log_p
double log_p
log_q
double log_q
log_n
double log_n
mean
double mean
gamma
double gamma
cut
double cut
uniform
Uniform uniform
freedom
double freedom
freedom_in
double freedom_in
b
double b
vm
double vm
vp
double vp
vd
double vd
cdf
double[] cdf
interpolationType
int interpolationType
K
int K
A
int[] A
F
double[] F
cdf
double[] cdf
lambda
double lambda
tau
double tau
s
double s
sm1
double sm1
tau_set
double tau_set
alpha
double alpha
lambda
double lambda
alpha
double alpha
beta
double beta
a_setup
double a_setup
b_setup
double b_setup
x
double x
u
double u
v
double v
e
double e
hr
double hr
hl
double hl
s
double s
pm
double pm
pr
double pr
samb
double samb
pmr
double pmr
mpa_1
double mpa_1
mmb_1
double mmb_1
my_N
int my_N
my_s
int my_s
my_n
int my_n
N_last
int N_last
M_last
int M_last
n_last
int n_last
N_Mn
int N_Mn
m
int m
mp
int mp
b
int b
Mp
double Mp
np
double np
fm
double fm
k2
int k2
k4
int k4
k1
int k1
k5
int k5
dl
double dl
dr
double dr
r1
double r1
r2
double r2
r4
double r4
r5
double r5
ll
double ll
lr
double lr
c_pm
double c_pm
f1
double f1
f2
double f2
f4
double f4
f5
double f5
p1
double p1
p2
double p2
p3
double p3
p4
double p4
p5
double p5
p6
double p6
my_p
double my_p
t
double t
h
double h
a_prev
double a_prev
n
int n
p
double p
gamma
Gamma gamma
poisson
Poisson poisson
mean
double mean
variance
double variance
standardDeviation
double standardDeviation
cache
double cache
cacheFilled
boolean cacheFilled
SQRT_INV
double SQRT_INV
mean
double mean
my_old
double my_old
p
double p
q
double q
p0
double p0
pp
double[] pp
llll
int llll
my_last
double my_last
ll
double ll
k2
int k2
k4
int k4
k1
int k1
k5
int k5
dl
double dl
dr
double dr
r1
double r1
r2
double r2
r4
double r4
r5
double r5
lr
double lr
l_my
double l_my
c_pm
double c_pm
f1
double f1
f2
double f2
f4
double f4
f5
double f5
p1
double p1
p2
double p2
p3
double p3
p4
double p4
p5
double p5
p6
double p6
m
int m
mean
double mean
cached_sq
double cached_sq
cached_alxm
double cached_alxm
cached_g
double cached_g
freedom
double freedom
TERM
double TERM
min
double min
max
double max
my_k
double my_k
k_set
double k_set
tau
double tau
rho
double rho
r
double r
ro
double ro
pk
double pk
c
double c
d
double d
ro_prev
double ro_prev
pk_prev
double pk_prev
maxlongint
double maxlongint
Package cern.jet.random.engine |
current
int current
mti
int mti
mt
int[] mt
row
int row
column
int column
Package cern.jet.random.sampling |
my_n
long my_n
my_N
long my_N
my_low
long my_low
my_RandomGenerator
RandomEngine my_RandomGenerator
sampler
RandomSampler sampler
buffer
long[] buffer
bufferPosition
int bufferPosition
skip
long skip
n
long n
skip
int skip
nextTriggerPos
int nextTriggerPos
nextSkip
int nextSkip
weight
int weight
generator
Uniform generator
Package cern.jet.stat.quantile |
binBoundaries
float[] binBoundaries
elements
DoubleArrayList elements
- The elements contained in this bin.
sortedElements
DoubleArrayList sortedElements
- The elements contained in this bin, sorted ascending.
fixedOrder
boolean fixedOrder
- Preserve element order under all circumstances?
isSorted
boolean isSorted
isIncrementalStatValid
boolean isIncrementalStatValid
isSumOfInversionsValid
boolean isSumOfInversionsValid
isSumOfLogarithmsValid
boolean isSumOfLogarithmsValid
hasSumOfLogarithms
boolean hasSumOfLogarithms
sumOfLogarithms
double sumOfLogarithms
hasSumOfInversions
boolean hasSumOfInversions
sumOfInversions
double sumOfInversions
sumOfPowers
double[] sumOfPowers
finder
DoubleQuantileFinder finder
size
int size
- The number of elements consumed by incremental parameter maintainance.
min
double min
max
double max
sum
double sum
sum_xx
double sum_xx
bins
int bins
min
double min
binWidth
double binWidth
xunder
int xunder
xover
int xover
errors
double[] errors
heights
double[] heights
entries
int[] entries
nEntry
int nEntry
sumWeight
double sumWeight
sumWeightSquared
double sumWeightSquared
mean
double mean
rms
double rms
heights
double[][] heights
errors
double[][] errors
entries
int[][] entries
nEntry
int nEntry
sumWeight
double sumWeight
sumWeightSquared
double sumWeightSquared
meanX
double meanX
rmsX
double rmsX
meanY
double meanY
rmsY
double rmsY
heights
double[][][] heights
errors
double[][][] errors
entries
int[][][] entries
nEntry
int nEntry
sumWeight
double sumWeight
sumWeightSquared
double sumWeightSquared
meanX
double meanX
rmsX
double rmsX
meanY
double meanY
rmsY
double rmsY
meanZ
double meanZ
rmsZ
double rmsZ
min
double min
bins
int bins
edges
double[] edges
Jump to the Colt Homepage