Logo Search packages:      
Sourcecode: scummvm version File versions  Download package

array.h

/* ScummVM - Scumm Interpreter
 * Copyright (C) 2002-2006 The ScummVM project
 *
 * 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.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
 *
 * $URL: https://svn.sourceforge.net/svnroot/scummvm/scummvm/tags/release-0-9-1/common/array.h $
 * $Id: array.h 21472 2006-03-28 09:42:54Z fingolfin $
 */

#ifndef COMMON_ARRAY_H
#define COMMON_ARRAY_H

#include "common/scummsys.h"
#include <assert.h>

namespace Common {

template <class T>
class Array {
protected:
      int _capacity;
      int _size;
      T *_data;

public:
      typedef T *iterator;
      typedef const T *const_iterator;

public:
      Array<T>() : _capacity(0), _size(0), _data(0) {}
      Array<T>(const Array<T>& array) : _capacity(0), _size(0), _data(0) {
            _size = array._size;
            _capacity = _size + 32;
            _data = new T[_capacity];
            for (int i = 0; i < _size; i++)
                  _data[i] = array._data[i];
      }

#ifdef __SYMBIAN32__
      ~Array()
#else
      ~Array<T>()
#endif
      {
            if (_data)
                  delete [] _data;
      }

      void push_back(const T& element) {
            ensureCapacity(_size + 1);
            _data[_size++] = element;
      }

      void push_back(const Array<T>& array) {
            ensureCapacity(_size + array._size);
            for (int i = 0; i < array._size; i++)
                  _data[_size++] = array._data[i];
      }

      void insert_at(int idx, const T& element) {
            assert(idx >= 0 && idx <= _size);
            ensureCapacity(_size + 1);
            // The following loop is not efficient if you can just memcpy things around.
            // e.g. if you have a list of ints. But for real objects (String...), memcpy
            // usually isn't correct (specifically, for any class which has a non-default
            // copy behaviour. E.g. the String class uses a refCounter which has to be
            // updated whenever a String is copied.
            for (int i = _size; i > idx; i--) {
                  _data[i] = _data[i-1];
            }
            _data[idx] = element;
            _size++;
      }

      T remove_at(int idx) {
            assert(idx >= 0 && idx < _size);
            T tmp = _data[idx];
            for (int i = idx; i < _size - 1; i++)
                  _data[i] = _data[i+1];
            _size--;
            return tmp;
      }

      // TODO: insert, remove, ...

      T& operator [](int idx) {
            assert(idx >= 0 && idx < _size);
            return _data[idx];
      }

      const T& operator [](int idx) const {
            assert(idx >= 0 && idx < _size);
            return _data[idx];
      }

      Array<T>& operator  =(const Array<T>& array) {
            if (_data)
                  delete [] _data;
            _size = array._size;
            _capacity = _size + 32;
            _data = new T[_capacity];
            for (int i = 0; i < _size; i++)
                  _data[i] = array._data[i];

            return *this;
      }

      uint size() const {
            return _size;
      }

      void clear() {
            if (_data) {
                  delete [] _data;
                  _data = 0;
            }
            _size = 0;
            _capacity = 0;
      }

      bool empty() const {
            return (_size == 0);
      }


      iterator          begin() {
            return _data;
      }

      iterator          end() {
            return _data + _size;
      }

      const_iterator    begin() const {
            return _data;
      }

      const_iterator    end() const {
            return _data + _size;
      }

      bool contains(const T &key) const {
            for (const_iterator i = begin(); i != end(); ++i) {
                  if (*i == key)
                        return true;
            }
            return false;
      }


protected:
      void ensureCapacity(int new_len) {
            if (new_len <= _capacity)
                  return;

            T *old_data = _data;
            _capacity = new_len + 32;
            _data = new T[_capacity];

            if (old_data) {
                  // Copy old data
                  for (int i = 0; i < _size; i++)
                        _data[i] = old_data[i];
                  delete [] old_data;
            }
      }
};

} // End of namespace Common

#endif

Generated by  Doxygen 1.6.0   Back to index