bag.h

/* */
/* Bag.h */
/* C++ template example */
/* */

/* Declare a simple container template and some accessories for it. */
template<class T, size_t count>
class Bag
{
public:
    typedef T type;

    Bag();
    ~Bag()                              { m_count = 0; }

    void Add( T* item );
    void Remove( T* item );

    T**                 begin() const   { return m_array; }
    const T* const *    end() const     { return m_array + m_count; }

private:
    T*      m_array[count];
    size_t  m_count;
};

/* Iterate bag members */
#define Bag_foreach( Bag, instance, iterator ) \
Bag::type** iterator##curr = (instance).begin();\
const Bag::type* const * iterator##last = (instance).end();\
Bag::type* iterator = *iterator##curr;\
    for( ; iterator##curr < (Bag::type**)iterator##last; iterator = *++iterator##curr )

/* Add a pointer to the set */
template<class T, size_t count>
void Bag::Add( T* item )
{
    if( m_count < count )
    {
         m_array[m_count++] = item;
    }
    else
    {
        /* Some sort of 'full' handler */
    }
}

/* Construct */
template<class T, size_t count>
Bag::Bag()
{ 
    m_count = 0; 
    memset(m_array,0,sizeof(m_array)); 
}

/* Remove an item */
template<class T, size_t count>
void Bag::Remove( const T* thisOne )
{
    T** search = begin();
    T** last = search + m_count;
    while( search < last )
    {
        if( *search == thisOne )
        {
            *search = --*last;
            *last = NULL;
            --m_count;
            /* Search through whole bag for duplicates */
        }
    }
}