61 lines
1.3 KiB
Plaintext
61 lines
1.3 KiB
Plaintext
import mem:*;
|
|
import util:*;
|
|
import io:*;
|
|
|
|
typedef template<T> vector (Destructable) {
|
|
|T*| data;
|
|
|int| size;
|
|
|int| available;
|
|
|
|
|vector<T>*| construct() {
|
|
size = 0;
|
|
available = 8;
|
|
data = new<T>(8);
|
|
return this;
|
|
}
|
|
|
|
|void| destruct() {
|
|
delete<T>(data);
|
|
}
|
|
|
|
|bool| resize(|int| newSize) {
|
|
|T*| newData = new<T>(newSize);
|
|
if (!newData)
|
|
return false;
|
|
for (|int| i = 0; i < lesser<int>(size, newSize); i++;)
|
|
newData[i] = data[i];
|
|
delete<T>(data, 0);
|
|
data = newData;
|
|
available = newSize;
|
|
return true;
|
|
}
|
|
|
|
|T| at(|int| index) {
|
|
return get(index);
|
|
}
|
|
|
|
|T| get(|int| index) {
|
|
if (index < 0 || index >= size) {
|
|
println("Vector access out of bounds! Retuning 0th element as sanest option");
|
|
print("Vector tried to access element: ");
|
|
println(index);
|
|
return data[0];
|
|
}
|
|
return data[index];
|
|
}
|
|
|
|
|T*| getBackingMemory() { return data; }
|
|
|
|
|void| set(|int| index, |T| dataIn) {
|
|
if (index < 0 || index >= size)
|
|
return;
|
|
data[index] = dataIn;
|
|
}
|
|
|void| addEnd(|T| dataIn) {
|
|
size++;
|
|
if (size >= available)
|
|
resize(size*2);
|
|
data[size-1] = dataIn;
|
|
}
|
|
};
|