Stack.h

// WARNING: Changes to this file must be contributed back to Sawyer or else they will
//          be clobbered by the next update from Sawyer.  The Sawyer repository is at
//          https://github.com/matzke1/sawyer.
 
 
 
 
#ifndef Sawyer_Stack_H
#define Sawyer_Stack_H
 
#include <Sawyer/Assert.h>
#include <Sawyer/IndexedList.h>
 
namespace Sawyer {
namespace Container {
 
template<typename T>
class Stack {
public:
    typedef T Value;
private:
    IndexedList<T> items_;
public:
    Stack() {}
 
    template<class Iterator>
    Stack(const boost::iterator_range<Iterator> &range) {
        for (Iterator iter = range.begin(); iter != range.end(); ++iter)
            items_.pushBack(*iter);
    }
 
    // FIXME[Robb P. Matzke 2014-08-06]: we need iterators, values(), begin(), end(), etc.
 
    size_t size() const {
        return items_.size();
    }
 
    bool isEmpty() const {
        return items_.isEmpty();
    }
 
    Value& top() {
        ASSERT_forbid(isEmpty());
        return items_.backValue();
    }
    const Value& top() const {
        ASSERT_forbid(isEmpty());
        return items_.backValue();
    }
    Value& get(size_t idx) {
        ASSERT_require(idx < size());
        return items_[items_.size() - (idx+1)];
    }
    const Value& get(size_t idx) const {
        ASSERT_require(idx < size());
        return items_[items_.size() - (idx+1)];
    }
    Value& operator[](size_t idx) { return get(idx); }
    const Value& operator[](size_t idx) const { return get(idx); }
    Stack& push(const Value &value) {
        items_.pushBack(value);
        return *this;
    }
 
    Value pop() {
        Value v = top();
        items_.erase(items_.size()-1);
        return v;
    }
};
 
} // namespace
} // namespace
 
#endif