mirror of
https://github.com/tribes2/engine.git
synced 2026-01-20 11:44:46 +00:00
643 lines
14 KiB
C++
643 lines
14 KiB
C++
//-----------------------------------------------------------------------------
|
|
// V12 Engine
|
|
//
|
|
// Copyright (c) 2001 GarageGames.Com
|
|
// Portions Copyright (c) 2001 by Sierra Online, Inc.
|
|
//-----------------------------------------------------------------------------
|
|
|
|
#ifndef _TVECTOR_H_
|
|
#define _TVECTOR_H_
|
|
|
|
//Includes
|
|
#ifndef _PLATFORM_H_
|
|
#include "Platform/platform.h"
|
|
#endif
|
|
|
|
#if defined(__BORLANDC__) && (__BORLANDC__ >= 0x500)
|
|
#pragma warn -inl
|
|
#endif
|
|
|
|
#define VectorBlockSize 16
|
|
|
|
//-----------------------------------------------------------------------------
|
|
// A dynamic array class. The vector grows as you insert or append
|
|
// elements. Insertion is fastest at the end of the array. Resizing
|
|
// of the array can be avoided by pre-allocating space using the
|
|
// reserve() method.
|
|
|
|
// ***WARNING***
|
|
// This template does not initialize, construct or destruct any of
|
|
// it's elements. This means don't use this template for elements
|
|
// (classes) that need these operations. This template is intended
|
|
// to be used for simple structures that have no constructors or
|
|
// destructors.
|
|
|
|
#ifdef DEBUG_GUARD
|
|
extern bool VectorResize(U32 *aSize, U32 *aCount, void **arrayPtr, U32 newCount, U32 elemSize,
|
|
const char* fileName,
|
|
const U32 lineNum);
|
|
#else
|
|
extern bool VectorResize(U32 *aSize, U32 *aCount, void **arrayPtr, U32 newCount, U32 elemSize);
|
|
#endif
|
|
|
|
|
|
// Use the following macro to bind a vector to a particular line
|
|
// of the owning class for memory tracking purposes
|
|
#ifdef DEBUG_GUARD
|
|
#define VECTOR_SET_ASSOCIATION(x) x.setFileAssociation(__FILE__, __LINE__)
|
|
#else
|
|
#define VECTOR_SET_ASSOCIATION(x) x
|
|
#endif
|
|
|
|
// =============================================================================
|
|
template<class T>
|
|
class Vector
|
|
{
|
|
protected:
|
|
U32 mElementCount;
|
|
U32 mArraySize;
|
|
T* mArray;
|
|
|
|
#ifdef DEBUG_GUARD
|
|
const char* mFileAssociation;
|
|
U32 mLineAssociation;
|
|
#endif
|
|
|
|
bool resize(U32);
|
|
public:
|
|
Vector(const U32 initialSize = 0);
|
|
Vector(const U32 initialSize, const char* fileName, const U32 lineNum);
|
|
Vector(const char* fileName, const U32 lineNum);
|
|
Vector(const Vector&);
|
|
~Vector();
|
|
|
|
#ifdef DEBUG_GUARD
|
|
void setFileAssociation(const char* file, const U32 line);
|
|
#endif
|
|
|
|
// STL interface
|
|
typedef T value_type;
|
|
typedef T& reference;
|
|
typedef const T& const_reference;
|
|
|
|
typedef T* iterator;
|
|
typedef const T* const_iterator;
|
|
typedef S32 difference_type;
|
|
typedef U32 size_type;
|
|
|
|
Vector<T>& operator=(const Vector<T>& p);
|
|
|
|
iterator begin();
|
|
const_iterator begin() const;
|
|
iterator end();
|
|
const_iterator end() const;
|
|
|
|
S32 size() const;
|
|
bool empty() const;
|
|
|
|
void insert(iterator, const T&);
|
|
void erase(iterator);
|
|
|
|
T& front();
|
|
const T& front() const;
|
|
T& back();
|
|
const T& back() const;
|
|
|
|
void push_front(const T&);
|
|
void push_back(const T&);
|
|
void pop_front();
|
|
void pop_back();
|
|
|
|
T& operator[](U32);
|
|
const T& operator[](U32) const;
|
|
|
|
T& operator[](S32 i) { return operator[](U32(i)); }
|
|
const T& operator[](S32 i ) const { return operator[](U32(i)); }
|
|
|
|
void reserve(U32);
|
|
U32 capacity() const;
|
|
|
|
// Extended interface
|
|
U32 memSize() const;
|
|
T* address() const;
|
|
U32 setSize(U32);
|
|
void increment(U32 = 1);
|
|
void decrement(U32 = 1);
|
|
void insert(U32);
|
|
void erase(U32);
|
|
void erase_fast(U32);
|
|
void erase_fast(iterator);
|
|
void clear();
|
|
void compact();
|
|
|
|
T& first();
|
|
T& last();
|
|
const T& first() const;
|
|
const T& last() const;
|
|
|
|
void set(void * addr, S32 sz);
|
|
|
|
// BJW 8/20/97
|
|
// merge another vector into this one
|
|
void merge(const Vector& p);
|
|
};
|
|
|
|
template<class T> inline Vector<T>::~Vector()
|
|
{
|
|
dFree(mArray);
|
|
}
|
|
|
|
template<class T> inline Vector<T>::Vector(const U32 initialSize)
|
|
{
|
|
#ifdef DEBUG_GUARD
|
|
mFileAssociation = NULL;
|
|
mLineAssociation = 0;
|
|
#endif
|
|
|
|
mArray = 0;
|
|
mElementCount = 0;
|
|
mArraySize = 0;
|
|
if(initialSize)
|
|
reserve(initialSize);
|
|
}
|
|
|
|
template<class T> inline Vector<T>::Vector(const U32 initialSize,
|
|
const char* fileName,
|
|
const U32 lineNum)
|
|
{
|
|
#ifdef DEBUG_GUARD
|
|
mFileAssociation = fileName;
|
|
mLineAssociation = lineNum;
|
|
#else
|
|
fileName;
|
|
lineNum;
|
|
#endif
|
|
|
|
mArray = 0;
|
|
mElementCount = 0;
|
|
mArraySize = 0;
|
|
if(initialSize)
|
|
reserve(initialSize);
|
|
}
|
|
|
|
template<class T> inline Vector<T>::Vector(const char* fileName,
|
|
const U32 lineNum)
|
|
{
|
|
#ifdef DEBUG_GUARD
|
|
mFileAssociation = fileName;
|
|
mLineAssociation = lineNum;
|
|
#else
|
|
fileName;
|
|
lineNum;
|
|
#endif
|
|
|
|
mArray = 0;
|
|
mElementCount = 0;
|
|
mArraySize = 0;
|
|
}
|
|
|
|
template<class T> inline Vector<T>::Vector(const Vector& p)
|
|
{
|
|
#ifdef DEBUG_GUARD
|
|
mFileAssociation = p.mFileAssociation;
|
|
mLineAssociation = p.mLineAssociation;
|
|
#endif
|
|
|
|
mArray = 0;
|
|
resize(p.mElementCount);
|
|
if (p.mElementCount)
|
|
dMemcpy(mArray,p.mArray,mElementCount * sizeof(value_type));
|
|
}
|
|
|
|
|
|
#ifdef DEBUG_GUARD
|
|
template<class T> inline void Vector<T>::setFileAssociation(const char* file,
|
|
const U32 line)
|
|
{
|
|
mFileAssociation = file;
|
|
mLineAssociation = line;
|
|
}
|
|
#endif
|
|
|
|
template<class T> inline U32 Vector<T>::memSize() const
|
|
{
|
|
return capacity() * sizeof(T);
|
|
}
|
|
|
|
template<class T> inline T* Vector<T>::address() const
|
|
{
|
|
return mArray;
|
|
}
|
|
|
|
template<class T> inline U32 Vector<T>::setSize(U32 size)
|
|
{
|
|
if (size > mArraySize)
|
|
resize(size);
|
|
else
|
|
mElementCount = size;
|
|
return mElementCount;
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::increment(U32 delta)
|
|
{
|
|
if ((mElementCount += delta) > mArraySize)
|
|
resize(mElementCount);
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::decrement(U32 delta)
|
|
{
|
|
if (mElementCount > delta)
|
|
mElementCount -= delta;
|
|
else
|
|
mElementCount = 0;
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::insert(U32 index)
|
|
{
|
|
// Assert: index >= 0 && index < mElementCount
|
|
increment();
|
|
dMemmove(&mArray[index + 1],
|
|
&mArray[index],
|
|
(mElementCount - index - 1) * sizeof(value_type));
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::erase(U32 index)
|
|
{
|
|
// Assert: index >= 0 && index < mElementCount
|
|
dMemmove(&mArray[index],
|
|
&mArray[index + 1],
|
|
(mElementCount - index - 1) * sizeof(value_type));
|
|
decrement();
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::erase_fast(U32 index)
|
|
{
|
|
// CAUTION: this operator does maintain list order
|
|
// Copy the last element into the deleted 'hole' and decrement the
|
|
// size of the vector.
|
|
// Assert: index >= 0 && index < mElementCount
|
|
if (index < (mElementCount - 1))
|
|
dMemmove(&mArray[index], &mArray[mElementCount - 1], sizeof(value_type));
|
|
decrement();
|
|
}
|
|
|
|
template<class T> inline T& Vector<T>::first()
|
|
{
|
|
return mArray[0];
|
|
}
|
|
|
|
template<class T> inline const T& Vector<T>::first() const
|
|
{
|
|
return mArray[0];
|
|
}
|
|
|
|
template<class T> inline T& Vector<T>::last()
|
|
{
|
|
AssertFatal(mElementCount != 0, "Error, no last element of a zero sized array!");
|
|
return mArray[mElementCount - 1];
|
|
}
|
|
|
|
template<class T> inline const T& Vector<T>::last() const
|
|
{
|
|
return mArray[mElementCount - 1];
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::clear()
|
|
{
|
|
mElementCount = 0;
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::compact()
|
|
{
|
|
resize(mElementCount);
|
|
}
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
template<class T> inline Vector<T>& Vector<T>::operator=(const Vector<T>& p)
|
|
{
|
|
resize(p.mElementCount);
|
|
if (p.mElementCount)
|
|
dMemcpy(mArray,p.mArray,mElementCount * sizeof(value_type));
|
|
|
|
return *this;
|
|
}
|
|
|
|
template<class T> inline typename Vector<T>::iterator Vector<T>::begin()
|
|
{
|
|
return mArray;
|
|
}
|
|
|
|
template<class T> inline typename Vector<T>::const_iterator Vector<T>::begin() const
|
|
{
|
|
return mArray;
|
|
}
|
|
|
|
template<class T> inline typename Vector<T>::iterator Vector<T>::end()
|
|
{
|
|
return mArray + mElementCount;
|
|
}
|
|
|
|
template<class T> inline typename Vector<T>::const_iterator Vector<T>::end() const
|
|
{
|
|
return mArray +mElementCount;
|
|
}
|
|
|
|
template<class T> inline S32 Vector<T>::size() const
|
|
{
|
|
return S32(mElementCount);
|
|
}
|
|
|
|
template<class T> inline bool Vector<T>::empty() const
|
|
{
|
|
return (mElementCount == 0);
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::insert(iterator p,const T& x)
|
|
{
|
|
S32 index = p - mArray;
|
|
insert(U32(index));
|
|
mArray[index] = x;
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::erase(iterator q)
|
|
{
|
|
erase(U32(q - mArray));
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::erase_fast(iterator q)
|
|
{
|
|
erase_fast(U32(q - mArray));
|
|
}
|
|
|
|
template<class T> inline T& Vector<T>::front()
|
|
{
|
|
return *begin();
|
|
}
|
|
|
|
template<class T> inline const T& Vector<T>::front() const
|
|
{
|
|
return *begin();
|
|
}
|
|
|
|
template<class T> inline T& Vector<T>::back()
|
|
{
|
|
return *end();
|
|
}
|
|
|
|
template<class T> inline const T& Vector<T>::back() const
|
|
{
|
|
return *end();
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::push_front(const T& x)
|
|
{
|
|
insert(0);
|
|
mArray[0] = x;
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::push_back(const T& x)
|
|
{
|
|
increment();
|
|
mArray[mElementCount - 1] = x;
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::pop_front()
|
|
{
|
|
erase(U32(0));
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::pop_back()
|
|
{
|
|
decrement();
|
|
}
|
|
|
|
template<class T> inline T& Vector<T>::operator[](U32 index)
|
|
{
|
|
return mArray[index];
|
|
}
|
|
|
|
template<class T> inline const T& Vector<T>::operator[](U32 index) const
|
|
{
|
|
return mArray[index];
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::reserve(U32 size)
|
|
{
|
|
if (size > mArraySize) {
|
|
S32 ec = S32(mElementCount);
|
|
if (resize(size))
|
|
mElementCount = U32(ec);
|
|
}
|
|
}
|
|
|
|
template<class T> inline U32 Vector<T>::capacity() const
|
|
{
|
|
return mArraySize;
|
|
}
|
|
|
|
template<class T> inline void Vector<T>::set(void * addr, S32 sz)
|
|
{
|
|
setSize(sz);
|
|
if (addr)
|
|
dMemcpy(address(),addr,sz*sizeof(T));
|
|
}
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
template<class T> inline bool Vector<T>::resize(U32 ecount)
|
|
{
|
|
#ifdef DEBUG_GUARD
|
|
return VectorResize(&mArraySize, &mElementCount, (void**) &mArray, ecount, sizeof(T),
|
|
mFileAssociation, mLineAssociation);
|
|
#else
|
|
return VectorResize(&mArraySize, &mElementCount, (void**) &mArray, ecount, sizeof(T));
|
|
#endif
|
|
}
|
|
|
|
// BJW 8/20/97
|
|
// code to merge a vector into this one
|
|
template<class T> inline void Vector<T>::merge(const Vector& p)
|
|
{
|
|
if (p.size()) {
|
|
S32 oldsize = size();
|
|
resize(oldsize + p.size());
|
|
dMemcpy( &mArray[oldsize], p.address(), p.size() * sizeof(T) );
|
|
}
|
|
}
|
|
|
|
//-----------------------------------------------------------------------------
|
|
// Template for vectors of pointers.
|
|
//-----------------------------------------------------------------------------
|
|
|
|
template <class T>
|
|
class VectorPtr : public Vector<void*>
|
|
{
|
|
|
|
VectorPtr(const VectorPtr&); // disallowed
|
|
public:
|
|
VectorPtr();
|
|
VectorPtr(const char* fileName, const U32 lineNum);
|
|
|
|
// STL interface
|
|
typedef T value_type;
|
|
typedef T& reference;
|
|
typedef const T& const_reference;
|
|
|
|
typedef T* iterator;
|
|
typedef const T* const_iterator;
|
|
typedef U32 difference_type;
|
|
typedef U32 size_type;
|
|
|
|
iterator begin();
|
|
const_iterator begin() const;
|
|
iterator end();
|
|
const_iterator end() const;
|
|
|
|
void insert(iterator,const T&);
|
|
void erase(iterator);
|
|
|
|
T& front();
|
|
const T& front() const;
|
|
T& back();
|
|
const T& back() const;
|
|
void push_front(const T&);
|
|
void push_back(const T&);
|
|
|
|
T& operator[](U32);
|
|
const T& operator[](U32) const;
|
|
|
|
// Extended interface
|
|
typedef Vector<void*> Parent;
|
|
T& first();
|
|
T& last();
|
|
const T& first() const;
|
|
const T& last() const;
|
|
void erase_fast(U32);
|
|
void erase_fast(iterator);
|
|
};
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
template<class T> inline VectorPtr<T>::VectorPtr()
|
|
{
|
|
//
|
|
}
|
|
|
|
template<class T> inline VectorPtr<T>::VectorPtr(const char* fileName,
|
|
const U32 lineNum)
|
|
: Vector<void*>(fileName, lineNum)
|
|
{
|
|
//
|
|
}
|
|
|
|
template<class T> inline T& VectorPtr<T>::first()
|
|
{
|
|
return (T&)Parent::first();
|
|
}
|
|
|
|
template<class T> inline const T& VectorPtr<T>::first() const
|
|
{
|
|
return (const T)Parent::first();
|
|
}
|
|
|
|
template<class T> inline T& VectorPtr<T>::last()
|
|
{
|
|
return (T&)Parent::last();
|
|
}
|
|
|
|
template<class T> inline const T& VectorPtr<T>::last() const
|
|
{
|
|
return (const T&)Parent::last();
|
|
}
|
|
|
|
template<class T> inline typename VectorPtr<T>::iterator VectorPtr<T>::begin()
|
|
{
|
|
return (iterator)Parent::begin();
|
|
}
|
|
|
|
template<class T> inline typename VectorPtr<T>::const_iterator VectorPtr<T>::begin() const
|
|
{
|
|
return (const_iterator)Parent::begin();
|
|
}
|
|
|
|
template<class T> inline typename VectorPtr<T>::iterator VectorPtr<T>::end()
|
|
{
|
|
return (iterator)Parent::end();
|
|
}
|
|
|
|
template<class T> inline typename VectorPtr<T>::const_iterator VectorPtr<T>::end() const
|
|
{
|
|
return (const_iterator)Parent::end();
|
|
}
|
|
|
|
template<class T> inline void VectorPtr<T>::insert(iterator i,const T& x)
|
|
{
|
|
Parent::insert( (Parent::iterator)i, (Parent::reference)x );
|
|
}
|
|
|
|
template<class T> inline void VectorPtr<T>::erase(iterator i)
|
|
{
|
|
Parent::erase( (Parent::iterator)i );
|
|
}
|
|
|
|
template<class T> inline void VectorPtr<T>::erase_fast(U32 index)
|
|
{
|
|
// CAUTION: this operator does maintain list order
|
|
// Copy the last element into the deleted 'hole' and decrement the
|
|
// size of the vector.
|
|
// Assert: index >= 0 && index < mElementCount
|
|
if (index < (mElementCount - 1))
|
|
mArray[index] = mArray[mElementCount - 1];
|
|
decrement();
|
|
}
|
|
|
|
template<class T> inline void VectorPtr<T>::erase_fast(iterator i)
|
|
{
|
|
erase_fast(U32(i - iterator(mArray)));
|
|
}
|
|
|
|
template<class T> inline T& VectorPtr<T>::front()
|
|
{
|
|
return *begin();
|
|
}
|
|
|
|
template<class T> inline const T& VectorPtr<T>::front() const
|
|
{
|
|
return *begin();
|
|
}
|
|
|
|
template<class T> inline T& VectorPtr<T>::back()
|
|
{
|
|
return *end();
|
|
}
|
|
|
|
template<class T> inline const T& VectorPtr<T>::back() const
|
|
{
|
|
return *end();
|
|
}
|
|
|
|
template<class T> inline void VectorPtr<T>::push_front(const T& x)
|
|
{
|
|
Parent::push_front((Parent::const_reference)x);
|
|
}
|
|
|
|
template<class T> inline void VectorPtr<T>::push_back(const T& x)
|
|
{
|
|
Parent::push_back((Parent::const_reference)x);
|
|
}
|
|
|
|
template<class T> inline T& VectorPtr<T>::operator[](U32 index)
|
|
{
|
|
return (T&)Parent::operator[](index);
|
|
}
|
|
|
|
template<class T> inline const T& VectorPtr<T>::operator[](U32 index) const
|
|
{
|
|
return (const T&)Parent::operator[](index);
|
|
}
|
|
|
|
#endif //_TVECTOR_H_
|
|
|