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
|
/*
* Copyright (C) 2002 Daniel Heck
*
* 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.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifndef ECL_ALIST_HH
#define ECL_ALIST_HH
/*
* This file defines STL-like associative lists (similar to the ones
* found in Lisp dialects, but with a C++-ish look and feel. They can
* be used as a std::map replacement when linear searches aren't
* expensive.
*/
#include <string>
#include <list>
#include <utility>
namespace ecl
{
template <class KEY, class VAL>
class AssocList : public std::list<std::pair<KEY, VAL> > {
public:
typedef KEY key_type;
typedef std::pair<KEY,VAL> value_type;
typedef typename std::list<value_type>::iterator iterator;
typedef typename std::list<value_type>::const_iterator const_iterator;
iterator find (const key_type &key) {
iterator i=this->begin(), e=this->end();
for (; i!=e; ++i)
if (i->first == key)
break;
return i;
}
const_iterator find (const key_type &key) const {
const_iterator i=this->begin(), e=this->end();
for (; i!=e; ++i)
if (i->first == key)
break;
return i;
}
VAL &operator[] (const key_type &key) {
iterator i=find(key);
if (i==this->end())
i=this->insert(this->end(), make_pair(key, VAL()));
return i->second;
}
void remove_key(const key_type &key) {
iterator i = find(key);
if (i != this->end())
this->erase(i);
}
};
}
#endif
|
