ArrayList.h

/*
    Hyperspace Explorer - visualizing higher-dimensional geometry
    Copyright (C) 2010  Lene Preuss <lene.preuss@gmail.com>

    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 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, write to the Free Software Foundation, Inc.,
    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.

*/

#ifndef ARRAYLIST_H
#define ARRAYLIST_H

#include <string>


template <unsigned size, typename T> class ArrayList {

  public:

    ArrayList();
    ArrayList(const T &x);
    ArrayList(const T &head, const ArrayList<size-1, T> &tail);

    const T &head() const;
    T &head();
    const ArrayList<size-1, T> &tail() const;
    ArrayList<size-1, T> &tail();

    const T &operator[](unsigned i) const;
    T &operator[](unsigned i);

    ArrayList<size-1, T> minusElement(unsigned i) const;

    bool contains(const T &x) const;
    
    std::string toString() const;

  private:

    std::pair<T, ArrayList<size-1, T> > _elements;
};


template <typename T> class ArrayList<1, T> {

  public:

    ArrayList();
    ArrayList(const T &x);
    ArrayList(T x, ArrayList<0, T>);
    
    const T &head() const;
    T &head();
    ArrayList<0, T> tail() const;
    
    T &operator[](unsigned);
    const T &operator[](unsigned) const;

    ArrayList<0, T> minusElement(unsigned) const;

    bool contains (const T &x) const;
    
    std::string toString() const;

  private:
    
    T element_;
    
};


template <typename T> class ArrayList<0, T> {

  public:

    ArrayList();
    ArrayList(const T &);
    
    std::string toString() const;
    
};

template<unsigned size, typename T>
bool isPermutation(const ArrayList<size, T> &list1, const ArrayList<size, T> &list2);
template<typename T>
bool isPermutation(const ArrayList<1, T> &list1, const ArrayList<1, T> &list2);

template<typename T> 
ArrayList<1, T> makeArrayList(const T &x0);
template<typename T> 
ArrayList<2, T> makeArrayList(const T &x0, const T &x1);
template<typename T> 
ArrayList<3, T> makeArrayList(const T &x0, const T &x1, const T &x2);
template<typename T> 
ArrayList<4, T> makeArrayList(const T &x0, const T &x1, const T &x2, const T &x3);
template<typename T> 
ArrayList<5, T> makeArrayList(const T &x0, const T &x1, const T &x2, const T &x3, const T &x4);
template<typename T> 
ArrayList<6, T> makeArrayList(const T &x0, const T &x1, const T &x2, const T &x3, const T &x4,
                              const T &x5);
template<typename T> 
ArrayList<7, T> makeArrayList(const T &x0, const T &x1, const T &x2, const T &x3, const T &x4,
                              const T &x5, const T &x6);
template<typename T> 
ArrayList<8, T> makeArrayList(const T &x0, const T &x1, const T &x2, const T &x3, const T &x4,
                              const T &x5, const T &x6, const T &x7);
template<typename T> 
ArrayList<9, T> makeArrayList(const T &x0, const T &x1, const T &x2, const T &x3, const T &x4,
                              const T &x5, const T &x6, const T &x7, const T &x8);
template<typename T> 
ArrayList<10, T> makeArrayList(const T &x0, const T &x1, const T &x2, const T &x3, const T &x4,
                               const T &x5, const T &x6, const T &x7, const T &x8, const T &x9);

#endif // ARRAYLIST_H