useful algorithms

algorithms.h

template <typename Container>
static void moveElementToFront(Container& c, const typename Container::value_type& e)
{
    auto it = std::find(c.begin(), c.end(), e);
    if (it != c.end())
        std::rotate(c.begin(), it, it + 1);
}

// TODO: multi-element version and non-contiguous version using std::partition
template <typename Container>
static void moveElementToBack(Container& c, const typename Container::value_type& e)
{
    auto it = std::find(c.begin(), c.end(), e);
    if (it != c.end())
        std::rotate(it, it + 1, c.end());
}