#ifndef STACK_H
#define STACK_H

#include "data/ArrayList.h"
#include "data/List.h"

namespace Core {
    namespace Internal {
        template<typename T, typename S>
        class BaseStack final {
            S data;

        public:
            // returns true on error
            template<typename... Args>
            check_return bool push(Args&&... args) {
                return data.add(Core::forward<Args>(args)...);
            }

            void clear() {
                data.clear();
            }

            // returns true on error
            check_return bool pop() {
                // removeBySwap is checked
                return data.removeBySwap(data.getLength() - 1);
            }

            bool isEmpty() const {
                return data.getLength() == 0;
            }

            T& peek() {
                return data[data.getLength() - 1];
            }

            const T& peek() const {
                return data[data.getLength() - 1];
            }

            // returns true on error
            template<int L>
            check_return bool toString(ArrayString<L>& s) const {
                return s.append(data);
            }
        };
    }

    template<typename T>
    using ListStack = Internal::BaseStack<T, List<T>>;

    template<typename T, int N>
    using ArrayStack = Internal::BaseStack<T, ArrayList<T, N>>;
}

#endif