forked from domaemon/snes9x-sdl
-
Notifications
You must be signed in to change notification settings - Fork 1
/
vector.h
204 lines (179 loc) · 6.08 KB
/
vector.h
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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
#ifndef _VECTOR_H
#define _VECTOR_H
#include <stdlib.h>
#include <assert.h>
#include <iostream.h>
// templated vector class, partially based on Budd,
// Classic Data Structures in C++
// written 11/5/93, modified 3/23/94
// changed on 3/9/95 to make all methods inline (defined in class decl)
//
// for a vector of Items use Vector<Item>, e.g., Vector <int> intvector;
//
// note: Item must have a default constructor
//
// constructors:
// Vector() -- default, vector of size 0 (no entries)
// Vector(int size) -- vector with size entries
// Vector(int size,
// Item fillValue) -- vector w/ size entries all == fillValue
// Vector(const Vector & vec) -- copy constructor
//
// int Length() -- returns size of vector (capacity)
// void SetSize(int newSize) -- resizes the vector to newSize elements
// (can result in losing elements if
// new size < old size)
// void resize(int newSize) -- synonym for SetSize
//
// void Fill(Item fillValue) -- set all entries == fillValue
//
// operator = -- assignment operator works properly
// operator [] -- indexes both const and non-const vectors
//
//
// examples of use:
// Vector<double> dlist(100); // a list of 100 doubles
// Vector<double> dzlist(100,0.0); // initialized to 0.0
//
// Vector<String> slist(300); // 300 strings
//
// Vector<int> ilist; // has room for 0 ints
template <class Item> class Vector
{
public:
Vector() // default constructor 0 elts
// postcondition: vector of zero items constructed
{
myLength = 0; myList = 0;
}
Vector(int size) // specify size of vector
// postcondition: vector of size items constructed
{
myLength = size;
myList = new Item [size];
assert(myList != 0);
}
Vector(int size, Item fillValue) // specify size and fill value
// postcondition: vector of size items, each initialized to fillValue
// constructed
{
myLength = size;
myList = new Item [size];
assert(myList != 0);
for(int k = 0; k < size; k++){
myList[k] = fillValue;
}
}
Vector(const Vector<Item> & vec) // copy constructor
// precondition: Item supports assignment
// postcondition: return copy of vec
{
// allocate storage
myList = new Item [myLength = vec.myLength];
assert(myList != 0);
// copy elements
for(int k = 0; k < vec.myLength; k++)
{
myList[k] = vec.myList[k];
}
}
~Vector () // free new'd storage
// postcondition: dynamically allocated storage freed
{
delete [] myList;
myList = 0;
myLength = 0; // leave in "empty" state
}
Vector & operator = (const Vector<Item> & vec) // overload assignment
// precondition: Item supports assignment
// postcondition: self is assigned vec
{
if (this != &vec) // don't assign to self!
{
delete [] myList; // out with old list, in with new
myList = new Item [myLength = vec.myLength];
assert(myList != 0);
// copy vec
myLength = vec.myLength;
for(int k=0; k < myLength; k++)
{
myList[k] = vec.myList[k];
}
}
return *this;
}
int Length() const // capacity of vector
{
return myLength;
}
int length() const
{
return Length();
}
void Fill(Item fillValue)
// postcondition: all entries == fillvalue
{
int k;
for(k=0; k < myLength; k++)
{
myList[k] = fillValue;
}
}
void SetSize(int newSize) // change size dynamically
// precondition: vector has room for myLength entries
// postcondition: vector has room for newSize entries
// the first myLength of which are copies of original
// unless newSize < myLength, then truncated copy occurs
{
int numToCopy = newSize < myLength ? newSize : myLength;
// allocate new storage
Item * newList = new Item[newSize];
assert(newList != 0); // be sure storage allocated
int k;
for(k=0; k < numToCopy;k++)
{
newList[k] = myList[k];
}
delete [] myList; // de-allocate old storage
myLength = newSize;
myList = newList;
}
void resize(int newSize)
{
SetSize(newSize);
}
Item & operator [] (int index)
// safe indexing, returning reference
// precondition: 0 <= index < myLength
// postcondition: return index-th item
// exception: aborts if index is out-of-bounds
{
if ((unsigned) index >= (unsigned)myLength || index < 0)
{
cerr << "Illegal vector index: " << index
<< " (max = " << myLength-1 << ")" << endl;
assert(index >= 0);
assert(index < myLength);
}
return myList[index];
}
const Item & operator [] (int index) const // const index
// safe indexing, returning const reference to avoid modification
// precondition: 0 <= index < myLength
// postcondition: return index-th item
// exception: aborts if index is out-of-bounds
{
if ((unsigned) index >= (unsigned)myLength || index < 0)
{
cerr << "Illegal vector index: " << index
<< " (max = " << myLength << ")" << endl;
assert(index >= 0);
assert(index < myLength);
}
return myList[index];
}
private:
Item * myList; // the array of items
int myLength; // # things in vector (array), 0,1,...,(myLength-1)
};
#endif // _VECTOR_H not defined