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
|
/*-*-c++-*-
* $Id$
*
* This file is part of plptools.
*
* Copyright (C) 2000 Henner Zeller <hzeller@to.com>
*
* This program 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; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include "Enum.h"
using namespace std;
void EnumBase::i2sMapper::add(long i, const char* s) {
stringMap.insert(pair<long, const char* const>(i, s));
}
string EnumBase::i2sMapper::lookup (long i) const {
i2s_map_t::const_iterator searchPtr = stringMap.find(i);
if (searchPtr == stringMap.end())
return "[OUT-OF-RANGE]";
/*
* now combine the probably the multiple strings belonging to this
* integer
*/
string result;
for (i = stringMap.count(i); i > 0 ; --i, ++searchPtr) {
// this should be the case:
assert(searchPtr != stringMap.end());
if (result.length() != 0)
result += string(",");
result += string(searchPtr->second);
}
return result;
}
long EnumBase::i2sMapper::lookup (const char *s) const {
/*
* lookup a specific string.
* Since speed does not matter, we just do an exhaustive
* search.
* Otherwise we would have to maintain another map
* mapping strings to ints .. but its not worth the memory
*/
i2s_map_t::const_iterator run = stringMap.begin();
while (run != stringMap.end() && strcmp(s, run->second)) {
++run;
}
if (run == stringMap.end())
return -1; // FIXME .. maybe throw an exception ?
return run->first;
}
bool EnumBase::i2sMapper::inRange (long i) const {
return (stringMap.find(i) != stringMap.end());
}
/*
* Local variables:
* c-basic-offset: 4
* End:
*/
|
