grid_layout.hpp

// Copyright Take Vos 2022.
// 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 "box_constraints.hpp"
#include "box_shape.hpp"
#include "spreadsheet_address.hpp"
#include "../geometry/module.hpp"
#include "../utility/module.hpp"
#include <cstdint>
#include <numeric>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
 
namespace hi { inline namespace v1 {
namespace detail {
 
template<typename T>
struct grid_layout_cell {
    using value_type = T;
 
    size_t first_column = 0;
    size_t first_row = 0;
    size_t last_column = 0;
    size_t last_row = 0;
    bool beyond_maximum = false;
    value_type value = {};
    box_shape shape = {};
 
    constexpr grid_layout_cell() noexcept = default;
    constexpr grid_layout_cell(grid_layout_cell const&) noexcept = default;
    constexpr grid_layout_cell(grid_layout_cell&&) noexcept = default;
    constexpr grid_layout_cell& operator=(grid_layout_cell const&) noexcept = default;
    constexpr grid_layout_cell& operator=(grid_layout_cell&&) noexcept = default;
 
    constexpr grid_layout_cell(
        size_t first_column,
        size_t first_row,
        size_t last_column,
        size_t last_row,
        bool beyond_maximum,
        std::convertible_to<value_type> auto&& value) noexcept :
        first_column(first_column),
        first_row(first_row),
        last_column(last_column),
        last_row(last_row),
        beyond_maximum(beyond_maximum),
        value(hi_forward(value))
    {
        hi_assert(first_column < last_column);
        hi_assert(first_row < last_row);
    }
 
    constexpr void set_constraints(box_constraints const& constraints) noexcept
    {
        _constraints = constraints;
    }
 
    template<hi::axis Axis>
    [[nodiscard]] constexpr size_t first() const noexcept
    {
        if constexpr (Axis == axis::x) {
            return first_column;
        } else if constexpr (Axis == axis::y) {
            return first_row;
        } else {
            hi_static_no_default();
        }
    }
 
    template<hi::axis Axis>
    [[nodiscard]] constexpr size_t last() const noexcept
    {
        if constexpr (Axis == axis::x) {
            return last_column;
        } else if constexpr (Axis == axis::y) {
            return last_row;
        } else {
            hi_static_no_default();
        }
    }
 
    template<hi::axis Axis>
    [[nodiscard]] constexpr size_t span() const noexcept
    {
        hi_axiom(first<Axis>() < last<Axis>());
        return last<Axis>() - first<Axis>();
    }
 
    template<hi::axis Axis>
    [[nodiscard]] constexpr auto alignment() const noexcept
    {
        if constexpr (Axis == axis::x) {
            return _constraints.alignment.horizontal();
        } else if constexpr (Axis == axis::y) {
            return _constraints.alignment.vertical();
        } else {
            hi_static_no_default();
        }
    }
 
    template<hi::axis Axis>
    [[nodiscard]] constexpr int minimum() const noexcept
    {
        if constexpr (Axis == axis::x) {
            return _constraints.minimum.width();
        } else if constexpr (Axis == axis::y) {
            return _constraints.minimum.height();
        } else {
            hi_static_no_default();
        }
    }
 
    template<hi::axis Axis>
    [[nodiscard]] constexpr int preferred() const noexcept
    {
        if constexpr (Axis == axis::x) {
            return _constraints.preferred.width();
        } else if constexpr (Axis == axis::y) {
            return _constraints.preferred.height();
        } else {
            hi_static_no_default();
        }
    }
 
    template<hi::axis Axis>
    [[nodiscard]] constexpr int maximum() const noexcept
    {
        if constexpr (Axis == axis::x) {
            return _constraints.maximum.width();
        } else if constexpr (Axis == axis::y) {
            return _constraints.maximum.height();
        } else {
            hi_static_no_default();
        }
    }
 
    template<hi::axis Axis>
    [[nodiscard]] constexpr int margin_before(bool forward) const noexcept
    {
        if constexpr (Axis == axis::x) {
            if (forward) {
                return _constraints.margins.left();
            } else {
                return _constraints.margins.right();
            }
        } else if constexpr (Axis == axis::y) {
            if (forward) {
                return _constraints.margins.bottom();
            } else {
                return _constraints.margins.top();
            }
        } else {
            hi_static_no_default();
        }
    }
 
    template<hi::axis Axis>
    [[nodiscard]] constexpr int margin_after(bool forward) const noexcept
    {
        if constexpr (Axis == axis::x) {
            if (forward) {
                return _constraints.margins.right();
            } else {
                return _constraints.margins.left();
            }
        } else if constexpr (Axis == axis::y) {
            if (forward) {
                return _constraints.margins.top();
            } else {
                return _constraints.margins.bottom();
            }
        } else {
            hi_static_no_default();
        }
    }
 
    template<hi::axis Axis>
    [[nodiscard]] constexpr int padding_before(bool forward) const noexcept
    {
        if constexpr (Axis == axis::x) {
            if (forward) {
                return _constraints.padding.left();
            } else {
                return _constraints.padding.right();
            }
        } else if constexpr (Axis == axis::y) {
            if (forward) {
                return _constraints.padding.bottom();
            } else {
                return _constraints.padding.top();
            }
        } else {
            hi_static_no_default();
        }
    }
 
    template<hi::axis Axis>
    [[nodiscard]] constexpr int padding_after(bool forward) const noexcept
    {
        if constexpr (Axis == axis::x) {
            if (forward) {
                return _constraints.padding.right();
            } else {
                return _constraints.padding.left();
            }
        } else if constexpr (Axis == axis::y) {
            if (forward) {
                return _constraints.padding.top();
            } else {
                return _constraints.padding.bottom();
            }
        } else {
            hi_static_no_default();
        }
    }
 
private:
    box_constraints _constraints;
};
 
template<hi::axis Axis, typename T>
class grid_layout_axis_constraints {
public:
    constexpr static hi::axis axis = Axis;
 
    using value_type = T;
    using alignment_type = std::conditional_t<axis == axis::y, vertical_alignment, horizontal_alignment>;
    using cell_type = grid_layout_cell<value_type>;
    using cell_vector = std::vector<cell_type>;
 
    struct constraint_type {
        int minimum = 0;
 
        int preferred = 0;
 
        int maximum = std::numeric_limits<int>::max();
 
        int margin_before = 0;
 
        int margin_after = 0;
 
        int padding_before = 0;
 
        int padding_after = 0;
 
        alignment_type alignment = alignment_type::none;
 
        bool beyond_maximum = false;
 
        int position = 0;
 
        int extent = 0;
 
        std::optional<int> guideline = 0;
    };
    using constraint_vector = std::vector<constraint_type>;
    using iterator = constraint_vector::iterator;
    using const_iterator = constraint_vector::const_iterator;
    using reverse_iterator = constraint_vector::reverse_iterator;
    using reference = constraint_vector::reference;
    using const_reference = constraint_vector::const_reference;
 
    constexpr ~grid_layout_axis_constraints() = default;
    constexpr grid_layout_axis_constraints() noexcept = default;
    constexpr grid_layout_axis_constraints(grid_layout_axis_constraints const&) noexcept = default;
    constexpr grid_layout_axis_constraints(grid_layout_axis_constraints&&) noexcept = default;
    constexpr grid_layout_axis_constraints& operator=(grid_layout_axis_constraints const&) noexcept = default;
    constexpr grid_layout_axis_constraints& operator=(grid_layout_axis_constraints&&) noexcept = default;
    [[nodiscard]] constexpr friend bool
    operator==(grid_layout_axis_constraints const&, grid_layout_axis_constraints const&) noexcept = default;
 
    constexpr grid_layout_axis_constraints(cell_vector const& cells, size_t num, bool forward) noexcept :
        _constraints(num), _forward(forward)
    {
        for (hilet& cell : cells) {
            construct_simple_cell(cell);
        }
        construct_fixup();
 
        for (hilet& cell : cells) {
            construct_span_cell(cell);
        }
        construct_fixup();
    }
 
    [[nodiscard]] constexpr int margin_before() const noexcept
    {
        return empty() ? 0 : _forward ? front().margin_before : back().margin_before;
    }
 
    [[nodiscard]] constexpr int margin_after() const noexcept
    {
        return empty() ? 0 : _forward ? back().margin_after : front().margin_after;
    }
 
    [[nodiscard]] constexpr int padding_before() const noexcept
    {
        return empty() ? 0 : _forward ? front().padding_before : back().padding_before;
    }
 
    [[nodiscard]] constexpr int padding_after() const noexcept
    {
        return empty() ? 0 : _forward ? back().padding_after : front().padding_after;
    }
 
    [[nodiscard]] constexpr std::tuple<int, int, int> update_constraints() const noexcept
    {
        return constraints(begin(), end());
    }
 
    [[nodiscard]] constexpr std::tuple<int, int, int> constraints(cell_type const& cell) const noexcept
    {
        return constraints(cell.first<axis>(), cell.last<axis>());
    }
 
    [[nodiscard]] constexpr int position(cell_type const& cell) const noexcept
    {
        return position(cell.first<axis>(), cell.last<axis>());
    }
 
    [[nodiscard]] constexpr int extent(cell_type const& cell) const noexcept
    {
        return extent(cell.first<axis>(), cell.last<axis>());
    }
 
    [[nodiscard]] constexpr std::optional<int> guideline(cell_type const& cell) const noexcept
    {
        if (cell.span<axis>() == 1) {
            return guideline(cell.first<axis>());
        } else {
            return std::nullopt;
        }
    }
 
    constexpr void layout(int new_position, int new_extent, std::optional<int> external_guideline, int guideline_width) noexcept
    {
        // Start with the extent of each constraint equal to the preferred extent.
        for (auto& constraint : _constraints) {
            constraint.extent = constraint.preferred;
        }
 
        // If the total extent is too large, shrink the constraints that allow to be shrunk.
        auto [total_extent, count] = layout_shrink(begin(), end());
        while (total_extent > new_extent and count != 0) {
            // The result may shrink slightly too much, which will be fixed by expanding in the next loop.
            std::tie(total_extent, count) = layout_shrink(begin(), end(), total_extent - new_extent, count);
        }
 
        // If the total extent is too small, expand the constraints that allow to be grown.
        std::tie(total_extent, count) = layout_expand(begin(), end());
        while (total_extent < new_extent and count != 0) {
            // The result may expand slightly too much, we don't care.
            std::tie(total_extent, count) = layout_expand(begin(), end(), new_extent - total_extent, count);
        }
 
        // If the total extent is still too small, expand into the cells that are marked beyond_maximum.
        if (total_extent < new_extent) {
            // The result may expand slightly too much, we don't care.
            count = std::count_if(begin(), end(), [](hilet& item) {
                return item.beyond_maximum;
            });
            if (count) {
                hilet todo = new_extent - total_extent;
                hilet per_extent = narrow_cast<int>((todo + count - 1) / count);
                for (auto& constraint : _constraints) {
                    if (constraint.beyond_maximum) {
                        constraint.extent += per_extent;
                    }
                }
            }
            total_extent = extent(cbegin(), cend());
        }
 
        // If the total extent is still too small, expand the first constrain above the maximum size.
        if (total_extent < new_extent and not empty()) {
            // The result may expand slightly too much, we don't care.
            front().extent += new_extent - total_extent;
        }
 
        if (_forward) {
            layout_position(begin(), end(), new_position, guideline_width);
        } else {
            layout_position(rbegin(), rend(), new_position, guideline_width);
        }
 
        if (external_guideline and size() == 1) {
            // When there is only 1 cell on this axis, the external guideline is used.
            // XXX If there are more cell, then the external alignment should be taken into account.
            front().guideline = *external_guideline;
        }
    }
 
    [[nodiscard]] constexpr size_t size() const noexcept
    {
        return _constraints.size();
    }
 
    [[nodiscard]] constexpr bool empty() const noexcept
    {
        return _constraints.empty();
    }
 
    [[nodiscard]] constexpr iterator begin() noexcept
    {
        return _constraints.begin();
    }
 
    [[nodiscard]] constexpr const_iterator begin() const noexcept
    {
        return _constraints.begin();
    }
 
    [[nodiscard]] constexpr const_iterator cbegin() const noexcept
    {
        return _constraints.cbegin();
    }
 
    [[nodiscard]] constexpr iterator end() noexcept
    {
        return _constraints.end();
    }
 
    [[nodiscard]] constexpr const_iterator end() const noexcept
    {
        return _constraints.end();
    }
 
    [[nodiscard]] constexpr const_iterator cend() const noexcept
    {
        return _constraints.cend();
    }
 
    [[nodiscard]] constexpr reverse_iterator rbegin() noexcept
    {
        return _constraints.rbegin();
    }
 
    [[nodiscard]] constexpr reverse_iterator rend() noexcept
    {
        return _constraints.rend();
    }
 
    [[nodiscard]] constexpr reference operator[](size_t index) noexcept
    {
        hi_axiom(index < size());
        return _constraints[index];
    }
 
    [[nodiscard]] constexpr const_reference operator[](size_t index) const noexcept
    {
        hi_axiom(index < size());
        return _constraints[index];
    }
 
    [[nodiscard]] constexpr reference front() noexcept
    {
        hi_axiom(not empty());
        return _constraints.front();
    }
 
    [[nodiscard]] constexpr const_reference front() const noexcept
    {
        hi_axiom(not empty());
        return _constraints.front();
    }
 
    [[nodiscard]] constexpr reference back() noexcept
    {
        hi_axiom(not empty());
        return _constraints.back();
    }
 
    [[nodiscard]] constexpr const_reference back() const noexcept
    {
        hi_axiom(not empty());
        return _constraints.back();
    }
 
private:
    constraint_vector _constraints = {};
 
    bool _forward = true;
 
    [[nodiscard]] constexpr std::pair<int, size_t>
    layout_shrink(const_iterator first, const_iterator last, int extra = 0, size_t count = 1) noexcept
    {
        hilet first_ = begin() + std::distance(cbegin(), first);
        hilet last_ = begin() + std::distance(cbegin(), last);
 
        hi_axiom(extra >= 0);
 
        hilet extra_per = narrow_cast<int>((extra + count - 1) / count);
 
        auto new_extent = 0;
        auto new_count = 0_uz;
        for (auto it = first_; it != last_; ++it) {
            it->extent = it->extent - std::max(extra_per, it->extent - it->minimum);
 
            if (it != first_) {
                new_extent += it->margin_before;
            }
            new_extent += it->extent;
 
            if (it->extent > it->minimum) {
                ++new_count;
            }
        }
 
        return {new_extent, new_count};
    }
 
    [[nodiscard]] constexpr std::pair<int, size_t>
    layout_expand(const_iterator first, const_iterator last, int extra = 0, size_t count = 1) noexcept
    {
        hilet first_ = begin() + std::distance(cbegin(), first);
        hilet last_ = begin() + std::distance(cbegin(), last);
 
        hi_axiom(extra >= 0);
 
        hilet extra_per = narrow_cast<int>((extra + count - 1) / count);
 
        auto new_extent = 0;
        auto new_count = 0_uz;
        for (auto it = first_; it != last_; ++it) {
            it->extent = it->extent + std::min(extra_per, it->maximum - it->extent);
 
            if (it != first_) {
                new_extent += it->margin_before;
            }
            new_extent += it->extent;
 
            if (it->extent < it->maximum) {
                ++new_count;
            }
        }
 
        return {new_extent, new_count};
    }
 
    constexpr void layout_position(auto first, auto last, int start_position, int guideline_width) noexcept
    {
        auto position = start_position;
        for (auto it = first; it != last; ++it) {
            it->position = position;
            it->guideline = make_guideline(
                it->alignment, position, position + it->extent, it->padding_before, it->padding_after, guideline_width);
 
            position += it->extent;
            position += it->margin_after;
        }
    }
 
    constexpr void construct_simple_cell(cell_type const& cell) noexcept
    {
        inplace_max(_constraints[cell.first<axis>()].margin_before, cell.margin_before<axis>(_forward));
        inplace_max(_constraints[cell.last<axis>() - 1].margin_after, cell.margin_after<axis>(_forward));
        inplace_max(_constraints[cell.first<axis>()].padding_before, cell.padding_before<axis>(_forward));
        inplace_max(_constraints[cell.last<axis>() - 1].padding_after, cell.padding_after<axis>(_forward));
 
        for (auto i = cell.first<axis>(); i != cell.last<axis>(); ++i) {
            _constraints[i].beyond_maximum |= cell.beyond_maximum;
        }
 
        if (cell.span<axis>() == 1) {
            inplace_max(_constraints[cell.first<axis>()].alignment, cell.alignment<axis>());
            inplace_max(_constraints[cell.first<axis>()].minimum, cell.minimum<axis>());
            inplace_max(_constraints[cell.first<axis>()].preferred, cell.preferred<axis>());
            inplace_min(_constraints[cell.first<axis>()].maximum, cell.maximum<axis>());
        }
    }
 
    constexpr void construct_span_cell(cell_type const& cell) noexcept
    {
        auto num_cells = narrow_cast<int>(cell.span<axis>());
 
        if (cell.span<axis>() > 1) {
            hilet[span_minimum, span_preferred, span_maximum] = constraints(cell);
            if (hilet extra = cell.minimum<axis>() - span_minimum; extra > 0) {
                hilet extra_per_cell = (extra + num_cells - 1) / num_cells;
                for (auto i = cell.first<axis>(); i != cell.last<axis>(); ++i) {
                    _constraints[i].minimum += extra_per_cell;
                }
            }
 
            if (hilet extra = cell.preferred<axis>() - span_preferred; extra > 0) {
                hilet extra_per_cell = (extra + num_cells - 1) / num_cells;
                for (auto i = cell.first<axis>(); i != cell.last<axis>(); ++i) {
                    _constraints[i].preferred += extra_per_cell;
                }
            }
 
            if (hilet extra = cell.maximum<axis>() - span_preferred; extra < 0) {
                hilet extra_per_cell = (extra + num_cells) / num_cells;
                for (auto i = cell.first<axis>(); i != cell.last<axis>(); ++i) {
                    // The maximum could become too low here, fixup() will fix this.
                    _constraints[i].maximum += extra_per_cell;
                }
            }
        }
    }
 
    constexpr void construct_fixup() noexcept
    {
        for (auto it = begin(); it != end(); ++it) {
            // Fix the margins so that between two constraints they are equal.
            if (it + 1 != end()) {
                it->margin_after = (it + 1)->margin_before = std::max(it->margin_after, (it + 1)->margin_before);
            }
 
            // Fix the constraints so that minimum <= preferred <= maximum.
            inplace_max(it->preferred, it->minimum);
            inplace_max(it->maximum, it->preferred);
 
            // Fix the padding, so that it doesn't overlap.
            if (it->padding_before + it->padding_after > it->minimum) {
                hilet padding_diff = it->padding_after - it->padding_before;
                hilet middle = std::clamp(it->minimum / 2 + padding_diff, 0, it->minimum);
                it->padding_after = middle;
                it->padding_before = it->minimum - middle;
            }
        }
    }
 
    [[nodiscard]] constexpr std::tuple<int, int, int> constraints(const_iterator first, const_iterator last) const noexcept
    {
        auto r_minimum = 0;
        auto r_preferred = 0;
        auto r_maximum = 0;
        auto r_margin = 0;
 
        if (first != last) {
            r_minimum = first->minimum;
            r_preferred = first->preferred;
            r_maximum = first->maximum;
            for (auto it = first + 1; it != last; ++it) {
                r_margin += it->margin_before;
                r_minimum += it->minimum;
                r_preferred += it->preferred;
                r_maximum += it->maximum;
            }
        }
        return {r_minimum + r_margin, r_preferred + r_margin, r_maximum + r_margin};
    }
 
    [[nodiscard]] constexpr std::tuple<int, int, int> constraints(size_t first, size_t last) const noexcept
    {
        hi_axiom(first <= last);
        hi_axiom(last <= size());
        return constraints(begin() + first, begin() + last);
    }
 
    [[nodiscard]] constexpr int position(const_iterator first, const_iterator last) const noexcept
    {
        hi_axiom(first != last);
        if (_forward) {
            return first->position;
        } else {
            return (last - 1)->position;
        }
    }
 
    [[nodiscard]] constexpr int position(size_t first, size_t last) const noexcept
    {
        hi_axiom(first < last);
        hi_axiom(last <= size());
        return position(cbegin() + first, cbegin() + last);
    }
 
    [[nodiscard]] constexpr int extent(const_iterator first, const_iterator last) const noexcept
    {
        auto r = 0;
        if (first != last) {
            r = first->extent;
            for (auto it = first + 1; it != last; ++it) {
                r += it->margin_before;
                r += it->extent;
            }
        }
        return r;
    }
 
    [[nodiscard]] constexpr int extent(size_t first, size_t last) const noexcept
    {
        hi_axiom(first <= last);
        hi_axiom(last <= size());
        return extent(cbegin() + first, cbegin() + last);
    }
 
    [[nodiscard]] constexpr std::optional<int> guideline(const_iterator it) const noexcept
    {
        return it->guideline;
    }
 
    [[nodiscard]] constexpr std::optional<int> guideline(size_t i) const noexcept
    {
        return guideline(cbegin() + i);
    }
};
 
} // namespace detail
 
template<typename T>
class grid_layout {
public:
    using value_type = T;
 
    using cell_type = detail::grid_layout_cell<value_type>;
    using cell_vector = std::vector<cell_type>;
    using iterator = cell_vector::iterator;
    using const_iterator = cell_vector::const_iterator;
    using reference = cell_vector::reference;
    using const_reference = cell_vector::const_reference;
 
    ~grid_layout() = default;
    constexpr grid_layout() noexcept = default;
    constexpr grid_layout(grid_layout const&) noexcept = default;
    constexpr grid_layout(grid_layout&&) noexcept = default;
    constexpr grid_layout& operator=(grid_layout const&) noexcept = default;
    constexpr grid_layout& operator=(grid_layout&&) noexcept = default;
    [[nodiscard]] constexpr friend bool operator==(grid_layout const&, grid_layout const&) noexcept = default;
 
    [[nodiscard]] constexpr bool empty() const noexcept
    {
        return _cells.empty();
    }
 
    [[nodiscard]] constexpr size_t size() const noexcept
    {
        return _cells.size();
    }
 
    [[nodiscard]] constexpr size_t num_columns() const noexcept
    {
        return _num_columns;
    }
 
    [[nodiscard]] constexpr size_t num_rows() const noexcept
    {
        return _num_rows;
    }
 
    [[nodiscard]] constexpr iterator begin() noexcept
    {
        return _cells.begin();
    }
 
    [[nodiscard]] constexpr iterator end() noexcept
    {
        return _cells.end();
    }
 
    [[nodiscard]] constexpr const_iterator begin() const noexcept
    {
        return _cells.begin();
    }
 
    [[nodiscard]] constexpr const_iterator end() const noexcept
    {
        return _cells.end();
    }
 
    [[nodiscard]] constexpr const_iterator cbegin() const noexcept
    {
        return _cells.cbegin();
    }
 
    [[nodiscard]] constexpr const_iterator cend() const noexcept
    {
        return _cells.cend();
    }
 
    [[nodiscard]] constexpr const_reference operator[](size_t i) const noexcept
    {
        return _cells[i];
    }
 
    [[nodiscard]] constexpr reference operator[](size_t i) noexcept
    {
        return _cells[i];
    }
 
    [[nodiscard]] constexpr bool cell_in_use(size_t first_column, size_t first_row, size_t last_column, size_t last_row) noexcept
    {
        // At least one cell must be in the range.
        hi_axiom(first_column < last_column);
        hi_axiom(first_row < last_row);
 
        for (hilet& cell : _cells) {
            if (first_column >= cell.last_column) {
                continue;
            }
            if (last_column <= cell.first_column) {
                continue;
            }
            if (first_row >= cell.last_row) {
                continue;
            }
            if (last_row <= cell.first_row) {
                continue;
            }
            return true;
        }
        return false;
    }
 
    template<forward_of<value_type> Value>
    constexpr reference add_cell(
        size_t first_column,
        size_t first_row,
        size_t last_column,
        size_t last_row,
        Value&& value,
        bool beyond_maximum = false) noexcept
    {
        // At least one cell must be in the range.
        hi_assert(first_column < last_column);
        hi_assert(first_row < last_row);
        hi_assert(not cell_in_use(first_column, first_row, last_column, last_row));
        auto& r = _cells.emplace_back(first_column, first_row, last_column, last_row, beyond_maximum, std::forward<Value>(value));
        update_after_insert_or_delete();
        return r;
    }
 
    template<forward_of<value_type> Value>
    constexpr reference add_cell(size_t column, size_t row, Value&& value, bool beyond_maximum = false) noexcept
    {
        return add_cell(column, row, column + 1, row + 1, std::forward<Value>(value), beyond_maximum);
    }
 
    constexpr void clear() noexcept
    {
        _cells.clear();
        update_after_insert_or_delete();
    }
 
    [[nodiscard]] constexpr box_constraints constraints(bool left_to_right) const noexcept
    {
        // Rows in the grid are laid out from top to bottom which is reverse from the y-axis up.
        _row_constraints = {_cells, num_rows(), false};
        _column_constraints = {_cells, num_columns(), left_to_right};
 
        auto r = box_constraints{};
        std::tie(r.minimum.width(), r.preferred.width(), r.maximum.width()) = _column_constraints.update_constraints();
        r.margins.left() = _column_constraints.margin_before();
        r.margins.right() = _column_constraints.margin_after();
        r.padding.left() = _column_constraints.padding_before();
        r.padding.right() = _column_constraints.padding_after();
 
        std::tie(r.minimum.height(), r.preferred.height(), r.maximum.height()) = _row_constraints.update_constraints();
        r.margins.bottom() = _row_constraints.margin_after();
        r.margins.top() = _row_constraints.margin_before();
        r.padding.bottom() = _row_constraints.padding_after();
        r.padding.top() = _row_constraints.padding_before();
 
        r.alignment = [&] {
            if (num_rows() == 1 and num_columns() == 1) {
                return hi::alignment{_column_constraints.front().alignment, _row_constraints.front().alignment};
            } else if (num_rows() == 1) {
                return hi::alignment{_row_constraints.front().alignment};
            } else if (num_columns() == 1) {
                return hi::alignment{_column_constraints.front().alignment};
            } else {
                return hi::alignment{};
            }
        }();
 
        return r;
    }
 
    constexpr void set_layout(box_shape const& shape, int baseline_adjustment) noexcept
    {
        // Rows in the grid are laid out from top to bottom which is reverse from the y-axis up.
        _column_constraints.layout(shape.x(), shape.width(), shape.centerline, 0);
        _row_constraints.layout(shape.y(), shape.height(), shape.baseline, baseline_adjustment);
 
        // Assign the shape for each cell.
        for (auto& cell : _cells) {
            cell.shape.rectangle = {
                _column_constraints.position(cell),
                _row_constraints.position(cell),
                _column_constraints.extent(cell),
                _row_constraints.extent(cell)};
            cell.shape.centerline = _column_constraints.guideline(cell);
            cell.shape.baseline = _row_constraints.guideline(cell);
        }
    }
 
private:
    cell_vector _cells = {};
    size_t _num_rows = 0;
    size_t _num_columns = 0;
    mutable detail::grid_layout_axis_constraints<axis::y, value_type> _row_constraints = {};
    mutable detail::grid_layout_axis_constraints<axis::x, value_type> _column_constraints = {};
 
    constexpr void sort_cells() noexcept
    {
        std::sort(_cells.begin(), _cells.end(), [](cell_type const& lhs, cell_type const& rhs) {
            if (lhs.first_row != rhs.first_row) {
                return lhs.first_row < rhs.first_row;
            } else {
                return lhs.first_column < rhs.first_column;
            }
        });
    }
 
    constexpr void update_after_insert_or_delete() noexcept
    {
        sort_cells();
 
        _num_rows = 0;
        _num_columns = 0;
        for (hilet& cell : _cells) {
            inplace_max(_num_rows, cell.last_row);
            inplace_max(_num_columns, cell.last_column);
        }
    }
};
 
}} // namespace hi::v1