Implement goto so node

Encompasses determining a route and a distance to travel

2 files changed, 65 insertions, 0 deletions

diff --git a/game/objectives/goto.cpp b/game/objectives/goto.cpp
new file mode 100644
index 0000000..c089bc3
--- /dev/null
+++ b/game/objectives/goto.cpp
@@ -0,0 +1,43 @@
+#include "goto.h"
+#include <algorithm>
+#include <game/activities/go.h>
+#include <game/activity.h>
+#include <game/network/link.h>
+#include <game/network/routeWalker.h>
+#include <game/objective.h>
+#include <memory>
+#include <numeric>
+#include <vector>
+
+GoTo::GoTo(Orders * o, const Link::End & cp, float d, const NodePtr & dest) :
+	Objective(o), links(RouteWalker().findRouteTo(cp, dest)), startDist {d}
+{
+}
+
+ActivityPtr
+GoTo::createActivity() const
+{
+	return std::make_unique<Go>(std::accumulate(links.begin(), links.end(), 0,
+										[](auto p, const auto & l) {
+											return p += l.first.lock()->length;
+										})
+			+ startDist
+
+	);
+}
+
+inline bool
+operator==(const Link::Next & l, const Link::Next & n)
+{
+	return l.second == n.second && l.first.lock() == n.first.lock();
+}
+
+Link::Next
+GoTo::navigate(Link::Nexts::const_iterator begin, Link::Nexts::const_iterator end) const
+{
+	const auto nextStep = std::find_first_of(links.begin(), links.end(), begin, end);
+	if (nextStep == links.end()) {
+		return *begin;
+	}
+	return *nextStep;
+}
diff --git a/game/objectives/goto.h b/game/objectives/goto.h
new file mode 100644
index 0000000..01e47ae
--- /dev/null
+++ b/game/objectives/goto.h
@@ -0,0 +1,22 @@
+#ifndef GOTO_H
+#define GOTO_H
+
+#include <game/activity.h>
+#include <game/network/link.h>
+#include <game/objective.h>
+
+class Orders;
+
+class GoTo : public Objective {
+public:
+	GoTo(Orders * os, const Link::End &, float, const NodePtr & dest);
+
+	[[nodiscard]] ActivityPtr createActivity() const override;
+	[[nodiscard]] Link::Next navigate(Link::Nexts::const_iterator, Link::Nexts::const_iterator) const override;
+
+private:
+	Link::Nexts links;
+	float startDist;
+};
+
+#endif