Lines Matching defs:merge
22208 /// The current algorithm is an adaptive, iterative merge sort inspired by
22259 /// The current algorithm is an adaptive, iterative merge sort inspired by
22302 /// The current algorithm is an adaptive, iterative merge sort inspired by
22880 unsafe fn merge<T, F>(v: &mut [T], mid: usize, buf: *mut T, is_less: &mut F)
22888 // The merge process first copies the shorter run into `buf`. Then it traces the newly copied
22988 /// This merge sort borrows some (but not all) ideas from TimSort, which is described in detail
23059 // merge sort on short sequences, so this significantly improves performance.
23074 merge(
23089 // Examines the stack of runs and identifies the next pair of runs to merge. More specifically,
23101 // run starts at index 0, it will always demand a merge operation until the stack is fully
29208 // We prepare to merge `left` and `right` into a sorted sequence in linear time.
39139 /// Performs a merge and lets a closure decide what to return.
39804 /// Stocks up or merge away any underfull nodes on the right border of the
39873 // `MIN_LEN + 1` to avoid readjust if merge happens on the next level.
39893 // `MIN_LEN + 1` to avoid readjust if merge happens on the next level.