blob: d0c71a404412d947ddbec1be662fa64b711caf2a (
plain) (
tree)
|
|
using namespace CMem; //strlen and memcpy
template <typename T>
Vector<T>::Vector() {
m_data = 0;
m_size = 0;
}
template <typename T>
Vector<T>::Vector(u32int size) {
m_data = new T[size];
m_size = size;
}
template <typename T>
Vector<T>::Vector(u32int size, T value) {
//m_data = (T*)Mem::kalloc(size * sizeof(T));
m_data = new T[size](value);
m_size = size;
/*for (u32int i = 0; i < size; i++) {
m_data[i] = new(&m_data[i]) T(value);
}*/
}
template <typename T>
Vector<T>::Vector(const Vector<T> &other) {
m_size = other.m_size;
m_data = (T*)Mem::kalloc(m_size * sizeof(T));
for (u32int i = 0; i < m_size; i++) {
new(&m_data[i]) T(other.m_data[i]);
}
}
template <typename T>
Vector<T>& Vector<T>::operator= (const Vector<T> &other) {
if (m_data != 0) delete[] m_data;
m_size = other.m_size;
m_data = (T*)Mem::kalloc(m_size * sizeof(T));
for (u32int i = 0; i < m_size; i++) {
new(&m_data[i]) T(other.m_data[i]);
}
}
template <typename T>
Vector<T>::~Vector() {
if (m_data != 0) delete[] m_data;
}
template <typename T>
T& Vector<T>::operator[] (u32int index) {
return m_data[index];
}
template <typename T>
void Vector<T>::push(T element) {
T* newdata = (T*)Mem::kalloc((m_size + 1) * sizeof(T));
memcpy((u8int*)newdata, (const u8int*) m_data, m_size * sizeof(T));
new(&newdata[m_size]) T(element); //Construct by copy
m_size++;
Mem::kfree(m_data);
m_data = newdata;
}
/* template <typename T>
void Vector<T>::push(T& element) {
T* newdata = (T*)Memory::alloc((m_size + 1) * sizeof(T));
memcpy((u8int*)newdata, (const u8int*) m_data, m_size * sizeof(T));
//memcpy((u8int*)newdata + (m_size * sizeof(T)), (const u8int*) element, sizeof(T)); //Copy
new(&newdata[m_size]) T(element); //Construct by copy
m_size++;
Memory::free(m_data);
m_data = newdata;
} */
template <typename T>
void Vector<T>::pop() {
m_size--;
//delete(&m_data[m_size], &m_data[m_size]); //implicitly call destructor with placement delete
m_data[m_size].~T(); //Call destructor
T* newdata = (T*)Mem::kalloc(m_size * sizeof(T));
memcpy((u8int*)newdata, (const u8int*) m_data, m_size * sizeof(T));
Mem::kfree(m_data);
m_data = newdata;
}
template <typename T>
T& Vector<T>::back() {
return m_data[m_size - 1];
}
template <typename T>
T& Vector<T>::front() {
return m_data[0];
}
template <typename T>
u32int Vector<T>::size() {
return m_size;
}
template <typename T>
bool Vector<T>::empty() {
return m_size == 0;
}
template <typename T>
void Vector<T>::clear() {
if (empty()) return;
Mem::kfree(m_data);
m_data = 0;
m_size = 0;
}
|