algorithm.hpp

#ifndef ENTT_CORE_ALGORITHM_HPP
#define ENTT_CORE_ALGORITHM_HPP


#include <functional>
#include <algorithm>
#include <utility>


namespace entt {


struct std_sort {
    template<typename It, typename Compare = std::less<>, typename... Args>
    void operator()(It first, It last, Compare compare = Compare{}, Args &&... args) const {
        std::sort(std::forward<Args>(args)..., std::move(first), std::move(last), std::move(compare));
    }
};


struct insertion_sort {
    template<typename It, typename Compare = std::less<>>
    void operator()(It first, It last, Compare compare = Compare{}) const {
        if(first != last) {
            auto it = first + 1;

            while(it != last) {
                auto pre = it++;
                auto value = *pre;

                while(pre-- != first && compare(value, *pre)) {
                    *(pre+1) = *pre;
                }

                *(pre+1) = value;
            }
        }
    }
};


}


#endif // ENTT_CORE_ALGORITHM_HPP