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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
|
/*
* The Mana World
* Copyright 2004 The Mana World Development Team
*
* This file is part of The Mana World.
*
* The Mana World 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
* any later version.
*
* The Mana World 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 The Mana World; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* $Id$
*/
#include <stdio.h>
#include "astar.h"
#include "being.h"
NODE *player_node = NULL;
std::list<NODE*> beings;
PATH_NODE::PATH_NODE(unsigned short x, unsigned short y):
next(NULL)
{
this->x = x;
this->y = y;
}
PATH_NODE *calculate_path(
unsigned short src_x, unsigned short src_y,
unsigned short dest_x, unsigned short dest_y)
{
return find_path(1, src_x, src_y, dest_x, dest_y);
}
NODE::NODE():
id(0), job(0),
action(0), frame(0),
path(NULL),
speech(NULL), speech_time(0),
tick_time(0), speed(150),
emotion(0), emotion_time(0),
text_x(0), text_y(0),
hair_style(1), hair_color(1),
weapon(0)
{
memset(coordinates, 0, 3);
speech_color = makecol(0, 0, 0);
}
void empty() {
std::list<NODE*>::iterator i;
for (i = beings.begin(); i != beings.end(); i++) {
delete (*i);
}
beings.clear();
}
void add_node(NODE *node) {
beings.push_back(node);
}
void remove_node(unsigned int id) {
std::list<NODE*>::iterator i;
for (i = beings.begin(); i != beings.end(); i++) {
if ((*i)->id == id) {
delete (*i);
beings.erase(i);
return;
}
}
}
unsigned int find_npc(unsigned short x, unsigned short y) {
std::list<NODE*>::iterator i;
for (i = beings.begin(); i != beings.end(); i++) {
NODE *node = (*i);
// Check if is a NPC (only low job ids)
if (node->job >= 46 && node->job <= 125 &&
get_x(node->coordinates) == x &&
get_y(node->coordinates) == y)
{
return node->id;
}
}
return 0;
}
unsigned int find_monster(unsigned short x, unsigned short y) {
std::list<NODE*>::iterator i;
for (i = beings.begin(); i != beings.end(); i++) {
NODE *node = (*i);
// Check if is a MONSTER
if (node->job > 200 &&
get_x(node->coordinates) == x &&
get_y(node->coordinates) == y)
{
return node->id;
}
}
return 0;
}
NODE *find_node(unsigned int id) {
std::list<NODE*>::iterator i;
for (i = beings.begin(); i != beings.end(); i++) {
NODE *node = (*i);
if (node->id == id) {
return node;
}
}
return NULL;
}
class NODE_Compare {
public:
bool operator() (const NODE *a, const NODE *b) const {
return get_y(a->coordinates) < get_y(b->coordinates);
}
};
void sort() {
beings.sort(NODE_Compare());
}
void empty_path(NODE *node) {
if (node) {
PATH_NODE *temp = node->path;
PATH_NODE *next;
while (temp) {
next = temp->next;
delete temp;
temp = next;
}
node->path = NULL;
}
}
|
