bit
/
DotRecastNetSim
forked from mirror/DotRecast
40
0
Fork 1
Code Pull Requests Releases Activity

remove Vector2f.SetElement

This commit is contained in:
ikpil 2023-04-05 17:33:36 +09:00
parent d84f78352d
commit c1c535641c
3 changed files with 12 additions and 32 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
src/DotRecast.Core/Vector2f.cs
View File

@ -6,25 +6,5 @@ namespace DotRecast.Core
{ {
public float x; public float x;
public float y; public float y;
public float this[int index]
{
set => SetElement(index, value);
}
public void SetElement(int index, float value)
{
switch (index)
{
case 0:
x = value;
break;
case 1:
y = value;
break;
default: throw new IndexOutOfRangeException($"{index}-{value}");
}
}
} }
} }

12
src/DotRecast.Recast.Demo/Geom/ChunkyTriMesh.cs
View File

@ -140,29 +140,29 @@ public class ChunkyTriMesh
BoundsItem it = items[i] = new BoundsItem(); BoundsItem it = items[i] = new BoundsItem();
it.i = i; it.i = i;
// Calc triangle XZ bounds. // Calc triangle XZ bounds.
it.bmin[0] = it.bmax[0] = verts[tris[t] * 3 + 0]; it.bmin.x = it.bmax.x = verts[tris[t] * 3 + 0];
it.bmin[1] = it.bmax[1] = verts[tris[t] * 3 + 2]; it.bmin.y = it.bmax.y = verts[tris[t] * 3 + 2];
for (int j = 1; j < 3; ++j) for (int j = 1; j < 3; ++j)
{ {
int v = tris[t + j] * 3; int v = tris[t + j] * 3;
if (verts[v] < it.bmin.x) if (verts[v] < it.bmin.x)
{ {
it.bmin[0] = verts[v]; it.bmin.x = verts[v];
} }
if (verts[v + 2] < it.bmin.y) if (verts[v + 2] < it.bmin.y)
{ {
it.bmin[1] = verts[v + 2]; it.bmin.y = verts[v + 2];
} }
if (verts[v] > it.bmax.x) if (verts[v] > it.bmax.x)
{ {
it.bmax[0] = verts[v]; it.bmax.x = verts[v];
} }
if (verts[v + 2] > it.bmax.y) if (verts[v + 2] > it.bmax.y)
{ {
it.bmax[1] = verts[v + 2]; it.bmax.y = verts[v + 2];
} }
} }
} }

12
src/DotRecast.Recast/Geom/ChunkyTriMesh.cs
View File

@ -163,29 +163,29 @@ namespace DotRecast.Recast.Geom
BoundsItem it = items[i] = new BoundsItem(); BoundsItem it = items[i] = new BoundsItem();
it.i = i; it.i = i;
// Calc triangle XZ bounds. // Calc triangle XZ bounds.
it.bmin[0] = it.bmax[0] = verts[tris[t] * 3 + 0]; it.bmin.x = it.bmax.x = verts[tris[t] * 3 + 0];
it.bmin[1] = it.bmax[1] = verts[tris[t] * 3 + 2]; it.bmin.y = it.bmax.y = verts[tris[t] * 3 + 2];
for (int j = 1; j < 3; ++j) for (int j = 1; j < 3; ++j)
{ {
int v = tris[t + j] * 3; int v = tris[t + j] * 3;
if (verts[v] < it.bmin.x) if (verts[v] < it.bmin.x)
{ {
it.bmin[0] = verts[v]; it.bmin.x = verts[v];
} }
if (verts[v + 2] < it.bmin.y) if (verts[v + 2] < it.bmin.y)
{ {
it.bmin[1] = verts[v + 2]; it.bmin.y = verts[v + 2];
} }
if (verts[v] > it.bmax.x) if (verts[v] > it.bmax.x)
{ {
it.bmax[0] = verts[v]; it.bmax.x = verts[v];
} }
if (verts[v + 2] > it.bmax.y) if (verts[v + 2] > it.bmax.y)
{ {
it.bmax[1] = verts[v + 2]; it.bmax.y = verts[v + 2];
} }
} }
} }