// Copyright (C) 2020 Jérôme Leclercq // This file is part of the "Nazara Engine - Core module" // For conditions of distribution and use, see copyright notice in Config.hpp // I'm not proud of those five following lines but ti's hard to do with another way now #ifdef NAZARA_DEBUG_NEWREDEFINITION_DISABLE_REDEFINITION #define NAZARA_DEBUG_NEWREDEFINITION_DISABLE_REDEFINITION_DEFINED #else #define NAZARA_DEBUG_NEWREDEFINITION_DISABLE_REDEFINITION #endif #include #include #include #include #include #include #include namespace Nz { /*! * \ingroup core * \class Nz::StackArray * \brief Core class that represents a stack-allocated (if alloca is present) array */ template StackArray::StackArray() : m_size(0), m_ptr(nullptr) { } template StackArray::StackArray(T* stackMemory, std::size_t size) : m_size(size), m_ptr(stackMemory) { for (std::size_t i = 0; i < m_size; ++i) PlacementNew(&m_ptr[i]); } template StackArray::StackArray(T* stackMemory, std::size_t size, NoInitTag) : m_size(size), m_ptr(stackMemory) { } template StackArray::~StackArray() { for (std::size_t i = 0; i < m_size; ++i) PlacementDestroy(&m_ptr[i]); #ifndef NAZARA_ALLOCA_SUPPORT OperatorDelete(m_ptr); #endif } template typename StackArray::reference StackArray::back() { assert(m_size != 0); return m_ptr[m_size - 1]; } template typename StackArray::const_reference StackArray::back() const { assert(m_size != 0); return m_ptr[m_size - 1]; } template typename StackArray::iterator StackArray::begin() noexcept { return iterator(&m_ptr[0]); } template typename StackArray::const_iterator StackArray::begin() const noexcept { return const_iterator(&m_ptr[0]); } template typename StackArray::const_iterator StackArray::cbegin() const noexcept { return const_iterator(&m_ptr[0]); } template typename StackArray::const_iterator StackArray::cend() const noexcept { return const_iterator(&m_ptr[m_size]); } template typename StackArray::const_reverse_iterator StackArray::crbegin() const noexcept { return const_reverse_iterator(&m_ptr[m_size]); } template typename StackArray::const_reverse_iterator StackArray::crend() const noexcept { return const_reverse_iterator(&m_ptr[0]); } template T* StackArray::data() noexcept { return m_ptr; } template const T* StackArray::data() const noexcept { return m_ptr; } template bool StackArray::empty() const noexcept { return m_size == 0; } template typename StackArray::iterator StackArray::end() noexcept { return iterator(&m_ptr[m_size]); } template typename StackArray::const_iterator StackArray::end() const noexcept { return const_iterator(&m_ptr[m_size]); } template void StackArray::fill(const T& value) { std::fill(begin(), end(), value); } template typename StackArray::reference StackArray::front() noexcept { return m_ptr[0]; } template typename StackArray::const_reference StackArray::front() const noexcept { return m_ptr[0]; } template typename StackArray::size_type StackArray::max_size() const noexcept { return size(); } template typename StackArray::reverse_iterator StackArray::rbegin() noexcept { return reverse_iterator(&m_ptr[m_size]); } template typename StackArray::const_reverse_iterator StackArray::rbegin() const noexcept { return reverse_iterator(&m_ptr[m_size]); } template typename StackArray::reverse_iterator StackArray::rend() noexcept { return reverse_iterator(&m_ptr[0]); } template typename StackArray::const_reverse_iterator StackArray::rend() const noexcept { return reverse_iterator(&m_ptr[0]); } template typename StackArray::size_type StackArray::size() const noexcept { return m_size; } template typename StackArray::reference StackArray::operator[](size_type pos) { assert(pos < m_size); return m_ptr[pos]; } template typename StackArray::const_reference StackArray::operator[](size_type pos) const { assert(pos < m_size); return m_ptr[pos]; } } #include // If we have defined the constant, then we have to undefine it (to avoid bloating in the engine) #ifndef NAZARA_DEBUG_NEWREDEFINITION_DISABLE_REDEFINITION_DEFINED #undef NAZARA_DEBUG_NEWREDEFINITION_DISABLE_REDEFINITION #endif