Uses of Class
org.ddogleg.struct.DogArray_I32
Package
Description
-
Uses of DogArray_I32 in org.ddogleg.clustering
Modifier and TypeMethodDescriptionvoid
ComputeMeanClusters.process
(LArrayAccessor<P> points, DogArray_I32 assignments, FastAccess<P> clusters) Updates cluster means -
Uses of DogArray_I32 in org.ddogleg.clustering.kmeans
-
Uses of DogArray_I32 in org.ddogleg.clustering.misc
Modifier and TypeMethodDescriptionvoid
MeanArrayF64.process
(LArrayAccessor<double[]> points, DogArray_I32 assignments, FastAccess<double[]> clusters) -
Uses of DogArray_I32 in org.ddogleg.fitting.modelset.lmeds
Modifier and TypeFieldDescriptionprotected final DogArray_I32
LeastMedianOfSquares.TrialHelper.selectedIdx
-
Uses of DogArray_I32 in org.ddogleg.fitting.modelset.ransac
Modifier and TypeMethodDescriptionstatic <T> void
Ransac.addSelect
(DogArray_I32 indexes, int numSample, List<T> dataSet, List<T> initialSample) Adds the selected elements to the initialSample list and undoes the shuffling.static void
Ransac.randomDraw
(DogArray_I32 indexes, int size, int numSample, Random rand) Randomly selects a set of points in indexes. -
Uses of DogArray_I32 in org.ddogleg.nn.alg
Modifier and TypeMethodDescriptionprotected KdTree.Node
KdTreeConstructor.computeBranch
(List<P> points, @Nullable DogArray_I32 indexes) Given the data inside this particular node, select a point for the node and compute the node's childrenprotected KdTree.Node
KdTreeConstructor.computeChild
(List<P> points, @Nullable DogArray_I32 indexes) Creates a child by checking to see if it is a leaf or branch.void
ExhaustiveNeighbor.findClosestN
(P p, double maxDistance, int numNeighbors, DogArray_I32 outputIndex, DogArray_F64 outputDistance) Finds the index of the point which has the smallest Euclidean distance to 'p' and is<
maxDistance away.void
AxisSplitter.splitData
(List<P> points, @Nullable DogArray_I32 indexes, List<P> left, @Nullable DogArray_I32 leftIndexes, List<P> right, @Nullable DogArray_I32 righrIndexes) Given the a set of points, select the axis to split the data along and select a point to divide the data.void
AxisSplitterMedian.splitData
(List<P> points, @Nullable DogArray_I32 indexes, List<P> left, @Nullable DogArray_I32 leftIndexes, List<P> right, @Nullable DogArray_I32 rightIndexes) -
Uses of DogArray_I32 in org.ddogleg.struct
Modifier and TypeMethodDescriptionstatic DogArray_I32
DogArray_I32.array
(int... values) DogArray_I32.copy()
static DogArray_I32
static DogArray_I32
DogArray_I32.range
(int idx0, int idx1) Returns a new array with values containing range of integer numbers from idx0 to idx1-1.DogArray_I32.reset()
DogArray_I32.resize
(int size) DogArray_I32.resize
(int size, int value) Resizes the array and assigns the default value to every new element.DogArray_I32.setTo
(int... src) Set's the value of this array to the passed in raw array.DogArray_I32.setTo
(DogArray_I32 original) static DogArray_I32
DogArray_I32.zeros
(int length) Creates a queue with the specified length as its size filled with all zerosModifier and TypeMethodDescriptionvoid
DogArray_I32.addAll
(DogArray_I32 queue) boolean
FastAccess.findAllIdx
(DogArray_I32 matches, FastAccess.FunctionMatches<T> function) Finds the indexes of all elements which match.boolean
DogArray_I32.isEquals
(DogArray_I32 values) DogArray_I32.setTo
(DogArray_I32 original) -
Uses of DogArray_I32 in org.ddogleg.util
Modifier and TypeMethodDescriptionstatic void
PrimitiveArrays.intersection
(int[] setA, int sizeA, int[] setB, int sizeB, int valueMin, int valueMax, DogArray_I32 results, @Nullable DogArray_I8 work) Finds the intersection of two sets.static void
PrimitiveArrays.intersection
(int[] setA, int sizeA, int[] setB, int sizeB, DogArray_I32 results, @Nullable DogArray_I8 work) Finds the itersection of two sets.static void
PrimitiveArrays.union
(int[] setA, int sizeA, int[] setB, int sizeB, int valueMin, int valueMax, DogArray_I32 results, @Nullable DogArray_I8 work) Finds the intersection of two sets.