// Copyright (C) 1996 DIMACS Center, Rutgers, The State University of New Jersey
// Author(s): Jonathan Berry
// This software is copyrighted by the DIMACS Center at Rutgers, The State
// University of New Jersey. IT IS PROVIDED AS IS, AND THE AUTHORS, DIMACS, AND
// RUTGERS, THE STATE UNIVERSITY OF NEW JERSEY DISCLAIM
// ALL LIABILITY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL
// DAMAGES ARISING OUT OF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY
// DERIVATIVES THEREOF, EVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
// THE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES,
// INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE, AND NON-INFRINGEMENT. THIS SOFTWARE
// IS PROVIDED ON AN "AS IS" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE
// NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR
// MODIFICATIONS.
// The authors hereby grant permission to use, copy, modify, distribute,
// and license this software and its documentation for any purpose, provided
// that existing copyright notices are retained in all copies and that this
// notice is included verbatim in any distributions. No written agreement,
// license, or royalty fee is required for any of the authorized uses.
// Modifications to this software may be copyrighted by their authors
// and need not follow the licensing terms described here, provided that
// the new terms are clearly indicated on the first page of each file where
// they apply.
// Last File Update: 31-Jul-1996
//
#ifndef Set_h
#define Set_h
#include
#ifndef DEFAULT_SET_IMPL
#define DEFAULT_SET_IMPL SortedList
#endif
template
class SetBase : public MSetBase {
public:
SetBase() : MSetBase() {}
SetBase(const SetBase& s);
SetBase(const Collection&c);
SetBase(const Container&c);
SetBase& operator=(const SetBase& c);
SetBase& operator=(const Collection& c);
//SetBase& copy(const SetBase& c)
// { *this = c; return *this;}
DataType type() const { return SETCOL; }
void insert(Item e);
void append(Item e);
//MSetBase unions(Collection& c);
//MSetBase operator+(Collection& c);
//MSetBase intersection(Collection& c);
//MSetBase operator^(Collection& c);
//MSetBase difference(Collection& c);
//MSetBase operator-(Collection& c);
//MSetBase unions(SetBase& c);
//MSetBase operator+(SetBase& c);
//MSetBase intersection(SetBase& c);
//MSetBase operator^(SetBase& c);
//MSetBase difference(SetBase& c);
//MSetBase operator-(SetBase& c);
int occurrences(Item item) const;
Bool permutationQ() const;
ostream& display(ostream& os) const;
Collection* newEmpty() const
{return new SetBase; }
protected:
void newSet(SetBase* s);
//friend class CollectionWrapper;
};
template
class Set : public SetBase > {
public:
Set() {}
Set(const Set& c) :
SetBase >(c) {}
Set(const Collection& c) :
SetBase >(c) {}
Set(const Container& c) :
SetBase >(c) {}
Set& operator=(const Set& s);
Set& operator=(const Collection& s);
//friend class CollectionWrapper;
};
#define SET(etype, itype) SetBase >
#ifdef DEFINE_TEMPLATE
#include
#endif
#endif