Files
@ r12194:be89dc048e69
Branch filter:
Location: cpp/openttd-patchpack/source/src/core/smallmap_type.hpp
r12194:be89dc048e69
2.9 KiB
text/x-c++hdr
(svn r16618) -Fix (r16614): Silence a warning.
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 | /* $Id$ */
/** @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"
/** Simple pair of data. Both types have to be POD ("Plain Old Data")! */
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().
* @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;
/** 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();
}
/** 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->Find(key) != this->End()) return false;
new (this->Append()) Pair(key, 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()
{
qsort(this->Begin(), this->items, sizeof(Pair), KeySorter);
}
static int CDECL KeySorter(const void *a, const void *b)
{
const Pair *pa = (const Pair*)a;
const Pair *pb = (const Pair*)b;
return pa->first - pb->first;
}
};
#endif /* SMALLMAP_TYPE_HPP */
|