|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use IntIntPair | |
---|---|
de.lmu.ifi.dbs.elki.algorithm.outlier | Outlier detection algorithms |
de.lmu.ifi.dbs.elki.evaluation.paircounting.generator | Pair generation for pair counting evaluation. |
de.lmu.ifi.dbs.elki.math.linearalgebra | Linear Algebra package provides classes and computational methods for operations on matrices. |
de.lmu.ifi.dbs.elki.utilities.pairs | Pairs and triples utility classes. |
Uses of IntIntPair in de.lmu.ifi.dbs.elki.algorithm.outlier |
---|
Method parameters in de.lmu.ifi.dbs.elki.algorithm.outlier with type arguments of type IntIntPair | |
---|---|
protected DBIDs |
AbstractAggarwalYuOutlier.computeSubspace(Vector<IntIntPair> subspace,
ArrayList<ArrayList<DBIDs>> ranges)
Method to get the ids in the given subspace |
Uses of IntIntPair in de.lmu.ifi.dbs.elki.evaluation.paircounting.generator |
---|
Fields in de.lmu.ifi.dbs.elki.evaluation.paircounting.generator declared as IntIntPair | |
---|---|
private IntIntPair |
PairSortedGenerator.cur
Current pair |
Methods in de.lmu.ifi.dbs.elki.evaluation.paircounting.generator that return IntIntPair | |
---|---|
protected abstract IntIntPair |
PairSortedGenerator.advance()
Main advance method. |
protected IntIntPair |
PairGeneratorNoise.advance()
Advance iterator and return new pair. |
protected IntIntPair |
PairGeneratorMerge.advance()
Advance iterator and return next pair. |
protected IntIntPair |
PairGeneratorSingleCluster.advance()
Advance iterator |
IntIntPair |
PairSortedGenerator.current()
Return current pair. |
IntIntPair |
PairSortedGeneratorInterface.current()
Return current pair. |
IntIntPair |
PairSortedGenerator.next()
Return next pair. |
IntIntPair |
PairSortedGeneratorInterface.next()
Return next pair, advance generator |
Methods in de.lmu.ifi.dbs.elki.evaluation.paircounting.generator with parameters of type IntIntPair | |
---|---|
protected void |
PairSortedGenerator.setCurrent(IntIntPair cur)
Set the current pair. |
Uses of IntIntPair in de.lmu.ifi.dbs.elki.math.linearalgebra |
---|
Methods in de.lmu.ifi.dbs.elki.math.linearalgebra that return IntIntPair | |
---|---|
private IntIntPair |
LinearEquationSystem.nonZeroPivotSearch(int k)
Method for trivial pivot search, searches for non-zero entry. |
private IntIntPair |
LinearEquationSystem.totalPivotSearch(int k)
Method for total pivot search, searches for x,y in {k,...n}, so that |a_xy| > |a_ij| |
Methods in de.lmu.ifi.dbs.elki.math.linearalgebra with parameters of type IntIntPair | |
---|---|
private void |
LinearEquationSystem.permutePivot(IntIntPair pos1,
IntIntPair pos2)
permutes two matrix rows and two matrix columns |
Uses of IntIntPair in de.lmu.ifi.dbs.elki.utilities.pairs |
---|
Fields in de.lmu.ifi.dbs.elki.utilities.pairs with type parameters of type IntIntPair | |
---|---|
static Comparator<IntIntPair> |
IntIntPair.BYFIRST_COMPARATOR
Comparator to compare by second component only |
static Comparator<IntIntPair> |
IntIntPair.BYSECOND_COMPARATOR
Comparator to compare by second component only |
static Comparator<IntIntPair> |
IntIntPair.SWAPPED_COMPARATOR
Comparator to compare by swapped components |
Methods in de.lmu.ifi.dbs.elki.utilities.pairs with parameters of type IntIntPair | |
---|---|
int |
IntIntPair.compareSwappedTo(IntIntPair other)
Implementation of comparableSwapped interface, sorting by second then first. |
int |
IntIntPair.compareTo(IntIntPair other)
Implementation of comparable interface, sorting by first then second. |
|
|
|||||||||||
PREV NEXT | FRAMES NO FRAMES |