Best way to sort through giant lists?

[cubemaster21]

I have a list of about 1000 entities that i need to go through on a regular basis and see which ones are in a certain range. However, looking through the list every time I need to get the new list seems a bit inefficient. Is there a better way to do this? This is somewhat of what I'm using now.

1   2   3   4   5   6   7   8   9

public ArrayList<Entity> getEntitiesInRage(int range, Entity center){      ArrayList<Entity> inRange = new ArrayList<Entity>();      for(Entity e: fullList){           if(e.getDistanceTo(center) >= range)                inRange.add(e);      }      return inRange(); }

[HeroesGraveDev]

getEntitiesInRage

lol.

Anyway:

The only way to optimise such a method is to put the entities into a large-scale grid*. Then you can work out the maximum amount of grid squares you could go and still be in that range. Then you check all the entities within those grid squares, and do the final check on only those entities.

You would have to store which entities are in which grid. And make sure that when one moves, it is removed from the previous square and added to the next.

*Grid or Tree

[cubemaster21]

Lol, that was just some psuedocode. I didn't even catch the 'Rage'. Anyway, I don't think that there is any real way that I could get them into a grid system.

Games published by our own members! Check 'em out!

[HeroesGraveDev]

You could if you really wanted to.

[cubemaster21]

Instead, I've just decided to reduce to list size to 250 and whenever the size gets any smaller, it just adds some to fill in the gaps.

[pjt33]

Lol, that was just some psuedocode.

That's good, because the logic's back to front as well.

Do you really need to find all entities within range, or would you be better using something like k-nearest, which is a well-discussed computational geometry problem?