forked from mirror/DotRecast
Compare commits
1 Commits
master
...
pr/accepta
Author | SHA1 | Date |
---|---|---|
wreng | 13097f9661 |
|
@ -358,8 +358,8 @@ namespace DotRecast.Detour
|
|||
var tbmax = tile.data.header.bmax;
|
||||
float qfac = tile.data.header.bvQuantFactor;
|
||||
// Calculate quantized box
|
||||
int[] bmin = new int[3];
|
||||
int[] bmax = new int[3];
|
||||
Span<int> bmin = stackalloc int[3];
|
||||
Span<int> bmax = stackalloc int[3];
|
||||
// dtClamp query box to world box.
|
||||
float minx = Math.Clamp(qmin.X, tbmin.X, tbmax.X) - tbmin.X;
|
||||
float miny = Math.Clamp(qmin.Y, tbmin.Y, tbmax.Y) - tbmin.Y;
|
||||
|
|
|
@ -583,8 +583,8 @@ namespace DotRecast.Detour
|
|||
var tbmax = tile.data.header.bmax;
|
||||
float qfac = tile.data.header.bvQuantFactor;
|
||||
// Calculate quantized box
|
||||
int[] bmin = new int[3];
|
||||
int[] bmax = new int[3];
|
||||
Span<int> bmin = stackalloc int[3];
|
||||
Span<int> bmax = stackalloc int[3];
|
||||
// dtClamp query box to world box.
|
||||
float minx = Math.Clamp(qmin.X, tbmin.X, tbmax.X) - tbmin.X;
|
||||
float miny = Math.Clamp(qmin.Y, tbmin.Y, tbmax.Y) - tbmin.Y;
|
||||
|
@ -1824,6 +1824,9 @@ namespace DotRecast.Detour
|
|||
|
||||
float[] verts = new float[m_nav.GetMaxVertsPerPoly() * 3];
|
||||
|
||||
const int MAX_NEIS = 8;
|
||||
Span<long> neis = stackalloc long[MAX_NEIS];
|
||||
|
||||
while (0 < stack.Count)
|
||||
{
|
||||
// Pop front.
|
||||
|
@ -1854,9 +1857,7 @@ namespace DotRecast.Detour
|
|||
for (int i = 0, j = curPoly.vertCount - 1; i < curPoly.vertCount; j = i++)
|
||||
{
|
||||
// Find links to neighbours.
|
||||
int MAX_NEIS = 8;
|
||||
int nneis = 0;
|
||||
long[] neis = new long[MAX_NEIS];
|
||||
|
||||
if ((curPoly.neis[j] & DtNavMesh.DT_EXT_LINK) != 0)
|
||||
{
|
||||
|
|
|
@ -64,7 +64,7 @@ namespace DotRecast.Detour
|
|||
/// @param[in] bmax Maximum bounds of box B. [(x, y, z)]
|
||||
/// @return True if the two AABB's overlap.
|
||||
/// @see dtOverlapBounds
|
||||
public static bool OverlapQuantBounds(int[] amin, int[] amax, int[] bmin, int[] bmax)
|
||||
public static bool OverlapQuantBounds(Span<int> amin, Span<int> amax, Span<int> bmin, Span<int> bmax)
|
||||
{
|
||||
bool overlap = true;
|
||||
overlap = (amin[0] > bmax[0] || amax[0] < bmin[0]) ? false : overlap;
|
||||
|
|
Loading…
Reference in New Issue