algorithm.h

Go to the documentation of this file.

 
#pragma once
 
#include <algorithm>
#include <numeric>
#include <functional>
#include <promeki/core/namespace.h>
#include <promeki/core/list.h>
 
PROMEKI_NAMESPACE_BEGIN
 
template <typename Container>
Container sorted(Container c) {
        std::sort(c.begin(), c.end());
        return c;
}
 
template <typename Container, typename Compare>
Container sorted(Container c, Compare comp) {
        std::sort(c.begin(), c.end(), comp);
        return c;
}
 
template <typename Container, typename Predicate>
Container filtered(const Container &c, Predicate pred) {
        Container result;
        for(auto it = c.begin(); it != c.end(); ++it) {
                if(pred(*it)) result += *it;
        }
        return result;
}
 
template <typename Container, typename Transform>
auto mapped(const Container &c, Transform fn) {
        using ResultType = decltype(fn(*c.begin()));
        List<ResultType> result;
        result.reserve(c.size());
        for(auto it = c.begin(); it != c.end(); ++it) {
                result += fn(*it);
        }
        return result;
}
 
template <typename Container, typename Predicate>
bool allOf(const Container &c, Predicate pred) {
        return std::all_of(c.begin(), c.end(), pred);
}
 
template <typename Container, typename Predicate>
bool anyOf(const Container &c, Predicate pred) {
        return std::any_of(c.begin(), c.end(), pred);
}
 
template <typename Container, typename Predicate>
bool noneOf(const Container &c, Predicate pred) {
        return std::none_of(c.begin(), c.end(), pred);
}
 
template <typename Container, typename Callable>
void forEach(const Container &c, Callable fn) {
        std::for_each(c.begin(), c.end(), fn);
}
 
template <typename Container, typename Init, typename BinaryOp>
Init accumulate(const Container &c, Init init, BinaryOp op) {
        return std::accumulate(c.begin(), c.end(), init, op);
}
 
template <typename Container>
auto minElement(const Container &c) {
        return std::min_element(c.begin(), c.end());
}
 
template <typename Container>
auto maxElement(const Container &c) {
        return std::max_element(c.begin(), c.end());
}
 
template <typename Container, typename Value>
bool contains(const Container &c, const Value &val) {
        return std::find(c.begin(), c.end(), val) != c.end();
}
 
PROMEKI_NAMESPACE_END