Files
@ r27383:44f4e925c6f0
Branch filter:
Location: cpp/openttd-patchpack/source/src/linkgraph/linkgraph.cpp - annotation
r27383:44f4e925c6f0
9.0 KiB
text/x-c
Codechange: Swap SocketList map key/value around.
This map is used store socket and address together, and, other than
checking that the address does not already have a socket, the data layout
does not seem particularly important.
However, as address is the key, technically it should not be modified,
and address may self-modify itself during comparisons.
This map is used store socket and address together, and, other than
checking that the address does not already have a socket, the data layout
does not seem particularly important.
However, as address is the key, technically it should not be modified,
and address may self-modify itself during comparisons.
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 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 | r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r21383:942c32fb8b0e r21383:942c32fb8b0e r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r21529:6bf3ee37953c r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r26916:2753c2f94e2d r20250:629a2ca277f7 r21529:6bf3ee37953c r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r26920:e212d9198e19 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r25901:ecc6a1476cb8 r20854:d6b61e2cf909 r20854:d6b61e2cf909 r26920:e212d9198e19 r20250:629a2ca277f7 r20250:629a2ca277f7 r20310:5347597a1460 r20310:5347597a1460 r20310:5347597a1460 r20310:5347597a1460 r20310:5347597a1460 r20310:5347597a1460 r20310:5347597a1460 r20310:5347597a1460 r20310:5347597a1460 r20310:5347597a1460 r20310:5347597a1460 r26920:e212d9198e19 r20854:d6b61e2cf909 r20854:d6b61e2cf909 r20310:5347597a1460 r20310:5347597a1460 r20310:5347597a1460 r20310:5347597a1460 r20250:629a2ca277f7 r20250:629a2ca277f7 r27148:4e041ae27b9d r20250:629a2ca277f7 r20250:629a2ca277f7 r26920:e212d9198e19 r20250:629a2ca277f7 r26484:43a092404ec2 r26484:43a092404ec2 r26484:43a092404ec2 r26484:43a092404ec2 r27176:1ede36282270 r26484:43a092404ec2 r26484:43a092404ec2 r20250:629a2ca277f7 r25905:25006fee5ec7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r27166:64e04a3ef9b1 r27166:64e04a3ef9b1 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r26920:e212d9198e19 r26920:e212d9198e19 r26920:e212d9198e19 r26920:e212d9198e19 r26920:e212d9198e19 r26920:e212d9198e19 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r23569:b43bf680313b r23569:b43bf680313b r23569:b43bf680313b r23569:b43bf680313b r26916:2753c2f94e2d r26920:e212d9198e19 r26920:e212d9198e19 r26920:e212d9198e19 r26920:e212d9198e19 r26920:e212d9198e19 r26920:e212d9198e19 r26920:e212d9198e19 r26920:e212d9198e19 r26920:e212d9198e19 r26920:e212d9198e19 r26920:e212d9198e19 r26916:2753c2f94e2d r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r26916:2753c2f94e2d r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r21443:e0525f7288a8 r21443:e0525f7288a8 r20250:629a2ca277f7 r20250:629a2ca277f7 r21443:e0525f7288a8 r21443:e0525f7288a8 r20250:629a2ca277f7 r26922:e16d3a06d864 r20250:629a2ca277f7 r26920:e212d9198e19 r26920:e212d9198e19 r26922:e16d3a06d864 r20250:629a2ca277f7 r21443:e0525f7288a8 r26711:a4f8e9c41dea r27148:4e041ae27b9d r27148:4e041ae27b9d r20250:629a2ca277f7 r20250:629a2ca277f7 r20854:d6b61e2cf909 r20854:d6b61e2cf909 r20854:d6b61e2cf909 r20854:d6b61e2cf909 r21443:e0525f7288a8 r21443:e0525f7288a8 r20854:d6b61e2cf909 r26922:e16d3a06d864 r20250:629a2ca277f7 r20250:629a2ca277f7 r21443:e0525f7288a8 r26920:e212d9198e19 r25901:ecc6a1476cb8 r20250:629a2ca277f7 r26922:e16d3a06d864 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r26922:e16d3a06d864 r20250:629a2ca277f7 r26922:e16d3a06d864 r26922:e16d3a06d864 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r21443:e0525f7288a8 r25901:ecc6a1476cb8 r21443:e0525f7288a8 r21443:e0525f7288a8 r20250:629a2ca277f7 r21443:e0525f7288a8 r25901:ecc6a1476cb8 r21443:e0525f7288a8 r20250:629a2ca277f7 r26922:e16d3a06d864 r20250:629a2ca277f7 r26922:e16d3a06d864 r21443:e0525f7288a8 r21443:e0525f7288a8 r21443:e0525f7288a8 r26922:e16d3a06d864 r26922:e16d3a06d864 r25901:ecc6a1476cb8 r26922:e16d3a06d864 r25901:ecc6a1476cb8 r26922:e16d3a06d864 r25901:ecc6a1476cb8 r26922:e16d3a06d864 r26922:e16d3a06d864 r21443:e0525f7288a8 r26922:e16d3a06d864 r26922:e16d3a06d864 r26922:e16d3a06d864 r26922:e16d3a06d864 r26922:e16d3a06d864 r26922:e16d3a06d864 r25901:ecc6a1476cb8 r26922:e16d3a06d864 r20250:629a2ca277f7 r27148:4e041ae27b9d r27148:4e041ae27b9d r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r20250:629a2ca277f7 r23521:26cb73a2624c r20250:629a2ca277f7 | /*
* This file is part of OpenTTD.
* OpenTTD 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, version 2.
* OpenTTD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with OpenTTD. If not, see <http://www.gnu.org/licenses/>.
*/
/** @file linkgraph.cpp Definition of link graph classes used for cargo distribution. */
#include "../stdafx.h"
#include "../core/pool_func.hpp"
#include "linkgraph.h"
#include "../safeguards.h"
/* Initialize the link-graph-pool */
LinkGraphPool _link_graph_pool("LinkGraph");
INSTANTIATE_POOL_METHODS(LinkGraph)
/**
* Create a node or clear it.
* @param xy Location of the associated station.
* @param st ID of the associated station.
* @param demand Demand for cargo at the station.
*/
LinkGraph::BaseNode::BaseNode(TileIndex xy, StationID st, uint demand)
{
this->xy = xy;
this->supply = 0;
this->demand = demand;
this->station = st;
this->last_update = INVALID_DATE;
}
/**
* Create an edge.
*/
LinkGraph::BaseEdge::BaseEdge(NodeID dest_node)
{
this->capacity = 0;
this->usage = 0;
this->travel_time_sum = 0;
this->last_unrestricted_update = INVALID_DATE;
this->last_restricted_update = INVALID_DATE;
this->dest_node = dest_node;
}
/**
* Shift all dates by given interval.
* This is useful if the date has been modified with the cheat menu.
* @param interval Number of days to be added or subtracted.
*/
void LinkGraph::ShiftDates(int interval)
{
this->last_compression += interval;
for (NodeID node1 = 0; node1 < this->Size(); ++node1) {
BaseNode &source = this->nodes[node1];
if (source.last_update != INVALID_DATE) source.last_update += interval;
for (BaseEdge &edge : this->nodes[node1].edges) {
if (edge.last_unrestricted_update != INVALID_DATE) edge.last_unrestricted_update += interval;
if (edge.last_restricted_update != INVALID_DATE) edge.last_restricted_update += interval;
}
}
}
void LinkGraph::Compress()
{
this->last_compression = (TimerGameCalendar::date + this->last_compression) / 2;
for (NodeID node1 = 0; node1 < this->Size(); ++node1) {
this->nodes[node1].supply /= 2;
for (BaseEdge &edge : this->nodes[node1].edges) {
if (edge.capacity > 0) {
uint new_capacity = std::max(1U, edge.capacity / 2);
if (edge.capacity < (1 << 16)) {
edge.travel_time_sum = edge.travel_time_sum * new_capacity / edge.capacity;
} else if (edge.travel_time_sum != 0) {
edge.travel_time_sum = std::max<uint64>(1, edge.travel_time_sum / 2);
}
edge.capacity = new_capacity;
edge.usage /= 2;
}
}
}
}
/**
* Merge a link graph with another one.
* @param other LinkGraph to be merged into this one.
*/
void LinkGraph::Merge(LinkGraph *other)
{
TimerGameCalendar::Date age = TimerGameCalendar::date - this->last_compression + 1;
TimerGameCalendar::Date other_age = TimerGameCalendar::date - other->last_compression + 1;
NodeID first = this->Size();
for (NodeID node1 = 0; node1 < other->Size(); ++node1) {
Station *st = Station::Get(other->nodes[node1].station);
NodeID new_node = this->AddNode(st);
this->nodes[new_node].supply = LinkGraph::Scale(other->nodes[node1].supply, age, other_age);
st->goods[this->cargo].link_graph = this->index;
st->goods[this->cargo].node = new_node;
for (BaseEdge &e : other->nodes[node1].edges) {
BaseEdge &new_edge = this->nodes[new_node].edges.emplace_back(first + e.dest_node);
new_edge.capacity = LinkGraph::Scale(e.capacity, age, other_age);
new_edge.usage = LinkGraph::Scale(e.usage, age, other_age);
new_edge.travel_time_sum = LinkGraph::Scale(e.travel_time_sum, age, other_age);
}
}
delete other;
}
/**
* Remove a node from the link graph by overwriting it with the last node.
* @param id ID of the node to be removed.
*/
void LinkGraph::RemoveNode(NodeID id)
{
assert(id < this->Size());
NodeID last_node = this->Size() - 1;
Station::Get(this->nodes[last_node].station)->goods[this->cargo].node = id;
/* Erase node by swapping with the last element. Node index is referenced
* directly from station goods entries so the order and position must remain. */
this->nodes[id] = this->nodes.back();
this->nodes.pop_back();
for (auto &n : this->nodes) {
/* Find iterator position where an edge to id would be. */
auto [first, last] = std::equal_range(n.edges.begin(), n.edges.end(), id);
/* Remove potential node (erasing an empty range is safe). */
auto insert = n.edges.erase(first, last);
/* As the edge list is sorted, a potential edge to last_node will always be the last edge. */
if (!n.edges.empty() && n.edges.back().dest_node == last_node) {
/* Change dest ID and move into the spot of the deleted edge. */
n.edges.back().dest_node = id;
n.edges.insert(insert, n.edges.back());
n.edges.pop_back();
}
}
}
/**
* Add a node to the component and create empty edges associated with it. Set
* the station's last_component to this component. Calculate the distances to all
* other nodes. The distances to _all_ nodes are important as the demand
* calculator relies on their availability.
* @param st New node's station.
* @return New node's ID.
*/
NodeID LinkGraph::AddNode(const Station *st)
{
const GoodsEntry &good = st->goods[this->cargo];
NodeID new_node = this->Size();
this->nodes.emplace_back(st->xy, st->index, HasBit(good.status, GoodsEntry::GES_ACCEPTANCE));
return new_node;
}
/**
* Fill an edge with values from a link. Set the restricted or unrestricted
* update timestamp according to the given update mode.
* @param to Destination node of the link.
* @param capacity Capacity of the link.
* @param usage Usage to be added.
* @param mode Update mode to be used.
*/
void LinkGraph::BaseNode::AddEdge(NodeID to, uint capacity, uint usage, uint32 travel_time, EdgeUpdateMode mode)
{
assert(!this->HasEdgeTo(to));
BaseEdge &edge = *this->edges.emplace(std::upper_bound(this->edges.begin(), this->edges.end(), to), to);
edge.capacity = capacity;
edge.usage = usage;
edge.travel_time_sum = static_cast<uint64>(travel_time) * capacity;
if (mode & EUM_UNRESTRICTED) edge.last_unrestricted_update = TimerGameCalendar::date;
if (mode & EUM_RESTRICTED) edge.last_restricted_update = TimerGameCalendar::date;
}
/**
* Creates an edge if none exists yet or updates an existing edge.
* @param to Target node.
* @param capacity Capacity of the link.
* @param usage Usage to be added.
* @param mode Update mode to be used.
*/
void LinkGraph::BaseNode::UpdateEdge(NodeID to, uint capacity, uint usage, uint32 travel_time, EdgeUpdateMode mode)
{
assert(capacity > 0);
assert(usage <= capacity);
if (!this->HasEdgeTo(to)) {
this->AddEdge(to, capacity, usage, travel_time, mode);
} else {
this->GetEdge(to)->Update(capacity, usage, travel_time, mode);
}
}
/**
* Remove an outgoing edge from this node.
* @param to ID of destination node.
*/
void LinkGraph::BaseNode::RemoveEdge(NodeID to)
{
auto [first, last] = std::equal_range(this->edges.begin(), this->edges.end(), to);
this->edges.erase(first, last);
}
/**
* Update an edge. If mode contains UM_REFRESH refresh the edge to have at
* least the given capacity and usage, otherwise add the capacity, usage and travel time.
* In any case set the respective update timestamp(s), according to the given
* mode.
* @param capacity Capacity to be added/updated.
* @param usage Usage to be added.
* @param travel_time Travel time to be added, in ticks.
* @param mode Update mode to be applied.
*/
void LinkGraph::BaseEdge::Update(uint capacity, uint usage, uint32 travel_time, EdgeUpdateMode mode)
{
assert(this->capacity > 0);
assert(capacity >= usage);
if (mode & EUM_INCREASE) {
if (this->travel_time_sum == 0) {
this->travel_time_sum = static_cast<uint64>(this->capacity + capacity) * travel_time;
} else if (travel_time == 0) {
this->travel_time_sum += this->travel_time_sum / this->capacity * capacity;
} else {
this->travel_time_sum += static_cast<uint64>(travel_time) * capacity;
}
this->capacity += capacity;
this->usage += usage;
} else if (mode & EUM_REFRESH) {
if (this->travel_time_sum == 0) {
this->capacity = std::max(this->capacity, capacity);
this->travel_time_sum = static_cast<uint64>(travel_time) * this->capacity;
} else if (capacity > this->capacity) {
this->travel_time_sum = this->travel_time_sum / this->capacity * capacity;
this->capacity = capacity;
}
this->usage = std::max(this->usage, usage);
}
if (mode & EUM_UNRESTRICTED) this->last_unrestricted_update = TimerGameCalendar::date;
if (mode & EUM_RESTRICTED) this->last_restricted_update = TimerGameCalendar::date;
}
/**
* Resize the component and fill it with empty nodes and edges. Used when
* loading from save games. The component is expected to be empty before.
* @param size New size of the component.
*/
void LinkGraph::Init(uint size)
{
assert(this->Size() == 0);
this->nodes.resize(size);
}
|