// sample code for a set of strings
// uses partially filled array
// not order preserving
// not the greatest
// wdg 2009

#include <string>
#include <iostream>
#include "StringSet.h"
using namespace std;

StringSet::StringSet() : count(0), A(new string[MAX_COUNT]) 
{
}

StringSet::StringSet( const StringSet &other) 
                         : count( other.count), A(new string[MAX_COUNT]) 
{
  for(int i=0; i<count; i++)
    A[i] = other.A[i];
}

StringSet::~StringSet()
{
  delete [] A;
}

bool StringSet::contains(string item) const
{
   for(int i=0; i<count; i++)
      if( item==A[i]  )
         return true;
   return false;
}

void StringSet::add(string item) 
{
   if( contains(item) )
      return;
   A[count++]=item;
}
    
void StringSet::remove(string item) 
{
    for(int i=0; i<count; i++)
        if( item==A[i] ) {
            A[i]=A[count-1];
            count--;
            return;
        }
}

bool StringSet::operator== ( const StringSet &other ) const
{
    if( count != other.count ) 
      return false;
    for(int i=0; i<count; i++)
      if( !other.contains(A[i]) )
         return false;
    return true;   
}

ostream &operator<< (ostream &out, const StringSet &myStringSet) 
{
    for(int i=0; i<myStringSet.count-1; i++)
       out << myStringSet.A[i]+":"; 
    out << myStringSet.A[myStringSet.count-1];
    return out;
}