Files
@ r18552:fc7b2cfc2e6b
Branch filter:
Location: cpp/openttd-patchpack/source/src/core/smallmap_type.hpp - annotation
r18552:fc7b2cfc2e6b
3.9 KiB
text/x-c++hdr
(svn r23407) -Codechange: Keep a bitmap of all cargos accepted by towns.
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 | r10487:cee39532d33e r10487:cee39532d33e r12768:980ae0491352 r12768:980ae0491352 r12768:980ae0491352 r12768:980ae0491352 r12768:980ae0491352 r12768:980ae0491352 r12768:980ae0491352 r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r13019:456c429f33da r10487:cee39532d33e r16900:b96e0071e36a r16900:b96e0071e36a r16900:b96e0071e36a r16900:b96e0071e36a r16900:b96e0071e36a r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r15610:623a23fb6560 r15610:623a23fb6560 r10487:cee39532d33e r16900:b96e0071e36a r16900:b96e0071e36a r16900:b96e0071e36a r16900:b96e0071e36a r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r13271:4bcd60b30aeb r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r15610:623a23fb6560 r15610:623a23fb6560 r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r15610:623a23fb6560 r16240:4f0e181f881c r16240:4f0e181f881c r16240:4f0e181f881c r16240:4f0e181f881c r16240:4f0e181f881c r16240:4f0e181f881c r16240:4f0e181f881c r16240:4f0e181f881c r16240:4f0e181f881c r16240:4f0e181f881c r15610:623a23fb6560 r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r15610:623a23fb6560 r15610:623a23fb6560 r10487:cee39532d33e r11100:d2e797d6fe85 r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r15610:623a23fb6560 r15610:623a23fb6560 r10487:cee39532d33e r10487:cee39532d33e r11100:d2e797d6fe85 r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r16240:4f0e181f881c r15319:238047a2f7fc r15319:238047a2f7fc r15319:238047a2f7fc r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r15610:623a23fb6560 r15610:623a23fb6560 r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e r10519:2f31649cb7d7 r10519:2f31649cb7d7 r10519:2f31649cb7d7 r13019:456c429f33da r10519:2f31649cb7d7 r10519:2f31649cb7d7 r13019:456c429f33da r10519:2f31649cb7d7 r13019:456c429f33da r10519:2f31649cb7d7 r10487:cee39532d33e r10487:cee39532d33e r10487:cee39532d33e | /* $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 smallmap_type.hpp Simple mapping class targeted for small sets of data. Stored data shall be POD ("Plain Old Data")! */
#ifndef SMALLMAP_TYPE_HPP
#define SMALLMAP_TYPE_HPP
#include "smallvec_type.hpp"
#include "sort_func.hpp"
/**
* Simple pair of data. Both types have to be POD ("Plain Old Data")!
* @tvar T Key type.
* @tvar U Value type.
*/
template <typename T, typename U>
struct SmallPair {
T first;
U second;
/** Initializes this Pair with data */
FORCEINLINE SmallPair(const T &first, const U &second) : first(first), second(second) { }
};
/**
* Implementation of simple mapping class. Both types have to be POD ("Plain Old Data")!
* It has inherited accessors from SmallVector().
* @tvar T Key type.
* @tvar U Value type.
* @tvar S Unit of allocation.
*
* @see SmallVector
*/
template <typename T, typename U, uint S = 16>
struct SmallMap : SmallVector<SmallPair<T, U>, S> {
typedef ::SmallPair<T, U> Pair;
typedef Pair *iterator;
typedef const Pair *const_iterator;
/** Creates new SmallMap. Data are initialized in SmallVector constructor */
FORCEINLINE SmallMap() { }
/** Data are freed in SmallVector destructor */
FORCEINLINE ~SmallMap() { }
/**
* Finds given key in this map
* @param key key to find
* @return &Pair(key, data) if found, this->End() if not
*/
FORCEINLINE Pair *Find(const T &key)
{
for (uint i = 0; i < this->items; i++) {
if (key == this->data[i].first) return &this->data[i];
}
return this->End();
}
/**
* Tests whether a key is assigned in this map.
* @param key key to test
* @return true iff the item is present
*/
FORCEINLINE bool Contains(const T &key)
{
return this->Find(key) != this->End();
}
/**
* Removes given pair from this map
* @param pair pair to remove
* @note it has to be pointer to pair in this map. It is overwritten by the last item.
*/
FORCEINLINE void Erase(Pair *pair)
{
assert(pair >= this->Begin() && pair < this->End());
*pair = this->data[--this->items];
}
/**
* Removes given key from this map
* @param key key to remove
* @return true iff the key was found
* @note last item is moved to its place, so don't increase your iterator if true is returned!
*/
FORCEINLINE bool Erase(const T &key)
{
for (uint i = 0; i < this->items; i++) {
if (key == this->data[i].first) {
this->data[i] = this->data[--this->items];
return true;
}
}
return false;
}
/**
* Adds new item to this map.
* @param key key
* @param data data
* @return true iff the key wasn't already present
*/
FORCEINLINE bool Insert(const T &key, const U &data)
{
if (this->Contains(key)) return false;
Pair *n = this->Append();
n->first = key;
n->second = data;
return true;
}
/**
* Returns data belonging to this key
* @param key key
* @return data belonging to this key
* @note if this key wasn't present, new entry is created
*/
FORCEINLINE U &operator[](const T &key)
{
for (uint i = 0; i < this->items; i++) {
if (key == this->data[i].first) return this->data[i].second;
}
Pair *n = this->Append();
n->first = key;
return n->second;
}
FORCEINLINE void SortByKey()
{
QSortT(this->Begin(), this->items, KeySorter);
}
static int CDECL KeySorter(const Pair *a, const Pair *b)
{
return a->first - b->first;
}
};
#endif /* SMALLMAP_TYPE_HPP */
|