package mindustry.ai;

//new indexer implementation, uses quadtrees
public class NewBlockIndexer{

    /*
    public ObjectSet<Tile> getOrePositions(Item item){

    }

    public Tile findClosestOre(float xp, float yp, Item item){

    }

    public ObjectSet<Tile> getDamaged(Team team){

    }

    public ObjectSet<Tile> getAllied(Team team, BlockFlag type){

    }

    public boolean eachBlock(Teamc team, float range, Boolf<Tilec> pred, Cons<Tilec> cons){
        return eachBlock(team.team(), team.getX(), team.getY(), range, pred, cons);
    }

    public boolean eachBlock(Team team, float wx, float wy, float range, Boolf<Tilec> pred, Cons<Tilec> cons){

    }

    public Array<Tile> getEnemy(Team team, BlockFlag type){

    }

    public void notifyTileDamaged(Tilec entity){

    }

    public Tilec findEnemyTile(Team team, float x, float y, float range, Boolf<Tilec> pred){

    }

    public Tilec findTile(Team team, float x, float y, float range, Boolf<Tilec> pred, boolean usePriority){

    }

    public Tilec findTile(Team team, float x, float y, float range, Boolf<Tilec> pred){
        return findTile(team, x, y, range, pred, false);
    }*/
}