Algorithms.h

Go to the documentation of this file.

#pragma once

#include <algorithm>

namespace Base
{

template <class InputIt, class OutputIt, class Pred, class Fct>
void transform_if(InputIt first, InputIt last, OutputIt dest, Pred pred, Fct transform)
{
    while (first != last)
    {
        if (pred(*first))
            *dest++ = transform(*first);
        else
            *dest++ = *first;

        ++first;
    }
}

template <class Cont, class OutputIt, class Pred, class Fct>
void transform_if(Cont container, OutputIt dest, Pred pred, Fct transform)
{
    transform_if(container.cbegin(), container.cend(), dest, pred, transform);
}

template <typename Container, typename OutputIt, typename BinaryFunction>
void transform(Container container, OutputIt out, BinaryFunction function)
{
    std::transform(container.cbegin(), container.cend(), out, function);
}

template <typename Container, typename T, typename BinaryFunction>
T accumulate(Container container, T init, BinaryFunction function)
{
    return std::accumulate(container.cbegin(), container.cend(), init, function);
}



}