From df79f2684d29c32a8caf565cba8d0c9950a5d1f3 Mon Sep 17 00:00:00 2001 From: daisuke8000 Date: Sun, 5 Jul 2026 17:34:37 +0900 Subject: [PATCH] Remove redundant sort in btree_to_label_selector (DSK-127) BTreeMap iteration is already key-ordered; join pairs directly without collecting and re-sorting. Co-authored-by: Cursor --- crates/rustern-core/src/discovery/workload_selector.rs | 5 +---- 1 file changed, 1 insertion(+), 4 deletions(-) diff --git a/crates/rustern-core/src/discovery/workload_selector.rs b/crates/rustern-core/src/discovery/workload_selector.rs index b49a524..22b8209 100644 --- a/crates/rustern-core/src/discovery/workload_selector.rs +++ b/crates/rustern-core/src/discovery/workload_selector.rs @@ -18,10 +18,7 @@ use super::resource::{ResourceKind, label_selector_for}; /// /// Uses lexicographic key order (`BTreeMap` iterator order). pub fn btree_to_label_selector(m: &BTreeMap) -> String { - let mut pairs: Vec<(&String, &String)> = m.iter().collect(); - pairs.sort_by(|a, b| a.0.cmp(b.0)); - pairs - .iter() + m.iter() .map(|(k, v)| format!("{}={}", k.as_str(), v.as_str())) .collect::>() .join(",")