blob: dae9ca43d68696ed23c0a8a9a8fb5586b6a97f2c (
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
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
|
/* Starshatter: The Open Source Project
Copyright (c) 2021-2022, Starshatter: The Open Source Project Contributors
Copyright (c) 2011-2012, Starshatter OpenSource Distribution Contributors
Copyright (c) 1997-2006, Destroyer Studios LLC.
AUTHOR: John DiCamillo
OVERVIEW
========
Declaration of the Dictionary class
*/
#ifndef Dictionary_h
#define Dictionary_h
#include "Text.h"
// +-------------------------------------------------------------------+
template <class T> class Dictionary;
template <class T> class DictionaryIter;
template <class T> class DictionaryCell;
// +-------------------------------------------------------------------+
template <class T> class Dictionary
{
public:
Dictionary();
~Dictionary();
T& operator[](const Text& key);
void insert(const Text& key, const T& val);
void remove(const Text& key);
void clear();
int size() const { return items; }
int isEmpty() const { return !items; }
int contains(const Text& key) const;
T find(const Text& key, T defval) const;
private:
void init();
int items;
typedef DictionaryCell<T>* PTR;
PTR table[256];
friend class DictionaryIter<T>;
};
// +-------------------------------------------------------------------+
template <class T> class DictionaryIter
{
public:
DictionaryIter(Dictionary<T>& l);
~DictionaryIter();
int operator++(); // prefix
void reset();
void forth();
Text key() const;
T value() const;
void attach(Dictionary<T>& l);
Dictionary<T>& container();
private:
Dictionary<T>* dict;
DictionaryCell<T>* here;
int chain;
};
// +-------------------------------------------------------------------+
template <class T> class DictionaryCell
{
public:
DictionaryCell(const Text& k) : key(k), value( ), next(0) { }
DictionaryCell(const Text& k, const T& v) : key(k), value(v), next(0) { }
~DictionaryCell() { }
Text key;
T value;
DictionaryCell<T>* next;
};
// +-------------------------------------------------------------------+
#include "Dictionary.inl"
#endif // Dictionary_h
|
