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
|
#if ! defined _Map_h
#define _Map_h 1
#include <basic/Link.h>
#include <stdio.h> // for NULL
namespace omega {
#define foreach_map(k,K,v,V,M,A) {for (omega::MapElementIterator<K,V> __M_##k = (M).iterator();__M_##k;__M_##k++) {K & k = *__M_##k; V & v = __M_##k.value(); A;}}
template <class K, class V> class MapElement {
public:
K k;
V v;
MapElement<K,V> *tail;
MapElement(const MapElement<K,V>&);
MapElement() {}
MapElement & operator=(const MapElement<K,V>&);
~MapElement() { delete tail; }
};
template<class K, class V> class MapElementIterator {
public:
MapElementIterator(MapElement<K,V>* j) { i = j;}
virtual const K & operator*() const { return i->k; }
virtual K & operator*() { return i->k;}
virtual const V & value() const { return i->v; }
virtual V & value() { return i->v; }
virtual void operator++(int) { i = i->tail; }
virtual void operator++() { i = i->tail; }
virtual bool live() const { return i != NULL; }
operator bool() const { return live(); }
protected:
MapElement<K,V> *i;
};
template <class K, class V> class Map {
public:
#if ! defined linux
Map(const V &default_value);
#else
// work around for '386 g++ on Linux
Map(V default_value);
#endif
~Map();
MapElementIterator<K,V> iterator()
{return MapElementIterator<K,V>(contents);}
int empty() const {return contents == NULL;}
V operator()(K) const;
V& operator[](K);
private:
MapElement<K,V> * contents;
V _default_value;
};
} // namespace
#if ! defined DONT_INCLUDE_TEMPLATE_CODE
#include <basic/Map.c>
#endif
#define instantiate_Map(T1,T2) template class Map<T1,T2>; \
template class MapElement<T1,T2>; \
template class MapElementIterator<T1,T2>;
#define instantiate_MapElement(T1,T2) instantiate_Map(T1,T2)
#define instantiate_MapElementIterator(T1,T2) instantiate_Map(T1,T2)
#endif
|
