---

array.h

Go to the documentation of this file.

// OMICRON ENGINE HEADER FILE
//
// --------------------------------------------------------------------------
// Copyright (C) 2001-2002 by Bjoern Paetzel <kolrabi@gmx.de>
//
// This file is part of the Omicron Engine.
//
// The Omicron Engine 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.
//
// The Omicron Engine  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 The Omicron Engine;  if not,  write to the  Free Software Foundation,
// Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA 
//
// --------------------------------------------------------------------------
// Last modified:       $Date: 2002/12/07 19:02:17 $
// By           :       $Author: kolrabi $
// $Id: array.h,v 1.1.1.1 2002/12/07 19:02:17 kolrabi Exp $ 

/*

  $Log: array.h,v $
  Revision 1.1.1.1  2002/12/07 19:02:17  kolrabi
  initial release


*/
 
/**************************************************************************** 
 **************************************************************************** 
 * TYPES ******************************************************************** 
 **************************************************************************** 
 ****************************************************************************/ 
 
template <class T> class array_c
{ 
protected: 
 
    T           **data;                 
    long        count;                  
 
public: 
 
    array_c()
    { 
        count = 1; 
        data  = new T*[count]; 
        memset(data, 0, sizeof(T*)*count);
    } 

    virtual
    ~array_c()
    {
        AssertThis;

        SafeArrayDelete(data); 
    } 
 
    long
    get_free()
    { 
        AssertThisV;

        long i; 
 
        for (i=0; i<count; i++) 
            if (!data[i]) 
                return i; 
 
        return count; 
    } 

    long
    add(T* ptr)
    { 
        AssertThisV;

        long l = get_free(); 
 
        if (l==INVALID_INDEX) 
            return l; 
 
        set(l,ptr); 
 
        return l; 
    } 

    void
    remove(long i)
    { 
        AssertThis;

        if (i>=count || i<0) 
          return; 
 
        data[i] = NULL; 
    } 

    void
    remove_ptr(T* ptr, bool all = true)
    {
        AssertThis;

        for (slong i=0; i<count; i++)
        {
            if (data[i] == ptr)
            {
                data[i] = NULL;
                if (!all)
                    break;
            }
        }
    }
 
    void
    set(long i, T* ptr)
    { 
        AssertThis;
        AssertReturn1(i>=0)
 
        if (i>=count) 
        { 
            long newcount = i+1; 
 
            T **data2; 
            data2 = new T*[newcount]; 
            memset(data2, 0, sizeof(T*)*newcount);
 
            for (i=0; i<count; i++) 
                data2[i] = data[i]; 

            SafeArrayDelete(data); 
            data = data2; 
 
            count = newcount; 
        } 
 
        data[i] = ptr; 
    } 

    T*
    get(long i)
    { 
        AssertThisV;

        if (i>=count || i<0) 
          return NULL; 
 
        return data[i]; 
    } 

    long
    find(T* ptr)
    { 
        AssertThisValue(INVALID_INDEX);

        long i; 
 
        for (i=0; i<count; i++) 
            if (data[i] == ptr) 
                return i; 
 
        return INVALID_INDEX; 
    } 

    long
    get_count()
    {
        AssertThisValue(INVALID_INDEX);
        return count+1;
    };

    void
    clear()
    { 
        AssertThis;

        SafeArrayDelete(data); 
                count = 1; 
                data = new T*[count]; 
        memset(data, 0, sizeof(T*)*count);
    };
};

---