blob: 9b7dafd4fdd77d5c52cc9f6befd6cacf3327d79b (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
#include "common.h"
#include "patcher.h"
#include "main.h"
#include "PedRoutes.h"
CRouteNode (&gaRoutes)[NUMPEDROUTES] = *(CRouteNode(*)[NUMPEDROUTES]) * (uintptr*)0x62E090;
int16
CRouteNode::GetRouteThisPointIsOn(int16 point)
{
return gaRoutes[point].m_route;
}
// Actually GetFirstPointOfRoute
int16
CRouteNode::GetRouteStart(int16 route)
{
for (int i = 0; i < NUMPEDROUTES; i++) {
if (route == gaRoutes[i].m_route)
return i;
}
return -1;
}
CVector
CRouteNode::GetPointPosition(int16 point)
{
return gaRoutes[point].m_pos;
}
void
CRouteNode::AddRoutePoint(int16 route, CVector pos)
{
uint16 point;
for (point = 0; point < NUMPEDROUTES; point++) {
if (gaRoutes[point].m_route == -1)
break;
}
#ifdef FIX_BUGS
if (point == NUMPEDROUTES)
return;
#endif
gaRoutes[point].m_route = route;
gaRoutes[point].m_pos = pos;
}
void
CRouteNode::RemoveRoute(int16 route)
{
uint16 first_point, last_point, i;
for (first_point = 0; first_point < NUMPEDROUTES; first_point++) {
if (gaRoutes[first_point].m_route == route)
break;
}
if (first_point == NUMPEDROUTES)
return;
for (last_point = first_point; last_point < NUMPEDROUTES; last_point++)
if (gaRoutes[last_point].m_route != route)
break;
uint16 diff = last_point - first_point;
#ifdef FIX_BUGS
for (i = first_point; i < NUMPEDROUTES - diff; i++)
gaRoutes[i] = gaRoutes[i + diff];
#else
for (i = 0; i < diff; i++)
gaRoutes[first_point + i] = gaRoutes[last_point + i];
#endif
for (i = NUMPEDROUTES - diff; i < NUMPEDROUTES; i++)
gaRoutes[i].m_route = -1;
}
|
