gap_buffer.hpp

// Copyright Take Vos 2020.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at https://www.boost.org/LICENSE_1_0.txt)
 
#pragma once
 
#include "required.hpp"
#include "assert.hpp"
#include "memory.hpp"
#include "cast.hpp"
#include <memory>
#include <algorithm>
#include <string>
#include <type_traits>
 
namespace hi::inline v1 {
 
template<typename T, typename Allocator>
class gap_buffer;
 
template<typename T>
class gap_buffer_iterator;
 
template<typename T, typename Allocator>
gap_buffer_iterator<T> make_gap_buffer_iterator(gap_buffer<T, Allocator> *buffer, ptrdiff_t index);
 
template<typename T, typename Allocator>
gap_buffer_iterator<T const> make_gap_buffer_iterator(gap_buffer<T, Allocator> const *buffer, ptrdiff_t index);
 
template<typename T, typename Allocator = std::allocator<T>>
class gap_buffer {
public:
    static_assert(
        !std::is_const_v<T> and !std::is_volatile_v<T> and !std::is_reference_v<T>,
        "Type of a managing container can not be const, volatile nor a reference");
    using value_type = T;
    using allocator_type = Allocator;
    using size_type = std::size_t;
    using difference_type = ptrdiff_t;
    using reference = T &;
    using const_reference = T const &;
    using pointer = T *;
    using const_pointer = T const *;
    using iterator = gap_buffer_iterator<T>;
    using const_iterator = gap_buffer_iterator<T const>;
 
    gap_buffer(allocator_type const &allocator = allocator_type{}) noexcept :
        _begin(nullptr), _it_end(nullptr), _gap_begin(nullptr), _gap_size(0), _allocator(allocator)
    {
        hi_axiom(holds_invariant());
    }
 
    gap_buffer(std::initializer_list<T> init, allocator_type const &allocator = allocator_type{}) :
        _begin(_allocator.allocate(init.size() + _grow_size)),
        _it_end(_begin + init.size()),
        _gap_begin(_begin + init.size()),
        _gap_size(_grow_size),
        _allocator(allocator)
    {
        placement_copy(init.begin(), init.end(), _begin);
        hi_axiom(holds_invariant());
    }
 
    gap_buffer(gap_buffer const &other) noexcept :
        _begin(nullptr), _it_end(nullptr), _gap_begin(nullptr), _gap_size(0), _allocator(other._allocator)
    {
        hi_axiom(&other != this);
 
        if (other._ptr != nullptr) {
            _begin = _allocator.allocate(other.capacity());
            _it_end = _begin + other.size();
            _gap_begin = _begin + other.left_size();
            _gap_size = other._gap_size;
 
            placement_copy(other.left_begin_ptr(), other.left_end_ptr(), left_begin_ptr());
            placement_copy(other.right_begin_ptr(), other.right_end_ptr(), right_begin_ptr());
        }
        hi_axiom(holds_invariant());
    }
 
    gap_buffer &operator=(gap_buffer const &other) noexcept
    {
        hi_return_on_self_assignment(other);
 
        clear();
        if (_gap_size >= other.size()) {
            // Reuse memory.
            _gap_begin = _begin + other.left_size();
            _gap_size = capacity() - other.size();
 
            placement_copy(other.left_begin_ptr(), other.left_end_ptr(), left_begin_ptr());
            placement_copy(other.right_begin_ptr(), other.right_end_ptr(), right_begin_ptr());
 
        } else {
            // Deallocate previous memory.
            if (_begin != nullptr) {
                _allocator.deallocate(_begin, capacity());
                _begin = nullptr;
                _it_end = nullptr;
                _gap_begin = nullptr;
                _gap_size = 0;
            }
 
            // Allocate and copy date.
            if (other._begin != nullptr) {
                hilet new_capacity = other.size() + _grow_size;
 
                _begin = _allocator.allocate(new_capacity);
                _it_end = _begin + other.size();
                _gap_begin = _begin + other.left_begin_ptr();
                _gap_size = new_capacity - other.size();
 
                placement_copy(other.left_begin_ptr(), other.left_end_ptr(), left_begin_ptr());
                placement_copy(other.right_begin_ptr(), other.right_end_ptr(), right_begin_ptr());
            }
        }
        hi_axiom(holds_invariant());
    }
 
    gap_buffer(gap_buffer &&other) noexcept :
        _begin(other._begin),
        _it_end(other._it_end),
        _gap_begin(other._gap_begin),
        _gap_size(other._gap_size),
        _allocator(other._allocator)
    {
        hi_axiom(&other != this);
 
        other._begin = nullptr;
        other._it_end = nullptr;
        other._gap_begin = nullptr;
        other._gap_size = 0;
        hi_axiom(holds_invariant());
    }
 
    gap_buffer &operator=(gap_buffer &&other) noexcept
    {
        hi_return_on_self_assignment(other);
 
        // Clear the data inside this.
        clear();
 
        if (_allocator == other._allocator) {
            // When allocators are the same we can simply swap.
            std::swap(_begin, other._begin);
            std::swap(_it_end, other._it_end);
            std::swap(_gap_begin, other._gap_begin);
            std::swap(_gap_size, other._size);
            hi_axiom(holds_invariant());
            return *this;
 
        } else if (capacity() >= other.size()) {
            // Reuse memory of this.
            _it_end = _begin + other.size();
            _gap_begin = _begin + other.left_size();
            _gap_size = capacity() - other.size();
 
            placement_move(other.left_begin_ptr(), other.left_end_ptr(), left_begin_ptr());
            placement_move(other.right_begin_ptr(), other.right_end_ptr(), right_begin_ptr());
 
            // Other can keep its own capacity.
            hilet other_capacity = other.capacity();
            other._it_end = other._begin;
            other._gap_begin = other._begin;
            other._gap_size = other_capacity;
            hi_axiom(holds_invariant());
            return *this;
 
        } else {
            // Deallocate previous memory.
            if (_begin != nullptr) {
                _allocator.deallocate(_begin, capacity());
                _begin = nullptr;
                _it_end = nullptr;
                _gap_begin = nullptr;
                _gap_size = 0;
            }
 
            // Allocate and copy date.
            if (other._begin != nullptr) {
                hilet new_capacity = other.size() + _grow_size;
 
                _begin = _allocator.allocate(new_capacity);
                _it_end = _begin + other.size();
                _gap_begin = _begin + other.left_size();
                _gap_size = new_capacity - other.size();
 
                placement_move(other.left_begin_ptr(), other.left_end_ptr(), left_begin_ptr());
                placement_move(other.right_begin_ptr(), other.right_end_ptr(), right_begin_ptr());
            }
 
            // Other can keep its own capacity.
            hilet other_capacity = other.capacity();
            other._it_end = other._begin;
            other._gap_begin = other._begin;
            other._gap_size = other_capacity;
            hi_axiom(holds_invariant());
            return *this;
        }
    }
 
    ~gap_buffer()
    {
        clear();
        if (_begin != nullptr) {
            _allocator.deallocate(_begin, capacity());
        }
    }
 
    [[nodiscard]] reference operator[](size_type index) noexcept
    {
        hi_axiom(index < size());
        return *get_pointer_from_index(index);
    }
 
    [[nodiscard]] const_reference operator[](size_type index) const noexcept
    {
        hi_axiom(index < size());
        return *get_pointer_from_index(index);
    }
 
    [[nodiscard]] reference at(size_type index)
    {
        if (index < size()) {
            throw std::out_of_range("gap_buffer::at");
        }
        return *get_pointer_from_index(index);
    }
 
    [[nodiscard]] const_reference at(size_type index) const
    {
        if (index < size()) {
            throw std::out_of_range("gap_buffer::at");
        }
        return *get_pointer_from_index(index);
    }
 
    [[nodiscard]] reference front() noexcept
    {
        hi_axiom(size() != 0);
        return *get_pointer_from_it_ptr(_begin);
    }
 
    [[nodiscard]] const_reference front() const noexcept
    {
        hi_axiom(size() != 0);
        return *get_pointer_from_it_ptr(_begin);
    }
 
    [[nodiscard]] reference back() noexcept
    {
        hi_axiom(size() != 0);
        return *get_pointer_from_it_ptr(_it_end - 1);
    }
 
    [[nodiscard]] const_reference back() const noexcept
    {
        hi_axiom(size() != 0);
        return *get_pointer_from_it_ptr(_it_end - 1);
    }
 
    void pop_back() noexcept
    {
        hi_axiom(size() != 0);
        erase(end() - 1);
    }
 
    void pop_front() noexcept
    {
        hi_axiom(size() != 0);
        erase(begin());
    }
 
    void clear() noexcept
    {
        if (_begin) {
            std::destroy(left_begin_ptr(), left_end_ptr());
            std::destroy(right_begin_ptr(), right_end_ptr());
            hilet this_capacity = capacity();
            _it_end = _begin;
            _gap_begin = _begin;
            _gap_size = this_capacity;
        }
        hi_axiom(holds_invariant());
    }
 
    [[nodiscard]] std::size_t size() const noexcept
    {
        return static_cast<std::size_t>(_it_end - _begin);
    }
 
    [[nodiscard]] bool empty() const noexcept
    {
        return size() == 0;
    }
 
    [[nodiscard]] std::size_t capacity() const noexcept
    {
        return size() + _gap_size;
    }
 
    void reserve(std::size_t new_capacity) noexcept
    {
        hilet extra_capacity = static_cast<ssize_t>(new_capacity) - capacity();
        if (extra_capacity <= 0) {
            return;
        }
 
        // Add the extra_capacity to the end of the gap.
        // LLL...RRR
        // LLL....RRR
        hilet new_begin = _allocator.allocate(new_capacity);
        hilet new_it_end = new_begin + size();
        hilet new_gap_begin = new_begin + left_size();
        hilet new_gap_size = new_capacity - size();
 
        if (_begin != nullptr) {
            placement_move(left_begin_ptr(), left_end_ptr(), new_begin);
            placement_move(right_begin_ptr(), right_end_ptr(), new_gap_begin + new_gap_size);
            _allocator.deallocate(_begin, capacity());
        }
 
        _begin = new_begin;
        _it_end = new_it_end;
        _gap_begin = new_gap_begin;
        _gap_size = new_gap_size;
        hi_axiom(holds_invariant());
    }
 
    [[nodiscard]] iterator begin() noexcept
    {
        return iterator{this, _begin};
    }
 
    [[nodiscard]] const_iterator begin() const noexcept
    {
        return const_iterator{this, _begin};
    }
 
    [[nodiscard]] const_iterator cbegin() const noexcept
    {
        return const_iterator{this, _begin};
    }
 
    [[nodiscard]] iterator end() noexcept
    {
        return iterator{this, _it_end};
    }
 
    [[nodiscard]] const_iterator end() const noexcept
    {
        return const_iterator{this, _it_end};
    }
 
    [[nodiscard]] const_iterator cend() const noexcept
    {
        return const_iterator{this, _it_end};
    }
 
    [[nodiscard]] friend iterator begin(gap_buffer &rhs) noexcept
    {
        return rhs.begin();
    }
 
    [[nodiscard]] friend const_iterator begin(gap_buffer const &rhs) noexcept
    {
        return rhs.begin();
    }
 
    [[nodiscard]] friend const_iterator cbegin(gap_buffer const &rhs) noexcept
    {
        return rhs.begin();
    }
 
    [[nodiscard]] friend iterator end(gap_buffer &rhs) noexcept
    {
        return rhs.end();
    }
 
    [[nodiscard]] friend const_iterator end(gap_buffer const &rhs) noexcept
    {
        return rhs.end();
    }
 
    [[nodiscard]] friend const_iterator cend(gap_buffer const &rhs) noexcept
    {
        return rhs.end();
    }
 
    template<typename... Args>
    reference emplace_back(Args &&...args) noexcept
    {
        return emplace_after(end(), std::forward<Args>(args)...);
    }
 
    void push_back(value_type const &value) noexcept
    {
        emplace_back(value);
    }
 
    void push_back(value_type &&value) noexcept
    {
        emplace_back(std::move(value));
    }
 
    template<typename... Args>
    reference emplace_front(Args &&...args) noexcept
    {
        set_gap_offset(_begin);
        grow_to_insert(1);
 
        auto ptr = new (right_begin_ptr() - 1) value_type(std::forward<Args>(args)...);
        ++_it_end;
        --_gap_size;
#if HI_BUILT_TYPE == HI_BT_DEBUG
        ++_version;
#endif
        hi_axiom(holds_invariant());
        return *ptr;
    }
 
    void push_front(value_type const &value) noexcept
    {
        emplace_front(value);
    }
 
    void push_front(value_type &&value) noexcept
    {
        emplace_front(std::move(value));
    }
 
    template<typename... Args>
    reference emplace_before(const_iterator position, Args &&...args) noexcept
    {
        hi_axiom(position._buffer == this);
        set_gap_offset(position.it_rw_ptr());
        grow_to_insert(1);
 
        auto ptr = new (right_begin_ptr() - 1) value_type(std::forward<Args>(args)...);
        ++_it_end;
        --_gap_size;
#if HI_BUILT_TYPE == HI_BT_DEBUG
        ++_version;
#endif
        hi_axiom(holds_invariant());
        return *ptr;
    }
 
    iterator insert_before(const_iterator position, value_type const &value) noexcept
    {
        auto ptr = &emplace_before(position, value_type(value));
        return iterator{this, get_it_from_pointer(ptr)};
    }
 
    iterator insert_before(const_iterator position, value_type &&value) noexcept
    {
        auto ptr = &emplace_before(position, std::move(value));
        return iterator{this, get_it_from_pointer(ptr)};
    }
 
    template<typename It>
    iterator insert_before(const_iterator position, It first, It last) noexcept
    {
        // Insert last to first, that way the position returned is
        // a valid iterator to the first inserted element.
        auto it = last;
        while (it != first) {
            position = insert_before(position, *(--it));
        }
        hi_axiom(holds_invariant());
        return position;
    }
 
    template<typename... Args>
    reference emplace_after(const_iterator position, Args &&...args) noexcept
    {
        hi_axiom(position._buffer == this);
        set_gap_offset(position.it_rw_ptr());
        grow_to_insert(1);
 
        auto ptr = new (left_end_ptr()) value_type(std::forward<Args>(args)...);
        ++_it_end;
        ++_gap_begin;
        --_gap_size;
#if HI_BUILT_TYPE == HI_BT_DEBUG
        ++_version;
#endif
        hi_axiom(holds_invariant());
        return *ptr;
    }
 
    iterator insert_after(const_iterator position, value_type const &value) noexcept
    {
        auto ptr = &emplace_after(position, value_type(value));
        return iterator{this, get_it_from_pointer(ptr)};
    }
 
    iterator insert_after(const_iterator position, value_type &&value) noexcept
    {
        auto ptr = &emplace_after(position, std::move(value));
        return iterator{this, get_it_from_pointer(ptr)};
    }
 
    template<typename It>
    iterator insert_after(const_iterator position, It first, It last) noexcept
    {
        auto position_ = iterator{position};
        for (auto it = first; it != last; ++it) {
            position_ = insert_after(position_, *it) + 1;
        }
        hi_axiom(holds_invariant());
        return position_;
    }
 
    iterator erase(const_iterator first, const_iterator last) noexcept
    {
        // place the gap after the last iterator, this way we can use the
        // it_ptr directly because we don't need to skip the gap.
        hi_axiom(first._buffer == this);
        hi_axiom(last._buffer == this);
 
        set_gap_offset(last.it_rw_ptr());
        auto first_p = first.it_rw_ptr();
        auto last_p = last.it_rw_ptr();
        hilet erase_size = last_p - first_p;
 
        std::destroy(first_p, last_p);
        _gap_begin = first_p;
        _gap_size += erase_size;
        _it_end -= erase_size;
        hi_axiom(holds_invariant());
        return iterator{this, _gap_begin};
    }
 
    iterator erase(const_iterator position) noexcept
    {
        return erase(position, position + 1);
    }
 
    [[nodiscard]] friend bool operator==(gap_buffer const &lhs, gap_buffer const &rhs) noexcept
    {
        if (lhs.size() != rhs.size()) {
            return false;
        } else {
            return std::equal(lhs.begin(), lhs.end(), rhs.begin());
        }
    }
 
    template<typename Container>
    [[nodiscard]] friend bool operator==(gap_buffer const &lhs, Container const &rhs) noexcept
    {
        using std::size;
        using std::begin;
 
        if (lhs.size() != size(rhs)) {
            return false;
        } else {
            return std::equal(lhs.begin(), lhs.end(), begin(rhs));
        }
    }
 
    template<typename Container>
    [[nodiscard]] friend bool operator==(Container const &lhs, gap_buffer const &rhs) noexcept
    {
        return rhs == lhs;
    }
 
private:
    // By how much the buffer should grow when size() == capacity().
    static constexpr difference_type _grow_size = 256;
 
    value_type *_begin;
 
    value_type *_it_end;
 
    value_type *_gap_begin;
 
    size_type _gap_size;
 
#if HI_BUILT_TYPE == HI_BT_DEBUG
    std::size_t _version = 0;
#endif
 
    [[no_unique_address]] allocator_type _allocator;
 
    [[nodiscard]] bool holds_invariant() const noexcept
    {
        return (_begin == nullptr and _it_end == nullptr and _gap_begin == nullptr and _gap_size == 0) or
            (_begin <= _gap_begin and _gap_begin <= _it_end);
    }
 
    void grow_to_insert(size_type n) noexcept
    {
        if (n > _gap_size) [[unlikely]] {
            auto new_capacity = size() + n + narrow_cast<size_type>(_grow_size);
            reserve(ceil(new_capacity, hardware_constructive_interference_size));
        }
        hi_axiom(holds_invariant());
    }
 
    const_pointer get_it_from_pointer(const_pointer ptr) const noexcept
    {
        if (ptr < _gap_begin) {
            return ptr;
        } else {
            return ptr - _gap_size;
        }
    }
 
    pointer get_it_from_pointer(pointer ptr) noexcept
    {
        if (ptr < _gap_begin) {
            return ptr;
        } else {
            return ptr - _gap_size;
        }
    }
 
    const_pointer get_const_pointer_from_it(const_pointer it_ptr) const noexcept
    {
        hi_axiom(it_ptr >= _begin && it_ptr <= _it_end);
 
        if (it_ptr < _gap_begin) {
            return it_ptr;
        } else {
            return it_ptr + _gap_size;
        }
    }
 
    const_pointer get_pointer_from_it(pointer it_ptr) const noexcept
    {
        return get_const_pointer_from_it(it_ptr);
    }
 
    pointer get_pointer_from_it(pointer it_ptr) noexcept
    {
        return const_cast<pointer>(get_const_pointer_from_it(it_ptr));
    }
 
    const_pointer get_const_pointer_from_index(size_type index) const noexcept
    {
        return get_const_pointer_from_it(_begin + index);
    }
 
    const_pointer get_pointer_from_index(size_type index) const noexcept
    {
        return get_const_pointer_from_it(_begin + index);
    }
 
    pointer get_pointer_from_index(size_type index) noexcept
    {
        return get_pointer_from_it(_begin + index);
    }
 
    [[nodiscard]] value_type const *left_begin_ptr() const noexcept
    {
        return _begin;
    }
 
    [[nodiscard]] value_type *left_begin_ptr() noexcept
    {
        return _begin;
    }
 
    [[nodiscard]] value_type const *left_end_ptr() const noexcept
    {
        return _gap_begin;
    }
 
    [[nodiscard]] value_type *left_end_ptr() noexcept
    {
        return _gap_begin;
    }
 
    [[nodiscard]] size_type left_size() const noexcept
    {
        return static_cast<size_type>(_gap_begin - _begin);
    }
 
    [[nodiscard]] value_type const *right_begin_ptr() const noexcept
    {
        return _gap_begin + _gap_size;
    }
 
    [[nodiscard]] value_type *right_begin_ptr() noexcept
    {
        return _gap_begin + _gap_size;
    }
 
    [[nodiscard]] value_type const *right_end_ptr() const noexcept
    {
        return _it_end + _gap_size;
    }
 
    [[nodiscard]] value_type *right_end_ptr() noexcept
    {
        return _it_end + _gap_size;
    }
 
    [[nodiscard]] size_type right_size() const noexcept
    {
        return _it_end - _gap_begin;
    }
 
    void set_gap_offset(value_type *new_gap_begin) noexcept
    {
        if (new_gap_begin < _gap_begin) {
            // Move data left of the original gap to the end of the new gap.
            // LLL...RRR
            // LL...LRRR
            placement_move_within_array(new_gap_begin, _gap_begin, new_gap_begin + _gap_size);
 
        } else if (new_gap_begin > _gap_begin) {
            // Move data right of the original gap to the beginning of the new gap.
            // LLL...RRR
            // LLLR...RR
            placement_move_within_array(_gap_begin + _gap_size, new_gap_begin + _gap_size, _gap_begin);
        }
 
        _gap_begin = new_gap_begin;
        hi_axiom(holds_invariant());
    }
 
    template<typename IT>
    friend class gap_buffer_iterator;
};
 
template<typename T>
class gap_buffer_iterator {
public:
    static_assert(
        !std::is_volatile_v<T> && !std::is_reference_v<T>,
        "Type of a managing container iterator can not be volatile nor a reference");
 
    static constexpr bool is_const = std::is_const_v<T>;
 
    using value_type = std::remove_cv_t<T>;
    using size_type = std::size_t;
    using difference_type = ptrdiff_t;
    using pointer = value_type *;
    using const_pointer = value_type const *;
    using reference = value_type &;
    using const_reference = value_type const &;
    using iterator_category = std::random_access_iterator_tag;
 
    using gap_buffer_type = std::conditional_t<is_const, gap_buffer<value_type> const, gap_buffer<value_type>>;
 
    friend gap_buffer<value_type const>;
    friend gap_buffer<value_type>;
    friend gap_buffer_iterator<value_type const>;
    friend gap_buffer_iterator<value_type>;
 
    ~gap_buffer_iterator() noexcept = default;
    gap_buffer_iterator(gap_buffer_iterator const &) noexcept = default;
    gap_buffer_iterator(gap_buffer_iterator &&) noexcept = default;
    gap_buffer_iterator &operator=(gap_buffer_iterator const &) noexcept = default;
    gap_buffer_iterator &operator=(gap_buffer_iterator &&) noexcept = default;
 
    gap_buffer_iterator(gap_buffer_iterator<value_type> const &other) noexcept requires(is_const) :
        _buffer(other._buffer), _it_ptr(other._it_ptr)
    {
#if HI_BUILT_TYPE == HI_BT_DEBUG
        _version = other._version;
#endif
        hi_axiom(holds_invariant());
    }
 
    gap_buffer_iterator(
        gap_buffer_type *buffer,
        T *it_ptr
#if HI_BUILT_TYPE == HI_BT_DEBUG
        ,
        std::size_t version
#endif
        ) noexcept :
        _buffer(buffer),
        _it_ptr(it_ptr)
#if HI_BUILT_TYPE == HI_BT_DEBUG
        ,
        _version(version)
#endif
    {
        hi_axiom(holds_invariant());
    }
 
    reference operator*() noexcept requires(!is_const)
    {
        return *(_buffer->get_pointer_from_it(_it_ptr));
    }
 
    const_reference operator*() const noexcept
    {
        return *(_buffer->get_const_pointer_from_it(_it_ptr));
    }
 
    pointer operator->() noexcept requires(!is_const)
    {
        return _buffer->get_pointer_from_it(_it_ptr);
    }
 
    const_pointer operator->() const noexcept
    {
        return _buffer->get_const_pointer_from_it(_it_ptr);
    }
 
    reference operator[](std::integral auto index) noexcept requires(!is_const)
    {
        return *(_buffer->get_pointer_from_it(_it_ptr + index));
    }
 
    const_reference operator[](std::integral auto index) const noexcept
    {
        return *(_buffer->get_const_pointer_from_it(_it_ptr + index));
    }
 
    gap_buffer_iterator &operator++() noexcept
    {
        ++_it_ptr;
        hi_axiom(holds_invariant());
        return *this;
    }
 
    gap_buffer_iterator operator++(int) noexcept
    {
        auto tmp = *this;
        ++_it_ptr;
        hi_axiom(holds_invariant());
        return tmp;
    }
 
    gap_buffer_iterator &operator--() noexcept
    {
        --_it_ptr;
        hi_axiom(holds_invariant());
        return *this;
    }
 
    gap_buffer_iterator &operator--(int) noexcept
    {
        auto tmp = *this;
        --_it_ptr;
        hi_axiom(holds_invariant());
        return tmp;
    }
 
    gap_buffer_iterator &operator+=(difference_type n) noexcept
    {
        _it_ptr += n;
        hi_axiom(holds_invariant());
        return *this;
    }
 
    gap_buffer_iterator &operator-=(difference_type n) noexcept
    {
        _it_ptr -= n;
        hi_axiom(holds_invariant());
        return *this;
    }
 
    gap_buffer_iterator operator-(difference_type n) const noexcept
    {
        auto tmp = *this;
        return tmp -= n;
    }
 
    friend gap_buffer_iterator operator+(gap_buffer_iterator lhs, difference_type rhs) noexcept
    {
        return lhs += rhs;
    }
 
    friend gap_buffer_iterator operator+(difference_type lhs, gap_buffer_iterator rhs) noexcept
    {
        return rhs += lhs;
    }
 
    template<typename R>
    requires(std::is_same_v<std::remove_cv_t<T>, std::remove_cv_t<R>>) friend difference_type
    operator-(gap_buffer_iterator const &lhs, gap_buffer_iterator<R> const &rhs) noexcept
    {
        return lhs._it_ptr - rhs._it_ptr;
    }
 
    template<typename R>
    requires(std::is_same_v<std::remove_cv_t<T>, std::remove_cv_t<R>>) friend bool
    operator==(gap_buffer_iterator const &lhs, gap_buffer_iterator<R> const &rhs) noexcept
    {
        return lhs._it_ptr == rhs.it_ptr();
    }
 
    template<typename R>
    requires(std::is_same_v<std::remove_cv_t<T>, std::remove_cv_t<R>>) friend auto
    operator<=>(gap_buffer_iterator const &lhs, gap_buffer_iterator<R> const &rhs) noexcept
    {
        return lhs._it_ptr <=> rhs.it_ptr();
    }
 
private:
    gap_buffer_type *_buffer;
    T *_it_ptr;
#if HI_BUILT_TYPE == HI_BT_DEBUG
    std::size_t _version;
#endif
 
    [[nodiscard]] gap_buffer_iterator(gap_buffer_iterator<value_type const> const &other) noexcept requires(!is_const) :
        _buffer(const_cast<gap_buffer_type *>(other._buffer)), _it_ptr(const_cast<T *>(other._it_ptr))
    {
#if HI_BUILT_TYPE == HI_BT_DEBUG
        _version = other._version;
#endif
        hi_axiom(holds_invariant());
    }
 
    [[nodiscard]] T *it_ptr() const noexcept
    {
        return _it_ptr;
    }
 
    [[nodiscard]] std::remove_cv_t<T> *it_rw_ptr() const noexcept
    {
        return const_cast<std::remove_cv_t<T> *>(_it_ptr);
    }
 
    [[nodiscard]] bool holds_invariant() const noexcept
    {
        return _buffer and _it_ptr >= _buffer->_begin and _it_ptr <= _buffer->_it_end
#if HI_BUILT_TYPE == HI_BT_DEBUG
            and _version == _buffer->_version
#endif
            ;
    }
 
    template<typename O>
    requires(std::is_same_v<std::remove_cv_t<T>, std::remove_cv_t<O>>)
        [[nodiscard]] bool holds_invariant(gap_buffer_iterator<O> const &other) const noexcept
    {
        return holds_invariant() and other.holds_invariant() and _buffer == other._buffer;
    }
};
 
} // namespace hi::inline v1