Package net.algart.math.rectangles
Class IRectangleFinder
java.lang.Object
net.algart.math.rectangles.IRectangleFinder
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionprotected Stringvoidclear()compact()intfindContaining(double x, double y, int[] resultIndexes) abstract voidfindContaining(double x, double y, IntConsumer indexConsumer) intfindContaining(int x, int y, int[] resultIndexes) abstract voidfindContaining(int x, int y, IntConsumer indexConsumer) intfindIntersecting(int minX, int maxX, int minY, int maxY, int[] resultIndexes) abstract voidfindIntersecting(int minX, int maxX, int minY, int maxY, IntConsumer indexConsumer) static IRectangleFinderstatic IRectangleFindergetEmptyInstance(boolean horizontal) static IRectangleFinderstatic IRectangleFindergetInstance(int[] minX, int[] maxX, int[] minY, int[] maxY) static IRectangleFindergetInstance(IntUnaryOperator minX, IntUnaryOperator maxX, IntUnaryOperator minY, IntUnaryOperator maxY, int numberOfRectangles) final booleanindexActual(int k) maxX()final intmaxX(int k) maxY()final intmaxY(int k) minX()final intminX(int k) minY()final intminY(int k) final intfinal IRectangleFinderfinal IRectangleFindersetIndexActual(IntPredicate indexActual) final IRectangleFindersetIndexedRectangles(int[] minX, int[] maxX, int[] minY, int[] maxY, int[] indexes, int numberOfRectangles) protected abstract voidfinal IRectangleFindersetRectangles(int[] minX, int[] maxX, int[] minY, int[] maxY) final IRectangleFindersetRectangles(IntUnaryOperator minX, IntUnaryOperator maxX, IntUnaryOperator minY, IntUnaryOperator maxY, int numberOfRectangles) toString()
-
Constructor Details
-
IRectangleFinder
public IRectangleFinder()
-
-
Method Details
-
getEmptyInstance
-
getEmptyInstance
-
getEmptyUnoptimizedInstance
-
getInstance
public static IRectangleFinder getInstance(IntUnaryOperator minX, IntUnaryOperator maxX, IntUnaryOperator minY, IntUnaryOperator maxY, int numberOfRectangles) -
getInstance
-
minX
-
maxX
-
minY
-
maxY
-
minX
public final int minX(int k) -
maxX
public final int maxX(int k) -
minY
public final int minY(int k) -
maxY
public final int maxY(int k) -
numberOfRectangles
public final int numberOfRectangles() -
setRectangles
public final IRectangleFinder setRectangles(IntUnaryOperator minX, IntUnaryOperator maxX, IntUnaryOperator minY, IntUnaryOperator maxY, int numberOfRectangles) -
setRectangles
-
setIndexedRectangles
public final IRectangleFinder setIndexedRectangles(int[] minX, int[] maxX, int[] minY, int[] maxY, int[] indexes, int numberOfRectangles) -
setIndexActual
-
setAllIndexesActual
-
indexActual
public final boolean indexActual(int k) -
compact
-
findContaining
-
findContaining
public int findContaining(int x, int y, int[] resultIndexes) -
findContaining
-
findContaining
public int findContaining(double x, double y, int[] resultIndexes) -
findIntersecting
public abstract void findIntersecting(int minX, int maxX, int minY, int maxY, IntConsumer indexConsumer) -
findIntersecting
public int findIntersecting(int minX, int maxX, int minY, int maxY, int[] resultIndexes) -
clear
public void clear() -
toString
-
setRanges
protected abstract void setRanges() -
algorithmName
-