sequence.h

Go to the documentation of this file.

#ifndef SEQUENCE_CLASS
#define SEQUENCE_CLASS

/*****************************************************************************\
*                                                                             *
*  Name   : sequence                                                          *
*  Author : Chris Koeritz                                                     *
*                                                                             *
*******************************************************************************
* Copyright (c) 1989-$now By Author.  This program is free software; you can  *
* redistribute it and/or modify it under the terms of the GNU General Public  *
* License as published by the Free Software Foundation; either version 2 of   *
* the License or (at your option) any later version.  This is online at:      *
*     http://www.fsf.org/copyleft/gpl.html                                    *
* Please send any updates to: fred@gruntose.com                               *
\*****************************************************************************/

#include "array.h"


template <class contents>
class sequence : public array<contents>
{
public:
  inline sequence(int number = 0, const contents *initial = NIL,
          u_short flags = array<contents>::EXPONENTIAL_GROWTH
              | array<contents>::FLUSH_INVISIBLE)
          : array<contents>(number, initial, flags) {}

  inline sequence(const array<contents> &to_copy) : array<contents>(to_copy) {}

  inline bool operator < (const sequence &s2) const
          { return comparator(s2) < 0; }

  inline bool operator <= (const sequence &s2) const
          { return comparator(s2) <= 0; }
  inline bool operator == (const sequence &s2) const
          { return comparator(s2) == 0; }
  inline bool operator != (const sequence &s2) const
          { return comparator(s2) != 0; }
  inline bool operator > (const sequence &s2) const
          { return comparator(s2) > 0; }
  inline bool operator >= (const sequence &s2) const
          { return comparator(s2) >= 0; }

  int find(const contents &to_find, int &position, outcome &outcome) const;

  int find(const sequence &to_find, int &position, outcome &outcome) const;

private:
  int comparator(const sequence &s2) const;

};


class byte_sequence : public sequence<byte>
{
public:
  byte_sequence(int number = 0, const byte *initial_contents = NIL)
    : sequence<byte>(number, initial_contents, SIMPLE_COPY | EXPONE) {}
  byte_sequence(const byte_sequence &to_copy) : sequence<byte>(to_copy) {}
  byte_sequence(const sequence<byte> &to_copy) : sequence<byte>(to_copy) {}
};

class flexichar_sequence : public sequence<flexichar>
{
public:
  flexichar_sequence(int number = 0, const flexichar *initial_contents = NIL)
          : sequence<flexichar>(number, initial_contents, 
              SIMPLE_COPY | EXPONE) {}
  flexichar_sequence(const flexichar_sequence &to_copy)
          : sequence<flexichar>(to_copy) {}
  flexichar_sequence(const sequence<flexichar> &to_copy)
          : sequence<flexichar>(to_copy) {}
};

#endif

---