//**************************************************************
//
//  CS 240C   : Spring 2003 Ohio University Travis Dillon
//  Project 1 : A Templated Set Class
//  file      : bag.h
//  started   : 04-07-03
//
//**************************************************************

#ifndef BAG_H
#define BAG_H

#include "node.h"
template <typename T>
class Bag
{
 public:
   Bag();  //default c-tor
   Bag(const Bag& in);  //copy c-tor
   Bag& operator =(const Bag& rop);  //assignment operator
   ~Bag();  //x-tor
   bool iselement(T ele)const;  //check if element of list
   bool issubset(const Bag& in)const;   //if list is derived from other
   friend ostream& operator << <> (ostream& os, const Bag<T>& rop);
   friend Bag<T> operator + <> (const Bag<T>& lop, const Bag<T>& rop);
   friend Bag<T> operator * <> (const Bag<T>& lop, const Bag<T>& rop);
   friend Bag<T> operator - <> (const Bag<T>& lop, const Bag<T>& rop);
   void insert(T in_data);   //insert data into bag
   void strip();  //delete all nodes in list
   T grab();  //return random element of the bag
 private:
   Node<T>* first;
   int count;
};

#include "bag.template"
#endif  //BAG_H