/**

  * vim: set ts=4 :

  * =============================================================================

  * SourceMod

  * Copyright (C) 2004-2008 AlliedModders LLC.  All rights reserved.

  * =============================================================================

  *

  * This program is free software; you can redistribute it and/or modify it under

  * the terms of the GNU General Public License, version 3.0, as published by the

  * Free Software Foundation.

  * 

  * This program is distributed in the hope that it will be useful, but WITHOUT

  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS

  * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more

  * details.

  *

  * You should have received a copy of the GNU General Public License along with

  * this program.  If not, see <http://www.gnu.org/licenses/>.

  *

  * As a special exception, AlliedModders LLC gives you permission to link the

  * code of this program (as well as its derivative works) to "Half-Life 2," the

  * "Source Engine," the "SourcePawn JIT," and any Game MODs that run on software

  * by the Valve Corporation.  You must obey the GNU General Public License in

  * all respects for all other code used.  Additionally, AlliedModders LLC grants

  * this exception to all derivative works.  AlliedModders LLC defines further

  * exceptions, found in LICENSE.txt (as of this writing, version JULY-31-2007),

  * or <http://www.sourcemod.net/license.php>.

  *

  * Version: $Id$

  */

 #ifndef _INCLUDE_SOURCEMOD_CELLARRAY_H_

 #define _INCLUDE_SOURCEMOD_CELLARRAY_H_

 #include <stdlib.h>

 #include <string.h>

 extern HandleType_t htCellArray;

 class CellArray

 {

 public:

 	CellArray(size_t blocksize) : m_Data(NULL), m_BlockSize(blocksize), m_AllocSize(0), m_Size(0)

 	{

 	}

 	~CellArray()

 	{

 		free(m_Data);

 	}

 	size_t size() const

 	{

 		return m_Size;

 	}

 	cell_t *push()

 	{

 		if (!GrowIfNeeded(1))

 		{

 			return NULL;

 		}

 		cell_t *arr = &m_Data[m_Size * m_BlockSize];

 		m_Size++;

 		return arr;

 	}

 	cell_t *at(size_t b) const

 	{

 		return &m_Data[b * m_BlockSize];

 	}

 	size_t blocksize() const

 	{

 		return m_BlockSize;

 	}

 	void clear()

 	{

 		m_Size = 0;

 	}

 	bool swap(size_t item1, size_t item2)

 	{

 		/* Make sure there is extra space available */

 		if (!GrowIfNeeded(1))

 		{

 			return false;

 		}

 		cell_t *pri = at(item1);

 		cell_t *alt = at(item2);

 		/* Get our temporary array 1 after the limit */

 		cell_t *temp = &m_Data[m_Size * m_BlockSize];

 		memcpy(temp, pri, sizeof(cell_t) * m_BlockSize);

 		memcpy(pri, alt, sizeof(cell_t) * m_BlockSize);

 		memcpy(alt, temp, sizeof(cell_t) * m_BlockSize);

 		return true;

 	}

 	void remove(size_t index)

 	{

 		/* If we're at the end, take the easy way out */

 		if (index == m_Size - 1)

 		{

 			m_Size--;

 			return;

 		}

 		/* Otherwise, it's time to move stuff! */

 		size_t remaining_indexes = (m_Size - 1) - index;

 		cell_t *src = at(index + 1);

 		cell_t *dest = at(index);

 		memmove(dest, src, sizeof(cell_t) * m_BlockSize * remaining_indexes);

 		m_Size--;

 	}

 	cell_t *insert_at(size_t index)

 	{

 		/* Make sure it'll fit */

 		if (!GrowIfNeeded(1))

 		{

 			return NULL;

 		}

 		/* move everything up */

 		cell_t *src = at(index);

 		cell_t *dst = at(index + 1);

 		memmove(dst, src, sizeof(cell_t) * m_BlockSize * (m_Size-index));

 		m_Size++;

 		return src;

 	}

 	bool resize(size_t count)

 	{

 		if (count <= m_Size)

 		{

 			m_Size = count;

 			return true;

 		}

 		if (!GrowIfNeeded(count - m_Size))

 		{

 			return false;

 		}

 		m_Size = count;

 		return true;

 	}

 	CellArray *clone()

 	{

 		CellArray *array = new CellArray(m_BlockSize);

 		array->m_AllocSize = m_AllocSize;

 		array->m_Size = m_Size;

 		array->m_Data = (cell_t *)malloc(sizeof(cell_t) * m_BlockSize * m_AllocSize);

 		memcpy(array->m_Data, m_Data, sizeof(cell_t) * m_BlockSize * m_Size);

 		return array;

 	}

 	cell_t *base()

 	{

 		return m_Data;

 	}

 	size_t mem_usage()

 	{

 		return m_AllocSize * m_BlockSize * sizeof(cell_t);

 	}

 private:

 	bool GrowIfNeeded(size_t count)

 	{

 		/* Shortcut out if we can store this */

 		if (m_Size + count <= m_AllocSize)

 		{

 			return true;

 		}

 		/* Set a base allocation size of 8 items */

 		if (!m_AllocSize)

 		{

 			m_AllocSize = 8;

 		}

 		/* If it's not enough, keep doubling */

 		while (m_Size + count > m_AllocSize)

 		{

 			m_AllocSize *= 2;

 		}

 		/* finally, allocate the new block */

 		if (m_Data)

 		{

 			m_Data = (cell_t *)realloc(m_Data, sizeof(cell_t) * m_BlockSize * m_AllocSize);

 		} else {

 			m_Data = (cell_t *)malloc(sizeof(cell_t) * m_BlockSize * m_AllocSize);

 		}

 		return (m_Data != NULL);

 	}

 private:

 	cell_t *m_Data;

 	size_t m_BlockSize;

 	size_t m_AllocSize;

 	size_t m_Size;

 };

 #endif /* _INCLUDE_SOURCEMOD_CELLARRAY_H_ */