common/tarray.h

Go to the documentation of this file.

// Emacs style mode select   -*- C++ -*- 
//-----------------------------------------------------------------------------
//
// $Id: tarray.h 1788 2010-08-24 04:42:57Z russellrice $
//
// Copyright (C) 1998-2006 by Randy Heit (ZDoom).
// Copyright (C) 2006-2010 by The Odamex Team.
//
// This program 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
// of the License, or (at your option) any later version.
//
// 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.
//
// DESCRIPTION:
//      TARRAY
//
//-----------------------------------------------------------------------------


#ifndef __TARRAY_H__
#define __TARRAY_H__

#include <stdlib.h>
#include <string.h>
#include "m_alloc.h"

template <class T>
class TArray
{
public:
        TArray ()
        {
                Most = 0;
                Count = 0;
                Array = NULL;
        }
        TArray (int max)
        {
                Most = max;
                Count = 0;
                Array = (T *)Malloc (sizeof(T)*max);
        }
        ~TArray ()
        {
                M_Free (Array);
        }
        T &operator[] (size_t index) const
        {
                return Array[index];
        }
        size_t Push (T item)
        {
                if (Count >= Most)
                {
                        Most = Most ? Most * 2 : 16;
                        Array = (T *)Realloc (Array, sizeof(T)*Most);
                }
                Array[Count] = item;
                return Count++;
        }
        bool Pop (T &item)
        {
                if (Count > 0)
                {
                        item = Array[--Count];
                        return true;
                }
                return false;
        }
        size_t Size ()
        {
                return Count;
        }
        size_t Max ()
        {
                return Most;
        }
        void Clear ()
        {
                Count = 0;
        }
private:
        T *Array;
        size_t Most;
        size_t Count;
};

#endif //__TARRAY_H__