-// $Id$
-//
// SuperTux
// Copyright (C) 2006 Matthias Braun <matze@braunis.de>
//
-// 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 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 3 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
// 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+// along with this program. If not, see <http://www.gnu.org/licenses/>.
-#include <config.h>
+#include "object/path_walker.hpp"
#include <math.h>
#include <assert.h>
-#include "path_walker.hpp"
-PathWalker::PathWalker(const Path* path, bool running)
- : path(path), running(running), current_node_nr(0), next_node_nr(0), stop_at_node_nr(-1), node_time(0),
- walking_speed(1.0)
+PathWalker::PathWalker(const Path* path_, bool running_) :
+ path(path_),
+ running(running_),
+ current_node_nr(0),
+ next_node_nr(0),
+ stop_at_node_nr(running?-1:0),
+ node_time(0),
+ node_mult(),
+ walking_speed(1.0)
{
- last_pos = path->nodes[0].position;
node_mult = 1 / path->nodes[0].time;
next_node_nr = path->nodes.size() > 1 ? 1 : 0;
}
Vector
PathWalker::advance(float elapsed_time)
{
- if (!running) return Vector(0,0);
+ if (!running) return path->nodes[current_node_nr].position;
assert(elapsed_time >= 0);
elapsed_time *= fabsf(walking_speed);
-
+
const Path::Node* current_node = & (path->nodes[current_node_nr]);
while(node_time + elapsed_time * node_mult >= 1) {
elapsed_time -= (1 - node_time) / node_mult;
node_mult = 1 / path->nodes[next_node_nr].time;
}
}
-
- const Path::Node* next_node = & (path->nodes[next_node_nr]);
+
node_time += elapsed_time * node_mult;
-
- Vector new_pos = current_node->position +
+
+ return get_pos();
+}
+
+Vector
+PathWalker::get_pos()
+{
+ const Path::Node* current_node = & (path->nodes[current_node_nr]);
+ const Path::Node* next_node = & (path->nodes[next_node_nr]);
+ Vector new_pos = current_node->position +
(next_node->position - current_node->position) * node_time;
-
- Vector result = new_pos - last_pos;
- last_pos = new_pos;
-
- return result;
+
+ return new_pos;
}
-void
+void
PathWalker::goto_node(int node_no)
{
if (node_no == stop_at_node_nr) return;
stop_at_node_nr = node_no;
}
-void
+void
PathWalker::start_moving()
{
running = true;
stop_at_node_nr = -1;
}
-void
+void
PathWalker::stop_moving()
{
stop_at_node_nr = next_node_nr;
}
-
void
PathWalker::advance_node()
{
next_node_nr = 0;
walking_speed = 0;
}
+
+/* EOF */