Dynamic pathfinding

This commit is contained in:
Anuken
2020-05-28 11:27:42 -04:00
parent 638343d25e
commit ed795076f0
13 changed files with 216 additions and 84 deletions

View File

@ -9,8 +9,8 @@ import java.util.*;
/** Creates quadtrees per unit team. */
public class TeamIndexProcess implements AsyncProcess{
private QuadTree<Unitc>[] trees = new QuadTree[Team.all().length];
private int[] counts = new int[Team.all().length];
private QuadTree<Unitc>[] trees = new QuadTree[Team.all.length];
private int[] counts = new int[Team.all.length];
public QuadTree<Unitc> tree(Team team){
if(trees[team.uid] == null) trees[team.uid] = new QuadTree<>(Vars.world.getQuadBounds(new Rect()));
@ -28,14 +28,14 @@ public class TeamIndexProcess implements AsyncProcess{
@Override
public void reset(){
counts = new int[Team.all().length];
trees = new QuadTree[Team.all().length];
counts = new int[Team.all.length];
trees = new QuadTree[Team.all.length];
}
@Override
public void begin(){
for(Team team : Team.all()){
for(Team team : Team.all){
if(trees[team.uid] != null){
trees[team.uid].clear();
}