difftreelog
refactor move field sorting to visible_fields
in: master
2 files changed
crates/jrsonnet-evaluator/src/obj.rsdiffbeforeafterboth86 Rc::try_unwrap(out).unwrap().into_inner()86 Rc::try_unwrap(out).unwrap().into_inner()87 }87 }88 pub fn visible_fields(&self) -> Vec<Rc<str>> {88 pub fn visible_fields(&self) -> Vec<Rc<str>> {89 self.fields_visibility()89 let mut visible_fields: Vec<_> = self90 .fields_visibility()90 .into_iter()91 .into_iter()91 .filter(|(_k, v)| *v)92 .filter(|(_k, v)| *v)92 .map(|(k, _)| k)93 .map(|(k, _)| k)93 .collect()94 .collect();95 visible_fields.sort();96 visible_fields94 }97 }95 pub fn get(&self, key: Rc<str>) -> Result<Option<Val>> {98 pub fn get(&self, key: Rc<str>) -> Result<Option<Val>> {96 if let Some(v) = self.0.value_cache.borrow().get(&key) {99 if let Some(v) = self.0.value_cache.borrow().get(&key) {crates/jrsonnet-evaluator/src/val.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/val.rs
+++ b/crates/jrsonnet-evaluator/src/val.rs
@@ -255,8 +255,7 @@
}
Val::Obj(obj) => {
buf.push_str("{\n");
- let mut fields = obj.visible_fields();
- fields.sort();
+ let fields = obj.visible_fields();
if !fields.is_empty() {
let old_len = cur_padding.len();
cur_padding.push_str(padding);