Files
@ r20660:5782cd63ef4b
Branch filter:
Location: cpp/openttd-patchpack/source/src/core/smallvec_type.hpp - annotation
r20660:5782cd63ef4b
9.4 KiB
text/x-c++hdr
(svn r25698) -Fix [FS#5700]: Autoreplace/renew also refits free wagons.
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 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 | r9555:95ac8b32acff r9555:95ac8b32acff r12768:980ae0491352 r12768:980ae0491352 r12768:980ae0491352 r12768:980ae0491352 r12768:980ae0491352 r12768:980ae0491352 r12768:980ae0491352 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r16026:de6f171ab049 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r15594:ba7e42fbae24 r15594:ba7e42fbae24 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r15264:ccfbc4196c34 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r17630:7d818445376d r17630:7d818445376d r17630:7d818445376d r17630:7d818445376d r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r16028:f7cfe78e8c66 r16026:de6f171ab049 r16026:de6f171ab049 r19523:0a961bdbee52 r16026:de6f171ab049 r16026:de6f171ab049 r17630:7d818445376d r17630:7d818445376d r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r17630:7d818445376d r16028:f7cfe78e8c66 r16028:f7cfe78e8c66 r16028:f7cfe78e8c66 r19523:0a961bdbee52 r16028:f7cfe78e8c66 r16028:f7cfe78e8c66 r16028:f7cfe78e8c66 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r19523:0a961bdbee52 r9555:95ac8b32acff r9555:95ac8b32acff r18782:6453522c2154 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r10416:5aed71415cd6 r10416:5aed71415cd6 r18782:6453522c2154 r10416:5aed71415cd6 r10416:5aed71415cd6 r10416:5aed71415cd6 r10416:5aed71415cd6 r10416:5aed71415cd6 r10416:5aed71415cd6 r10416:5aed71415cd6 r10416:5aed71415cd6 r9555:95ac8b32acff r9555:95ac8b32acff r18782:6453522c2154 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r14426:0aaa0726efa5 r14076:ca02dbb2786f r9555:95ac8b32acff r18782:6453522c2154 r9555:95ac8b32acff r14429:d459d2cbce62 r14426:0aaa0726efa5 r14426:0aaa0726efa5 r14426:0aaa0726efa5 r14426:0aaa0726efa5 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r14426:0aaa0726efa5 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r15264:ccfbc4196c34 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r18782:6453522c2154 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r15264:ccfbc4196c34 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r18782:6453522c2154 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r15264:ccfbc4196c34 r13033:00be5ea0c48f r13033:00be5ea0c48f r13033:00be5ea0c48f r13033:00be5ea0c48f r19360:2ad849e759c9 r13033:00be5ea0c48f r13033:00be5ea0c48f r19360:2ad849e759c9 r13033:00be5ea0c48f r13033:00be5ea0c48f r13033:00be5ea0c48f r13033:00be5ea0c48f r13033:00be5ea0c48f r13033:00be5ea0c48f r13033:00be5ea0c48f r13033:00be5ea0c48f r13033:00be5ea0c48f r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r18782:6453522c2154 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r14076:ca02dbb2786f r14076:ca02dbb2786f r10793:5ba2151e71e9 r10793:5ba2151e71e9 r10793:5ba2151e71e9 r18782:6453522c2154 r10793:5ba2151e71e9 r10793:5ba2151e71e9 r10793:5ba2151e71e9 r10793:5ba2151e71e9 r10793:5ba2151e71e9 r10449:7750c62a1816 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r20080:370491fa9c80 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r18782:6453522c2154 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r10449:7750c62a1816 r9555:95ac8b32acff r9555:95ac8b32acff r18782:6453522c2154 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r18782:6453522c2154 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r18782:6453522c2154 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r18782:6453522c2154 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r18782:6453522c2154 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r18782:6453522c2154 r9555:95ac8b32acff r14083:338691e8f2d4 r14083:338691e8f2d4 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r18782:6453522c2154 r9555:95ac8b32acff r14083:338691e8f2d4 r14083:338691e8f2d4 r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r15264:ccfbc4196c34 r9555:95ac8b32acff r9555:95ac8b32acff r18782:6453522c2154 r9555:95ac8b32acff r14076:ca02dbb2786f r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r15264:ccfbc4196c34 r9555:95ac8b32acff r9555:95ac8b32acff r18782:6453522c2154 r9555:95ac8b32acff r14076:ca02dbb2786f r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9555:95ac8b32acff r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r18782:6453522c2154 r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r9677:9dec7fb5b7dd r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18782:6453522c2154 r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r18776:45400817a6df r17630:7d818445376d r11560:52827dc8eb76 r9555:95ac8b32acff | /* $Id$ */
/*
* 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 smallvec_type.hpp Simple vector class that allows allocating an item without the need to copy this->data needlessly. */
#ifndef SMALLVEC_TYPE_HPP
#define SMALLVEC_TYPE_HPP
#include "alloc_func.hpp"
#include "mem_func.hpp"
/**
* Simple vector template class.
*
* @note There are no asserts in the class so you have
* to care about that you grab an item which is
* inside the list.
*
* @tparam T The type of the items stored
* @tparam S The steps of allocation
*/
template <typename T, uint S>
class SmallVector {
protected:
T *data; ///< The pointer to the first item
uint items; ///< The number of items stored
uint capacity; ///< The available space for storing items
public:
SmallVector() : data(NULL), items(0), capacity(0) { }
/**
* Copy constructor.
* @param other The other vector to copy.
*/
SmallVector(const SmallVector &other) : data(NULL), items(0), capacity(0)
{
this->Assign(other);
}
/**
* Generic copy constructor.
* @param other The other vector to copy.
*/
template <uint X>
SmallVector(const SmallVector<T, X> &other) : data(NULL), items(0), capacity(0)
{
this->Assign(other);
}
/**
* Assignment.
* @param other The other vector to assign.
*/
SmallVector &operator=(const SmallVector &other)
{
this->Assign(other);
return *this;
}
/**
* Generic assignment.
* @param other The other vector to assign.
*/
template <uint X>
SmallVector &operator=(const SmallVector<T, X> &other)
{
this->Assign(other);
return *this;
}
~SmallVector()
{
free(this->data);
}
/**
* Assign items from other vector.
*/
template <uint X>
inline void Assign(const SmallVector<T, X> &other)
{
if ((const void *)&other == (void *)this) return;
this->Clear();
if (other.Length() > 0) MemCpyT<T>(this->Append(other.Length()), other.Begin(), other.Length());
}
/**
* Remove all items from the list.
*/
inline void Clear()
{
/* In fact we just reset the item counter avoiding the need to
* probably reallocate the same amount of memory the list was
* previously using. */
this->items = 0;
}
/**
* Remove all items from the list and free allocated memory.
*/
inline void Reset()
{
this->items = 0;
this->capacity = 0;
free(data);
data = NULL;
}
/**
* Compact the list down to the smallest block size boundary.
*/
inline void Compact()
{
uint capacity = Align(this->items, S);
if (capacity >= this->capacity) return;
this->capacity = capacity;
this->data = ReallocT(this->data, this->capacity);
}
/**
* Append an item and return it.
* @param to_add the number of items to append
* @return pointer to newly allocated item
*/
inline T *Append(uint to_add = 1)
{
uint begin = this->items;
this->items += to_add;
if (this->items > this->capacity) {
this->capacity = Align(this->items, S);
this->data = ReallocT(this->data, this->capacity);
}
return &this->data[begin];
}
/**
* Set the size of the vector, effectively truncating items from the end or appending uninitialised ones.
* @param num_items Target size.
*/
inline void Resize(uint num_items)
{
this->items = num_items;
if (this->items > this->capacity) {
this->capacity = Align(this->items, S);
this->data = ReallocT(this->data, this->capacity);
}
}
/**
* Search for the first occurrence of an item.
* The '!=' operator of T is used for comparison.
* @param item Item to search for
* @return The position of the item, or End() when not present
*/
inline const T *Find(const T &item) const
{
const T *pos = this->Begin();
const T *end = this->End();
while (pos != end && *pos != item) pos++;
return pos;
}
/**
* Search for the first occurrence of an item.
* The '!=' operator of T is used for comparison.
* @param item Item to search for
* @return The position of the item, or End() when not present
*/
inline T *Find(const T &item)
{
T *pos = this->Begin();
const T *end = this->End();
while (pos != end && *pos != item) pos++;
return pos;
}
/**
* Search for the first occurrence of an item.
* The '!=' operator of T is used for comparison.
* @param item Item to search for
* @return The position of the item, or -1 when not present
*/
inline int FindIndex(const T &item) const
{
int index = 0;
const T *pos = this->Begin();
const T *end = this->End();
while (pos != end && *pos != item) {
pos++;
index++;
}
return pos == end ? -1 : index;
}
/**
* Tests whether a item is present in the vector.
* The '!=' operator of T is used for comparison.
* @param item Item to test for
* @return true iff the item is present
*/
inline bool Contains(const T &item) const
{
return this->Find(item) != this->End();
}
/**
* Removes given item from this vector
* @param item item to remove
* @note it has to be pointer to item in this map. It is overwritten by the last item.
*/
inline void Erase(T *item)
{
assert(item >= this->Begin() && item < this->End());
*item = this->data[--this->items];
}
/**
* Remove items from the vector while preserving the order of other items.
* @param pos First item to remove.
* @param count Number of consecutive items to remove.
*/
void ErasePreservingOrder(uint pos, uint count = 1)
{
if (count == 0) return;
assert(pos < this->items);
assert(pos + count <= this->items);
this->items -= count;
uint to_move = this->items - pos;
if (to_move > 0) MemMoveT(this->data + pos, this->data + pos + count, to_move);
}
/**
* Tests whether a item is present in the vector, and appends it to the end if not.
* The '!=' operator of T is used for comparison.
* @param item Item to test for
* @return true iff the item is was already present
*/
inline bool Include(const T &item)
{
bool is_member = this->Contains(item);
if (!is_member) *this->Append() = item;
return is_member;
}
/**
* Get the number of items in the list.
*/
inline uint Length() const
{
return this->items;
}
/**
* Get the pointer to the first item (const)
*
* @return the pointer to the first item
*/
inline const T *Begin() const
{
return this->data;
}
/**
* Get the pointer to the first item
*
* @return the pointer to the first item
*/
inline T *Begin()
{
return this->data;
}
/**
* Get the pointer behind the last valid item (const)
*
* @return the pointer behind the last valid item
*/
inline const T *End() const
{
return &this->data[this->items];
}
/**
* Get the pointer behind the last valid item
*
* @return the pointer behind the last valid item
*/
inline T *End()
{
return &this->data[this->items];
}
/**
* Get the pointer to item "number" (const)
*
* @param index the position of the item
* @return the pointer to the item
*/
inline const T *Get(uint index) const
{
/* Allow access to the 'first invalid' item */
assert(index <= this->items);
return &this->data[index];
}
/**
* Get the pointer to item "number"
*
* @param index the position of the item
* @return the pointer to the item
*/
inline T *Get(uint index)
{
/* Allow access to the 'first invalid' item */
assert(index <= this->items);
return &this->data[index];
}
/**
* Get item "number" (const)
*
* @param index the position of the item
* @return the item
*/
inline const T &operator[](uint index) const
{
assert(index < this->items);
return this->data[index];
}
/**
* Get item "number"
*
* @param index the position of the item
* @return the item
*/
inline T &operator[](uint index)
{
assert(index < this->items);
return this->data[index];
}
};
/**
* Simple vector template class, with automatic free.
*
* @note There are no asserts in the class so you have
* to care about that you grab an item which is
* inside the list.
*
* @param T The type of the items stored, must be a pointer
* @param S The steps of allocation
*/
template <typename T, uint S>
class AutoFreeSmallVector : public SmallVector<T, S> {
public:
~AutoFreeSmallVector()
{
this->Clear();
}
/**
* Remove all items from the list.
*/
inline void Clear()
{
for (uint i = 0; i < this->items; i++) {
free(this->data[i]);
}
this->items = 0;
}
};
/**
* Simple vector template class, with automatic delete.
*
* @note There are no asserts in the class so you have
* to care about that you grab an item which is
* inside the list.
*
* @param T The type of the items stored, must be a pointer
* @param S The steps of allocation
*/
template <typename T, uint S>
class AutoDeleteSmallVector : public SmallVector<T, S> {
public:
~AutoDeleteSmallVector()
{
this->Clear();
}
/**
* Remove all items from the list.
*/
inline void Clear()
{
for (uint i = 0; i < this->items; i++) {
delete this->data[i];
}
this->items = 0;
}
};
typedef AutoFreeSmallVector<char*, 4> StringList; ///< Type for a list of strings.
#endif /* SMALLVEC_TYPE_HPP */
|