Files
Bento4/Source/C++/Core/Ap4Array.h
2005-11-10 22:52:16 +00:00

153 lines
4.3 KiB
C++

/*****************************************************************
|
| AP4 - Arrays
|
| Copyright 2002 Gilles Boccon-Gibod
|
|
| This file is part of Bento4/AP4 (MP4 Atom Processing Library).
|
| Unless you have obtained Bento4 under a difference license,
| this version of Bento4 is Bento4|GPL.
| Bento4|GPL is free software; you can redistribute it and/or modify
| it under the terms of the GNU General Public License as published by
| the Free Software Foundation; either version 2, or (at your option)
| any later version.
|
| Bento4|GPL 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 Bento4|GPL; see the file COPYING. If not, write to the
| Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
| 02111-1307, USA.
|
****************************************************************/
#ifndef _AP4_ARRAY_H_
#define _AP4_ARRAY_H_
/*----------------------------------------------------------------------
| includes
+---------------------------------------------------------------------*/
#include "Ap4Types.h"
#include "Ap4Results.h"
/*----------------------------------------------------------------------
| constants
+---------------------------------------------------------------------*/
const int AP4_ARRAY_INITIAL_COUNT = 64;
/*----------------------------------------------------------------------
| AP4_Array
+---------------------------------------------------------------------*/
template <typename T>
class AP4_Array
{
public:
// methods
AP4_Array<T>(): m_AllocatedCount(0), m_ItemCount(0), m_Items(0) {}
virtual ~AP4_Array<T>();
AP4_Cardinal ItemCount() { return m_ItemCount; }
AP4_Result Append(const T& item);
T& operator[](unsigned long idx);
AP4_Result EnsureCapacity(AP4_Cardinal count);
protected:
// members
AP4_Cardinal m_AllocatedCount;
AP4_Cardinal m_ItemCount;
T* m_Items;
T m_OverflowItem;
};
/*----------------------------------------------------------------------
| AP4_Array<T>::~AP4_Array<T>
+---------------------------------------------------------------------*/
template <typename T>
AP4_Array<T>::~AP4_Array<T>()
{
delete[] m_Items;
}
/*----------------------------------------------------------------------
| AP4_Array<T>::EnsureCapacity
+---------------------------------------------------------------------*/
template <typename T>
AP4_Result
AP4_Array<T>::EnsureCapacity(AP4_Cardinal count)
{
if (count <= m_AllocatedCount) return AP4_SUCCESS;
unsigned long new_count;
if (m_AllocatedCount) {
new_count = 2*m_AllocatedCount;
} else {
new_count = AP4_ARRAY_INITIAL_COUNT;
}
// (re)allocate the items
T* new_items = new T[new_count];
if (new_items == NULL) {
return AP4_ERROR_OUT_OF_MEMORY;
}
if (m_ItemCount && m_Items) {
for (unsigned int i=0; i<m_ItemCount; i++) {
new_items[i] = m_Items[i];
}
delete[] m_Items;
}
m_Items = new_items;
m_AllocatedCount = new_count;
return AP4_SUCCESS;
}
/*----------------------------------------------------------------------
| AP4_Array<T>::operator[]
+---------------------------------------------------------------------*/
template <typename T>
T&
AP4_Array<T>::operator[](unsigned long idx)
{
if (idx >= m_ItemCount) {
return m_OverflowItem;
} else {
return m_Items[idx];
}
}
/*----------------------------------------------------------------------
| AP4_Array<T>::Append
+---------------------------------------------------------------------*/
template <typename T>
AP4_Result
AP4_Array<T>::Append(const T& item)
{
// ensure capacity
AP4_Result result = EnsureCapacity(m_ItemCount+1);
if (result != AP4_SUCCESS) return result;
// store the item
m_Items[m_ItemCount++] = item;
return AP4_SUCCESS;
}
#endif // _AP4_ARRAY_H_