legoPSet.H

Go to the documentation of this file.

/*------------------------------------------------------------------------*/
/*  Name:           legoPSet.H                                            */
/*  Designer:       Willie Glover                                         */
/*  Date:           5/16/96                                               */
/*                                                                        */
/*  Description:    Defines template class legoPSet which is a set        */
/*                     container that holds pointers to legoOps and       */
/*                     lRegions.                                          */
/*                                                                        */
/*  12/05/96 WAH:   Added copy constructor for legoPSet.                  */
/*  2/13/97 WAH:    Added Detach method to remove an item without ever    */
/*                  destroying it.                                        */
/*  3/7/97 WAH:     Added Replace method to replace an item with another  */
/*                  item (an in-place swap).                              */
/*  3/16/97 WAH:    Added Search and Insert methods.                      */
/*  2/18/98 WAH:    Made destructor virtual.
/*------------------------------------------------------------------------*/

#if !defined( LEGOPSET_H )
#define LEGOPSET_H

//#if !defined( LEGOMORE_H )
//#include "legoMore.H"
//#endif

#if !defined( LEGOPARR_H )
#include "legoPArr.H"
#endif

template <class T> class legoPSetIterator;

template <class T> class legoPSet
{

protected:

    legoPArr<T> Data;          // this instance of lego array of pointers

public:

    friend legoPSetIterator<T>;
/*
 *   construct a legoPArr of size 4 and increment 4
 */
    legoPSet() : Data(4,4)
    {
      //      fprintf(stderr,"Creating LEGOPSET %p\n",this);
    }

  legoPSet(const legoPSet<T> &);

    virtual ~legoPSet()
    {
      //      fprintf(stderr,"Deleting LEGOPSET %p\n",this);
    }

    int AddItem( T t )
    {
       //   if ( Data.Search((void*)t,1) ) { return 0; }
          return Data.AddItem((void*)t); 
    }

    void Replace ( T item, unsigned index )
    {
      Data.Replace( item, index );
    }

    int IsEmpty() const
        { return Data.IsEmpty(); }

    int IsFull() const
        { return 0; }

    int GetCount() const
        { return Data.GetCount(); }

    T GetItem(unsigned index)
        { return Data[index]; }

    void DestroyItem(unsigned index)
        { Data.DestroyItem( index ); }

    void Detach(unsigned index)
    {
      int sd = Data.shouldDelete;

      Data.shouldDelete = false;
      Data.DestroyItem( index );
      Data.shouldDelete = sd;
    }

    void Insert (T item, unsigned index, unsigned count = 1)
    {
      Data.Insert (item, index, count);
    }

    unsigned Search (T item, int direction = +1)
    {
      return Data.Search (item, direction);
    }


//
//  int HasMember( const T *t ) const
//      { return Data.Search(t,1) != UINT_MAX; }
//
//  void Flush()
//      { Data.PEmpty(); }
//
//  T *Find( T *t ) const
//      {
//      unsigned loc = Data.Find(t);
//      return ( loc == UINT_MAX ? 0 : STATIC_CAST(T *,Data[loc]) );
//     }
//
//  void ForEach( IterFunc iter, void *args )
//      { Data.ForEach( iter, args, 0, Data.Top() ); }
//
//  T *FirstThat( CondFunc cond, void *args ) const
//      { return Data.FirstThat( cond, args, 0, Data.Top() ); }
//
//  T *LastThat( CondFunc cond, void *args ) const
//      { return Data.LastThat( cond, args, 0, Data.Top() ); }

};

template <class T> legoPSet<T>::legoPSet (const legoPSet<T> &orig)
{
  //  fprintf(stderr,"Creating LEGOPSET %p\n",this);
  Data = orig.Data;
} // end copy constructor

/*-------------------------- Iterator ----------------------------*/

template <class T> class legoPSetIterator :
    public legoPArrItr<T>
{

public:

    legoPSetIterator( const legoPArr<T>& s ) :
        legoPArrItr<T>(s) {}

};

#endif  // LEGOPSET_H

---