4 // Copyright (C) 2006 Matthias Braun <matze@braunis.de>
6 // This program is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU General Public License
8 // as published by the Free Software Foundation; either version 2
9 // of the License, or (at your option) any later version.
11 // This program is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License
17 // along with this program; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
24 #include "path_walker.hpp"
26 PathWalker::PathWalker(const Path* path, bool running)
27 : path(path), running(running), current_node_nr(0), next_node_nr(0), stop_at_node_nr(running?-1:0), node_time(0),
30 last_pos = path->nodes[0].position;
31 node_mult = 1 / path->nodes[0].time;
32 next_node_nr = path->nodes.size() > 1 ? 1 : 0;
35 PathWalker::~PathWalker()
40 PathWalker::advance(float elapsed_time)
42 if (!running) return Vector(0,0);
44 assert(elapsed_time >= 0);
46 elapsed_time *= fabsf(walking_speed);
48 const Path::Node* current_node = & (path->nodes[current_node_nr]);
49 while(node_time + elapsed_time * node_mult >= 1) {
50 elapsed_time -= (1 - node_time) / node_mult;
52 if(walking_speed > 0) {
54 } else if(walking_speed < 0) {
58 current_node = & (path->nodes[current_node_nr]);
60 if(walking_speed > 0) {
61 node_mult = 1 / current_node->time;
63 node_mult = 1 / path->nodes[next_node_nr].time;
67 const Path::Node* next_node = & (path->nodes[next_node_nr]);
68 node_time += elapsed_time * node_mult;
70 Vector new_pos = current_node->position +
71 (next_node->position - current_node->position) * node_time;
73 Vector result = new_pos - last_pos;
80 PathWalker::goto_node(int node_no)
82 if (node_no == stop_at_node_nr) return;
84 stop_at_node_nr = node_no;
88 PathWalker::start_moving()
95 PathWalker::stop_moving()
97 stop_at_node_nr = next_node_nr;
102 PathWalker::advance_node()
104 current_node_nr = next_node_nr;
105 if (static_cast<int>(current_node_nr) == stop_at_node_nr) running = false;
107 if(next_node_nr + 1 < path->nodes.size()) {
114 next_node_nr = path->nodes.size() - 1;
118 case Path::PING_PONG:
119 walking_speed = -walking_speed;
120 next_node_nr = path->nodes.size() > 1 ? path->nodes.size() - 2 : 0;
128 // we shouldn't get here
130 next_node_nr = path->nodes.size() - 1;
135 PathWalker::goback_node()
137 current_node_nr = next_node_nr;
139 if(next_node_nr > 0) {
145 case Path::PING_PONG:
146 walking_speed = -walking_speed;
147 next_node_nr = path->nodes.size() > 1 ? 1 : 0;