blob: 5388393e88b945eec37c0974c9c89c74020b7da3 (
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
// Copyright (C) 2018 Intel Corporation
//
// SPDX-License-Identifier: Apache-2.0
//
#include "node.hpp"
#include <memory>
#include "util/assert.hpp"
#include "util/algorithm.hpp"
#include "graph.hpp"
#include "edge.hpp"
namespace ade
{
Node::Node(Graph* parent):
m_parent(parent)
{
}
Node::~Node()
{
unlink();
}
void Node::unlink()
{
ASSERT(nullptr != m_parent);
for (auto& edge: m_inEdges) //TODO: join ranges
{
ASSERT(nullptr != edge);
ASSERT(this == edge->m_nextNode);
edge->m_nextNode = nullptr;
m_parent->removeEdge(edge);
}
m_inEdges.clear();
for (auto& edge: m_outEdges) //TODO: join ranges
{
ASSERT(nullptr != edge);
ASSERT(this == edge->m_prevNode);
edge->m_prevNode = nullptr;
m_parent->removeEdge(edge);
}
m_outEdges.clear();
}
void Node::addInEdge(Edge* edge)
{
ASSERT(nullptr != edge);
ASSERT(m_inEdges.end() == util::find(m_inEdges, edge));
m_inEdges.emplace_back(edge);
}
void Node::removeInEdge(Edge* edge)
{
ASSERT(nullptr != edge);
// Nodes usually have only a small amount of connections so linear search should be fine here
auto it = util::find(m_inEdges, edge);
ASSERT(m_inEdges.end() != it);
util::unstable_erase(m_inEdges, it);
}
void Node::addOutEdge(Edge* edge)
{
ASSERT(nullptr != edge);
ASSERT(m_outEdges.end() == util::find(m_outEdges, edge));
m_outEdges.emplace_back(edge);
}
void Node::removeOutEdge(Edge* edge)
{
ASSERT(nullptr != edge);
// Nodes usually have only a small amount of connections so linear search should be fine here
auto it = util::find(m_outEdges, edge);
ASSERT(m_outEdges.end() != it);
util::unstable_erase(m_outEdges, it);
}
Graph* Node::getParent() const
{
return m_parent;
}
Node::EdgeSetRange Node::inEdges()
{
return util::map<HandleMapper>(util::toRange(m_inEdges));
}
Node::EdgeSetCRange Node::inEdges() const
{
return util::map<HandleMapper>(util::toRange(m_inEdges));
}
Node::EdgeSetRange Node::outEdges()
{
return util::map<HandleMapper>(util::toRange(m_outEdges));
}
Node::EdgeSetCRange Node::outEdges() const
{
return util::map<HandleMapper>(util::toRange(m_outEdges));
}
Node::InNodeSetRange Node::inNodes()
{
return util::map<InEdgeMapper>(inEdges());
}
Node::InNodeSetCRange Node::inNodes() const
{
return util::map<InEdgeMapper>(inEdges());
}
Node::OutNodeSetRange Node::outNodes()
{
return util::map<OutEdgeMapper>(outEdges());
}
Node::OutNodeSetCRange Node::outNodes() const
{
return util::map<OutEdgeMapper>(outEdges());
}
EdgeHandle Node::HandleMapper::operator()(Edge* obj) const
{
ASSERT(nullptr != obj);
return Graph::HandleMapper()(obj);
}
NodeHandle Node::InEdgeMapper::operator()(const EdgeHandle& handle) const
{
ASSERT(nullptr != handle);
return handle->srcNode();
}
NodeHandle Node::OutEdgeMapper::operator()(const EdgeHandle& handle) const
{
ASSERT(nullptr != handle);
return handle->dstNode();
}
}
|
