Database-system-implementation/InefficientMap.cc at master · jren73/Database-system-implementation · GitHub

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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
#ifndef _INEFFICIENT_MAP_C
#define _INEFFICIENT_MAP_C

#include "InefficientMap.h"
#include "Keyify.cc"

#include <cstdlib>
#include <iostream>

using namespace std;


template <class Key, class Data> void
InefficientMap <Key, Data> :: SuckUp (InefficientMap &suckMe) {
	container.MoveToFinish ();
	suckMe.container.MoveToStart ();
	container.SwapRights (suckMe.container);
}

template <class Key, class Data> void
InefficientMap <Key, Data> :: Swap (InefficientMap &withMe) {
	container.Swap (withMe.container);
}

template <class Key, class Data> void
InefficientMap <Key, Data> :: CopyFrom(InefficientMap <Key, Data>& other) {
	// clean up our content
	InefficientMap empty;
	Swap(empty);

	// scan the other map and insert one element at the time
	for (other.MoveToStart(); !other.AtEnd(); other.Advance()){
		Key myKey;
		myKey.CopyFrom(other.CurrentKey());
		Data myData;
		myData.CopyFrom(other.CurrentData());

		Insert(myKey, myData);
	}
}

template <class Key, class Data> int
InefficientMap <Key, Data> :: Length() {
	int length = container.Length();
	return length;
}

template <class Key, class Data> void
InefficientMap <Key, Data> :: Insert (Key &insertKey, Data &insertData) {
	Node foo;
	foo.key.Swap (insertKey);
	foo.data.Swap (insertData);
	container.Insert (foo);
}

template <class Key, class Data> Data &
InefficientMap <Key, Data> :: Find (Key &findMe) {

	static Data garbage;
	int numRight = container.RightLength ();

	while (container.RightLength () != 0) {
		if (container.Current().key.IsEqual (findMe))
			return container.Current().data;
		container.Advance ();
	}

	container.MoveToStart ();
	while (container.RightLength () != numRight) {
		if (container.Current().key.IsEqual (findMe))
			return container.Current().data;
		container.Advance ();
	}
	return garbage;
}

template <class Key, class Data> int
InefficientMap <Key, Data> :: IsThere (Key &findMe) {

	static Data garbage;
	int numRight = container.RightLength ();
	while (container.RightLength () != 0) {
		if (container.Current().key.IsEqual (findMe)) {
			return 1;
		}
		container.Advance ();
	}

	container.MoveToStart ();
	while (container.RightLength () != numRight) {
		if (container.Current().key.IsEqual (findMe)) {
			return 1;
		}
		container.Advance ();
	}
	return 0;
}

template <class Key, class Data> void
InefficientMap <Key, Data> :: Clear(void) {
	MoveToStart();
	while (!AtEnd()){
		Key key;
		Data data;
		Node foo;
		container.Remove(foo);
		key.Swap(foo.key);
		data.Swap(foo.data);
	}
}

template <class Key, class Data> int
InefficientMap <Key, Data> :: Remove (Key &findMe, Key &putKeyHere,
	Data &putDataHere) {

	int numRight = container.RightLength ();
	Node foo;

	while (container.RightLength () != 0) {
		if (container.Current().key.IsEqual (findMe)) {
			container.Remove (foo);
			putKeyHere.Swap (foo.key);
			putDataHere.Swap (foo.data);
			return 1;
		}
		container.Advance ();
	}

	container.MoveToStart ();
	while (container.RightLength () != numRight) {
		if (container.Current().key.IsEqual (findMe)) {
			container.Remove (foo);
			putKeyHere.Swap (foo.key);
			putDataHere.Swap (foo.data);
			return 1;
		}
		container.Advance ();
	}

	return 0;
}

template <class Key, class Data> Key&
InefficientMap <Key, Data> ::CurrentKey(){ return container.Current().key; }

template <class Key, class Data> Data&
InefficientMap <Key, Data> ::CurrentData(){ return container.Current().data; }

template <class Key, class Data> void
InefficientMap <Key, Data> ::Advance(){ container.Advance();}

template <class Key, class Data> void
InefficientMap <Key, Data> ::Retreat(){ container.Retreat(); }

template <class Key, class Data> void
InefficientMap <Key, Data> ::MoveToStart(){ container.MoveToStart(); }

template <class Key, class Data> void
InefficientMap <Key, Data> ::MoveToFinish(){ container.MoveToFinish(); }

template <class Key, class Data> bool
InefficientMap <Key, Data> ::AtStart(){ return container.AtStart(); }

template <class Key, class Data> bool
InefficientMap <Key, Data> ::AtEnd(){ return container.AtEnd(); }

// redefine operator << for printing
template <class Key, class Data> ostream& operator<<(ostream& output,
	const InefficientMap<Key, Data>& _map) {
	InefficientMap<Key, Data> newObject;
	newObject.Swap(const_cast<InefficientMap<Key, Data>&>(_map));

	output << "[";
	for (newObject.MoveToStart(); !newObject.AtEnd(); newObject.Advance()) {
		if (!newObject.AtStart()) {
			output << ", ";
		}

		output << "(" << newObject.CurrentKey() << ", " << newObject.CurrentData() << ")";
	}
	output << "] : " << newObject.Length();

	newObject.Swap(const_cast<InefficientMap<Key, Data>&>(_map));

	return output;
}

#endif