Sha256: 495f569df21f2dad8f9930dd481ffc4de1a87fdde786ed59ca9930c1248dd3a9
Contents?: true
Size: 1.48 KB
Versions: 1
Compression:
Stored size: 1.48 KB
Contents
/*============================================================================== Copyright (c) 2010-2011 Bryce Lelbach 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_DETAIL_SORTED_HPP #define BOOST_DETAIL_SORTED_HPP #include <boost/detail/iterator.hpp> #include <functional> namespace boost { namespace detail { template<class Iterator, class Comp> inline Iterator is_sorted_until (Iterator first, Iterator last, Comp c) { if (first == last) return last; Iterator it = first; ++it; for (; it != last; first = it, ++it) if (c(*it, *first)) return it; return it; } template<class Iterator> inline Iterator is_sorted_until (Iterator first, Iterator last) { typedef typename boost::detail::iterator_traits<Iterator>::value_type value_type; typedef std::less<value_type> c; return ::boost::detail::is_sorted_until(first, last, c()); } template<class Iterator, class Comp> inline bool is_sorted (Iterator first, Iterator last, Comp c) { return ::boost::detail::is_sorted_until(first, last, c) == last; } template<class Iterator> inline bool is_sorted (Iterator first, Iterator last) { return ::boost::detail::is_sorted_until(first, last) == last; } } // detail } // boost #endif // BOOST_DETAIL_SORTED_HPP
Version data entries
1 entries across 1 versions & 1 rubygems
Version | Path |
---|---|
ruby-ogre-0.0.1-x86-mingw32 | deps/include/boost/detail/is_sorted.hpp |