a.samsonkin
/
DotRecastNetSim
forked from bit/DotRecastNetSim
1
0
Fork 0
Code Pull Requests Activity

rename for typo

This commit is contained in:
ikpil 2023-08-04 23:18:40 +09:00
parent 77153ddb25
commit 40fda6806e
3 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/DotRecast.Recast/CompareHoles.cs → src/DotRecast.Recast/RcContourHoleComparer.cs
View File

@ -2,7 +2,7 @@
namespace DotRecast.Recast
{
public class CompareHoles : IComparer<RcContourHole>
public class RcContourHoleComparer : IComparer<RcContourHole>
{
public int Compare(RcContourHole a, RcContourHole b)
{

2
src/DotRecast.Recast/CompareDiagDist.cs → src/DotRecast.Recast/RcPotentialDiagonalComparer.cs
View File

@ -2,7 +2,7 @@
namespace DotRecast.Recast
{
public class CompareDiagDist : IComparer<RcPotentialDiagonal>
public class RcPotentialDiagonalComparer : IComparer<RcPotentialDiagonal>
{
public int Compare(RcPotentialDiagonal va, RcPotentialDiagonal vb)
{

4
src/DotRecast.Recast/RecastContour.cs
View File

@ -619,7 +619,7 @@ namespace DotRecast.Recast
region.holes[i].leftmost = minleft[2];
}
Array.Sort(region.holes, new CompareHoles());
Array.Sort(region.holes, new RcContourHoleComparer());
int maxVerts = region.outline.nverts;
for (int i = 0; i < region.nholes; i++)
@ -665,7 +665,7 @@ namespace DotRecast.Recast
}
// Sort potential diagonals by distance, we want to make the connection as short as possible.
Array.Sort(diags, 0, ndiags, new CompareDiagDist());
Array.Sort(diags, 0, ndiags, new RcPotentialDiagonalComparer());
// Find a diagonal that is not intersecting the outline not the remaining holes.
index = -1;