amxmodx/dlls/sqlite/sdk/CVector.h

481 lines
7.0 KiB
C
Raw Normal View History

// vim: set ts=4 sw=4 tw=99 noet:
//
// AMX Mod X, based on AMX Mod by Aleksander Naszko ("OLO").
// Copyright (C) The AMX Mod X Development Team.
//
// This software is licensed under the GNU General Public License, version 3 or higher.
// Additional exceptions apply. For full license details, see LICENSE.txt or visit:
// https://alliedmods.net/amxmodx-license
2005-02-15 14:11:01 +00:00
#ifndef __CVECTOR_H__
#define __CVECTOR_H__
#include <assert.h>
// Vector
template <class T> class CVector
{
bool Grow(size_t amount)
2005-02-15 14:11:01 +00:00
{
// automatic grow
size_t newSize = m_Size * 2;
2005-02-15 14:11:01 +00:00
if (newSize == 0)
{
newSize = 8;
}
while (m_CurrentUsedSize + amount > newSize)
{
newSize *= 2;
}
2005-02-15 14:11:01 +00:00
T *newData = new T[newSize];
if (!newData)
return false;
if (m_Data)
{
for (size_t i=0; i<m_CurrentUsedSize; i++)
newData[i] = m_Data[i];
2005-02-15 14:11:01 +00:00
delete [] m_Data;
}
m_Data = newData;
m_Size = newSize;
return true;
}
bool GrowIfNeeded(size_t amount)
2005-02-15 14:11:01 +00:00
{
if (m_CurrentUsedSize + amount >= m_Size)
{
return Grow(amount);
}
2005-02-15 14:11:01 +00:00
else
{
2005-02-15 14:11:01 +00:00
return true;
}
2005-02-15 14:11:01 +00:00
}
bool ChangeSize(size_t size)
{
// change size
if (size == m_Size)
return true;
2006-06-03 19:52:21 +00:00
if (!size)
{
if (m_Data)
{
delete [] m_Data;
m_Data = NULL;
m_Size = 0;
}
return true;
}
2005-02-15 14:11:01 +00:00
T *newData = new T[size];
if (!newData)
return false;
if (m_Data)
{
2006-06-03 19:52:21 +00:00
size_t end = (m_CurrentUsedSize < size) ? (m_CurrentUsedSize) : size;
for (size_t i=0; i<end; i++)
newData[i] = m_Data[i];
2005-02-15 14:11:01 +00:00
delete [] m_Data;
}
m_Data = newData;
m_Size = size;
2006-06-03 19:52:21 +00:00
if (m_CurrentUsedSize > m_Size)
m_CurrentUsedSize = m_Size;
2005-02-15 14:11:01 +00:00
return true;
}
void FreeMemIfPossible()
{
2006-06-03 19:52:21 +00:00
if (!m_Data)
return;
if (!m_CurrentUsedSize)
{
ChangeSize(0);
return;
}
2005-02-15 14:11:01 +00:00
2006-06-03 19:52:21 +00:00
size_t newSize = m_Size;
while (m_CurrentUsedSize <= newSize / 2)
newSize /= 2;
if (newSize != m_Size)
ChangeSize(newSize);
2005-02-15 14:11:01 +00:00
}
protected:
T *m_Data;
size_t m_Size;
size_t m_CurrentUsedSize;
public:
class iterator
{
protected:
T *m_Ptr;
public:
// constructors / destructors
iterator()
{
m_Ptr = NULL;
}
iterator(T * ptr)
{
m_Ptr = ptr;
}
// member functions
T * base()
{
return m_Ptr;
}
const T * base() const
{
return m_Ptr;
}
// operators
T & operator*()
{
return *m_Ptr;
}
T * operator->()
{
return m_Ptr;
}
iterator & operator++() // preincrement
{
++m_Ptr;
return (*this);
}
iterator operator++(int) // postincrement
{
iterator tmp = *this;
++m_Ptr;
return tmp;
}
iterator & operator--() // predecrement
{
--m_Ptr;
return (*this);
}
iterator operator--(int) // postdecrememnt
{
iterator tmp = *this;
--m_Ptr;
return tmp;
}
bool operator==(T * right) const
{
return (m_Ptr == right);
}
bool operator==(const iterator & right) const
{
return (m_Ptr == right.m_Ptr);
}
bool operator!=(T * right) const
{
return (m_Ptr != right);
}
bool operator!=(const iterator & right) const
{
return (m_Ptr != right.m_Ptr);
}
iterator & operator+=(size_t offset)
{
m_Ptr += offset;
return (*this);
}
iterator & operator-=(size_t offset)
{
2006-06-03 19:52:21 +00:00
m_Ptr -= offset;
2005-02-15 14:11:01 +00:00
return (*this);
}
iterator operator+(size_t offset) const
{
iterator tmp(*this);
tmp.m_Ptr += offset;
return tmp;
}
iterator operator-(size_t offset) const
{
iterator tmp(*this);
2006-06-03 19:52:21 +00:00
tmp.m_Ptr -= offset;
2005-02-15 14:11:01 +00:00
return tmp;
}
2006-06-03 19:52:21 +00:00
2005-02-15 14:11:01 +00:00
T & operator[](size_t offset)
{
return (*(*this + offset));
}
const T & operator[](size_t offset) const
{
return (*(*this + offset));
}
bool operator<(const iterator & right) const
{
return m_Ptr < right.m_Ptr;
}
bool operator>(const iterator & right) const
{
return m_Ptr > right.m_Ptr;
}
bool operator<=(const iterator & right) const
{
return m_Ptr <= right.m_Ptr;
}
bool operator>=(const iterator & right) const
{
return m_Ptr >= right.m_Ptr;
}
size_t operator-(const iterator & right) const
{
return m_Ptr - right.m_Ptr;
}
};
// constructors / destructors
CVector<T>()
{
m_Size = 0;
m_CurrentUsedSize = 0;
m_Data = NULL;
}
CVector<T>(const CVector<T> & other)
{
// copy data
m_Data = new T [other.m_CurrentUsedSize];
m_Size = other.m_CurrentUsedSize;
2005-02-15 14:11:01 +00:00
m_CurrentUsedSize = other.m_CurrentUsedSize;
for (size_t i=0; i<other.m_CurrentUsedSize; i++)
m_Data[i] = other.m_Data[i];
2005-02-15 14:11:01 +00:00
}
~CVector<T>()
{
clear();
}
// interface
size_t size() const
{
return m_CurrentUsedSize;
}
size_t capacity() const
{
return m_Size;
}
2006-06-03 19:52:21 +00:00
iterator begin() const
2005-02-15 14:11:01 +00:00
{
return iterator(m_Data);
}
2006-06-03 19:52:21 +00:00
iterator end() const
2005-02-15 14:11:01 +00:00
{
return iterator(m_Data + m_CurrentUsedSize);
}
iterator iterAt(size_t pos)
{
if (pos > m_CurrentUsedSize)
assert(0);
return iterator(m_Data + pos);
}
bool reserve(size_t newSize)
{
2006-06-03 19:52:21 +00:00
if (newSize > m_Size)
return ChangeSize(newSize);
return true;
2005-02-15 14:11:01 +00:00
}
bool push_back(const T & elem)
{
if (!GrowIfNeeded(1))
2005-02-15 14:11:01 +00:00
{
return false;
}
m_Data[m_CurrentUsedSize++] = elem;
2005-02-15 14:11:01 +00:00
return true;
}
void pop_back()
{
--m_CurrentUsedSize;
if (m_CurrentUsedSize < 0)
m_CurrentUsedSize = 0;
2006-06-03 19:52:21 +00:00
FreeMemIfPossible();
2005-02-15 14:11:01 +00:00
}
bool resize(size_t newSize)
{
if (!ChangeSize(newSize))
return false;
2006-06-03 19:52:21 +00:00
m_CurrentUsedSize = newSize;
2005-02-15 14:11:01 +00:00
return true;
}
bool empty() const
{
return (m_CurrentUsedSize == 0);
}
T & at(size_t pos)
{
if (pos > m_CurrentUsedSize)
{
assert(0);
}
return m_Data[pos];
}
const T & at(size_t pos) const
{
if (pos > m_CurrentUsedSize)
{
assert(0);
}
return m_Data[pos];
}
T & operator[](size_t pos)
{
return at(pos);
}
const T & operator[](size_t pos) const
{
return at(pos);
}
T & front()
{
if (m_CurrentUsedSize < 1)
{
assert(0);
}
return m_Data[0];
}
const T & front() const
{
if (m_CurrentUsedSize < 1)
{
assert(0);
}
return m_Data[0];
}
T & back()
{
if (m_CurrentUsedSize < 1)
{
assert(0);
}
return m_Data[m_CurrentUsedSize - 1];
}
const T & back() const
{
if (m_CurrentUsedSize < 1)
{
assert(0);
}
return m_Data[m_CurrentUsedSize - 1];
}
2006-06-03 19:52:21 +00:00
iterator insert(iterator where, const T & value)
2005-02-15 14:11:01 +00:00
{
// validate iter
2006-06-03 19:52:21 +00:00
if (where < m_Data || where > (m_Data + m_CurrentUsedSize))
return iterator(0);
size_t ofs = where - begin();
2005-02-15 14:11:01 +00:00
if (!GrowIfNeeded(1))
2005-02-15 14:11:01 +00:00
{
return false;
}
++m_CurrentUsedSize;
2006-06-03 19:52:21 +00:00
where = begin() + ofs;
// Move subsequent entries
for (T *ptr = m_Data + m_CurrentUsedSize - 2; ptr >= where.base(); --ptr)
*(ptr + 1) = *ptr;
*where.base() = value;
return where;
2005-02-15 14:11:01 +00:00
}
2006-06-03 19:52:21 +00:00
iterator erase(iterator where)
2005-02-15 14:11:01 +00:00
{
// validate iter
if (where < m_Data || where >= (m_Data + m_CurrentUsedSize))
2006-06-03 19:52:21 +00:00
return iterator(0);
size_t ofs = where - begin();
2005-02-15 14:11:01 +00:00
if (m_CurrentUsedSize > 1)
{
// move
2006-06-03 19:52:21 +00:00
T *theend = m_Data + m_CurrentUsedSize;
for (T *ptr = where.base() + 1; ptr < theend; ++ptr)
*(ptr - 1) = *ptr;
2005-02-15 14:11:01 +00:00
}
--m_CurrentUsedSize;
2006-06-03 19:52:21 +00:00
FreeMemIfPossible();
return begin() + ofs;
2005-02-15 14:11:01 +00:00
}
void clear()
{
m_Size = 0;
m_CurrentUsedSize = 0;
2006-06-03 19:52:21 +00:00
if (m_Data)
{
delete [] m_Data;
m_Data = NULL;
}
2005-02-15 14:11:01 +00:00
}
};
#endif // __CVECTOR_H__