From e8eb3f67566dae9dc4fa85c201b7ab8f7ccf2a43 Mon Sep 17 00:00:00 2001 From: discord9 Date: Wed, 24 Apr 2024 15:15:11 +0800 Subject: [PATCH] chore: typos --- src/flow/src/compute/render/reduce.rs | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/flow/src/compute/render/reduce.rs b/src/flow/src/compute/render/reduce.rs index 9f7358edf0..28bb5a833f 100644 --- a/src/flow/src/compute/render/reduce.rs +++ b/src/flow/src/compute/render/reduce.rs @@ -233,7 +233,7 @@ fn reduce_subgraph( /// return distinct rows(distinct by row's key) from the input, but do not update the arrangement /// -/// if the same key already exist, we only perserve the oldest value(It make sense for distinct input over key) +/// if the same key already exist, we only preserve the oldest value(It make sense for distinct input over key) fn eval_distinct_core( arrange: ArrangeReader, kv: impl IntoIterator, @@ -243,7 +243,7 @@ fn eval_distinct_core( let _ = err_collector; // note that we also need to keep track of the distinct rows inside the current input - // hence the `inner_map` to kepping track of the distinct rows + // hence the `inner_map` to keeping track of the distinct rows let mut inner_map = BTreeMap::new(); kv.into_iter() .filter_map(|((key, val), ts, diff)| {