4388     int parent_index = i;  in SortUnchecked()  local
4390     while (parent_index <= max_parent_index) {  in SortUnchecked()
4391       int child_index = 2 * parent_index + 1;  in SortUnchecked()
4401       Swap(parent_index, child_index);  in SortUnchecked()
4403       parent_index = child_index;  // parent_hash remains correct.  in SortUnchecked()
4412     int parent_index = 0;  in SortUnchecked()  local
4413     const uint32_t parent_hash = GetKey(parent_index)->Hash();  in SortUnchecked()
4415     while (parent_index <= max_parent_index) {  in SortUnchecked()
4416       int child_index = parent_index * 2 + 1;  in SortUnchecked()
4426       Swap(parent_index, child_index);  in SortUnchecked()
4427       parent_index = child_index;  in SortUnchecked()
8255       int parent_index = ((child_index + 1) >> 1) - 1;  in HeapSortPairs()  local
8256       uint32_t parent_value = NumberToUint32(numbers->get(parent_index));  in HeapSortPairs()
8259         content->SwapPairs(numbers, parent_index, child_index);  in HeapSortPairs()
8263       child_index = parent_index;  in HeapSortPairs()
8272     int parent_index = 0;  in HeapSortPairs()  local
8274       int child_index = ((parent_index + 1) << 1) - 1;  in HeapSortPairs()
8278       uint32_t parent_value = NumberToUint32(numbers->get(parent_index));  in HeapSortPairs()
8281         content->SwapPairs(numbers, parent_index, child_index);  in HeapSortPairs()
8282         parent_index = child_index;  in HeapSortPairs()
8285         content->SwapPairs(numbers, parent_index, child_index + 1);  in HeapSortPairs()
8286         parent_index = child_index + 1;  in HeapSortPairs()