algorithm.hpp

Go to the documentation of this file.

/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
#ifndef NFD_CORE_ALGORITHM_HPP
#define NFD_CORE_ALGORITHM_HPP

#include "common.hpp"
#include <boost/concept/requires.hpp>

namespace nfd {

template<typename It, typename Pred>
BOOST_CONCEPT_REQUIRES(
  ((boost::BidirectionalIterator<It>))
  ((boost::UnaryPredicate<Pred, typename std::iterator_traits<It>::value_type>)),
  (It)
)
find_last_if(It first, It last, Pred p)
{
  std::reverse_iterator<It> firstR(first), lastR(last);
  auto found = std::find_if(lastR, firstR, p);
  return found == firstR ? last : std::prev(found.base());
}

} // namespace nfd

#endif // NFD_CORE_ALGORITHM_HPP