#ifndef __ARRAY_INCLUDE_H
#define __ARRAY_INCLUDE_H

#include "user/lib/Iterator.h"
#include <cstddef>
#include <utility>

namespace bse {

    template<typename T, const std::size_t N>
    class array {
    public:
        using iterator = ContinuousIterator<T>;

    private:
        T buf[N];

    public:
        iterator begin() { return iterator(&buf[0]); }
        iterator end() { return iterator(&buf[N]); }

        T& operator[](std::size_t i) {
            return this->buf[i];
        }

        constexpr const T& operator[](std::size_t i) const {
            return this->buf[i];
        }

        void swap(array<T, N>& other) {
            for (std::size_t i = 0; i < N; ++i) {
                std::swap(this->buf[i], other[i]);
            }
        }

        // Array& other has to have size n:
        // arr1.swap_n<5>(arr2) => arr2 has size 5, arr1 has size >= 5
        template<std::size_t n>
        void swap_n(array<T, n>& other) {
            for (std::size_t i = 0; i < n; ++i) {
                std::swap(this->buf[i], other[i]);
            }
        }

        constexpr std::size_t size() const {
            return N;
        }
    };

}  // namespace bse

#endif