dvander@1156: /**
dvander@1156: * vim: set ts=4 :
ds@1330: * =============================================================================
dvander@1231: * SourceMod
dvander@1231: * Copyright (C) 2004-2007 AlliedModders LLC. All rights reserved.
ds@1330: * =============================================================================
dvander@1156: *
ds@1330: * This program is free software; you can redistribute it and/or modify it under
ds@1330: * the terms of the GNU General Public License, version 3.0, as published by the
ds@1330: * Free Software Foundation.
dvander@1231: *
ds@1330: * This program is distributed in the hope that it will be useful, but WITHOUT
ds@1330: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
ds@1330: * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
ds@1330: * details.
dvander@1231: *
ds@1330: * You should have received a copy of the GNU General Public License along with
ds@1330: * this program. If not, see .
dvander@1231: *
ds@1330: * As a special exception, AlliedModders LLC gives you permission to link the
ds@1330: * code of this program (as well as its derivative works) to "Half-Life 2," the
ds@1330: * "Source Engine," the "SourcePawn JIT," and any Game MODs that run on software
ds@1330: * by the Valve Corporation. You must obey the GNU General Public License in
ds@1330: * all respects for all other code used. Additionally, AlliedModders LLC grants
ds@1330: * this exception to all derivative works. AlliedModders LLC defines further
ds@1330: * exceptions, found in LICENSE.txt (as of this writing, version JULY-31-2007),
ds@1330: * or .
dvander@1156: *
dvander@1156: * Version: $Id$
dvander@1156: */
dvander@1156:
dvander@1156: #include
dvander@1156: #include
dvander@1156:
dvander@1156: class CellArray
dvander@1156: {
dvander@1156: public:
dvander@1156: CellArray(size_t blocksize) : m_Data(NULL), m_BlockSize(blocksize), m_AllocSize(0), m_Size(0)
dvander@1156: {
dvander@1156: }
dvander@1156: ~CellArray()
dvander@1156: {
dvander@1156: free(m_Data);
dvander@1156: }
dvander@1156: size_t size() const
dvander@1156: {
dvander@1156: return m_Size;
dvander@1156: }
dvander@1156: cell_t *push()
dvander@1156: {
dvander@1156: if (!GrowIfNeeded(1))
dvander@1156: {
dvander@1156: return NULL;
dvander@1156: }
dvander@1156: cell_t *arr = &m_Data[m_Size * m_BlockSize];
dvander@1156: m_Size++;
dvander@1156: return arr;
dvander@1156: }
dvander@1156: cell_t *at(size_t b) const
dvander@1156: {
dvander@1156: return &m_Data[b * m_BlockSize];
dvander@1156: }
dvander@1156: size_t blocksize() const
dvander@1156: {
dvander@1156: return m_BlockSize;
dvander@1156: }
dvander@1156: void clear()
dvander@1156: {
dvander@1156: m_Size = 0;
dvander@1156: }
dvander@1156: bool swap(size_t item1, size_t item2)
dvander@1156: {
dvander@1156: /* Make sure there is extra space available */
dvander@1156: if (!GrowIfNeeded(1))
dvander@1156: {
dvander@1156: return false;
dvander@1156: }
dvander@1156:
dvander@1156: cell_t *pri = at(item1);
dvander@1156: cell_t *alt = at(item2);
dvander@1156:
dvander@1156: /* Get our temporary array 1 after the limit */
dvander@1156: cell_t *temp = &m_Data[m_Size * m_BlockSize];
dvander@1156:
dvander@1156: memcpy(temp, pri, sizeof(cell_t) * m_BlockSize);
dvander@1156: memcpy(pri, alt, sizeof(cell_t) * m_BlockSize);
dvander@1156: memcpy(alt, temp, sizeof(cell_t) * m_BlockSize);
dvander@1156:
dvander@1156: return true;
dvander@1156: }
dvander@1156: void remove(size_t index)
dvander@1156: {
dvander@1156: /* If we're at the end, take the easy way out */
dvander@1156: if (index == m_Size - 1)
dvander@1156: {
dvander@1156: m_Size--;
dvander@1156: return;
dvander@1156: }
dvander@1156:
dvander@1156: /* Otherwise, it's time to move stuff! */
dvander@1156: size_t remaining_indexes = (m_Size - 1) - index;
dvander@1156: cell_t *src = at(index + 1);
dvander@1156: cell_t *dest = at(index);
dvander@1156: memmove(dest, src, sizeof(cell_t) * m_BlockSize * remaining_indexes);
dvander@1156:
dvander@1156: m_Size--;
dvander@1156: }
dvander@1156: cell_t *insert_at(size_t index)
dvander@1156: {
dvander@1156: /* Make sure it'll fit */
dvander@1156: if (!GrowIfNeeded(1))
dvander@1156: {
dvander@1156: return NULL;
dvander@1156: }
dvander@1156:
dvander@1156: /* move everything up */
dvander@1156: cell_t *src = at(index);
dvander@1156: cell_t *dst = at(index + 1);
dvander@1156: memmove(dst, src, sizeof(cell_t) * m_BlockSize * m_Size);
dvander@1156:
dvander@1156: m_Size++;
dvander@1156:
dvander@1156: return src;
dvander@1156: }
dvander@1156: bool resize(size_t count)
dvander@1156: {
dvander@1156: if (count <= m_Size)
dvander@1156: {
dvander@1156: m_Size = count;
dvander@1156: return true;
dvander@1156: }
teame06@1198:
teame06@1198: if(!GrowIfNeeded(count - m_Size))
teame06@1198: {
teame06@1198: return false;
teame06@1198: }
teame06@1198:
teame06@1198: m_Size = count;
teame06@1198: return true;
dvander@1156: }
dvander@1156: private:
dvander@1156: bool GrowIfNeeded(size_t count)
dvander@1156: {
dvander@1156: /* Shortcut out if we can store this */
dvander@1156: if (m_Size + count <= m_AllocSize)
dvander@1156: {
dvander@1156: return true;
dvander@1156: }
dvander@1156: /* Set a base allocation size of 8 items */
dvander@1156: if (!m_AllocSize)
dvander@1156: {
dvander@1156: m_AllocSize = 8;
dvander@1156: }
dvander@1156: /* If it's not enough, keep doubling */
dvander@1156: while (m_Size + count > m_AllocSize)
dvander@1156: {
dvander@1156: m_AllocSize *= 2;
dvander@1156: }
dvander@1156: /* finally, allocate the new block */
dvander@1156: if (m_Data)
dvander@1156: {
dvander@1156: m_Data = (cell_t *)realloc(m_Data, sizeof(cell_t) * m_BlockSize * m_AllocSize);
dvander@1156: } else {
dvander@1156: m_Data = (cell_t *)malloc(sizeof(cell_t) * m_BlockSize * m_AllocSize);
dvander@1156: }
dvander@1156: return (m_Data != NULL);
dvander@1156: }
dvander@1156: private:
dvander@1156: cell_t *m_Data;
dvander@1156: size_t m_BlockSize;
dvander@1156: size_t m_AllocSize;
dvander@1156: size_t m_Size;
dvander@1156: };