difftreelog
style fix clippy warnings
in: master
9 files changed
crates/jrsonnet-evaluator/src/builtin/manifest.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/builtin/manifest.rs
+++ b/crates/jrsonnet-evaluator/src/builtin/manifest.rs
@@ -42,7 +42,7 @@
}
}
Val::Null => buf.push_str("null"),
- Val::Str(s) => buf.push_str(&escape_string_json(&s)),
+ Val::Str(s) => buf.push_str(&escape_string_json(s)),
Val::Num(n) => write!(buf, "{}", n).unwrap(),
Val::Arr(items) => {
buf.push('[');
crates/jrsonnet-evaluator/src/builtin/mod.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/builtin/mod.rs
+++ b/crates/jrsonnet-evaluator/src/builtin/mod.rs
@@ -445,7 +445,7 @@
},
Val::Arr(a) => {
base64::encode(a.iter().map(|v| {
- Ok(v?.clone().unwrap_num()? as u8)
+ Ok(v?.unwrap_num()? as u8)
}).collect::<Result<Vec<_>>>()?).into()
},
_ => unreachable!()
@@ -589,7 +589,7 @@
name: &str,
args: &ArgsDesc,
) -> Result<Val> {
- if let Some(f) = BUILTINS.with(|builtins| builtins.get(name).map(|f| *f)) {
+ if let Some(f) = BUILTINS.with(|builtins| builtins.get(name).copied()) {
return Ok(f(context, loc, args)?);
}
throw!(IntrinsicNotFound(name.into()))
crates/jrsonnet-evaluator/src/evaluate.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/evaluate.rs
+++ b/crates/jrsonnet-evaluator/src/evaluate.rs
@@ -473,7 +473,6 @@
}
v.get(n as usize)?
.ok_or_else(|| ArrayBoundsError(n as usize, v.len()))?
- .clone()
}
(Val::Arr(_), Val::Str(n)) => throw!(AttemptedIndexAnArrayWithString(n)),
(Val::Arr(_), n) => throw!(ValueIndexMustBeTypeGot(
crates/jrsonnet-evaluator/src/native.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/native.rs
+++ b/crates/jrsonnet-evaluator/src/native.rs
@@ -1,3 +1,5 @@
+#![allow(clippy::type_complexity)]
+
use crate::{error::Result, Val};
use jrsonnet_parser::ParamsDesc;
use std::fmt::Debug;
crates/jrsonnet-evaluator/src/obj.rsdiffbeforeafterboth1use crate::{evaluate_add_op, LazyBinding, Result, Val};2use indexmap::IndexMap;3use jrsonnet_interner::IStr;4use jrsonnet_parser::{ExprLocation, Visibility};5use std::{cell::RefCell, collections::HashMap, fmt::Debug, rc::Rc};67#[derive(Debug)]8pub struct ObjMember {9 pub add: bool,10 pub visibility: Visibility,11 pub invoke: LazyBinding,12 pub location: Option<ExprLocation>,13}1415// Field => This16type CacheKey = (IStr, usize);17#[derive(Debug)]18pub struct ObjValueInternals {19 super_obj: Option<ObjValue>,20 this_entries: Rc<HashMap<IStr, ObjMember>>,21 value_cache: RefCell<HashMap<CacheKey, Option<Val>>>,22}23#[derive(Clone)]24pub struct ObjValue(pub(crate) Rc<ObjValueInternals>);25impl Debug for ObjValue {26 fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {27 if let Some(super_obj) = self.0.super_obj.as_ref() {28 if f.alternate() {29 write!(f, "{:#?}", super_obj)?;30 } else {31 write!(f, "{:?}", super_obj)?;32 }33 write!(f, " + ")?;34 }35 let mut debug = f.debug_struct("ObjValue");36 for (name, member) in self.0.this_entries.iter() {37 debug.field(&name, member);38 }39 #[cfg(feature = "unstable")]40 {41 debug.finish_non_exhaustive()42 }43 #[cfg(not(feature = "unstable"))]44 {45 debug.finish()46 }47 }48}4950impl ObjValue {51 pub fn new(super_obj: Option<Self>, this_entries: Rc<HashMap<IStr, ObjMember>>) -> Self {52 Self(Rc::new(ObjValueInternals {53 super_obj,54 this_entries,55 value_cache: RefCell::new(HashMap::new()),56 }))57 }58 pub fn new_empty() -> Self {59 Self::new(None, Rc::new(HashMap::new()))60 }61 pub fn with_super(&self, super_obj: Self) -> Self {62 match &self.0.super_obj {63 None => Self::new(Some(super_obj), self.0.this_entries.clone()),64 Some(v) => Self::new(Some(v.with_super(super_obj)), self.0.this_entries.clone()),65 }66 }67 pub fn enum_fields(&self, handler: &impl Fn(&IStr, &Visibility)) {68 if let Some(s) = &self.0.super_obj {69 s.enum_fields(handler);70 }71 for (name, member) in self.0.this_entries.iter() {72 handler(name, &member.visibility);73 }74 }75 pub fn fields_visibility(&self) -> IndexMap<IStr, bool> {76 let out = Rc::new(RefCell::new(IndexMap::new()));77 self.enum_fields(&|name, visibility| {78 let mut out = out.borrow_mut();79 match visibility {80 Visibility::Normal => {81 if !out.contains_key(name) {82 out.insert(name.to_owned(), true);83 }84 }85 Visibility::Hidden => {86 out.insert(name.to_owned(), false);87 }88 Visibility::Unhide => {89 out.insert(name.to_owned(), true);90 }91 };92 });93 Rc::try_unwrap(out).unwrap().into_inner()94 }95 pub fn visible_fields(&self) -> Vec<IStr> {96 let mut visible_fields: Vec<_> = self97 .fields_visibility()98 .into_iter()99 .filter(|(_k, v)| *v)100 .map(|(k, _)| k)101 .collect();102 visible_fields.sort();103 visible_fields104 }105 pub fn get(&self, key: IStr) -> Result<Option<Val>> {106 Ok(self.get_raw(key, None)?)107 }108 pub(crate) fn get_raw(&self, key: IStr, real_this: Option<&Self>) -> Result<Option<Val>> {109 let real_this = real_this.unwrap_or(self);110 let cache_key = (key.clone(), Rc::as_ptr(&real_this.0) as usize);111112 if let Some(v) = self.0.value_cache.borrow().get(&cache_key) {113 return Ok(v.clone());114 }115 let value = match (self.0.this_entries.get(&key), &self.0.super_obj) {116 (Some(k), None) => Ok(Some(self.evaluate_this(k, real_this)?)),117 (Some(k), Some(s)) => {118 let our = self.evaluate_this(k, real_this)?;119 if k.add {120 s.get_raw(key, Some(real_this))?121 .map_or(Ok(Some(our.clone())), |v| {122 Ok(Some(evaluate_add_op(&v, &our)?))123 })124 } else {125 Ok(Some(our))126 }127 }128 (None, Some(s)) => s.get_raw(key, Some(real_this)),129 (None, None) => Ok(None),130 }?;131 self.0132 .value_cache133 .borrow_mut()134 .insert(cache_key, value.clone());135 Ok(value)136 }137 fn evaluate_this(&self, v: &ObjMember, real_this: &Self) -> Result<Val> {138 Ok(v.invoke139 .evaluate(Some(real_this.clone()), self.0.super_obj.clone())?140 .evaluate()?)141 }142143 pub fn ptr_eq(a: &ObjValue, b: &ObjValue) -> bool {144 Rc::ptr_eq(&a.0, &b.0)145 }146}147impl PartialEq for ObjValue {148 fn eq(&self, other: &Self) -> bool {149 Rc::ptr_eq(&self.0, &other.0)150 }151}1use crate::{evaluate_add_op, LazyBinding, Result, Val};2use indexmap::IndexMap;3use jrsonnet_interner::IStr;4use jrsonnet_parser::{ExprLocation, Visibility};5use std::{cell::RefCell, collections::HashMap, fmt::Debug, rc::Rc};67#[derive(Debug)]8pub struct ObjMember {9 pub add: bool,10 pub visibility: Visibility,11 pub invoke: LazyBinding,12 pub location: Option<ExprLocation>,13}1415// Field => This16type CacheKey = (IStr, usize);17#[derive(Debug)]18pub struct ObjValueInternals {19 super_obj: Option<ObjValue>,20 this_entries: Rc<HashMap<IStr, ObjMember>>,21 value_cache: RefCell<HashMap<CacheKey, Option<Val>>>,22}23#[derive(Clone)]24pub struct ObjValue(pub(crate) Rc<ObjValueInternals>);25impl Debug for ObjValue {26 fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {27 if let Some(super_obj) = self.0.super_obj.as_ref() {28 if f.alternate() {29 write!(f, "{:#?}", super_obj)?;30 } else {31 write!(f, "{:?}", super_obj)?;32 }33 write!(f, " + ")?;34 }35 let mut debug = f.debug_struct("ObjValue");36 for (name, member) in self.0.this_entries.iter() {37 debug.field(name, member);38 }39 #[cfg(feature = "unstable")]40 {41 debug.finish_non_exhaustive()42 }43 #[cfg(not(feature = "unstable"))]44 {45 debug.finish()46 }47 }48}4950impl ObjValue {51 pub fn new(super_obj: Option<Self>, this_entries: Rc<HashMap<IStr, ObjMember>>) -> Self {52 Self(Rc::new(ObjValueInternals {53 super_obj,54 this_entries,55 value_cache: RefCell::new(HashMap::new()),56 }))57 }58 pub fn new_empty() -> Self {59 Self::new(None, Rc::new(HashMap::new()))60 }61 pub fn with_super(&self, super_obj: Self) -> Self {62 match &self.0.super_obj {63 None => Self::new(Some(super_obj), self.0.this_entries.clone()),64 Some(v) => Self::new(Some(v.with_super(super_obj)), self.0.this_entries.clone()),65 }66 }67 pub fn enum_fields(&self, handler: &impl Fn(&IStr, &Visibility)) {68 if let Some(s) = &self.0.super_obj {69 s.enum_fields(handler);70 }71 for (name, member) in self.0.this_entries.iter() {72 handler(name, &member.visibility);73 }74 }75 pub fn fields_visibility(&self) -> IndexMap<IStr, bool> {76 let out = Rc::new(RefCell::new(IndexMap::new()));77 self.enum_fields(&|name, visibility| {78 let mut out = out.borrow_mut();79 match visibility {80 Visibility::Normal => {81 if !out.contains_key(name) {82 out.insert(name.to_owned(), true);83 }84 }85 Visibility::Hidden => {86 out.insert(name.to_owned(), false);87 }88 Visibility::Unhide => {89 out.insert(name.to_owned(), true);90 }91 };92 });93 Rc::try_unwrap(out).unwrap().into_inner()94 }95 pub fn visible_fields(&self) -> Vec<IStr> {96 let mut visible_fields: Vec<_> = self97 .fields_visibility()98 .into_iter()99 .filter(|(_k, v)| *v)100 .map(|(k, _)| k)101 .collect();102 visible_fields.sort();103 visible_fields104 }105 pub fn get(&self, key: IStr) -> Result<Option<Val>> {106 Ok(self.get_raw(key, None)?)107 }108 pub(crate) fn get_raw(&self, key: IStr, real_this: Option<&Self>) -> Result<Option<Val>> {109 let real_this = real_this.unwrap_or(self);110 let cache_key = (key.clone(), Rc::as_ptr(&real_this.0) as usize);111112 if let Some(v) = self.0.value_cache.borrow().get(&cache_key) {113 return Ok(v.clone());114 }115 let value = match (self.0.this_entries.get(&key), &self.0.super_obj) {116 (Some(k), None) => Ok(Some(self.evaluate_this(k, real_this)?)),117 (Some(k), Some(s)) => {118 let our = self.evaluate_this(k, real_this)?;119 if k.add {120 s.get_raw(key, Some(real_this))?121 .map_or(Ok(Some(our.clone())), |v| {122 Ok(Some(evaluate_add_op(&v, &our)?))123 })124 } else {125 Ok(Some(our))126 }127 }128 (None, Some(s)) => s.get_raw(key, Some(real_this)),129 (None, None) => Ok(None),130 }?;131 self.0132 .value_cache133 .borrow_mut()134 .insert(cache_key, value.clone());135 Ok(value)136 }137 fn evaluate_this(&self, v: &ObjMember, real_this: &Self) -> Result<Val> {138 Ok(v.invoke139 .evaluate(Some(real_this.clone()), self.0.super_obj.clone())?140 .evaluate()?)141 }142143 pub fn ptr_eq(a: &Self, b: &Self) -> bool {144 Rc::ptr_eq(&a.0, &b.0)145 }146}147impl PartialEq for ObjValue {148 fn eq(&self, other: &Self) -> bool {149 Rc::ptr_eq(&self.0, &other.0)150 }151}crates/jrsonnet-evaluator/src/typed.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/typed.rs
+++ b/crates/jrsonnet-evaluator/src/typed.rs
@@ -29,7 +29,7 @@
pub struct TypeLocError(Box<TypeError>, ValuePathStack);
impl From<TypeError> for TypeLocError {
fn from(e: TypeError) -> Self {
- TypeLocError(Box::new(e), ValuePathStack(Vec::new()))
+ Self(Box::new(e), ValuePathStack(Vec::new()))
}
}
impl From<TypeLocError> for LocError {
@@ -61,7 +61,7 @@
write!(out, "{}", err)?;
for (i, line) in out.lines().enumerate() {
- if line.trim().len() == 0 {
+ if line.trim().is_empty() {
continue;
}
if i != 0 {
@@ -118,8 +118,8 @@
impl Display for ValuePathItem {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
match self {
- ValuePathItem::Field(name) => write!(f, ".{}", name)?,
- ValuePathItem::Index(idx) => write!(f, "[{}]", idx)?,
+ Self::Field(name) => write!(f, ".{}", name)?,
+ Self::Index(idx) => write!(f, "[{}]", idx)?,
}
Ok(())
}
@@ -140,25 +140,25 @@
impl CheckType for ComplexValType {
fn check(&self, value: &Val) -> Result<()> {
match self {
- ComplexValType::Any => Ok(()),
- ComplexValType::Simple(s) => s.check(value),
- ComplexValType::Char => match value {
+ Self::Any => Ok(()),
+ Self::Simple(s) => s.check(value),
+ Self::Char => match value {
Val::Str(s) if s.len() == 1 || s.chars().count() == 1 => Ok(()),
v => Err(TypeError::ExpectedGot(self.clone(), v.value_type()).into()),
},
- ComplexValType::BoundedNumber(from, to) => {
+ Self::BoundedNumber(from, to) => {
if let Val::Num(n) = value {
if from.map(|from| from > *n).unwrap_or(false)
|| to.map(|to| to <= *n).unwrap_or(false)
{
- return Err(TypeError::BoundsFailed(*n, from.clone(), to.clone()).into());
+ return Err(TypeError::BoundsFailed(*n, *from, *to).into());
}
Ok(())
} else {
Err(TypeError::ExpectedGot(self.clone(), value.value_type()).into())
}
}
- ComplexValType::Array(elem_type) => match value {
+ Self::Array(elem_type) => match value {
Val::Arr(a) => {
for (i, item) in a.iter().enumerate() {
push_type(
@@ -170,9 +170,9 @@
}
Ok(())
}
- v => return Err(TypeError::ExpectedGot(self.clone(), v.value_type()).into()),
+ v => Err(TypeError::ExpectedGot(self.clone(), v.value_type()).into()),
},
- ComplexValType::ArrayRef(elem_type) => match value {
+ Self::ArrayRef(elem_type) => match value {
Val::Arr(a) => {
for (i, item) in a.iter().enumerate() {
push_type(
@@ -184,9 +184,9 @@
}
Ok(())
}
- v => return Err(TypeError::ExpectedGot(self.clone(), v.value_type()).into()),
+ v => Err(TypeError::ExpectedGot(self.clone(), v.value_type()).into()),
},
- ComplexValType::ObjectRef(elems) => match value {
+ Self::ObjectRef(elems) => match value {
Val::Obj(obj) => {
for (k, v) in elems.iter() {
if let Some(got_v) = obj.get((*k).into())? {
@@ -202,11 +202,11 @@
);
}
}
- return Ok(());
+ Ok(())
}
- v => return Err(TypeError::ExpectedGot(self.clone(), v.value_type()).into()),
+ v => Err(TypeError::ExpectedGot(self.clone(), v.value_type()).into()),
},
- ComplexValType::Union(types) => {
+ Self::Union(types) => {
let mut errors = Vec::new();
for ty in types.iter() {
match ty.check(value) {
@@ -219,9 +219,9 @@
},
}
}
- return Err(TypeError::UnionFailed(self.clone(), TypeLocErrorList(errors)).into());
+ Err(TypeError::UnionFailed(self.clone(), TypeLocErrorList(errors)).into())
}
- ComplexValType::UnionRef(types) => {
+ Self::UnionRef(types) => {
let mut errors = Vec::new();
for ty in types.iter() {
match ty.check(value) {
@@ -234,15 +234,15 @@
},
}
}
- return Err(TypeError::UnionFailed(self.clone(), TypeLocErrorList(errors)).into());
+ Err(TypeError::UnionFailed(self.clone(), TypeLocErrorList(errors)).into())
}
- ComplexValType::Sum(types) => {
+ Self::Sum(types) => {
for ty in types.iter() {
ty.check(value)?
}
Ok(())
}
- ComplexValType::SumRef(types) => {
+ Self::SumRef(types) => {
for ty in types.iter() {
ty.check(value)?
}
crates/jrsonnet-evaluator/src/val.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/val.rs
+++ b/crates/jrsonnet-evaluator/src/val.rs
@@ -176,14 +176,14 @@
pub enum ArrValue {
Lazy(Rc<Vec<LazyVal>>),
Eager(Rc<Vec<Val>>),
- Extended(Box<(ArrValue, ArrValue)>),
+ Extended(Box<(Self, Self)>),
}
impl ArrValue {
pub fn len(&self) -> usize {
match self {
- ArrValue::Lazy(l) => l.len(),
- ArrValue::Eager(e) => e.len(),
- ArrValue::Extended(v) => v.0.len() + v.1.len(),
+ Self::Lazy(l) => l.len(),
+ Self::Eager(e) => e.len(),
+ Self::Extended(v) => v.0.len() + v.1.len(),
}
}
@@ -193,15 +193,15 @@
pub fn get(&self, index: usize) -> Result<Option<Val>> {
match self {
- ArrValue::Lazy(vec) => {
+ Self::Lazy(vec) => {
if let Some(v) = vec.get(index) {
Ok(Some(v.evaluate()?))
} else {
Ok(None)
}
}
- ArrValue::Eager(vec) => Ok(vec.get(index).cloned()),
- ArrValue::Extended(v) => {
+ Self::Eager(vec) => Ok(vec.get(index).cloned()),
+ Self::Extended(v) => {
let a_len = v.0.len();
if a_len > index {
v.0.get(index)
@@ -214,12 +214,9 @@
pub fn get_lazy(&self, index: usize) -> Option<LazyVal> {
match self {
- ArrValue::Lazy(vec) => vec.get(index).cloned(),
- ArrValue::Eager(vec) => vec
- .get(index)
- .cloned()
- .map(|val| LazyVal::new_resolved(val)),
- ArrValue::Extended(v) => {
+ Self::Lazy(vec) => vec.get(index).cloned(),
+ Self::Eager(vec) => vec.get(index).cloned().map(LazyVal::new_resolved),
+ Self::Extended(v) => {
let a_len = v.0.len();
if a_len > index {
v.0.get_lazy(index)
@@ -232,15 +229,15 @@
pub fn evaluated(&self) -> Result<Rc<Vec<Val>>> {
Ok(match self {
- ArrValue::Lazy(vec) => {
+ Self::Lazy(vec) => {
let mut out = Vec::with_capacity(vec.len());
for item in vec.iter() {
out.push(item.evaluate()?);
}
Rc::new(out)
}
- ArrValue::Eager(vec) => vec.clone(),
- ArrValue::Extended(v) => {
+ Self::Eager(vec) => vec.clone(),
+ Self::Extended(_v) => {
let mut out = Vec::with_capacity(self.len());
for item in self.iter() {
out.push(item?);
@@ -252,40 +249,40 @@
pub fn iter(&self) -> impl DoubleEndedIterator<Item = Result<Val>> + '_ {
(0..self.len()).map(move |idx| match self {
- ArrValue::Lazy(l) => l[idx].evaluate(),
- ArrValue::Eager(e) => Ok(e[idx].clone()),
- ArrValue::Extended(_) => self.get(idx).map(|e| e.unwrap()),
+ Self::Lazy(l) => l[idx].evaluate(),
+ Self::Eager(e) => Ok(e[idx].clone()),
+ Self::Extended(_) => self.get(idx).map(|e| e.unwrap()),
})
}
pub fn iter_lazy(&self) -> impl DoubleEndedIterator<Item = LazyVal> + '_ {
(0..self.len()).map(move |idx| match self {
- ArrValue::Lazy(l) => l[idx].clone(),
- ArrValue::Eager(e) => LazyVal::new_resolved(e[idx].clone()),
- ArrValue::Extended(_) => self.get_lazy(idx).unwrap(),
+ Self::Lazy(l) => l[idx].clone(),
+ Self::Eager(e) => LazyVal::new_resolved(e[idx].clone()),
+ Self::Extended(_) => self.get_lazy(idx).unwrap(),
})
}
pub fn reversed(self) -> Self {
match self {
- ArrValue::Lazy(vec) => {
+ Self::Lazy(vec) => {
let mut out = (&vec as &Vec<_>).clone();
out.reverse();
Self::Lazy(Rc::new(out))
}
- ArrValue::Eager(vec) => {
+ Self::Eager(vec) => {
let mut out = (&vec as &Vec<_>).clone();
out.reverse();
Self::Eager(Rc::new(out))
}
- ArrValue::Extended(b) => ArrValue::Extended(Box::new((b.1.reversed(), b.0.reversed()))),
+ Self::Extended(b) => Self::Extended(Box::new((b.1.reversed(), b.0.reversed()))),
}
}
- pub fn ptr_eq(a: &ArrValue, b: &ArrValue) -> bool {
+ pub fn ptr_eq(a: &Self, b: &Self) -> bool {
match (a, b) {
- (ArrValue::Lazy(a), ArrValue::Lazy(b)) => Rc::ptr_eq(a, b),
- (ArrValue::Eager(a), ArrValue::Eager(b)) => Rc::ptr_eq(a, b),
+ (Self::Lazy(a), Self::Lazy(b)) => Rc::ptr_eq(a, b),
+ (Self::Eager(a), Self::Eager(b)) => Rc::ptr_eq(a, b),
_ => false,
}
}
@@ -359,7 +356,7 @@
self.assert_type(context, ValType::Num)?;
self.unwrap_num()
}
- pub fn value_type(&self) -> ValType {
+ pub const fn value_type(&self) -> ValType {
match self {
Self::Str(..) => ValType::Str,
Self::Num(..) => ValType::Num,
@@ -378,7 +375,7 @@
Self::Null => "null".into(),
Self::Str(s) => s.clone(),
v => manifest_json_ex(
- &v,
+ v,
&ManifestJsonOptions {
padding: "",
mtype: ManifestType::ToString,
@@ -556,7 +553,7 @@
(Val::Obj(_), Val::Obj(_)) => throw!(RuntimeError(
"primitiveEquals operates on primitive types, got object".into(),
)),
- (a, b) if is_function_like(&a) && is_function_like(&b) => {
+ (a, b) if is_function_like(a) && is_function_like(b) => {
throw!(RuntimeError("cannot test equality of functions".into()))
}
(_, _) => false,
@@ -598,6 +595,6 @@
}
Ok(true)
}
- (a, b) => Ok(primitive_equals(&a, &b)?),
+ (a, b) => Ok(primitive_equals(a, b)?),
}
}
crates/jrsonnet-interner/src/lib.rsdiffbeforeafterboth--- a/crates/jrsonnet-interner/src/lib.rs
+++ b/crates/jrsonnet-interner/src/lib.rs
@@ -68,7 +68,7 @@
IStr(STR_POOL.with(|pool| {
let mut pool = pool.borrow_mut();
if let Some((k, _)) = pool.get_key_value(str) {
- return k.clone();
+ k.clone()
} else {
let rc: Rc<str> = str.into();
pool.insert(rc.clone(), ());
crates/jrsonnet-types/src/lib.rsdiffbeforeafterboth--- a/crates/jrsonnet-types/src/lib.rs
+++ b/crates/jrsonnet-types/src/lib.rs
@@ -133,10 +133,8 @@
union: &[ComplexValType],
) -> std::fmt::Result {
for (i, v) in union.iter().enumerate() {
- let should_add_braces = match v {
- ComplexValType::UnionRef(_) | ComplexValType::Union(_) if !is_union => true,
- _ => false,
- };
+ let should_add_braces =
+ matches!(v, ComplexValType::UnionRef(_) | ComplexValType::Union(_) if !is_union);
if i != 0 {
write!(f, " {} ", if is_union { '|' } else { '&' })?;
}