Searched refs:__hole (Results 1 – 2 of 2) sorted by relevance
47 _RandomAccessIterator __hole = std::__floyd_sift_down<_AlgPolicy>(__first, __comp_ref, __len); in __pop_heap() local50 if (__hole == __last) { in __pop_heap()51 *__hole = std::move(__top); in __pop_heap()53 *__hole = _IterOps<_AlgPolicy>::__iter_move(__last); in __pop_heap()54 ++__hole; in __pop_heap()56 std::__sift_up<_AlgPolicy>(__first, __hole, __comp_ref, __hole - __first); in __pop_heap()
90 _RandomAccessIterator __hole = __first; in __floyd_sift_down() 104 // swap __hole with its largest child in __floyd_sift_down() 105 *__hole = _IterOps<_AlgPolicy>::__iter_move(__child_i); in __floyd_sift_down() 106 __hole = __child_i; in __floyd_sift_down() 108 // if __hole is now a leaf, we're done in __floyd_sift_down() 110 return __hole; in __floyd_sift_down() 91 _RandomAccessIterator __hole = __first; __floyd_sift_down() local