/**
	This file is a part of rexy's general purpose library
	Copyright (C) 2020 rexy712

	This program is free software: you can redistribute it and/or modify
	it under the terms of the GNU Affero General Public License as published by
	the Free Software Foundation, either version 3 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 Affero General Public License for more details.

	You should have received a copy of the GNU Affero General Public License
	along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

#ifndef REXY_CX_ARRAY_HPP
#define REXY_CX_ARRAY_HPP

#include <cstddef> //size_t
#include "utility.hpp" //swap

#include <type_traits>

namespace rexy::cx{

	template<class T, size_t N>
	class array
	{
	public:
		using value_type = T;
		using size_type = size_t;
		using difference_type = ptrdiff_t;
		using reference = T&;
		using const_reference = const T&;
		using pointer = T*;
		using const_pointer = const T*;
		using iterator = T*;
		using const_iterator = const T*;

		static constexpr size_type max_elements = N;

	private:
		T m_elements[N] = {};

	public:
		constexpr reference at(size_type pos)noexcept{
			return m_elements[pos];
		}
		constexpr const_reference at(size_type pos)const noexcept{
			return m_elements[pos];
		}
		constexpr reference operator[](size_type pos)noexcept{
			return m_elements[pos];
		}
		constexpr const_reference operator[](size_type pos)const noexcept{
			return m_elements[pos];
		}
		constexpr reference front(void)noexcept{
			return m_elements[0];
		}
		constexpr const_reference front(void)const noexcept{
			return m_elements[0];
		}
		constexpr reference back(void)noexcept{
			return m_elements[max_elements-1];
		}
		constexpr const_reference back(void)const noexcept{
			return m_elements[max_elements-1];
		}
		constexpr pointer data(void)noexcept{
			return m_elements;
		}
		constexpr const_pointer data(void)const noexcept{
			return m_elements;
		}

		constexpr iterator begin(void)noexcept{
			return m_elements;
		}
		constexpr const_iterator begin(void)const noexcept{
			return m_elements;
		}
		constexpr const_iterator cbegin(void)const noexcept{
			return m_elements;
		}
		constexpr iterator end(void)noexcept{
			return m_elements+max_elements;
		}
		constexpr const_iterator end(void)const noexcept{
			return m_elements+max_elements;
		}
		constexpr const_iterator cend(void)const noexcept{
			return m_elements+max_elements;
		}
		constexpr bool empty(void)const noexcept{
			if constexpr(max_elements == 0){
				return true;
			}else{
				return false;
			}
		}
		constexpr size_type size(void)const noexcept{
			return max_elements;
		}
		constexpr size_type max_size(void)const noexcept{
			return max_elements;
		}
		constexpr void fill(const T& value)
			noexcept(std::is_nothrow_copy_assignable<T>::value)
		{
			for(auto it = begin();it != end();++it){
				*it = value;
			}
		}
		constexpr void swap(array& other)
			noexcept(noexcept(cx::swap(m_elements[0], other.m_elements[0])))
		{
			for(size_type i = 0;i < max_size();++i){
				cx::swap(m_elements[i], other.m_elements[i]);
			}
		}
	};

	template<class T, class... Us>
	array(T, Us...) -> array<T, 1 + sizeof...(Us)>;

}

#endif