Sequence.h

Go to the documentation of this file.

/*
 * Copyright (C) 2015 Niek Linnenbank
 *
 * 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 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#ifndef __LIBSTD_SEQUENCE_H
#define __LIBSTD_SEQUENCE_H
 
#include "Container.h"
#include "Comparable.h"
#include "Types.h"
#include "Macros.h"
 
template <class T> class Sequence : public Container, public Comparable<Sequence<T> >
{
  public:
 
    virtual int insert(const T & item)
    {
        return -1;
    }
 
    virtual bool insert(Size position, const T & item)
    {
        return false;
    }
 
    virtual void fill(T value)
    {
        Size s = this->size();
 
        for (Size i = 0; i < s; i++)
            insert(i, value);
    }
 
    virtual int remove(T value)
    {
        return 0;
    }
 
    virtual bool removeAt(Size position)
    {
        return false;
    }
 
    virtual void clear()
    {
        Size s = this->size();
 
        for (Size i = 0; i < s; i++)
            removeAt(i);
    }
 
    virtual const T * get(Size position) const = 0;
 
    virtual const T & at(Size position) const = 0;
 
    virtual bool contains(const T value) const
    {
        Size sz = this->size();
 
        for (Size i = 0; i < sz; i++)
            if (at(i) == value)
                return true;
 
        return false;
    }
 
    virtual int compareTo(const Sequence<T> &s) const
    {
        Size sz  = this->size();
        Size cnt = this->count();
 
        // Size must be equal
        if (s.size() != sz)
            return s.size() - sz;
 
        // Count must be equal
        if (s.count() != cnt)
            return s.count() - cnt;
 
        // All elements must be equal
        for (Size i = 0; i < cnt; i++)
        {
            if (at(i) != s.at(i))
            {
                return i + 1;
            }
        }
        return 0;
    }
 
    virtual bool equals(const Sequence<T> &s) const
    {
        return compareTo(s) == 0;
    }
 
    const T & operator [] (int i) const
    {
        return at(i);
    }
 
    const T & operator [] (Size i) const
    {
        return at(i);
    }
 
    T & operator [] (int i)
    {
        return (T &) at(i);
    }
 
    T & operator [] (Size i)
    {
        return (T &) at(i);
    }
};
 
#endif /* __LIBSTD_SEQUENCE_H */