// 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 Sequence_h
#define Sequence_h
#include
#include
#ifndef DEFAULT_SEQ_IMPL
#define DEFAULT_SEQ_IMPL List
#endif
template
class SequenceBase : public MSetBase {
public:
SequenceBase();
SequenceBase(const SequenceBase& s);
SequenceBase(const Collection& c);
SequenceBase(const Container& c);
SequenceBase& operator=(const SequenceBase& c);
//SequenceBase& copy(const SequenceBase& c)
// {*this = c; return *this; }
SequenceBase& operator=(const Collection&c);
DataType type() const { return SEQCOL; }
void insert(Item e) { newSequence(this); store->insert(e); }
void prepend(Item e){ newSequence(this); store->prepend(e); }
void append(Item e) { newSequence(this); store->append(e); }
void insertAfter(Item e, Item after_item);
void insertBefore(Item e, Item before_item);
//MSetBase > unions(Collection& c);
//MSetBase > operator+(Collection& c);
//MSetBase > intersection(Collection& c);
//MSetBase > operator^(Collection& c);
//MSetBase > difference(Collection& c);
//MSetBase > operator-(Collection& c);
ostream& display(ostream& os) const;
//void reverse();
//void swap(Item e1, Item e2);
//SequenceBase positions(Item e); // return type seq
Item element (int i);
SequenceBase subsequence(int i, int j);
int search(SequenceBase* str);
Bool SBmemberQ(SequenceBase* str)
{ return (search(str)==-1 ? FALSE : TRUE); }
Collection* newEmpty() const
{return new SequenceBase; }
//SequenceBase& insert(Item char, int pos)
//SequenceBase& insert(SequenceBase str, int pos)
//SequenceBase& replace(Item char, int pos)
//SequenceBase& replace(SequenceBase str, int pos)
//SequenceBase& remove(int i);
//SequenceBase& remove(int i, int j);
//SequenceBase& operator+(SequenceBase& str)
// { return union(str); }
//SequenceBase& union(SequenceBase& str);
protected:
void newSequence(SequenceBase* s);
void newStore();
//friend class CollectionWrapper;
};
template
class Sequence : public SequenceBase > {
public:
Sequence() {}
Sequence(const Sequence& s) :
SequenceBase >(s) {}
Sequence(const Collection& c) :
SequenceBase >(c) {}
Sequence(const Container& c) :
SequenceBase >(c) {}
Sequence& operator=(const Sequence& s);
Sequence& operator=(const Collection& c);
//friend class CollectionWrapper;
};
#define SEQUENCE(etype, itype) SequenceBase >
#ifdef DEFINE_TEMPLATE
#include
#endif
#endif