FM / pending

/usr/include/boost/pending

Name	Size	Mode	Actions
detail/	-	0755	rm
bucket_sorter.hpp	4729	0644	edit dl rm
container_traits.hpp	21723	0644	edit dl rm
disjoint_sets.hpp	6515	0644	edit dl rm
fenced_priority_queue.hpp	5188	0644	edit dl rm
fibonacci_heap.hpp	7722	0644	edit dl rm
indirect_cmp.hpp	2557	0644	edit dl rm
integer_log2.hpp	237	0644	edit dl rm
is_heap.hpp	1755	0644	edit dl rm
iterator_adaptors.hpp	230	0644	edit dl rm
iterator_tests.hpp	7421	0644	edit dl rm
mutable_heap.hpp	1993	0644	edit dl rm
mutable_queue.hpp	4234	0644	edit dl rm
property.hpp	13936	0644	edit dl rm
property_serialize.hpp	2898	0644	edit dl rm
queue.hpp	3156	0644	edit dl rm
relaxed_heap.hpp	20678	0644	edit dl rm
stringtok.hpp	3501	0644	edit dl rm

Edit: /usr/include/boost/pending/is_heap.hpp (1755B)

//
//=======================================================================
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
//
// 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)
//=======================================================================
//
#if __KCC
namespace std
{

template < class RandomAccessIterator, class Distance >
bool __is_heap(RandomAccessIterator first, RandomAccessIterator last, Distance*)
{
    const Distance n = last - first;

Distance parent = 0;
    for (Distance child = 1; child < n; ++child)
    {
        if (first[parent] < first[child])
            return false;
        if ((child & 1) == 0)
            ++parent;
    }
    return true;
}

template < class RandomAccessIterator >
inline bool is_heap(RandomAccessIterator first, RandomAccessIterator last)
{
    return __is_heap(first, last, distance_type(first));
}

template < class RandomAccessIterator, class Distance,
    class StrictWeakOrdering >
bool __is_heap(RandomAccessIterator first, RandomAccessIterator last,
    StrictWeakOrdering comp, Distance*)
{
    const Distance n = last - first;

Distance parent = 0;
    for (Distance child = 1; child < n; ++child)
    {
        if (comp(first[parent], first[child]))
            return false;
        if ((child & 1) == 0)
            ++parent;
    }
    return true;
}

template < class RandomAccessIterator, class StrictWeakOrdering >
inline bool is_heap(RandomAccessIterator first, RandomAccessIterator last,
    StrictWeakOrdering comp)
{
    return __is_heap(first, last, comp, distance_type(first));
}

}
#endif

cmd: