FM / algorithm

/usr/include/boost/algorithm

Name	Size	Mode	Actions
cxx11/	-	0755	rm
cxx14/	-	0755	rm
cxx17/	-	0755	rm
searching/	-	0755	rm
string/	-	0755	rm
algorithm.hpp	2421	0644	edit dl rm
apply_permutation.hpp	4512	0644	edit dl rm
clamp.hpp	7917	0644	edit dl rm
find_backward.hpp	2523	0644	edit dl rm
find_not.hpp	986	0644	edit dl rm
gather.hpp	4164	0644	edit dl rm
hex.hpp	13122	0644	edit dl rm
is_palindrome.hpp	4279	0644	edit dl rm
is_partitioned_until.hpp	2576	0644	edit dl rm
minmax.hpp	1281	0644	edit dl rm
minmax_element.hpp	17488	0644	edit dl rm
sort_subrange.hpp	3611	0644	edit dl rm
string.hpp	1061	0644	edit dl rm
string_regex.hpp	730	0644	edit dl rm

Edit: /usr/include/boost/algorithm/find_backward.hpp (2523B)

/*
   Copyright (c) T. Zachary Laine 2018.

Distributed under the Boost Software License, Version 1.0. (See accompanying
   file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*/
#ifndef BOOST_ALGORITHM_FIND_BACKWARD_HPP
#define BOOST_ALGORITHM_FIND_BACKWARD_HPP

#include <utility>

#include <boost/config.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>

namespace boost { namespace algorithm {

template<typename BidiIter, typename T>
BOOST_CXX14_CONSTEXPR
BidiIter find_backward(BidiIter first, BidiIter last, const T & x)
{
    BidiIter it = last;
    while (it != first) {
        if (*--it == x)
            return it;
    }
    return last;
}

template<typename Range, typename T>
BOOST_CXX14_CONSTEXPR
typename boost::range_iterator<Range>::type find_backward(Range & range, const T & x)
{
    return ::boost::algorithm::find_backward(boost::begin(range), boost::end(range), x);
}

template<typename BidiIter, typename T>
BOOST_CXX14_CONSTEXPR
BidiIter find_not_backward(BidiIter first, BidiIter last, const T & x)
{
    BidiIter it = last;
    while (it != first) {
        if (*--it != x)
            return it;
    }
    return last;
}

template<typename Range, typename T>
BOOST_CXX14_CONSTEXPR
typename boost::range_iterator<Range>::type find_not_backward(Range & range, const T & x)
{
    return ::boost::algorithm::find_not_backward(boost::begin(range), boost::end(range), x);
}

template<typename BidiIter, typename Pred>
BOOST_CXX14_CONSTEXPR
BidiIter find_if_backward(BidiIter first, BidiIter last, Pred p)
{
    BidiIter it = last;
    while (it != first) {
        if (p(*--it))
            return it;
    }
    return last;
}

template<typename Range, typename Pred>
BOOST_CXX14_CONSTEXPR
typename boost::range_iterator<Range>::type find_if_backward(Range & range, Pred p)
{
    return ::boost::algorithm::find_if_backward(boost::begin(range), boost::end(range), p);
}

template<typename BidiIter, typename Pred>
BOOST_CXX14_CONSTEXPR
BidiIter find_if_not_backward(BidiIter first, BidiIter last, Pred p)
{
    BidiIter it = last;
    while (it != first) {
        if (!p(*--it))
            return it;
    }
    return last;
}

template<typename Range, typename Pred>
BOOST_CXX14_CONSTEXPR
typename boost::range_iterator<Range>::type find_if_not_backward(Range & range, Pred p)
{
    return ::boost::algorithm::find_if_not_backward(boost::begin(range), boost::end(range), p);
}

}} // namespace boost and algorithm

#endif // BOOST_ALGORITHM_FIND_BACKWARD_HPP

/* Copyright (c) T. Zachary Laine 2018. Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) */ #ifndef BOOST_ALGORITHM_FIND_BACKWARD_HPP #define BOOST_ALGORITHM_FIND_BACKWARD_HPP #include #include #include #include namespace boost { namespace algorithm { template BOOST_CXX14_CONSTEXPR BidiIter find_backward(BidiIter first, BidiIter last, const T & x) { BidiIter it = last; while (it != first) { if (*--it == x) return it; } return last; } template BOOST_CXX14_CONSTEXPR typename boost::range_iterator::type find_backward(Range & range, const T & x) { return ::boost::algorithm::find_backward(boost::begin(range), boost::end(range), x); } template BOOST_CXX14_CONSTEXPR BidiIter find_not_backward(BidiIter first, BidiIter last, const T & x) { BidiIter it = last; while (it != first) { if (*--it != x) return it; } return last; } template BOOST_CXX14_CONSTEXPR typename boost::range_iterator::type find_not_backward(Range & range, const T & x) { return ::boost::algorithm::find_not_backward(boost::begin(range), boost::end(range), x); } template BOOST_CXX14_CONSTEXPR BidiIter find_if_backward(BidiIter first, BidiIter last, Pred p) { BidiIter it = last; while (it != first) { if (p(*--it)) return it; } return last; } template BOOST_CXX14_CONSTEXPR typename boost::range_iterator::type find_if_backward(Range & range, Pred p) { return ::boost::algorithm::find_if_backward(boost::begin(range), boost::end(range), p); } template BOOST_CXX14_CONSTEXPR BidiIter find_if_not_backward(BidiIter first, BidiIter last, Pred p) { BidiIter it = last; while (it != first) { if (!p(*--it)) return it; } return last; } template BOOST_CXX14_CONSTEXPR typename boost::range_iterator::type find_if_not_backward(Range & range, Pred p) { return ::boost::algorithm::find_if_not_backward(boost::begin(range), boost::end(range), p); } }} // namespace boost and algorithm #endif // BOOST_ALGORITHM_FIND_BACKWARD_HPP