perf minor and evaluate review

[Basedfloppa]

1 — HashMap.keys().collect() in subscribe — evaluate BTreeMap

Location: crates/core/src/operations/subscribe.rs:212

Code: let mut sorted_keys: Vec<_> = connections.keys().collect(); sorted_keys.sort();

Problem: Allocates Vec + sorts keys. If connection set is large (100+) and changes infrequently, BTreeMap maintains sorted order (O(log n) insert) and eliminates per-query sort (O(n log n)).

Action: Measure subscribe connection set size and churn. If <50 entries, close without action.

---

2 — gateways.to_vec() in initial join

Location: crates/core/src/operations/connect.rs:1608

Code: let gateways = gateways.to_vec();

Problem: Copies gateway slice (1–10 entries). Use &[InitPeerNode] if borrow checker allows.

Action: Check callers. Fix if ownership not required.

[github-actions]

🤖 Auto-labeled

Applied labels:

• T-enhancement (98% confidence)
• E-easy (85% confidence)
• A-networking (90% confidence)

Reasoning: The report describes micro-optimizations (avoiding per-query sort by using BTreeMap and avoiding small slice copies) rather than a bug or new feature, so T-enhancement is appropriate. Changes appear small and localized (measure connection set size, switch collection types or borrow) so E-easy. The changes concern connection sets and initial join gateways, which belong to networking code, so A-networking.

Previous labels: none

If these labels are incorrect, please update them. This helps improve the auto-labeling system.