tweak sort for validating chunk n^2 cost

[pollend]

this sort for chunk relevance adds an n^2 cost to the search. since it will try to sort the current chunks against all possible nearby chunks. this function only add the chunk from the region if its valid or creates a new chunk if its not available. This same problem is also apparent with ChunkTaskRelevanceComparator. Some better strategies would need to be setup if there are a lot of relevant entities.

 Chunk chunk = chunkProvider.getChunk(pos);
                            if (chunk != null) {
                                region.checkIfChunkIsRelevant(chunk);
                            } else {
                                chunkProvider.createOrLoadChunk(pos);
                            }

[pollend]

I exit the for loop early if the distance is at 0. Probably want to think about some better strategies to managing these queries.

[DarkWeird]

Yeah, it needs to rethink for algorithm.
It is enough now, when a bit regions used