runtime_view.hpp

#ifndef ENTT_ENTITY_RUNTIME_VIEW_HPP
#define ENTT_ENTITY_RUNTIME_VIEW_HPP
 
 
#include <iterator>
#include <vector>
#include <utility>
#include <algorithm>
#include <type_traits>
#include "../config/config.h"
#include "sparse_set.hpp"
#include "entity.hpp"
#include "fwd.hpp"
 
 
namespace entt {
 
 
template<typename Entity>
class basic_runtime_view {
    friend class basic_registry<Entity>;
 
    using underlying_iterator_type = typename sparse_set<Entity>::iterator_type;
 
    class iterator {
        friend class basic_runtime_view<Entity>;
 
        using direct_type = std::vector<const sparse_set<Entity> *>;
 
        iterator(const direct_type *all, underlying_iterator_type curr) ENTT_NOEXCEPT
            : pools{all},
              it{curr}
        {
            if(it != (*pools)[0]->end() && !valid()) {
                ++(*this);
            }
        }
 
        bool valid() const {
            return std::all_of(pools->begin()++, pools->end(), [entt = *it](const auto *curr) {
                return curr->has(entt);
            });
        }
 
    public:
        using difference_type = typename underlying_iterator_type::difference_type;
        using value_type = typename underlying_iterator_type::value_type;
        using pointer = typename underlying_iterator_type::pointer;
        using reference = typename underlying_iterator_type::reference;
        using iterator_category = std::bidirectional_iterator_tag;
 
        iterator() ENTT_NOEXCEPT = default;
 
        iterator & operator++() {
            while(++it != (*pools)[0]->end() && !valid());
            return *this;
        }
 
        iterator operator++(int) {
            iterator orig = *this;
            return operator++(), orig;
        }
 
        iterator & operator--() ENTT_NOEXCEPT {
            while(--it != (*pools)[0]->begin() && !valid());
            return *this;
        }
 
        iterator operator--(int) ENTT_NOEXCEPT {
            iterator orig = *this;
            return operator--(), orig;
        }
 
        bool operator==(const iterator &other) const ENTT_NOEXCEPT {
            return other.it == it;
        }
 
        bool operator!=(const iterator &other) const ENTT_NOEXCEPT {
            return !(*this == other);
        }
 
        pointer operator->() const {
            return it.operator->();
        }
 
        reference operator*() const {
            return *operator->();
        }
 
    private:
        const direct_type *pools;
        underlying_iterator_type it;
    };
 
    basic_runtime_view(std::vector<const sparse_set<Entity> *> others) ENTT_NOEXCEPT
        : pools{std::move(others)}
    {
        const auto it = std::min_element(pools.begin(), pools.end(), [](const auto *lhs, const auto *rhs) {
            return (!lhs && rhs) || (lhs && rhs && lhs->size() < rhs->size());
        });
 
        // brings the best candidate (if any) on front of the vector
        std::rotate(pools.begin(), it, pools.end());
    }
 
    bool valid() const {
        return !pools.empty() && pools.front();
    }
 
public:
    using entity_type = Entity;
    using size_type = std::size_t;
    using iterator_type = iterator;
 
    size_type size() const {
        return valid() ? pools.front()->size() : size_type{};
    }
 
    bool empty() const {
        return !valid() || pools.front()->empty();
    }
 
    iterator_type begin() const {
        iterator_type it{};
 
        if(valid()) {
            it = { &pools, pools[0]->begin() };
        }
 
        return it;
    }
 
    iterator_type end() const {
        iterator_type it{};
 
        if(valid()) {
            it = { &pools, pools[0]->end() };
        }
 
        return it;
    }
 
    bool contains(const entity_type entt) const {
        return valid() && std::all_of(pools.cbegin(), pools.cend(), [entt](const auto *view) {
            return view->find(entt) != view->end();
        });
    }
 
    template<typename Func>
    void each(Func func) const {
        for(const auto entity: *this) {
            func(entity);
        }
    }
 
private:
    std::vector<const sparse_set<Entity> *> pools;
};
 
 
}
 
 
#endif