0xf8/baritone
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

optimized

Browse Source
This commit is contained in:
Leijurv 2018-08-05 12:03:36 -04:00
parent a858882f02
commit d74660f7e5
No known key found for this signature in database
GPG Key ID: 44A3EA646EADAC6A
1 changed files with 26 additions and 33 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

59
src/main/java/baritone/bot/pathing/calc/openset/BinaryHeapOpenSet.java
View File

@ -36,10 +36,9 @@ public class BinaryHeapOpenSet implements IOpenSet {
array = Arrays.copyOf(array, array.length * 2); array = Arrays.copyOf(array, array.length * 2);
} }
size++; size++;
int index = size; value.heapPosition = size;
value.heapPosition = index; array[size] = value;
array[index] = value; upHeap(size);
upHeap(index);
} }
public void update(PathNode node) { public void update(PathNode node) {
@ -67,21 +66,28 @@ public class BinaryHeapOpenSet implements IOpenSet {
} }
int index = 1; int index = 1;
int smallerChild = 2; int smallerChild = 2;
double cost = array[index].combinedCost; PathNode val = array[index];
double cost = val.combinedCost;
do { do {
int right = smallerChild + 1; int right = smallerChild + 1;
double smallerChildCost = array[smallerChild].combinedCost; PathNode smallerChildNode = array[smallerChild];
double smallerChildCost = smallerChildNode.combinedCost;
if (right <= size) { if (right <= size) {
double rightChildCost = array[right].combinedCost; PathNode rightChildNode = array[right];
double rightChildCost = rightChildNode.combinedCost;
if (smallerChildCost > rightChildCost) { if (smallerChildCost > rightChildCost) {
smallerChild = right; smallerChild = right;
smallerChildCost = rightChildCost; smallerChildCost = rightChildCost;
smallerChildNode = rightChildNode;
} }
} }
if (cost <= smallerChildCost) { if (cost <= smallerChildCost) {
break; break;
} }
swap(index, smallerChild); array[index] = smallerChildNode;
array[smallerChild] = val;
val.heapPosition = smallerChild;
smallerChildNode.heapPosition = index;
index = smallerChild; index = smallerChild;
smallerChild = index << 1; smallerChild = index << 1;
} while (smallerChild <= size); } while (smallerChild <= size);
@ -89,31 +95,18 @@ public class BinaryHeapOpenSet implements IOpenSet {
} }
private void upHeap(int index) { private void upHeap(int index) {
int parent = index >>> 1; int parentInd = index >>> 1;
double cost = array[index].combinedCost; PathNode val = array[index];
while (index > 1 && array[parent].combinedCost > cost) { double cost = val.combinedCost;
swap(index, parent); PathNode parentNode = array[parentInd];
index = parent; while (index > 1 && parentNode.combinedCost > cost) {
parent = index >>> 1; array[index] = parentNode;
array[parentInd] = val;
val.heapPosition = parentInd;
parentNode.heapPosition = index;
index = parentInd;
parentInd = index >>> 1;
parentNode = array[parentInd];
} }
} }
/**
* Swaps the elements at the specified indices.
*
* @param index1 The first index
* @param index2 The second index
*/
protected void swap(int index1, int index2) {
//sanity checks, disabled because of performance hit
//if (array[index1].heapPosition != index1) throw new IllegalStateException();
//if (array[index2].heapPosition != index2) throw new IllegalStateException();
PathNode tmp = array[index1];
array[index1] = array[index2];
array[index2] = tmp;
tmp.heapPosition = index2;
array[index1].heapPosition = index1;
}
} }