Solved Nearest Block

I'm trying to get the nearest Chest within a certain radius, however the current method I'm using will not always get the nearest chest.

Code:java

ArrayList<Chest> nearChests = new ArrayList<Chest>();
for(int a = -30; a <= 30; a++)
{
    for(int b = 0; b <= owner.getWorld().getMaxHeight(); b++)
    {
        for(int c = -30; c <= 30; c++)
        {
            Location loc = new Location(owner.getWorld(), a, b, c);
            if((loc.getBlock().getType() == Material.CHEST || loc.getBlock().getType() == Material.TRAPPED_CHEST))
            nearChests.add((Chest) loc.getBlock().getState());
            else continue;
        }
    }
}

What I want to do next is loop through all the Chests in the Array nearChests and find the closest one to the player. What's the best way of doing this? I have some ideas but they are not efficient ...

Thank you!

 

Use chest.getLocation().distance(player.getLocation()) and save the one with the shortest distance in a variable.

 

Didn't know that was a method! Thanks

 

I fixed my post, it should be chest.getLocation() rather than chest.

 

No worries ... I figured that out on my own

 

you should do .distanceSquared() instead, uses less memory