Chris@16: //
Chris@16: //=======================================================================
Chris@16: // Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
Chris@16: // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
Chris@16: //
Chris@16: // Distributed under the Boost Software License, Version 1.0. (See
Chris@16: // accompanying file LICENSE_1_0.txt or copy at
Chris@16: // http://www.boost.org/LICENSE_1_0.txt)
Chris@16: //=======================================================================
Chris@16: //
Chris@16: #if __KCC
Chris@16: namespace std {
Chris@16: 
Chris@16: template <class RandomAccessIterator, class Distance>
Chris@16: bool __is_heap(RandomAccessIterator first, RandomAccessIterator last,
Chris@16:                Distance*)
Chris@16: {
Chris@16:   const Distance n = last - first;
Chris@16: 
Chris@16:   Distance parent = 0;
Chris@16:   for (Distance child = 1; child < n; ++child) {
Chris@16:     if (first[parent] < first[child]) 
Chris@16:       return false;
Chris@16:     if ((child & 1) == 0)
Chris@16:       ++parent;
Chris@16:   }
Chris@16:   return true;
Chris@16: }
Chris@16: 
Chris@16: template <class RandomAccessIterator>
Chris@16: inline bool is_heap(RandomAccessIterator first, RandomAccessIterator last)
Chris@16: {
Chris@16:   return __is_heap(first, last, distance_type(first));
Chris@16: }
Chris@16: 
Chris@16: 
Chris@16: template <class RandomAccessIterator, class Distance, class StrictWeakOrdering>
Chris@16: bool __is_heap(RandomAccessIterator first, RandomAccessIterator last,
Chris@16:                StrictWeakOrdering comp,
Chris@16:                Distance*)
Chris@16: {
Chris@16:   const Distance n = last - first;
Chris@16: 
Chris@16:   Distance parent = 0;
Chris@16:   for (Distance child = 1; child < n; ++child) {
Chris@16:     if (comp(first[parent], first[child]))
Chris@16:       return false;
Chris@16:     if ((child & 1) == 0)
Chris@16:       ++parent;
Chris@16:   }
Chris@16:   return true;
Chris@16: }
Chris@16: 
Chris@16: template <class RandomAccessIterator, class StrictWeakOrdering>
Chris@16: inline bool is_heap(RandomAccessIterator first, RandomAccessIterator last,
Chris@16:                     StrictWeakOrdering comp)
Chris@16: {
Chris@16:   return __is_heap(first, last, comp, distance_type(first));
Chris@16: }
Chris@16: 
Chris@16: }
Chris@16: #endif