/Users/jst/src/grafalgo/cpp/include/List.h

Go to the documentation of this file.

#ifndef LIST_H
#define LIST_H

#include "Adt.h"
#include "Exceptions.h"

namespace grafalgo {

class List : public Adt {
public:         List(int=26);
                ~List();

        void    clear();
        void    resize(int);
        void    expand(int);

        void    copyFrom(const List&);

        // methods to access items
        index   get(position) const;
        index   next(index) const;
        index   first() const;
        index   last() const;
        int     length() const;

        // predicates
        bool    valid(index) const;
        bool    empty() const;
        bool    member(index) const;
        bool    equals(List&) const;
        bool    isConsistent() const;
        
        // modifiers
        virtual bool insert(index,index);
        virtual bool removeNext(index);
        bool    addFirst(index);
        bool    addLast(index);
        bool    removeFirst();

        // input/output
        string& toString(string&) const;
        friend istream& operator>>(istream&, List&);

protected:
        // managing dynamic storage
        void    makeSpace(int);   
        void    freeSpace();

private:
        int     len;                    
        index   head;                   
        index   tail;                   
        index   *nxt;                   
};

inline index List::next(index i) const { return nxt[i]; }

inline index List::first() const { return head; }

inline index List::last() const { return tail; }

inline bool List::valid(index i) const { return 1 <= i && i <= n(); }

inline bool List::empty() const { return first() == 0; }

inline int List::length() const { return len; }

inline bool List::member(index i) const {
        if (!valid(i)) {
                stringstream ss; ss << "get(" << i << ")";
                string s = ss.str();
                throw IllegalArgumentException(s);
        }
        return nxt[i] != -1;
}

inline bool List::addFirst(index i) { return insert(i,0); }

inline bool List::addLast(index i) { return insert(i,last()); }

inline bool List::removeFirst() { return removeNext(0); }

} // ending namespace

#endif