Array.inl

/*
 * Copyright(c) Sophist Solutions, Inc. 1990-2026.  All rights reserved
 */
#include <optional>
 
#include "Stroika/Foundation/Containers/Support/ReserveTweaks.h"
#include "Stroika/Foundation/Debug/Assertions.h"
#include "Stroika/Foundation/Execution/Throw.h"
#include "Stroika/Foundation/Memory/Common.h"
 
namespace Stroika::Foundation::Containers::DataStructures {
 
// Would like to leave on by default but we just added and cannot afford to have debug builds get that slow
#ifndef qStroika_Foundation_Containers_DataStructures_Array_IncludeSlowDebugChecks_
#define qStroika_Foundation_Containers_DataStructures_Array_IncludeSlowDebugChecks_ 0
#endif
 
    /*
     ********************************************************************************
     *********************************** Array<T> ***********************************
     ********************************************************************************
     */
    template <typename T>
    inline void Array<T>::Invariant () const noexcept
    {
#if qStroika_Foundation_Debug_AssertionsChecked
        Invariant_ ();
#endif
    }
    template <typename T>
    Array<T>::Array (const Array& from)
    {
        from.Invariant ();
        reserve (from.size ());
 
        /*
         *  Construct the new items in-place into the new memory.
         */
        size_t newLength = from.size ();
        if (newLength > 0) {
            T*       lhs = &fItems_[0];
            const T* rhs = &from.fItems_[0];
            T*       end = &fItems_[newLength];
            do {
                new (lhs) T{*rhs++};
            } while (++lhs < end);
        }
        fLength_ = newLength;
        Invariant ();
    }
    template <typename T>
    Array<T>::Array (Array&& from) noexcept
        : fItems_{move (from.fItems_)}
        , fLength_{from.fLength_}
    {
        Invariant ();
        from.fItems_  = nullptr;
        from.fLength_ = 0;
        from.Invariant ();
    }
    template <typename T>
    inline void Array<T>::Insert (size_t index, ArgByValueType<T> item)
    {
        Insert (index, span{&item, 1});
    }
#if qCompilerAndStdLib_MemoryInsertAt_Buggy
    template <typename T>
    nonvirtual void Array<T>::Insert_BWA (size_t index, ArgByValueType<T> item)
    {
        // workaround crash in gcc optimized output
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (index >= 0);
        Require (index <= fLength_);
        Invariant ();
        size_t oldLength = fLength_;
        SetLength (oldLength + 1, item); //  Add space for extra item
        if (index < oldLength) {
            Assert (fLength_ >= 2);
            T*     lhs = &fItems_[fLength_ - 1];
            T*     rhs = &fItems_[fLength_ - 2];
            size_t i   = fLength_ - 1;
            for (; i > index; --i) {
                *lhs-- = *rhs--;
            }
            Assert (i == index);
            Assert (lhs == &fItems_[index]);
            *lhs = item;
        }
        Invariant ();
    }
#endif
    template <typename T>
    template <Memory::ISpanOfT<T> SPAN_T>
    void Array<T>::Insert (size_t at, const SPAN_T& copyFrom)
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (at >= 0);
        Require (at <= fLength_);
        Invariant ();
        size_t n2Add = copyFrom.size ();
        if (n2Add != 0) [[likely]] {
            size_t sz    = size ();
            size_t newSz = sz + n2Add;
            ReserveAtLeast (newSz);
#if qCompilerAndStdLib_MemoryInsertAt_Buggy
            // maybe is a compiler bug - cuz no problem on g++-15 ubuntu 25.04
            //temporary BWA til I find what is wrong with Memory::Insert () on gcc optimizer
            for (size_t i = 0; i < copyFrom.size (); ++i) {
                this->Insert_BWA (i + at, copyFrom[i]);
            }
#else
            this->fLength_ = Memory::Insert (span{this->data (), sz}, span{this->data (), capacity ()}, at, copyFrom).size ();
#endif
            Assert (this->fLength_ == newSz);
        }
        Invariant ();
    }
    template <typename T>
    inline void Array<T>::Insert (const ForwardIterator& i, ArgByValueType<T> newValue)
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (i._fData == this); // assure iterator not stale
        // i CAN BE DONE OR NOT
        Insert (i.CurrentIndex (), newValue);
    }
    template <typename T>
    inline void Array<T>::Insert (const BackwardIterator& i, ArgByValueType<T> newValue)
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (i._fData == this); // assure iterator not stale
        // i CAN BE DONE OR NOT
        Insert (i.CurrentIndex (), newValue);
    }
    template <typename T>
    inline void Array<T>::push_back (ArgByValueType<T> item)
    {
        Insert (this->size (), item);
    }
    template <typename T>
    void Array<T>::Remove (size_t index) noexcept
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (index >= 0);
        Require (index < fLength_);
        Invariant ();
        (void)Memory::Remove (span{this->data (), size ()}, span{this->data (), capacity ()}, index, index + 1);
        --fLength_;
        Invariant ();
    }
    template <typename T>
    void Array<T>::Remove (size_t from, size_t to) noexcept
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Invariant ();
        fLength_ = Memory::Remove (span{this->data (), size ()}, span{this->data (), capacity ()}, from, to).size ();
        Invariant ();
    }
    template <typename T>
    void Array<T>::clear ()
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Invariant ();
        T* p = &fItems_[0];
        for (size_t i = fLength_; i > 0; --i, ++p) {
            destroy_at (p);
        }
        fLength_ = 0;
        Invariant ();
    }
    template <typename T>
    template <invocable<T> FUNCTION>
    inline void Array<T>::Apply (FUNCTION&& doToElement) const
    {
        // @todo measure the crossover and auto-choose the policy here - eSeq is a placeholder, not a decision
        Apply (forward<FUNCTION> (doToElement), Execution::SequencePolicy::eSeq);
    }
    template <typename T>
    template <invocable<T> FUNCTION>
    inline void Array<T>::Apply (FUNCTION&& doToElement, Execution::SequencePolicy seq) const
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this};
        const T*                                                start = &fItems_[0];
        const T*                                                end   = &fItems_[fLength_];
        switch (seq) {
#if __cpp_lib_execution >= 201603L
            // only ePar goes parallel; 'default' running sequentially is deliberate - see the dispatch note
            // on Execution::SequencePolicy
            case Execution::SequencePolicy::ePar:
                for_each (execution::par, start, end, forward<FUNCTION> (doToElement));
                break;
#endif
            // @todo add other Execution::SequencePolicy cases
            default:
                for_each (start, end, forward<FUNCTION> (doToElement));
                break;
        }
    }
    template <typename T>
    inline auto Array<T>::begin () const -> ForwardIterator
    {
        return ForwardIterator{this, 0};
    }
    template <typename T>
    constexpr auto Array<T>::end () const -> ForwardIterator
    {
        return ForwardIterator{};
    }
    template <typename T>
    template <predicate<T> FUNCTION>
    auto Array<T>::Find (FUNCTION&& firstThat) const -> ForwardIterator
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this};
        const T*                                                start = &fItems_[0];
        const T*                                                i     = start;
        const T*                                                last  = &fItems_[fLength_];
        for (; i < last; ++i) {
            if (forward<FUNCTION> (firstThat) (*i)) {
                return ForwardIterator{this, static_cast<size_t> (i - start)};
            }
        }
        return end ();
    }
    template <typename T>
    template <typename EQUALS_COMPARER>
    const T* Array<T>::Find (ArgByValueType<T> item, EQUALS_COMPARER&& equalsComparer) const
    {
        const T* start = &fItems_[0];
        const T* last  = &fItems_[fLength_];
        for (const T* i = start; i < last; ++i) {
            if (forward<EQUALS_COMPARER> (equalsComparer) (i->fItem, item)) {
                return &i->fItem;
            }
        }
        return nullptr;
    }
    template <typename T>
    template <typename EQUALS_COMPARER>
    T* Array<T>::Find (ArgByValueType<T> item, EQUALS_COMPARER&& equalsComparer)
    {
        const T* start = &fItems_[0];
        const T* last  = &fItems_[fLength_];
        for (const T* i = start; i < last; ++i) {
            if (forward<EQUALS_COMPARER> (equalsComparer) (i->fItem, item)) {
                return &i->fItem;
            }
        }
        return nullptr;
    }
    template <typename T>
    void Array<T>::reserve (size_t slotsAlloced)
    {
        /*
         */
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (size () <= slotsAlloced);
        Invariant ();
        if (fSlotsAllocated_ != slotsAlloced) {
            if (slotsAlloced == 0) {
                if constexpr (kUseMalloc_) {
                    if (fItems_ != nullptr) {
                        free (fItems_);
                        fItems_ = nullptr;
                    }
                }
                else {
                    delete[] (char*)fItems_;
                    fItems_ = nullptr;
                }
            }
            else {
                /*
                 * We should consider getting rid of use of realloc since it prohibits
                 * internal pointers. For example, we cannot have an array of patchable_arrays.
                 */
                if (fItems_ == nullptr) {
                    if constexpr (kUseMalloc_) {
                        fItems_ = (T*)malloc (sizeof (T) * slotsAlloced);
                        Execution::ThrowIfNull (fItems_);
                    }
                    else {
                        fItems_ = (T*)new char[sizeof (T) * slotsAlloced];
                    }
                }
                else {
                    if constexpr (kUseMalloc_) {
                        auto newVal = (T*)realloc (fItems_, sizeof (T) * slotsAlloced);
                        Execution::ThrowIfNull (newVal);
                        fItems_ = newVal;
                    }
                    else {
                        // do better, but for now at least do something SAFE
                        // USE SFINAE IsTriviallyCopyable to see which way to do it (if can use realloc).
                        // ALSO - on windoze - use _expand() if available...
                        T* newV = (T*)new char[sizeof (T) * slotsAlloced];
                        try {
                            size_t n2Copy = fLength_;
                            uninitialized_copy_n (&fItems_[0], n2Copy, newV);
                        }
                        catch (...) {
                            delete[] (char*)newV;
                            throw;
                        }
                        {
                            T* end = &fItems_[fLength_];
                            for (T* p = &fItems_[0]; p != end; ++p) {
                                destroy_at (p);
                            }
                        }
                        delete[] (char*)fItems_;
                        fItems_ = newV;
                    }
                }
            }
            fSlotsAllocated_ = slotsAlloced;
        }
        Invariant ();
    }
    template <typename T>
    inline void Array<T>::ReserveAtLeast (size_t slotsAlloced)
    {
        if (slotsAlloced > capacity ()) [[unlikely]] {
            /*
             *      Bump up Slots alloced to be at least big enuf for our
             * new length. We could be minimalistic here, and just bump up
             * exactly, but this function can be expensive because it calls
             * realloc which could cause lots of memory copying. There are two
             * plausible strategies for bumping up memory in big chunks-
             * rounding up, and scaling up.
             */
            reserve (Containers::Support::ReserveTweaks::GetScaledUpCapacity (slotsAlloced, sizeof (T)));
        }
        Ensure (size () <= capacity ());
        Ensure (capacity () >= slotsAlloced);
    }
    template <typename T>
    auto Array<T>::operator= (const Array& list) -> Array&
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Invariant ();
        size_t newLength = list.size ();
 
        // @todo CLEANUP using std::copy and uninitialized_copy and range::destroy (or iterator range destory)
 
        /*
         *      In case user already set this, we should not unset,
         *  but must be sure we are big enuf. Do this before we store any pointers
         *  cuz it could invalidate them.
         */
        reserve (max (capacity (), newLength));
 
        /*
         * Copy array elements where both sides where constructed.
         */
        size_t commonLength = Stroika::Foundation::min (fLength_, newLength);
        T*     lhs          = &fItems_[0];
        T*     rhs          = &list.fItems_[0];
        for (size_t i = commonLength; i-- > 0;) {
            *lhs++ = *rhs++;
        }
 
        /*
         * Now if new length smaller, we must destroy entries at the end, and
         * otherwise we must copy in new entries.
         */
        Assert (lhs == &fItems_[commonLength]); // point 1 past first guy to destroy/overwrite
        if (fLength_ > newLength) {
            T* end = &fItems_[fLength_]; // point 1 past last old guy
            /*
             * Then we must destruct entries at the end.
             */
            Assert (lhs < end);
            do {
                destroy_at (lhs);
            } while (++lhs < end);
        }
        else if (fLength_ < newLength) {
            T* end = &fItems_[newLength]; // point 1 past last new guy
            Assert (lhs < end);
            do {
                new (lhs) T{*rhs++};
            } while (++lhs < end);
        }
        fLength_ = newLength;
        Invariant ();
        return *this;
    }
    template <typename T>
    void Array<T>::SetLength (size_t newLength, ArgByValueType<T> fillValue)
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Invariant ();
 
        /*
         * Safe to grow the memory, but not to shrink it here, since
         * we may need to destruct guys in the shrinking case.
         */
        ReserveAtLeast (newLength);
        T* cur = &fItems_[fLength_];  // point 1 past first guy
        T* end = &fItems_[newLength]; // point 1 past last guy
        if (newLength > fLength_) {
            Assert (cur < end);
            do {
                new (cur) T{fillValue};
            } while (++cur < end);
        }
        else {
            Assert (cur >= end);
            while (cur-- > end) {
                destroy_at (cur);
            }
        }
        fLength_ = newLength;
        Invariant ();
    }
#if qStroika_Foundation_Debug_AssertionsChecked
    template <typename T>
    void Array<T>::Invariant_ () const noexcept
    {
#if qStroika_Foundation_Containers_DataStructures_Array_IncludeSlowDebugChecks_
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this};
#endif
        Assert ((fSlotsAllocated_ == 0) == (fItems_ == nullptr)); // always free iff slots alloced = 0
        Assert (fLength_ <= fSlotsAllocated_);
    }
#endif
    template <typename T>
    inline Array<T>::~Array ()
    {
        clear (); // call destructors on elements
        if constexpr (kUseMalloc_) {
            if (fItems_ != nullptr) {
                free (fItems_);
            }
        }
        else {
            delete[] (char*)fItems_;
        }
    }
    template <typename T>
    inline void Array<T>::MoveIteratorHereAfterClone (IteratorBase* pi, [[maybe_unused]] const Array<T>* movedFrom) const
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this};
        RequireNotNull (pi);
        RequireNotNull (movedFrom);
        Require (pi->CurrentIndex () <= this->size ());
        Require (pi->_fData == movedFrom);
        pi->_fData = this;
    }
    template <typename T>
    inline T* Array<T>::data () noexcept
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this};
        return fItems_;
    }
    template <typename T>
    inline const T* Array<T>::data () const noexcept
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this};
        return fItems_;
    }
    template <typename T>
    inline T Array<T>::GetAt (size_t i) const
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this};
        Require (i >= 0);
        Require (i < fLength_);
        return fItems_[i];
    }
    template <typename T>
    inline T* Array<T>::PeekAt (size_t i)
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (i >= 0);
        Require (i < fLength_);
        return &fItems_[i];
    }
    template <typename T>
    inline const T* Array<T>::PeekAt (size_t i) const
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this};
        Require (i >= 0);
        Require (i < fLength_);
        return &fItems_[i];
    }
    template <typename T>
    inline void Array<T>::SetAt (size_t i, ArgByValueType<T> item)
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (i >= 0);
        Require (i < fLength_);
        fItems_[i] = item;
    }
    template <typename T>
    inline T& Array<T>::operator[] (size_t i)
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (i >= 0);
        Require (i < fLength_);
        return fItems_[i];
    }
    template <typename T>
    inline T Array<T>::operator[] (size_t i) const
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this};
        Require (i >= 0);
        Require (i < fLength_);
        return fItems_[i];
    }
    template <typename T>
    inline size_t Array<T>::size () const
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this};
        return fLength_;
    }
    template <typename T>
    inline bool Array<T>::empty () const
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this};
        return fLength_ == 0;
    }
    template <typename T>
    inline size_t Array<T>::capacity () const
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this};
        return fSlotsAllocated_;
    }
    template <typename T>
    inline void Array<T>::shrink_to_fit ()
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        reserve (size ());
    }
    template <typename T>
    inline void Array<T>::Remove (const ForwardIterator& i)
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (not i.AtEnd ());
        Require (i._fData == this); // assure iterator not stale
        this->Remove (i.CurrentIndex ());
    }
    template <typename T>
    inline auto Array<T>::erase (const ForwardIterator& i) -> ForwardIterator
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (not i.AtEnd ());
        Require (i._fData == this); // assure iterator not stale
        size_t idx = i.CurrentIndex ();
        this->Remove (idx);
        if (idx == this->fLength_) {
            return ForwardIterator{};
        }
        else {
            return ForwardIterator{this, idx};
        }
    }
    template <typename T>
    inline void Array<T>::Remove (const BackwardIterator& i)
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (not i.AtEnd ());
        this->Remove (i.CurrentIndex ());
    }
    template <typename T>
    inline void Array<T>::SetAt (const ForwardIterator& i, ArgByValueType<T> newValue)
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (i._fData == this); // assure iterator not stale
        Require (not i.AtEnd ());
        SetAt (i.CurrentIndex (), newValue);
    }
    template <typename T>
    inline void Array<T>::SetAt (const BackwardIterator& i, ArgByValueType<T> newValue)
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*this};
        Require (not i.AtEnd ());
        SetAt (i.CurrentIndex (), newValue);
    }
 
    /*
     ********************************************************************************
     ****************************** Array<>::IteratorBase ***************************
     ********************************************************************************
     */
    template <typename T>
    inline Array<T>::IteratorBase::IteratorBase (const Array* data)
        : _fData{data}
    {
        RequireNotNull (data);
    }
#if qStroika_Foundation_Debug_AssertionsChecked
    template <typename T>
    inline Array<T>::IteratorBase::~IteratorBase ()
    {
#if qStroika_Foundation_Debug_AssertionsChecked
        // hack so crash and debug easier
        _fData       = reinterpret_cast<Array<T>*> (-1);
        _fCurrentIdx = numeric_limits<size_t>::max ();
#endif
    }
#endif
    template <typename T>
    inline size_t Array<T>::IteratorBase::CurrentIndex () const
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*_fData};
        /*
         * NB: This can be called if we are done - if so, it returns size().
         */
        Invariant ();
        return _fCurrentIdx;
    }
    template <typename T>
    inline const T& Array<T>::IteratorBase::operator* () const
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*_fData};
        Invariant ();
        RequireNotNull (_fData);
        Require (0 <= _fCurrentIdx and _fCurrentIdx < _fData->fLength_);
        return _fData->fItems_[_fCurrentIdx];
    }
    template <typename T>
    inline const T* Array<T>::IteratorBase::operator->() const
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*_fData};
        Invariant ();
        RequireNotNull (_fData);
        Require (0 <= _fCurrentIdx and _fCurrentIdx < _fData->fLength_);
        return _fData->PeekAt (_fCurrentIdx);
    }
    template <typename T>
    inline void Array<T>::IteratorBase::SetIndex (size_t i)
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*_fData};
        RequireNotNull (_fData);
        Require (i <= _fData->fLength_);
        _fCurrentIdx = i;
    }
    template <typename T>
    inline auto Array<T>::IteratorBase::GetUnderlyingIteratorRep () const -> UnderlyingIteratorRep
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*_fData};
        /*
         * NB: This can be called if we are done - if so, it returns size().
         */
        Invariant ();
        return _fCurrentIdx;
    }
    template <typename T>
    inline void Array<T>::IteratorBase::SetUnderlyingIteratorRep (UnderlyingIteratorRep i)
    {
        Debug::AssertExternallySynchronizedChecker::WriteContext declareContext{*_fData};
        RequireNotNull (_fData);
        Require (i <= _fData->fLength_);
        _fCurrentIdx = i;
    }
    template <typename T>
    constexpr void Array<T>::IteratorBase::AssertDataMatches (const Array* data) const
    {
#if qStroika_Foundation_Debug_AssertionsChecked
        Require (data == _fData);
#endif
    }
    template <typename T>
    inline void Array<T>::IteratorBase::Invariant () const noexcept
    {
#if qStroika_Foundation_Debug_AssertionsChecked
        Invariant_ ();
#endif
    }
#if qStroika_Foundation_Debug_AssertionsChecked
    template <typename T>
    void Array<T>::IteratorBase::Invariant_ () const noexcept
    {
        Assert (0 <= _fCurrentIdx);
        if (_fData != nullptr) {
#if qStroika_Foundation_Containers_DataStructures_Array_IncludeSlowDebugChecks_
            Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*_fData};
#endif
            Assert (_fCurrentIdx <= _fData->fLength_);
        }
    }
#endif
 
    /*
     ********************************************************************************
     *************************** Array<T>::ForwardIterator **************************
     ********************************************************************************
     */
    template <typename T>
    inline Array<T>::ForwardIterator::ForwardIterator (const Array* data, UnderlyingIteratorRep startAt)
        : inherited{data}
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this->_fData};
        this->_fCurrentIdx = startAt;
        this->Invariant ();
    }
    template <typename T>
    constexpr Array<T>::ForwardIterator::ForwardIterator (ForwardIterator&& src) noexcept
    {
        this->_fData       = -src._fData;
        this->_fCurrentIdx = src._fCurrentIdx;
        src._fData         = nullptr;
    }
    template <typename T>
    inline Array<T>::ForwardIterator::operator bool () const
    {
        return not AtEnd ();
    }
    template <typename T>
    inline bool Array<T>::ForwardIterator::AtStart () const noexcept
    {
        if (this->_fData == nullptr) {
            Assert (this->_fCurrentIdx == 0);
            return true;
        }
#if qStroika_Foundation_Containers_DataStructures_Array_IncludeSlowDebugChecks_
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*_fData};
#endif
        this->Invariant ();
        return this->CurrentIndex () == 0;
    }
    template <typename T>
    inline bool Array<T>::ForwardIterator::AtEnd () const noexcept
    {
        if (this->_fData == nullptr) {
            Assert (this->_fCurrentIdx == 0);
            return true;
        }
#if qStroika_Foundation_Containers_DataStructures_Array_IncludeSlowDebugChecks_
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*_fData};
#endif
        this->Invariant ();
        return this->CurrentIndex () == this->_fData->fLength_;
    }
    template <typename T>
    inline auto Array<T>::ForwardIterator::operator++ () noexcept -> ForwardIterator&
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this->_fData};
        Require (not this->AtEnd ());
        this->Invariant ();
        Assert (this->_fCurrentIdx < this->_fData->fLength_);
        ++this->_fCurrentIdx;
        this->Invariant ();
        return *this;
    }
    template <typename T>
    inline auto Array<T>::ForwardIterator::operator++ (int) noexcept -> ForwardIterator
    {
        ForwardIterator result = *this;
        this->operator++ ();
        return result;
    }
    template <typename T>
    inline auto Array<T>::ForwardIterator::operator-- () noexcept -> ForwardIterator&
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this->_fData};
        Require (not this->AtStart ()); // checks not==0, so decrement is safe
        this->Invariant ();
        Assert (this->_fCurrentIdx <= this->_fData->fLength_); // stepping back from AtEnd () (_fCurrentIdx == fLength_) is legal
        --this->_fCurrentIdx;
        this->Invariant ();
        return *this;
    }
    template <typename T>
    inline auto Array<T>::ForwardIterator::operator-- (int) noexcept -> ForwardIterator
    {
        ForwardIterator result = *this;
        this->operator-- ();
        return result;
    }
    template <typename T>
    inline auto Array<T>::ForwardIterator::operator+ (difference_type i) const -> ForwardIterator
    {
        size_t newIdx = static_cast<difference_type> (this->_fCurrentIdx) + i;
        Require (newIdx <= this->_fData->fLength_); // reaching exactly 'end' (== fLength_) is legal
        return ForwardIterator{this->_fData, newIdx};
    }
    template <typename T>
    inline auto Array<T>::ForwardIterator::operator- (difference_type i) const -> ForwardIterator
    {
        size_t newIdx = static_cast<difference_type> (this->_fCurrentIdx) - i;
        Require (newIdx <= this->_fData->fLength_); // reaching exactly 'end' (== fLength_) is legal
        return ForwardIterator{this->_fData, newIdx};
    }
    template <typename T>
    inline auto Array<T>::ForwardIterator::operator+= (difference_type i) -> ForwardIterator&
    {
        this->_fCurrentIdx += i;
        Require (this->_fCurrentIdx <= this->_fData->fLength_); // reaching exactly 'end' (== fLength_) is legal
        return *this;
    }
    template <typename T>
    inline auto Array<T>::ForwardIterator::operator-= (difference_type i) -> ForwardIterator&
    {
        this->_fCurrentIdx -= i;
        Require (this->_fCurrentIdx <= this->_fData->fLength_); // reaching exactly 'end' (== fLength_) is legal (and cannot check < 0 since unsigned)
        return *this;
    }
    template <typename T>
    inline const T& Array<T>::ForwardIterator::operator[] (difference_type i) const
    {
        size_t newIdx = static_cast<difference_type> (this->_fCurrentIdx) + i;
        Require (newIdx < this->_fData->fLength_);
        return this->_fData->fItems_[newIdx];
    }
    template <typename T>
    inline bool Array<T>::ForwardIterator::operator== (const ForwardIterator& rhs) const
    {
        auto thisDone = this->AtEnd ();
        bool rhsDone  = rhs.AtEnd ();
        if (thisDone or rhsDone) {
            return thisDone and rhsDone;
        }
        Require (this->_fData == rhs._fData);
        return this->_fCurrentIdx == rhs._fCurrentIdx;
    }
    template <typename T>
    inline strong_ordering Array<T>::ForwardIterator::operator<=> (const ForwardIterator& rhs) const
    {
        auto thisDone = this->AtEnd ();
        bool rhsDone  = rhs.AtEnd ();
        if (thisDone) {
            return rhsDone ? strong_ordering::equal : strong_ordering::less;
        }
        if (rhsDone) {
            Assert (not thisDone);
            return strong_ordering::greater;
        }
        Require (this->_fData == rhs._fData);
        return this->_fCurrentIdx <=> rhs._fCurrentIdx;
    }
    template <typename T>
    inline typename Array<T>::ForwardIterator operator+ (typename Array<T>::ForwardIterator::difference_type i,
                                                         const typename Array<T>::ForwardIterator&           it)
    {
        return it + i; // commutative
    }
    template <typename T>
    inline typename Array<T>::ForwardIterator operator- (typename Array<T>::ForwardIterator::difference_type i,
                                                         const typename Array<T>::ForwardIterator&           it)
    {
        return -(it - i); // anti-commutative
    }
    template <typename T>
    auto Array<T>::ForwardIterator::OPERATOR_MINUS_BWA_ (const ForwardIterator& lhs, const ForwardIterator& rhs) -> difference_type
    {
        using difference_type = typename Array<T>::ForwardIterator::difference_type;
        // slightly tricky, because of 'sentinal' end cases
        // if both at end, just return 0 diff;
        // at least least ONE not at end, can use its 'data' field to get array length, and use that for any at-end iterators
        // 'atend' iterators. Else just use given index (easy case).
        // and careful to convert everything to difference_type to assure signed arithmetic.
        if (lhs.AtEnd ()) {
            if (rhs.AtEnd ()) {
                return 0;
            }
            else {
                difference_type lhsIdx = static_cast<difference_type> (rhs._fData->size ()); // not at end, so must have data
                difference_type rhsIdx = static_cast<difference_type> (rhs.CurrentIndex ());
                return lhsIdx - rhsIdx;
            }
        }
        else {
            if (rhs.AtEnd ()) {
                difference_type lhsIdx = static_cast<difference_type> (lhs.CurrentIndex ());
                difference_type rhsIdx = static_cast<difference_type> (lhs._fData->size ()); // not at end, so must have data
                return lhsIdx - rhsIdx;
            }
            else {
                difference_type lhsIdx = static_cast<difference_type> (lhs.CurrentIndex ());
                difference_type rhsIdx = static_cast<difference_type> (rhs.CurrentIndex ());
                return lhsIdx - rhsIdx;
            }
        }
        AssertNotReached ();
        return 0;
    }
 
    /*
     ********************************************************************************
     **************************** Array<T>::BackwardIterator ************************
     ********************************************************************************
     */
    template <typename T>
    inline Array<T>::BackwardIterator::BackwardIterator (const Array* data, UnderlyingIteratorRep startAt)
        : inherited{data}
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this->_fData};
        this->_fCurrent = startAt;
        this->Invariant ();
    }
    template <typename T>
    inline Array<T>::BackwardIterator::BackwardIterator (const Array* data)
        : BackwardIterator{data->size () == 0 ? data->size () : data->size () - 1} // start on last item or at magic (at end) value
    {
    }
    template <typename T>
    inline bool Array<T>::BackwardIterator::AtEnd () const noexcept
    {
#if qStroika_Foundation_Containers_DataStructures_Array_IncludeSlowDebugChecks_
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*_fData};
#endif
        this->Invariant ();
        return bool (this->CurrentIndex () == this->_fData->fLength_); // a little queer/confusing, but in C++ only legal extra address is past end, one before start not legal
    }
    template <typename T>
    inline auto Array<T>::BackwardIterator::operator++ () noexcept -> BackwardIterator&
    {
        Debug::AssertExternallySynchronizedChecker::ReadContext declareContext{*this->_fData};
        Require (not this->AtEnd ());
        this->Invariant ();
        if (this->_fCurrent == this->_fStart) {
            this->_fCurrent = this->_fEnd; // magic to indicate done
            Ensure (this->AtEnd ());
        }
        else {
            this->_fCurrent--;
            Ensure (not this->AtEnd ());
        }
        this->Invariant ();
        return *this;
    }
    template <typename T>
    inline bool Array<T>::BackwardIterator::operator== (const BackwardIterator& rhs) const
    {
        auto thisDone = this->AtEnd ();
        bool rhsDone  = rhs.AtEnd ();
        if (thisDone or rhsDone) {
            return thisDone and rhsDone;
        }
        Require (this->_fData == rhs._fData);
        return this->_fCurrentIdx == rhs._fCurrentIdx;
    }
 
}