1. template <class RandomAccessIterator> 
    2.  
     
  2. inline void push_heap(RandomAccessIterator first, RandomAccessIterator last) { 
    3.  
     
  3.     __push_heap_aux(first, last, distance_type(first), value_type(first)); 
    4.  
     
  4. } 
    5.  
     
  5.  
    6.  
     
  6. template <class RandomAccessIterator, class Distance, class T> 
    7.  
     
  7. inline void __push_heap_aux(RandomAccessIterator first, 
    8.  
     
  8.                            RandomAccessIterator last, Distance*, T*) { 
    9.  
     
  9.     __push_heap(first, Distance((last - first) - 1, Distance(0), T(*(last - 1))); 
    10.  
     
  10. } 
    11.  
    
 
    
 
 
    
 
    
     
     
  1. template <class RandomAccessIterator, class Distance, class T>                    
    2.  
     
  2. void __push_heap(RandomAccessIterator first, Distance holeIndex,
    3.  
     
  3.                  Distance topIndex, T value) {                                    
    4.  
     
  4.     Distance parent = (holeIndex - 1)/2;  
    5.  
     
  5.     while(holeIndex > topIndex && *(first + parent) < value) {                    
    6.  
     
  6.         *(first + holeIndex) = *(first + parent);                                 
    7.  
     
  7.         holeIndex = parent;                                                       
    8.  
     
  8.         parent = (holeIndex - 1)/2;                                               
    9.  
     
  9.     }                                                                             
    10.  
     
  10.     *(first + holeIndex) = value;                                                 
    11.  
     
  11. } 
    12.