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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* $URL$
* $Id$
*
*/
/*
* This code is based on original Hugo Trilogy source code
*
* Copyright (c) 1989-1995 David P. Gray
*
*/
#ifndef HUGO_ROUTE_H
#define HUGO_ROUTE_H
namespace Hugo {
/**
* Purpose of an automatic route
*/
enum go_t {kRouteSpace, kRouteExit, kRouteLook, kRouteGet};
struct Point {
int x;
int y;
};
struct segment_t { // Search segment
int16 y; // y position
int16 x1, x2; // Range of segment
};
class Route {
public:
Route(HugoEngine *vm);
void resetRoute() {_routeIndex = -1; }
int16 getRouteIndex() const {return _routeIndex; }
void processRoute();
bool startRoute(const go_t go_for, const int16 id, int16 cx, int16 cy);
void setDirection(const uint16 keyCode);
void setWalk(const uint16 direction);
private:
HugoEngine *_vm;
static const int kMapBound = 1; // Mark a boundary outline
static const int kMapFill = 2; // Mark a boundary filled
static const int kMaxSeg = 256; // Maximum number of segments
static const int kMaxNodes = 256; // Maximum nodes in route
uint16 _oldWalkDirection; // Last direction char
int16 _routeIndex; // Index into route list, or -1
go_t _go_for; // Purpose of an automatic route
int16 _go_id; // Index of exit of object walking to
byte _boundaryMap[kYPix][kXPix]; // Boundary byte map
segment_t _segment[kMaxSeg]; // List of points in fill-path
Point _route[kMaxNodes]; // List of nodes in route (global)
int16 _segmentNumb; // Count number of segments
int16 _routeListIndex; // Index into route list
int16 _destX;
int16 _destY;
int16 _heroWidth; // Hero width
bool _routeFoundFl; // TRUE when path found
bool _fullStackFl; // TRUE if stack exhausted
bool _fullSegmentFl; // Segments exhausted
void segment(int16 x, int16 y);
bool findRoute(const int16 cx, const int16 cy);
Point *newNode();
};
} // End of namespace Hugo
#endif //HUGO_ROUTE_H
|
