blob: 0da413cca5cfea45492407df6bbd00201ce29bc7 (
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
|
#ifndef LINK_H
#define LINK_H
#include <array>
#include <glm/glm.hpp>
#include <memory>
#include <special_members.hpp>
#include <utility>
// Generic network node
// something that can be travelled to
// it has location
class Node {
public:
explicit Node(glm::vec3 p) noexcept : pos(p) {};
virtual ~Node() noexcept = default;
NO_COPY(Node);
NO_MOVE(Node);
glm::vec3 pos;
};
using NodePtr = std::shared_ptr<Node>;
// Generic network link
// something that can be travelled along
// it joins 2 nodes
class Link {
public:
// side determines which edges can be moved to next, must alternate
using End = std::pair<NodePtr, bool /*side*/>;
Link(End, End);
virtual ~Link() = default;
NO_COPY(Link);
NO_MOVE(Link);
std::array<End, 2> ends;
};
template<typename T> struct PtrSorter {
bool
operator()(const T & a, const T & b) const
{
return *a < *b;
}
};
bool operator<(const glm::vec3 & a, const glm::vec3 & b);
bool operator<(const Node & a, const Node & b);
#endif
|
