Browse Source

style: 🎨 Format

tags/0.1.0
shangfengh 2 years ago
parent
commit
da0c726cdc
2 changed files with 7 additions and 7 deletions
  1. +2
    -2
      logic/GameEngine/CollisionChecker.cs
  2. +5
    -5
      logic/Preparation/Utility/XY.cs

+ 2
- 2
logic/GameEngine/CollisionChecker.cs View File

@@ -156,13 +156,13 @@ namespace GameEngine
{
double tmp = mod - obj.Radius - listObj.Radius;
// 计算能走的最长距离,好像这么算有一点误差?
tmp = ((int)(tmp*1000 / Math.Cos(Math.Atan2(orgDeltaY, orgDeltaX) - moveVec.Angle())));
tmp = ((int)(tmp * 1000 / Math.Cos(Math.Atan2(orgDeltaY, orgDeltaX) - moveVec.Angle())));
if (tmp < 0 || tmp > uint.MaxValue || double.IsNaN(tmp))
{
tmpMax = uint.MaxValue;
}
else
tmpMax = tmp/1000.0;
tmpMax = tmp / 1000.0;
}
break;
}


+ 5
- 5
logic/Preparation/Utility/XY.cs View File

@@ -64,11 +64,11 @@ namespace Preparation.Utility
}
public static double Distance(XY p1, XY p2)
{
long c = (((long)(p1.x - p2.x) * (p1.x - p2.x)) + ((long)(p1.y - p2.y) * (p1.y - p2.y)))*1000000;
long t = c/2+1;
while (t*t>c||(t+1)*(t+1)<c)
t=(c/t+t)/2;
return (double)t/1000.0;
long c = (((long)(p1.x - p2.x) * (p1.x - p2.x)) + ((long)(p1.y - p2.y) * (p1.y - p2.y))) * 1000000;
long t = c / 2 + 1;
while (t * t > c || (t + 1) * (t + 1) < c)
t = (c / t + t) / 2;
return (double)t / 1000.0;
}
public double Length()
{


Loading…
Cancel
Save