blob: 7d48b91005cd6695a1cd15ee9fe3bd7cb87665e0 (
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
|
/**
* @file llenum.h
* @author Tom Yedwab
* @brief Utility class for storing enum value <-> string lookup.
*
* Copyright (c) 2006-$CurrentYear$, Linden Research, Inc.
* $License$
*/
#ifndef LL_LLENUM_H
#define LL_LLENUM_H
class LLEnum
{
public:
typedef std::pair<const std::string, const U32> enum_t;
enum
{
UNDEFINED = 0xffffffff,
};
LLEnum(const enum_t values_array[], const U32 length)
{
for (U32 i=0; i<length; ++i)
{
mEnumMap.insert(values_array[i]);
if (values_array[i].second >= mEnumArray.size())
{
mEnumArray.resize(values_array[i].second+1);
}
mEnumArray[values_array[i].second] = values_array[i].first;
}
}
U32 operator[](std::string str)
{
std::map<const std::string, const U32>::iterator itor;
itor = mEnumMap.find(str);
if (itor != mEnumMap.end())
{
return itor->second;
}
return UNDEFINED;
}
const std::string operator[](U32 index)
{
if (index < mEnumArray.size())
{
return mEnumArray[index];
}
return "";
}
private:
std::map<const std::string, const U32> mEnumMap;
std::vector<std::string> mEnumArray;
};
#endif // LL_LLENUM_H
|
