pweot17951
小水手
UID 29739
精华
0
积分 2
帖子 2
阅读权限 10
注册 2007-3-6
来自 广东
状态 离线
|
能不能换种更高效写法!
算法优化，如何让代码更高效？？？
这是代码的一部分，如何改用别的判断语句，使代码运行的快点！我觉得在代码里通过判断跳转来执行下一条语句是底效的（switch (route_mode)，switch (route_order)）．请高手帮忙，该一种写发让代码更高效
void AutoRoute::FindNearPoint()
{
float pointdist = 99999.0;
iLine = -1;
iPoint = -1;
for(int i = 0; i < cvar.linecount ; i++)
{
if (route_line[i].enabled)
{
for(int j = 0; j < route_line[i].count; j++)
{
float dist = GetPointDistance(route_line[i].point[j].origin);
if (dist < pointdist && abs(route_line[i].point[j].origin[2] - me.pmEyePos[2]) < 25)
{
pointdist = dist;
iLine = i;
iPoint = j;
}
}
}
}
if (pointdist < cvar.finddist && iPoint > -1 && iLine > -1)
{
if (GetPointVisible(route_line[iLine].point[iPoint].origin))
{
if (iPoint > 0 && iPoint < route_line[iLine].count - 1)
{
if (GetPointVisible(route_line[iLine].point[iPoint + 1].origin) && GetAngleVisible(route_line[iLine].point[iPoint + 1].origin))
{
route_order = RO_ASC;
}
else if (GetPointVisible(route_line[iLine].point[iPoint - 1].origin) && GetAngleVisible(route_line[iLine].point[iPoint - 1].origin))
{
route_order = RO_DESC;
}
}
else
{
if (iPoint == 0 && GetPointVisible(route_line[iLine].point[iPoint + 1].origin) && GetAngleVisible(route_line[iLine].point[iPoint + 1].origin))
{
route_order = RO_ASC;
}
else if (iPoint == route_line[iLine].count - 1 && GetPointVisible(route_line[iLine].point[iPoint - 1].origin) && GetAngleVisible(route_line[iLine].point[iPoint - 1].origin))
{
route_order = RO_DESC;
}
}
}
else
{
iLine = -1;
iPoint = -1;
}
}
else
{
iLine = -1;
iPoint = -1;
}
}
void AutoRoute::CreateMove(usercmd_s *usercmd)
{
if (Record)
{
if (iLine > -1)
{
if (iPoint == cvar.pointcount){Record = false;return;};
if (iPoint == -1)
{
AddPoint();
}
else
{
float dist = GetPointDistance(route_line[iLine].point[iPoint].origin);
if (dist >= cvar.routedist)
{
AddPoint();
}
}
}
return;
}
if (cvar.autoroute && me.alive)
{
if (gAimbot.target!=-1 && cvar.routepursue)
{
cvar.autoroute = 0;
iLine = -1;
iPoint = -1;
route_mode = RM_NONE;
return;
}
switch (route_mode)
{
case RM_NONE:
{
FindNearPoint();
if (iPoint > -1 && iLine > -1)
{
GotoRoutePoint(route_line[iLine].point[iPoint].origin, usercmd);
route_mode = RM_FROM;
}
break;
}
case RM_FROM:
{
int i = iPoint;
if (((route_order == RO_ASC) && (i >= route_line[iLine].count - 1)) ||
((route_order == RO_DESC) && (i <= 0)))
{
iPoint = -1;
route_mode = RM_END;
return;
}
CheckRoutePoint(route_line[iLine].point[iPoint].origin, usercmd);
if( usercmd->forwardmove>-120 && usercmd->forwardmove<120 && usercmd->sidemove>-120 && usercmd->sidemove<120)
{
switch (route_order)
{
case RO_ASC:
{
i++;
}
break;
case RO_DESC:
{
i--;
}
break;
}
iPoint = i;
GotoRoutePoint(route_line[iLine].point[iPoint].origin, usercmd);
}
return;
}
break;
case RM_END:
{
iLine = -1;
iPoint = -1;
route_mode = RM_NONE;
}
break;
}
}
else
{
iLine = -1;
iPoint = -1;
route_mode = RM_NONE;
}
}
|
|
