aboutsummaryrefslogtreecommitdiff
path: root/engines/toon/path.h
blob: e38ec1275e9716feb9ba90e730d73c56c0596e9a (plain)
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$
*
*/

#ifndef TOON_PATH_H
#define TOON_PATH_H

#include "toon/toon.h"

namespace Toon {

// binary heap system for fast A*
struct HeapDataGrid {
	int16 _x, _y;
	int16 _weight;
};

class PathFindingHeap {
public:
	PathFindingHeap();
	~PathFindingHeap();

	int32 _alloc;
	int32 _count;

	int32 push(int32 x, int32 y, int32 weight);
	int32 pop(int32 *x, int32 *y, int32 *weight);
	int32 init(int32 size);
	int32 clear();
	int32 unload();

private:
	HeapDataGrid *_data;
};

class PathFinding {
public:
	PathFinding(ToonEngine *vm);
	~PathFinding();

	int32 findPath(int32 x, int32 y, int32 destX, int32 destY);
	int32 findClosestWalkingPoint(int32 xx, int32 yy, int32 *fxx, int32 *fyy, int origX = -1, int origY = -1);
	bool isWalkable(int32 x, int32 y);
	bool isLikelyWalkable(int32 x, int32 y);
	bool lineIsWalkable(int32 x, int32 y, int32 x2, int32 y2);
	void init(Picture *mask);

	void resetBlockingRects();
	void addBlockingRect(int32 x1, int32 y1, int32 x2, int32 y2);
	void addBlockingEllipse(int32 x1, int32 y1, int32 w, int32 h);

	int32 getPathNodeCount() const;
	int32 getPathNodeX(int32 nodeId) const;
	int32 getPathNodeY(int32 nodeId) const;
protected:
	Picture *_currentMask;

	PathFindingHeap *_heap;

	int32 *_gridTemp;
	int32 _width;
	int32 _height;

	int32 _tempPathX[4096];
	int32 _tempPathY[4096];
	int32 _blockingRects[16][5];
	int32 _numBlockingRects;
	int32 _allocatedGridPathCount;
	int32 _gridPathCount;

	ToonEngine *_vm;

};

} // End of namespace Toon

#endif