diff options
| author | Jérémy Zurcher <jeremy@asynk.ch> | 2016-01-11 10:37:38 +0100 |
|---|---|---|
| committer | Jérémy Zurcher <jeremy@asynk.ch> | 2016-01-11 11:45:57 +0100 |
| commit | 432fb6f91d186dd7dad12982d24aa66a4ae80ec0 (patch) | |
| tree | 015163fd9b71898d0f659f4ed7f385f7c25841e5 /core/src/ch/asynk/rustanddust/engine/SearchBoard.java | |
| parent | 21af522854d1b10289e6c338be0663132afe5ba6 (diff) | |
| download | RustAndDust-432fb6f91d186dd7dad12982d24aa66a4ae80ec0.zip RustAndDust-432fb6f91d186dd7dad12982d24aa66a4ae80ec0.tar.gz | |
ArrayListIt -> IterableArray
Diffstat (limited to 'core/src/ch/asynk/rustanddust/engine/SearchBoard.java')
| -rw-r--r-- | core/src/ch/asynk/rustanddust/engine/SearchBoard.java | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/core/src/ch/asynk/rustanddust/engine/SearchBoard.java b/core/src/ch/asynk/rustanddust/engine/SearchBoard.java index 9fd06ad..7fd2ef6 100644 --- a/core/src/ch/asynk/rustanddust/engine/SearchBoard.java +++ b/core/src/ch/asynk/rustanddust/engine/SearchBoard.java @@ -3,7 +3,7 @@ package ch.asynk.rustanddust.engine; import java.util.List; import java.util.Collection; -import ch.asynk.rustanddust.engine.util.ArrayListIt; +import ch.asynk.rustanddust.engine.util.IterableArray; public class SearchBoard { @@ -35,10 +35,10 @@ public class SearchBoard private int searchCount; private Node nodes[]; - private ArrayListIt<Node> stack; - private ArrayListIt<Node> queue; - private ArrayListIt<Node> roadMarch; - private ArrayListIt<Node> los; + private IterableArray<Node> stack; + private IterableArray<Node> queue; + private IterableArray<Node> roadMarch; + private IterableArray<Node> los; private boolean losBlocked; public SearchBoard(Board board, int cols, int rows) @@ -55,10 +55,10 @@ public class SearchBoard nodes[i + (j * cols)] = new Node((i + dx), j); } - this.queue = new ArrayListIt<Node>(30); - this.stack = new ArrayListIt<Node>(20); - this.roadMarch = new ArrayListIt<Node>(5); - this.los = new ArrayListIt<Node>(10); + this.queue = new IterableArray<Node>(30); + this.stack = new IterableArray<Node>(20); + this.roadMarch = new IterableArray<Node>(5); + this.los = new IterableArray<Node>(10); } private boolean inMap(int col, int row) |