I'm trying to implement a method of searching trough a large amount of 2D points for those that match a certain range. I'm thinking of creating HashMaps for <X, Point>
and <Y, Point>
but I'm wondering is HashMap good for doing this, because I will be taking points in a range, based on values from x_min to x_max and y_min to y_max.
So I will basically take all points from <X,Point>
searching from x_min to x_max and compare them to points taken from <Y,Point>
from y_min to y_max...
HashMap<Integer,Point> x_coordinates = new HashMap<Integer,Point>();
for(int i=x_min;i<=x_max;i++){
x_coordinates.get(i);
}
HashMap<Integer,Point> y_coordinates = new HashMap<Integer,Point>();
for(int i=y_min;i<=y_max;i++){
y_coordinates.get(i);
}
Is there a faster way to get a range of values from a HashMap, or some other type of data structure?
Aucun commentaire:
Enregistrer un commentaire