Seele/src/Engine/Containers/Array.h

#pragma once
#include "EngineTypes.h"
#include <initializer_list>
#include <iterator>
#include <assert.h>
#include <memory_resource>
#include <boost/serialization/serialization.hpp>

#ifndef DEFAULT_ALLOC_SIZE
#define DEFAULT_ALLOC_SIZE 16
#endif

namespace Seele
{
    template <typename T, typename Allocator = std::pmr::polymorphic_allocator<T>>
    struct Array
    {
    public:
        template <typename X>
        class IteratorBase
        {
        public:
            using iterator_category = std::random_access_iterator_tag;
            using value_type = X;
            using difference_type = std::ptrdiff_t;
            using reference = X&;
            using pointer = X*;

            IteratorBase(X *x = nullptr)
                : p(x)
            {
            }
            reference operator*() const
            {
                return *p;
            }
            pointer operator->() const
            {
                return p;
            }
            inline bool operator!=(const IteratorBase &other) const
            {
                return p != other.p;
            }
            inline bool operator==(const IteratorBase &other) const
            {
                return p == other.p;
            }
            inline int operator-(const IteratorBase &other) const
            {
                return (int)(p - other.p);
            }
            IteratorBase &operator++()
            {
                p++;
                return *this;
            }
            IteratorBase &operator--()
            {
                p--;
                return *this;
            }
            IteratorBase operator++(int)
            {
                IteratorBase tmp(*this);
                ++*this;
                return tmp;
            }
            IteratorBase operator--(int)
            {
                IteratorBase tmp(*this);
                --*this;
                return tmp;
            }

        private:
            X *p;
        };
        
        using value_type = T;
        using allocator_type = Allocator;
        using size_type = std::size_t;
        using difference_type = std::ptrdiff_t;
        using pointer = T*;
        using const_pointer = const T*;
        using reference = value_type&;
        using const_reference = const value_type&;

        using Iterator = IteratorBase<T>;
        using ConstIterator = IteratorBase<const T>;
        using iterator = Iterator;
        using const_iterator = ConstIterator;
        using reverse_iterator = std::reverse_iterator<iterator>;
        using const_reverse_iterator = std::reverse_iterator<const_iterator>;

        constexpr Array() noexcept(noexcept(Allocator()))
            : arraySize(0)
            , allocated(DEFAULT_ALLOC_SIZE)
            , allocator(Allocator())
        {
            _data = allocateArray(DEFAULT_ALLOC_SIZE);
            assert(_data != nullptr);
            markIteratorDirty();
        }

        constexpr explicit Array(const allocator_type& alloc)
            : arraySize(0)
            , allocated(DEFAULT_ALLOC_SIZE)
            , allocator(alloc)
        {
            _data = allocateArray(DEFAULT_ALLOC_SIZE);
            assert(_data != nullptr);
            markIteratorDirty();
        }
        constexpr Array(size_type size, const value_type& value, const allocator_type& alloc = allocator_type())
            : arraySize(size)
            , allocated(size)
            , allocator(alloc)
        {
            _data = allocateArray(size);
            for (size_type i = 0; i < size; ++i)
            {
                _data[i] = value;
            }
            markIteratorDirty();
        }
        constexpr explicit Array(size_type size, const allocator_type& alloc = allocator_type())
            : arraySize(size)
            , allocated(size)
            , allocator(alloc)
        {
            _data = allocateArray(size);
            for (size_type i = 0; i < size; ++i)
            {
                std::allocator_traits<allocator_type>::construct(allocator, &_data[i]);
            }
            markIteratorDirty();
        }
        constexpr Array(std::initializer_list<T> init, const allocator_type& alloc = allocator_type())
            : arraySize(init.size())
            , allocated(init.size())
            , allocator(alloc)
        {
            _data = allocateArray(init.size());
            markIteratorDirty();
            std::uninitialized_copy(init.begin(), init.end(), begin());
        }
        Array(const Array &other)
            : arraySize(other.arraySize)
            , allocated(other.allocated)
            , allocator(std::allocator_traits<allocator_type>::select_on_container_copy_construction(other.allocator))
        {
            _data = allocateArray(other.allocated);
            markIteratorDirty();
            std::uninitialized_copy(other.begin(), other.end(), begin());
        }
        Array(Array &&other) noexcept
            : arraySize(std::move(other.arraySize))
            , allocated(std::move(other.allocated))
            , allocator(std::move(other.allocator))
        {
            _data = other._data;
            other._data = nullptr;
            other.allocated = 0;
            other.arraySize = 0;
            markIteratorDirty();
        }
        Array &operator=(const Array &other) noexcept
        {
            if (this != &other)
            {
                if constexpr (std::allocator_traits<allocator_type>::propagate_on_container_copy_assignment::value )
                {
                    if (!std::allocator_traits<allocator_type>::is_always_equal::value
                     && allocator != other.allocator)
                    {
                        deallocateArray(_data, allocated);
                        _data = nullptr;
                    }
                    allocator = other.allocator;
                }
                if(_data == nullptr || other.arraySize > allocated)
                {
                    if(_data != nullptr)
                    {
                        deallocateArray(_data, allocated);
                    }
                    _data = allocateArray(other.allocated);
                    allocated = other.allocated;
                }
                arraySize = other.arraySize;
                markIteratorDirty();
                std::uninitialized_copy(other.begin(), other.end(), begin());
            }
            return *this;
        }
        Array &operator=(Array &&other) noexcept
        {
            if (this != &other)
            {
                if constexpr (std::allocator_traits<allocator_type>::propagate_on_container_move_assignment::value)
                {
                    if (!std::allocator_traits<allocator_type>::is_always_equal::value
                     && allocator != other.allocator)
                    {
                        deallocateArray(_data, allocated);
                        _data = nullptr;
                    }
                    allocator = std::move(other.allocator);
                }
                if (_data != nullptr)
                {
                    deallocateArray(_data, allocated);
                    _data = nullptr;
                }
                allocated = std::move(other.allocated);
                arraySize = std::move(other.arraySize);
                _data = other._data;
                other._data = nullptr;
                markIteratorDirty();
            }
            return *this;
        }
        ~Array()
        {
            clear();
        }

        constexpr bool operator==(const Array &other)
        {
            return _data == other._data;
        }

        constexpr bool operator!=(const Array &other)
        {
            return !(*this == other);
        }

        constexpr iterator find(const value_type &item)
        {
            for (uint32 i = 0; i < arraySize; ++i)
            {
                if (_data[i] == item)
                {
                    return iterator(&_data[i]);
                }
            }
            return endIt;
        }
        constexpr iterator find(value_type&& item)
        {
            for (uint32 i = 0; i < arraySize; ++i)
            {
                if (_data[i] == item)
                {
                    return iterator(&_data[i]);
                }
            }
            return endIt;	
        }
        constexpr allocator_type get_allocator() const
        {
            return allocator;
        }
        constexpr iterator begin() const
        {
            return beginIt;
        }
        constexpr iterator end() const
        {
            return endIt;
        }
        constexpr const_iterator cbegin() const
        {
            return beginIt;
        }
        constexpr const_iterator cend() const
        {
            return endIt;
        }
        constexpr reference add(const value_type &item = value_type())
        {
            return addInternal(item);
        }
        constexpr reference add(value_type&& item)
        {
            return addInternal(std::forward<T>(item));
        }
        constexpr reference addUnique(const value_type &item = value_type())
        {
            iterator it;
            if((it = std::move(find(item))) != endIt)
            {
                return *it;
            }
            return addInternal(item);
        }
        template<typename... args>
        constexpr reference emplace(args... arguments)
        {
            if (arraySize == allocated)
            {
                size_type newSize = arraySize + 1;
                allocated = calculateGrowth(newSize);
                T *tempArray = allocateArray(allocated);
                assert(tempArray != nullptr);
                
                std::uninitialized_move(begin(), end(), Iterator(tempArray));
                deallocateArray(_data, arraySize);
                _data = tempArray;
            }
            std::allocator_traits<allocator_type>::construct(allocator, &_data[arraySize++], arguments...);
            markIteratorDirty();
            return _data[arraySize - 1];
        }
        constexpr void remove(iterator it, bool keepOrder = true)
        {
            remove(it - beginIt, keepOrder);
        }
        constexpr void remove(int index, bool keepOrder = true)
        {
            if (keepOrder)
            {
                for(uint32 i = index; i < arraySize-1; ++i)
                {
                    _data[i] = std::move(_data[i+1]);
                }
            }
            else
            {
                _data[index] = std::move(_data[arraySize - 1]);
            }
            arraySize--;
            markIteratorDirty();
        }
        constexpr void resize(size_type newSize)
        {
            resizeInternal(newSize, std::move(T()));
        }
        constexpr void resize(size_type newSize, const value_type& value)
        {
            resizeInternal(newSize, value);
        }
        constexpr void clear()
        {
            if(_data == nullptr)
            {
                return;
            }
            for(size_type i = 0; i < arraySize; ++i)
            {
                _data[i].~T();
            }
            deallocateArray(_data, allocated);
            _data = nullptr;
            arraySize = 0;
            allocated = 0;
            markIteratorDirty();
        }
        inline size_type indexOf(iterator iterator)
        {
            return iterator - beginIt;
        }
        inline size_type indexOf(const_iterator iterator) const
        {
            return iterator.p - beginIt.p;
        }
        inline size_type indexOf(T& t)
        {
            return indexOf(find(t));
        }
        inline size_type indexOf(const T& t) const
        {
            return indexOf(find(t));
        }
        inline size_type size() const
        {
            return arraySize;
        }
        inline size_type empty() const
        {
            return arraySize == 0;
        }
        inline size_type capacity() const
        {
            return allocated;
        }
        inline pointer data() const
        {
            return _data;
        }
        inline reference front() const
        {
            assert(arraySize > 0);
            return _data[0];
        }
        inline reference back() const
        {
            assert(arraySize > 0);
            return _data[arraySize - 1];
        }
        void pop()
        {
            _data[--arraySize].~T();
            markIteratorDirty();
        }
        constexpr inline reference operator[](size_type index)
        {
            assert(index < arraySize);
            return _data[index];
        }
        constexpr inline const reference operator[](size_type index) const
        {
            assert(index < arraySize);
            return _data[index];
        }
    private:
        size_type calculateGrowth(size_type newSize) const
        {
            const size_type oldCapacity = capacity();

            if (oldCapacity > SIZE_MAX - oldCapacity / 2)
            {
                return newSize; // geometric growth would overflow
            }

            const size_type geometric = oldCapacity + oldCapacity / 2;

            if (geometric < newSize)
            {
                return newSize; // geometric growth would be insufficient
            }

            return geometric; // geometric growth is sufficient
        }
        void markIteratorDirty()
        {
            beginIt = Iterator(_data);
            endIt = Iterator(_data + arraySize);
        }
        T* allocateArray(size_type size)
        {
            T* result = allocator.allocate(size);
            assert(result != nullptr);
            return result;
        }
        void deallocateArray(T* ptr, size_type size)
        {
            allocator.deallocate(ptr, size);
        }
        template<typename Type>
        T& addInternal(Type&& t)
        {
            if (arraySize == allocated)
            {
                size_type newSize = arraySize + 1;
                allocated = calculateGrowth(newSize);
                T *tempArray = allocateArray(allocated);
                for (size_type i = 0; i < arraySize; ++i)
                {
                    std::allocator_traits<allocator_type>::construct(allocator, &tempArray[i], std::forward<Type>(_data[i]));
                }
                deallocateArray(_data, arraySize);
                _data = tempArray;
            }
            std::allocator_traits<allocator_type>::construct(allocator, &_data[arraySize++], std::forward<Type>(t));
            markIteratorDirty();
            return _data[arraySize - 1];
        }
        template<typename Type>
        void resizeInternal(size_type newSize, Type&& value)
        {
            if (newSize <= allocated)
            {
                // The array is already big enough
                if(newSize < arraySize)
                {
                    // But since we are sizing down we destruct some of them
                    for(size_type i = newSize; i < arraySize; ++i)
                    {
                        std::allocator_traits<allocator_type>::destroy(allocator, &_data[i]);
                    }
                }
                else
                {
                    // Or construct the new elements by default
                    for(size_type i = arraySize; i < newSize; ++i)
                    {
                        std::allocator_traits<allocator_type>::construct(allocator, &_data[i], std::move(value));
                    }
                }
                arraySize = newSize;
            }
            else
            {
                // The array is not big enough, so we make a new one
                T *newData = allocateArray(newSize);

                // And move the current elements into that one
                for(size_type i = 0; i < arraySize; ++i)
                {
                    newData[i] = std::forward<Type>(_data[i]);
                }
                // As well as default initialize the others
                for(size_type i = arraySize; i < newSize; ++i)
                {
                    std::allocator_traits<allocator_type>::construct(allocator, &_data[i], std::move(value));
                }
                deallocateArray(_data, allocated);
                arraySize = newSize;
                allocated = newSize;
                _data = newData;
            }
            markIteratorDirty();
        }
        friend class boost::serialization::access;
        template<class Archive>
        void serialize(Archive& ar, const unsigned int)
        {
            ar & arraySize;
            resize(arraySize);
            for(size_type i = 0; i < arraySize; ++i)
                ar & _data[i];
            markIteratorDirty();
        }
        size_type arraySize = 0;
        size_type allocated = 0;
        Iterator beginIt;
        Iterator endIt;
        T *_data = nullptr;
        allocator_type allocator;
    };

    template <typename T, size_t N>
    struct StaticArray
    {
    public:	
        template <typename X>
        class IteratorBase
        {
        public:
            using iterator_category = std::random_access_iterator_tag;
            using value_type = X;
            using difference_type = std::ptrdiff_t;
            using reference = X&;
            using pointer = X*;

            IteratorBase(X *x = nullptr)
                : p(x)
            {
            }
            reference operator*() const
            {
                return *p;
            }
            pointer operator->() const
            {
                return p;
            }
            inline bool operator!=(const IteratorBase &other)
            {
                return p != other.p;
            }
            inline bool operator==(const IteratorBase &other)
            {
                return p == other.p;
            }
            IteratorBase &operator++()
            {
                p++;
                return *this;
            }
            IteratorBase operator++(int)
            {
                IteratorBase tmp(*this);
                ++*this;
                return tmp;
            }
            IteratorBase &operator--()
            {
                p--;
                return *this;
            }
            IteratorBase operator--(int)
            {
                IteratorBase tmp(*this);
                --*this;
                return tmp;
            }
            

        private:
            X *p;
        };
        using value_type = T;
        using size_type = size_t;
        using difference_type = std::ptrdiff_t;
        using pointer = T*;
        using const_pointer = const T*;
        using reference = T&;
        using const_reference = const T&;

        using iterator = IteratorBase<T>;
        using const_iterator = IteratorBase<const T>;

        using reverse_iterator = std::reverse_iterator<iterator>;
        using const_reverse_iterator = std::reverse_iterator<const_iterator>;

        StaticArray()
        {
            beginIt = iterator(_data);
            endIt = iterator(_data + N);
        }
        StaticArray(T value)
        {
            for (int i = 0; i < N; ++i)
            {
                _data[i] = value;
            }
            beginIt = iterator(_data);
            endIt = iterator(_data + N);
        }
        ~StaticArray()
        {
        }
        
        inline size_type size() const
        {
            return N;
        }
        inline pointer data()
        {
            return _data;
        }
        inline const_pointer data() const
        {
            return _data;
        }
        constexpr reference operator[](size_type index) noexcept
        {
            assert(index < N);
            return _data[index];
        }
        constexpr const_reference operator[](size_type index) const noexcept
        {
            assert(index < N);
            return _data[index];
        }
        iterator begin()
        {
            return beginIt;
        }
        iterator end()
        {
            return endIt;
        }
        const_iterator begin() const
        {
            return beginIt;
        }
        const_iterator end() const
        {
            return beginIt;
        }
    private:
        T _data[N];
        iterator beginIt;
        iterator endIt;
        friend class boost::serialization::access;
        template<class Archive>
        void serialize(Archive& ar, const unsigned int version)
        {
            ar & version;
            ar & N;
            ar & _data;
        }
    };
} // namespace Seele