blob: 7349ff0f47378215ec78693e0f216481ac0e9aa9 (
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
|
#include "network.h"
#include "routeWalker.h"
#include <array>
#include <cache.h>
#include <game/network/link.h>
#include <gfx/models/texture.h>
#include <initializer_list>
#include <stdexcept>
#include <utility>
Network::Network(const std::string & tn) : texture {Texture::cachedTexture.get(tn)} { }
NodePtr
Network::nodeAt(glm::vec3 pos)
{
return *nodes.insert(std::make_shared<Node>(pos)).first;
}
std::pair<NodePtr, bool>
Network::newNodeAt(glm::vec3 pos)
{
const auto i = nodes.insert(std::make_shared<Node>(pos));
return {*i.first, i.second};
}
NodePtr
Network::findNodeAt(glm::vec3 pos) const
{
if (const auto n = nodes.find(std::make_shared<Node>(pos)); n != nodes.end()) {
return *n;
}
return {};
}
void
Network::joinLinks(const LinkPtr & l, const LinkPtr & ol)
{
if (l != ol) {
for (const auto oe : {0, 1}) {
for (const auto te : {0, 1}) {
if (l->ends[te].node == ol->ends[oe].node) {
l->ends[te].nexts.emplace_back(ol, oe);
ol->ends[oe].nexts.emplace_back(l, te);
}
}
}
}
}
std::vector<LinkWPtr>
Network::routeFromTo(const Link::End & start, glm::vec3 dest) const
{
auto destNode {findNodeAt(dest)};
if (!destNode) {
throw std::out_of_range("Node does not exist in network");
}
return routeFromTo(start, destNode);
}
std::vector<LinkWPtr>
Network::routeFromTo(const Link::End & end, const NodePtr & dest) const
{
return RouteWalker().findRouteTo(end, dest);
}
|
