Method merge

publication/code/chapter07/tim_sort_without_gallop.rs:193–206

归并排序

(&mut self)

    // 归并排序
    fn merge(&mut self) {
        while self.second_pos > self.dest_pos && self.second_pos < self.list_len {
            debug_assert!(self.first_pos + (self.second_pos - self.first_len) == self.dest_pos);

            if self.temp[self.first_pos] > self.list[self.second_pos] {
                self.list[self.dest_pos] = self.list[self.second_pos];
                self.second_pos += 1;
            } else {
                self.list[self.dest_pos] = self.temp[self.first_pos];
                self.first_pos += 1;
            }
            self.dest_pos += 1;
        }
    }
}

impl<'a> Drop for MergeLo<'a> {