/usr/include/boost/algorithm
NameSizeModeActions
cxx11/-0755rm
cxx14/-0755rm
cxx17/-0755rm
searching/-0755rm
string/-0755rm
algorithm.hpp24210644editdlrm
apply_permutation.hpp45120644editdlrm
clamp.hpp79170644editdlrm
find_backward.hpp25230644editdlrm
find_not.hpp9860644editdlrm
gather.hpp41640644editdlrm
hex.hpp131220644editdlrm
is_palindrome.hpp42790644editdlrm
is_partitioned_until.hpp25760644editdlrm
minmax.hpp12810644editdlrm
minmax_element.hpp174880644editdlrm
sort_subrange.hpp36110644editdlrm
string.hpp10610644editdlrm
string_regex.hpp7300644editdlrm
Edit: /usr/include/boost/algorithm/find_not.hpp (986B)
/* 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_NOT_HPP #define BOOST_ALGORITHM_FIND_NOT_HPP #include #include #include #include namespace boost { namespace algorithm { template BOOST_CXX14_CONSTEXPR InputIter find_not(InputIter first, Sentinel last, const T & x) { for (; first != last; ++first) { if (*first != x) break; } return first; } template BOOST_CXX14_CONSTEXPR typename boost::range_iterator::type find_not(Range & r, const T & x) { return ::boost::algorithm::find_not(boost::begin(r), boost::end(r), x); } }} // namespace boost and algorithm #endif // BOOST_ALGORITHM_FIND_NOT_HPP