Uses of Class
org.openimaj.util.pair.IntDoublePair

Packages that use IntDoublePair

Package	Description
org.openimaj.knn
org.openimaj.knn.approximate
org.openimaj.knn.pq
org.openimaj.ml.clustering
org.openimaj.ml.clustering.assignment.hard
org.openimaj.ml.clustering.assignment.soft
org.openimaj.ml.clustering.dbscan
org.openimaj.ml.clustering.incremental
org.openimaj.ml.clustering.kmeans	K-Means in OpenIMAJ is designed to be both extremely fast and flexible.
org.openimaj.util.pair
org.openimaj.util.tree

Uses of IntDoublePair in org.openimaj.knn

Methods in org.openimaj.knn that return IntDoublePair

Modifier and Type	Method and Description
IntDoublePair	DoubleNearestNeighboursExact.searchNN(double[] query)
IntDoublePair	LongNearestNeighboursExact.searchNN(long[] query)

Methods in org.openimaj.knn that return types with arguments of type IntDoublePair

Modifier and Type	Method and Description
List<IntDoublePair>	DoubleNearestNeighboursExact.searchKNN(double[] query, int K)
List<IntDoublePair>	LongNearestNeighboursExact.searchKNN(long[] query, int K)

Uses of IntDoublePair in org.openimaj.knn.approximate

Methods in org.openimaj.knn.approximate that return IntDoublePair

Modifier and Type	Method and Description
IntDoublePair	DoubleNearestNeighboursKDTree.searchNN(double[] query)
IntDoublePair	LongNearestNeighboursKDTree.searchNN(long[] query)

Methods in org.openimaj.knn.approximate that return types with arguments of type IntDoublePair

Modifier and Type	Method and Description
List<IntDoublePair>	DoubleNearestNeighboursKDTree.searchKNN(double[] query, int K)
List<IntDoublePair>	LongNearestNeighboursKDTree.searchKNN(long[] query, int K)

Uses of IntDoublePair in org.openimaj.knn.pq

Methods in org.openimaj.knn.pq that return IntDoublePair

Modifier and Type	Method and Description
IntDoublePair	DoubleADCNearestNeighbours.searchNN(double[] query)
IntDoublePair	IncrementalDoubleADCNearestNeighbours.searchNN(double[] query)
IntDoublePair	LongADCNearestNeighbours.searchNN(long[] query)
IntDoublePair	IncrementalLongADCNearestNeighbours.searchNN(long[] query)

Methods in org.openimaj.knn.pq that return types with arguments of type IntDoublePair

Modifier and Type	Method and Description
List<IntDoublePair>	DoubleADCNearestNeighbours.searchKNN(double[] query, int K)
List<IntDoublePair>	IncrementalDoubleADCNearestNeighbours.searchKNN(double[] query, int K)
List<IntDoublePair>	LongADCNearestNeighbours.searchKNN(long[] query, int K)
List<IntDoublePair>	IncrementalLongADCNearestNeighbours.searchKNN(long[] query, int K)

Methods in org.openimaj.knn.pq with parameters of type IntDoublePair

Modifier and Type	Method and Description
protected void	DoubleADCNearestNeighbours.computeDistances(double[] fullQuery, BoundedPriorityQueue<IntDoublePair> queue, IntDoublePair wp)
protected void	DoubleSDCNearestNeighbours.computeDistances(double[] fullQuery, BoundedPriorityQueue<IntDoublePair> queue, IntDoublePair workingPair)
protected void	IncrementalDoubleADCNearestNeighbours.computeDistances(double[] fullQuery, BoundedPriorityQueue<IntDoublePair> queue, IntDoublePair wp)
protected void	LongSDCNearestNeighbours.computeDistances(long[] fullQuery, BoundedPriorityQueue<IntDoublePair> queue, IntDoublePair workingPair)
protected void	LongADCNearestNeighbours.computeDistances(long[] fullQuery, BoundedPriorityQueue<IntDoublePair> queue, IntDoublePair wp)
protected void	IncrementalLongADCNearestNeighbours.computeDistances(long[] fullQuery, BoundedPriorityQueue<IntDoublePair> queue, IntDoublePair wp)

Method parameters in org.openimaj.knn.pq with type arguments of type IntDoublePair

Modifier and Type	Method and Description
protected void	DoubleADCNearestNeighbours.computeDistances(double[] fullQuery, BoundedPriorityQueue<IntDoublePair> queue, IntDoublePair wp)
protected void	DoubleSDCNearestNeighbours.computeDistances(double[] fullQuery, BoundedPriorityQueue<IntDoublePair> queue, IntDoublePair workingPair)
protected void	IncrementalDoubleADCNearestNeighbours.computeDistances(double[] fullQuery, BoundedPriorityQueue<IntDoublePair> queue, IntDoublePair wp)
protected void	LongSDCNearestNeighbours.computeDistances(long[] fullQuery, BoundedPriorityQueue<IntDoublePair> queue, IntDoublePair workingPair)
protected void	LongADCNearestNeighbours.computeDistances(long[] fullQuery, BoundedPriorityQueue<IntDoublePair> queue, IntDoublePair wp)
protected void	IncrementalLongADCNearestNeighbours.computeDistances(long[] fullQuery, BoundedPriorityQueue<IntDoublePair> queue, IntDoublePair wp)

Uses of IntDoublePair in org.openimaj.ml.clustering

Methods in org.openimaj.ml.clustering that return types with arguments of type IntDoublePair

Modifier and Type	Method and Description
HardAssigner<double[],double[],IntDoublePair>	DoubleCentroidsResult.defaultHardAssigner()
HardAssigner<long[],double[],IntDoublePair>	LongCentroidsResult.defaultHardAssigner()

Uses of IntDoublePair in org.openimaj.ml.clustering.assignment.hard

Methods in org.openimaj.ml.clustering.assignment.hard that return IntDoublePair

Modifier and Type	Method and Description
IntDoublePair	KDTreeDoubleEuclideanAssigner.assignDistance(double[] data)
IntDoublePair	ExactDoubleAssigner.assignDistance(double[] data)
IntDoublePair	HierarchicalDoubleHardAssigner.assignDistance(double[] data)
IntDoublePair	HierarchicalLongHardAssigner.assignDistance(long[] data)
IntDoublePair	ExactLongAssigner.assignDistance(long[] data)
IntDoublePair	KDTreeLongEuclideanAssigner.assignDistance(long[] data)

Uses of IntDoublePair in org.openimaj.ml.clustering.assignment.soft

Fields in org.openimaj.ml.clustering.assignment.soft with type parameters of type IntDoublePair

Modifier and Type	Field and Description
protected Map<CentroidsProvider<long[]>,HardAssigner<long[],double[],IntDoublePair>>	HierarchicalLongPathAssigner.assigners
protected Map<CentroidsProvider<double[]>,HardAssigner<double[],double[],IntDoublePair>>	HierarchicalDoublePathAssigner.assigners

Uses of IntDoublePair in org.openimaj.ml.clustering.dbscan

Constructor parameters in org.openimaj.ml.clustering.dbscan with type arguments of type IntDoublePair

Constructor and Description
State(int length, RegionMode<IntDoublePair> regionMode)
State(int length, RegionMode<IntDoublePair> regionMode, boolean noiseAsClusters)

Uses of IntDoublePair in org.openimaj.ml.clustering.incremental

Methods in org.openimaj.ml.clustering.incremental that return types with arguments of type IntDoublePair

Modifier and Type	Method and Description
protected Map<Integer,IntDoublePair>	IncrementalSparseClusterer.calculateStability(IndexClusters c1, IndexClusters c2, gnu.trove.set.TIntSet inactiveRows)

Uses of IntDoublePair in org.openimaj.ml.clustering.kmeans

Methods in org.openimaj.ml.clustering.kmeans that return types with arguments of type IntDoublePair

Modifier and Type	Method and Description
HardAssigner<double[],double[],IntDoublePair>	SphericalKMeansResult.defaultHardAssigner()
HardAssigner<long[],double[],IntDoublePair>	LongKMeans.Result.defaultHardAssigner()
HardAssigner<double[],double[],IntDoublePair>	DoubleKMeans.Result.defaultHardAssigner()

Uses of IntDoublePair in org.openimaj.util.pair

Fields in org.openimaj.util.pair with type parameters of type IntDoublePair

Modifier and Type	Field and Description
static Comparator<IntDoublePair>	IntDoublePair.FIRST_ITEM_ASCENDING_COMPARATOR Comparator for comparing the first element of a IntDoublePair in ascending order.
static Comparator<IntDoublePair>	IntDoublePair.FIRST_ITEM_DESCENDING_COMPARATOR Comparator for comparing the first element of a IntDoublePair in descending order.
static Comparator<IntDoublePair>	IntDoublePair.SECOND_ITEM_ASCENDING_COMPARATOR Comparator for comparing the second element of a IntDoublePair in ascending order.
static Comparator<IntDoublePair>	IntDoublePair.SECOND_ITEM_DESCENDING_COMPARATOR Comparator for comparing the second element of a IntDoublePair in descending order.

Methods in org.openimaj.util.pair that return IntDoublePair

Modifier and Type	Method and Description
static IntDoublePair	IntDoublePair.pair(int a, double b) Create a pair from the given values.

Method parameters in org.openimaj.util.pair with type arguments of type IntDoublePair

Modifier and Type	Method and Description
static gnu.trove.list.array.TIntArrayList	IntDoublePair.getFirst(Iterable<IntDoublePair> data) Extract the first values from a list of pairs.
static gnu.trove.list.array.TDoubleArrayList	IntDoublePair.getSecond(Iterable<IntDoublePair> data) Extract the second values from a list of pairs.

Uses of IntDoublePair in org.openimaj.util.tree

Methods in org.openimaj.util.tree that return IntDoublePair

Modifier and Type	Method and Description
IntDoublePair	DoubleKDTree.SplitChooser.chooseSplit(double[][] pnts, IntArrayView inds, int depth, double[] minBounds, double[] maxBounds) Choose the dimension and discriminant on which to split the data.
IntDoublePair	DoubleKDTree.BasicMedianSplit.chooseSplit(double[][] pnts, IntArrayView inds, int depth, double[] minBounds, double[] maxBounds)
IntDoublePair	DoubleKDTree.BBFMedianSplit.chooseSplit(double[][] pnts, IntArrayView inds, int depth, double[] minBounds, double[] maxBounds)
IntDoublePair	DoubleKDTree.ApproximateBBFMedianSplit.chooseSplit(double[][] pnts, IntArrayView inds, int depth, double[] minBounds, double[] maxBounds)
IntDoublePair	DoubleKDTree.RandomisedBBFMeanSplit.chooseSplit(double[][] pnts, IntArrayView inds, int depth, double[] minBounds, double[] maxBounds)
IntDoublePair	DoubleKDTree.nearestNeighbour(double[] qu) Nearest-neighbour search
IntDoublePair	LongKDTree.nearestNeighbour(long[] qu) Nearest-neighbour search

Methods in org.openimaj.util.tree that return types with arguments of type IntDoublePair

Modifier and Type	Method and Description
List<IntDoublePair>	DoubleKDTree.nearestNeighbours(double[] qu, int n) Nearest-neighbour search
List<IntDoublePair>	LongKDTree.nearestNeighbours(long[] qu, int n) Nearest-neighbour search