Changed CellPathFinding drop debug item id from 65 to 1061.
Thanks to kamikadzz.
This commit is contained in:
parent
ee0b23d18f
commit
e7003ad2b3
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -226,7 +226,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -226,7 +226,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -226,7 +226,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -226,7 +226,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -226,7 +226,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
@ -227,7 +227,7 @@ public class CellPathFinding extends PathFinding
|
||||
|
||||
if (debug)
|
||||
{
|
||||
path.forEach(n -> dropDebugItem(65, 1, n));
|
||||
path.forEach(n -> dropDebugItem(1061, 1, n));
|
||||
}
|
||||
|
||||
_findSuccess++;
|
||||
|
Loading…
Reference in New Issue
Block a user