Blame view

3rdparty/boost_1_81_0/boost/pending/is_heap.hpp 1.71 KB
0b6a182c   Hu Chunming   添加无鉴权注册和注销
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
  //
  //=======================================================================
  // 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