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