|
sl@0
|
1 |
//
|
|
sl@0
|
2 |
//=======================================================================
|
|
sl@0
|
3 |
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
|
|
sl@0
|
4 |
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
|
|
sl@0
|
5 |
//
|
|
sl@0
|
6 |
// Distributed under the Boost Software License, Version 1.0. (See
|
|
sl@0
|
7 |
// accompanying file LICENSE_1_0.txt or copy at
|
|
sl@0
|
8 |
// http://www.boost.org/LICENSE_1_0.txt)
|
|
sl@0
|
9 |
//=======================================================================
|
|
sl@0
|
10 |
//
|
|
sl@0
|
11 |
#if __KCC
|
|
sl@0
|
12 |
namespace std {
|
|
sl@0
|
13 |
|
|
sl@0
|
14 |
template <class RandomAccessIterator, class Distance>
|
|
sl@0
|
15 |
bool __is_heap(RandomAccessIterator first, RandomAccessIterator last,
|
|
sl@0
|
16 |
Distance*)
|
|
sl@0
|
17 |
{
|
|
sl@0
|
18 |
const Distance n = last - first;
|
|
sl@0
|
19 |
|
|
sl@0
|
20 |
Distance parent = 0;
|
|
sl@0
|
21 |
for (Distance child = 1; child < n; ++child) {
|
|
sl@0
|
22 |
if (first[parent] < first[child])
|
|
sl@0
|
23 |
return false;
|
|
sl@0
|
24 |
if ((child & 1) == 0)
|
|
sl@0
|
25 |
++parent;
|
|
sl@0
|
26 |
}
|
|
sl@0
|
27 |
return true;
|
|
sl@0
|
28 |
}
|
|
sl@0
|
29 |
|
|
sl@0
|
30 |
template <class RandomAccessIterator>
|
|
sl@0
|
31 |
inline bool is_heap(RandomAccessIterator first, RandomAccessIterator last)
|
|
sl@0
|
32 |
{
|
|
sl@0
|
33 |
return __is_heap(first, last, distance_type(first));
|
|
sl@0
|
34 |
}
|
|
sl@0
|
35 |
|
|
sl@0
|
36 |
|
|
sl@0
|
37 |
template <class RandomAccessIterator, class Distance, class StrictWeakOrdering>
|
|
sl@0
|
38 |
bool __is_heap(RandomAccessIterator first, RandomAccessIterator last,
|
|
sl@0
|
39 |
StrictWeakOrdering comp,
|
|
sl@0
|
40 |
Distance*)
|
|
sl@0
|
41 |
{
|
|
sl@0
|
42 |
const Distance n = last - first;
|
|
sl@0
|
43 |
|
|
sl@0
|
44 |
Distance parent = 0;
|
|
sl@0
|
45 |
for (Distance child = 1; child < n; ++child) {
|
|
sl@0
|
46 |
if (comp(first[parent], first[child]))
|
|
sl@0
|
47 |
return false;
|
|
sl@0
|
48 |
if ((child & 1) == 0)
|
|
sl@0
|
49 |
++parent;
|
|
sl@0
|
50 |
}
|
|
sl@0
|
51 |
return true;
|
|
sl@0
|
52 |
}
|
|
sl@0
|
53 |
|
|
sl@0
|
54 |
template <class RandomAccessIterator, class StrictWeakOrdering>
|
|
sl@0
|
55 |
inline bool is_heap(RandomAccessIterator first, RandomAccessIterator last,
|
|
sl@0
|
56 |
StrictWeakOrdering comp)
|
|
sl@0
|
57 |
{
|
|
sl@0
|
58 |
return __is_heap(first, last, comp, distance_type(first));
|
|
sl@0
|
59 |
}
|
|
sl@0
|
60 |
|
|
sl@0
|
61 |
}
|
|
sl@0
|
62 |
#endif
|