Skip to content

Commit

Permalink
Revert "upd comment"
Browse files Browse the repository at this point in the history
This reverts commit a18cba8.
  • Loading branch information
jayzhan211 committed Oct 29, 2024
1 parent d2f3a84 commit 905eea7
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions datafusion/physical-plan/src/sorts/merge.rs
Original file line number Diff line number Diff line change
Expand Up @@ -404,7 +404,7 @@ impl<C: CursorValues> SortPreservingMergeStream<C> {
/// between the current winner and a challenger. This function is invoked when such a tie needs to be
/// resolved according to the round-robin tie-breaker mode.
///
/// If round-robin tie-breaking is not active and the poll counts for all elements are reset.
/// If round-robin tie-breaking is not active, it is enabled, and the poll counts for all elements are reset.
/// The function then compares the poll counts of the current winner and the challenger:
/// - If the winner remains at the top after the final comparison, it increments the winner's poll count.
/// - If the challenger has a lower poll count than the current winner, the challenger becomes the new winner.
Expand All @@ -415,7 +415,7 @@ impl<C: CursorValues> SortPreservingMergeStream<C> {
/// - `winner`: A mutable reference to the current winner, which may be updated based on the tie-breaking result.
/// - `challenger`: The index of the challenger being compared against the winner.
///
/// This function ensures fair selection among elements with equal values
/// This function ensures fair selection among elements with equal values when tie-breaking mode is enabled,
/// aiming to balance the polling across different partitions.
#[inline]
fn handle_tie(&mut self, cmp_node: usize, winner: &mut usize, challenger: usize) {
Expand Down

0 comments on commit 905eea7

Please sign in to comment.