git.delta.rocks / jrsonnet / refs/commits / 5df60b8b674f

difftreelog

style fix clippy warnings

rvmlxxrnYaroslav Bolyukin2026-03-21parent: #ac5b435.patch.diff
in: master

36 files changed

modifiedbindings/jsonnet/src/native.rsdiffbeforeafterboth
--- a/bindings/jsonnet/src/native.rs
+++ b/bindings/jsonnet/src/native.rs
@@ -43,7 +43,7 @@
 		}
 		n_args.push(None);
 		let mut success = 1;
-		let v = unsafe { (self.cb)(self.ctx, n_args.as_ptr().cast(), &mut success) };
+		let v = unsafe { (self.cb)(self.ctx, n_args.as_ptr().cast(), &raw mut success) };
 		let v = unsafe { *Box::from_raw(v) };
 		if success == 1 {
 			Ok(v)
modifiedcrates/jrsonnet-cli/src/tla.rsdiffbeforeafterboth
--- a/crates/jrsonnet-cli/src/tla.rs
+++ b/crates/jrsonnet-cli/src/tla.rs
@@ -7,6 +7,7 @@
 
 #[derive(Parser)]
 #[clap(next_help_heading = "TOP LEVEL ARGUMENTS")]
+#[allow(clippy::struct_field_names)]
 pub struct TlaOpts {
 	/// Add top level string argument.
 	/// Top level arguments will be passed to function before manifestification stage.
modifiedcrates/jrsonnet-evaluator/src/arr/mod.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/arr/mod.rs
+++ b/crates/jrsonnet-evaluator/src/arr/mod.rs
@@ -77,7 +77,7 @@
 			let i = i?;
 			if filter(&i)? {
 				out.push(i);
-			};
+			}
 		}
 		Ok(Self::eager(out))
 	}
modifiedcrates/jrsonnet-evaluator/src/arr/spec.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/arr/spec.rs
+++ b/crates/jrsonnet-evaluator/src/arr/spec.rs
@@ -38,7 +38,7 @@
 }
 impl ArrayLike for SliceArray {
 	fn len(&self) -> usize {
-		((self.to - self.from + self.step - 1) / self.step) as usize
+		(self.to - self.from).div_ceil(self.step) as usize
 	}
 
 	fn get(&self, index: usize) -> Result<Option<Val>> {
@@ -139,7 +139,7 @@
 			ArrayThunk::Errored(e) => return Err(e.clone()),
 			ArrayThunk::Pending => return Err(InfiniteRecursionDetected.into()),
 			ArrayThunk::Waiting => {}
-		};
+		}
 
 		let ArrayThunk::Waiting =
 			replace(&mut self.cached.borrow_mut()[index], ArrayThunk::Pending)
@@ -158,15 +158,6 @@
 		Ok(Some(new_value))
 	}
 	fn get_lazy(&self, index: usize) -> Option<Thunk<Val>> {
-		if index >= self.len() {
-			return None;
-		}
-		match &self.cached.borrow()[index] {
-			ArrayThunk::Computed(c) => return Some(Thunk::evaluated(c.clone())),
-			ArrayThunk::Errored(e) => return Some(Thunk::errored(e.clone())),
-			ArrayThunk::Waiting | ArrayThunk::Pending => {}
-		};
-
 		#[derive(Trace)]
 		struct ExprArrThunk {
 			expr: ExprArray,
@@ -183,6 +174,15 @@
 			}
 		}
 
+		if index >= self.len() {
+			return None;
+		}
+		match &self.cached.borrow()[index] {
+			ArrayThunk::Computed(c) => return Some(Thunk::evaluated(c.clone())),
+			ArrayThunk::Errored(e) => return Some(Thunk::errored(e.clone())),
+			ArrayThunk::Waiting | ArrayThunk::Pending => {}
+		}
+
 		Some(Thunk::new(ExprArrThunk {
 			expr: self.clone(),
 			index,
@@ -441,7 +441,7 @@
 			ArrayThunk::Errored(e) => return Err(e.clone()),
 			ArrayThunk::Pending => return Err(InfiniteRecursionDetected.into()),
 			ArrayThunk::Waiting => {}
-		};
+		}
 
 		let ArrayThunk::Waiting =
 			replace(&mut self.cached.borrow_mut()[index], ArrayThunk::Pending)
@@ -467,15 +467,6 @@
 		Ok(Some(new_value))
 	}
 	fn get_lazy(&self, index: usize) -> Option<Thunk<Val>> {
-		if index >= self.len() {
-			return None;
-		}
-		match &self.cached.borrow()[index] {
-			ArrayThunk::Computed(c) => return Some(Thunk::evaluated(c.clone())),
-			ArrayThunk::Errored(e) => return Some(Thunk::errored(e.clone())),
-			ArrayThunk::Waiting | ArrayThunk::Pending => {}
-		};
-
 		#[derive(Trace)]
 		struct MappedArrayThunk<const WITH_INDEX: bool> {
 			arr: MappedArray<WITH_INDEX>,
@@ -489,6 +480,15 @@
 			}
 		}
 
+		if index >= self.len() {
+			return None;
+		}
+		match &self.cached.borrow()[index] {
+			ArrayThunk::Computed(c) => return Some(Thunk::evaluated(c.clone())),
+			ArrayThunk::Errored(e) => return Some(Thunk::errored(e.clone())),
+			ArrayThunk::Waiting | ArrayThunk::Pending => {}
+		}
+
 		Some(Thunk::new(MappedArrayThunk {
 			arr: self.clone(),
 			index,
modifiedcrates/jrsonnet-evaluator/src/async_import.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/async_import.rs
+++ b/crates/jrsonnet-evaluator/src/async_import.rs
@@ -21,7 +21,8 @@
 // Visits all nodes, trying to find import statements
 #[allow(clippy::too_many_lines)]
 pub fn find_imports(expr: &Spanned<Expr>, out: &mut FoundImports) {
-	fn in_destruct(dest: &Destruct, #[allow(unused_variables)] out: &mut FoundImports) {
+	#[allow(unused_variables, clippy::needless_pass_by_ref_mut)]
+	fn in_destruct(dest: &Destruct, out: &mut FoundImports) {
 		match dest {
 			#[cfg(feature = "exp-destruct")]
 			Destruct::Array {
@@ -295,8 +296,6 @@
 	let resolved = (s.import_resolver() as &dyn Any)
 		.downcast_ref::<ResolvedImportResolver>()
 		.expect("for async imports, import_resolver should be set to ResolvedImportResolver");
-
-	let mut resolved_map = resolved.resolved.borrow_mut();
 
 	let mut queue = vec![Job::LoadFile {
 		path: handler.resolve_from_default(path).await?,
@@ -340,14 +339,17 @@
 				}
 			}
 			Job::ResolveImport { from, import } => {
-				if let Some((resolved, expression)) =
-					resolved_map.get_mut(&(from.clone(), import.path.clone()))
 				{
-					if import.expression && !*expression {
-						*expression = true;
-						queue.push(Job::ParseFile(resolved.clone()));
+					let mut resolved_map = resolved.resolved.borrow_mut();
+					if let Some((resolved, expression)) =
+						resolved_map.get_mut(&(from.clone(), import.path.clone()))
+					{
+						if import.expression && !*expression {
+							*expression = true;
+							queue.push(Job::ParseFile(resolved.clone()));
+						}
+						continue;
 					}
-					continue;
 				}
 				let resolved = handler.resolve_from(&from, &import.path).await?;
 				queue.push(Job::LoadFile {
modifiedcrates/jrsonnet-evaluator/src/evaluate/destructure.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/evaluate/destructure.rs
+++ b/crates/jrsonnet-evaluator/src/evaluate/destructure.rs
@@ -1,6 +1,7 @@
+use std::{collections::HashMap, hash::BuildHasher};
+
 use jrsonnet_interner::IStr;
 use jrsonnet_parser::{BindSpec, Destruct};
-use rustc_hash::FxHashMap;
 
 use crate::{
 	bail,
@@ -10,11 +11,11 @@
 
 #[allow(clippy::too_many_lines)]
 #[allow(unused_variables)]
-pub fn destruct(
+pub fn destruct<H: BuildHasher>(
 	d: &Destruct,
 	parent: Thunk<Val>,
 	fctx: Pending<Context>,
-	new_bindings: &mut FxHashMap<IStr, Thunk<Val>>,
+	new_bindings: &mut HashMap<IStr, Thunk<Val>, H>,
 ) -> Result<()> {
 	match d {
 		Destruct::Full(v) => {
@@ -159,10 +160,10 @@
 	Ok(())
 }
 
-pub fn evaluate_dest(
+pub fn evaluate_dest<H: BuildHasher>(
 	d: &BindSpec,
 	fctx: Pending<Context>,
-	new_bindings: &mut FxHashMap<IStr, Thunk<Val>>,
+	new_bindings: &mut HashMap<IStr, Thunk<Val>, H>,
 ) -> Result<()> {
 	match d {
 		BindSpec::Field { into, value } => {
modifiedcrates/jrsonnet-evaluator/src/evaluate/mod.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/evaluate/mod.rs
+++ b/crates/jrsonnet-evaluator/src/evaluate/mod.rs
@@ -291,7 +291,7 @@
 	let uctx = CachedUnbound::new(evaluate_object_locals(ctx.clone(), locals));
 
 	for field in &members.fields {
-		evaluate_field_member(&mut builder, ctx.clone(), uctx.clone(), &field)?;
+		evaluate_field_member(&mut builder, ctx.clone(), uctx.clone(), field)?;
 	}
 
 	if !members.asserts.is_empty() {
@@ -304,13 +304,13 @@
 			fn run(&self, sup_this: SupThis) -> Result<()> {
 				let ctx = self.uctx.bind(sup_this)?;
 				for assert in &*self.asserts {
-					evaluate_assert(ctx.clone(), &assert)?;
+					evaluate_assert(ctx.clone(), assert)?;
 				}
 				Ok(())
 			}
 		}
 		builder.assert(ObjectAssert {
-			uctx: uctx.clone(),
+			uctx,
 			asserts: members.asserts.clone(),
 		});
 	}
@@ -567,7 +567,7 @@
 				evaluate_dest(b, fctx.clone(), &mut new_bindings)?;
 			}
 			let ctx = ctx.extend_bindings(new_bindings).into_future(fctx);
-			evaluate(ctx, &returned.clone())?
+			evaluate(ctx, returned)?
 		}
 		Arr(items) => {
 			if items.is_empty() {
modifiedcrates/jrsonnet-evaluator/src/evaluate/operator.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/evaluate/operator.rs
+++ b/crates/jrsonnet-evaluator/src/evaluate/operator.rs
@@ -95,9 +95,9 @@
 		// string format
 		(Str(_), _) => false,
 
-		(_, Num(b)) => return **b == 0.,
+		(_, Num(b)) => **b == 0.,
 		#[cfg(feature = "exp-bigint")]
-		(_, BigInt(b)) => return **b == num_bigint::BigInt::ZERO,
+		(_, BigInt(b)) => **b == num_bigint::BigInt::ZERO,
 
 		// something else
 		_ => false,
modifiedcrates/jrsonnet-evaluator/src/function/arglike.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/function/arglike.rs
+++ b/crates/jrsonnet-evaluator/src/function/arglike.rs
@@ -239,7 +239,7 @@
 	}
 
 	fn named_names(&self, handler: &mut dyn FnMut(&IStr)) {
-		for (name, _) in self {
+		for name in self.keys() {
 			handler(name);
 		}
 	}
modifiedcrates/jrsonnet-evaluator/src/function/parse.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/function/parse.rs
+++ b/crates/jrsonnet-evaluator/src/function/parse.rs
@@ -1,5 +1,3 @@
-use std::mem::replace;
-
 use jrsonnet_parser::{
 	function::{FunctionSignature, ParamName},
 	ExprParams,
@@ -87,7 +85,7 @@
 			}
 
 			destruct(
-				&into,
+				into,
 				{
 					let ctx = fctx.clone();
 					let name = into.name();
@@ -97,7 +95,7 @@
 				fctx.clone(),
 				&mut defaults,
 			)?;
-			if !into.name().is_anonymous() {
+			if into.name().is_named() {
 				filled_named += 1;
 			} else {
 				filled_positionals += 1;
@@ -165,7 +163,7 @@
 			.iter()
 			.position(|p| p.name() == name)
 			.ok_or_else(|| UnknownFunctionParameter(name.clone()))?;
-		if replace(&mut passed_args[id], Some(arg)).is_some() {
+		if passed_args[id].replace(arg).is_some() {
 			bail!(BindingParameterASecondTime(name.clone()));
 		}
 		filled_args += 1;
@@ -230,7 +228,7 @@
 					let params = params.clone();
 					Thunk!(move || Err(FunctionParameterNotBoundInCall(
 						param_name,
-						params.signature.clone()
+						params.signature
 					)
 					.into()))
 				},
modifiedcrates/jrsonnet-evaluator/src/gc.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/gc.rs
+++ b/crates/jrsonnet-evaluator/src/gc.rs
@@ -1,3 +1,8 @@
+#![allow(
+	clippy::implicit_hasher,
+	reason = "those methods exist exactly because with_capacity is only present for default BuildHasher"
+)]
+
 /// Macros to help deal with Gc
 use jrsonnet_gcmodule::Trace;
 use rustc_hash::{FxBuildHasher, FxHashMap, FxHashSet};
@@ -8,20 +13,20 @@
 }
 impl<V> WithCapacityExt for FxHashSet<V> {
 	fn with_capacity(capacity: usize) -> Self {
-		Self::with_capacity_and_hasher(capacity, FxBuildHasher::default())
+		Self::with_capacity_and_hasher(capacity, FxBuildHasher)
 	}
 
 	fn new() -> Self {
-		Self::with_hasher(FxBuildHasher::default())
+		Self::with_hasher(FxBuildHasher)
 	}
 }
 impl<K, V> WithCapacityExt for FxHashMap<K, V> {
 	fn with_capacity(capacity: usize) -> Self {
-		Self::with_capacity_and_hasher(capacity, FxBuildHasher::default())
+		Self::with_capacity_and_hasher(capacity, FxBuildHasher)
 	}
 
 	fn new() -> Self {
-		Self::with_hasher(FxBuildHasher::default())
+		Self::with_hasher(FxBuildHasher)
 	}
 }
 
modifiedcrates/jrsonnet-evaluator/src/lib.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/lib.rs
+++ b/crates/jrsonnet-evaluator/src/lib.rs
@@ -367,7 +367,7 @@
 		let res = evaluate(self.create_default_context(file_name), &parsed);
 
 		let mut file_cache = self.file_cache();
-		let mut file = file_cache.entry(path.clone());
+		let mut file = file_cache.entry(path);
 
 		let Entry::Occupied(file) = &mut file else {
 			unreachable!("this file was just here")
modifiedcrates/jrsonnet-evaluator/src/manifest.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/manifest.rs
+++ b/crates/jrsonnet-evaluator/src/manifest.rs
@@ -240,7 +240,7 @@
 					}
 					ToString if i != 0 => buf.push(' '),
 					Minify | ToString => {}
-				};
+				}
 
 				in_description_frame(
 					|| format!("elem <{i}> manifestification"),
@@ -335,7 +335,7 @@
 			buf.push('}');
 		}
 		Val::Func(_) => bail!("tried to manifest function"),
-	};
+	}
 	Ok(())
 }
 
modifiedcrates/jrsonnet-evaluator/src/map.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/map.rs
+++ b/crates/jrsonnet-evaluator/src/map.rs
@@ -16,7 +16,7 @@
 
 impl LayeredHashMap {
 	pub fn iter_keys(self, mut handler: impl FnMut(IStr)) {
-		for (k, _) in &self.0.current {
+		for k in self.0.current.keys() {
 			handler(k.clone());
 		}
 		if let Some(parent) = self.0.parent.clone() {
@@ -47,11 +47,7 @@
 
 	pub fn contains_key(&self, key: &IStr) -> bool {
 		(self.0).current.contains_key(key)
-			|| self
-				.0
-				.parent
-				.as_ref()
-				.map_or(false, |p| p.contains_key(key))
+			|| self.0.parent.as_ref().is_some_and(|p| p.contains_key(key))
 	}
 }
 
modifiedcrates/jrsonnet-evaluator/src/obj/mod.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/obj/mod.rs
+++ b/crates/jrsonnet-evaluator/src/obj/mod.rs
@@ -1,6 +1,7 @@
 use std::{
 	any::Any,
 	cell::{Cell, RefCell},
+	clone::Clone,
 	collections::hash_map::Entry,
 	fmt::{self, Debug},
 	hash::{Hash, Hasher},
@@ -272,7 +273,7 @@
 
 impl ObjValue {
 	pub fn empty() -> Self {
-		EMPTY_OBJ.with(|v| v.clone())
+		EMPTY_OBJ.with(Clone::clone)
 	}
 	pub fn is_empty(&self) -> bool {
 		self.0.cores.is_empty() || self.len() == 0
@@ -306,14 +307,13 @@
 			return Ok(GetFor::NotFound);
 		}
 		let v = self.this.get_idx(key, self.sup)?;
-		Ok(v.map_or(GetFor::NotFound, |v| GetFor::Final(v)))
+		Ok(v.map_or(GetFor::NotFound, GetFor::Final))
 	}
 
 	fn field_visibility_core(&self, field: IStr) -> FieldVisibility {
-		match self.this.field_visibility_idx(field, self.sup) {
-			Some(c) => FieldVisibility::Found(c),
-			None => FieldVisibility::NotFound,
-		}
+		self.this
+			.field_visibility_idx(field, self.sup)
+			.map_or(FieldVisibility::NotFound, FieldVisibility::Found)
 	}
 
 	fn run_assertions_core(&self, _sup_this: SupThis) -> Result<()> {
modifiedcrates/jrsonnet-evaluator/src/obj/oop.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/obj/oop.rs
+++ b/crates/jrsonnet-evaluator/src/obj/oop.rs
@@ -1,4 +1,4 @@
-use std::cell::Cell;
+use std::cell::{Cell, RefCell};
 use std::ops::ControlFlow;
 use std::{fmt, mem};
 
@@ -105,7 +105,7 @@
 
 	fn run_assertions_core(&self, sup_this: SupThis) -> Result<()> {
 		if let Some(assertion) = &self.assertion {
-			assertion.0.run(sup_this.clone())?;
+			assertion.0.run(sup_this)?;
 		}
 		Ok(())
 	}
@@ -196,7 +196,7 @@
 		ObjValue(Cc::new(ObjValueInner {
 			cores: self.sup,
 			assertions_ran: Cell::new(false),
-			value_cache: Default::default(),
+			value_cache: RefCell::default(),
 		}))
 	}
 }
modifiedcrates/jrsonnet-evaluator/src/stack.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/stack.rs
+++ b/crates/jrsonnet-evaluator/src/stack.rs
@@ -17,6 +17,7 @@
 	}
 }
 #[cfg(not(nightly))]
+#[allow(dead_code)]
 type NightlyLocalKey<T> = std::thread::LocalKey<T>;
 
 #[cfg(nightly)]
@@ -60,7 +61,7 @@
 pub struct StackDepthGuard(PhantomData<()>);
 impl Drop for StackDepthGuard {
 	fn drop(&mut self) {
-		STACK_LIMIT.with(|limit| limit.current_depth.set(limit.current_depth.get() - 1))
+		STACK_LIMIT.with(|limit| limit.current_depth.set(limit.current_depth.get() - 1));
 	}
 }
 
modifiedcrates/jrsonnet-evaluator/src/stdlib/format.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/stdlib/format.rs
+++ b/crates/jrsonnet-evaluator/src/stdlib/format.rs
@@ -297,6 +297,7 @@
 const NUMBERS: &[u8] = b"0123456789abcdefghijklmnopqrstuvwxyz";
 
 #[inline]
+#[allow(clippy::fn_params_excessive_bools)]
 pub fn render_integer(
 	out: &mut String,
 	neg: bool,
@@ -330,7 +331,7 @@
 
 	let pref_len = zero_prefix.len() as u16;
 	let zp2 = zp
-		.saturating_sub(if !prefix_in_padding { pref_len } else { 0 })
+		.saturating_sub(if prefix_in_padding { 0 } else { pref_len })
 		.max(precision)
 		.saturating_sub(if prefix_in_padding { pref_len } else { 0 } + digits.len() as u16);
 
@@ -369,6 +370,7 @@
 		out, neg, iv, padding, precision, blank, sign, 10, "", false, false,
 	);
 }
+#[allow(clippy::fn_params_excessive_bools)]
 pub fn render_octal(
 	out: &mut String,
 	neg: bool,
@@ -439,8 +441,8 @@
 	// Note that it can also be equal to 10**prec and we'll need to carry
 	// over to the wholes.  We operate on the absolute numbers, so that we
 	// don't have trouble with the rounding direction.
-	let denominator = 10.0f64.powi(precision as i32);
-	let numerator = n.abs() * denominator + 0.5;
+	let denominator = 10.0f64.powi(i32::from(precision));
+	let numerator = n.abs().mul_add(denominator, 0.5);
 	let whole = (numerator / denominator).floor();
 	let frac = numerator.floor() % denominator;
 
@@ -611,7 +613,7 @@
 			} else {
 				value.abs().log10().floor()
 			};
-			if exponent < -4.0 || exponent >= fpprec as f64 {
+			if exponent < -4.0 || exponent >= f64::from(fpprec) {
 				render_float_sci(
 					&mut tmp_out,
 					value,
@@ -661,7 +663,7 @@
 			}
 		},
 		ConvTypeV::Percent => tmp_out.push('%'),
-	};
+	}
 
 	let padding = width.saturating_sub(tmp_out.len() as u16);
 
modifiedcrates/jrsonnet-evaluator/src/tla.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/tla.rs
+++ b/crates/jrsonnet-evaluator/src/tla.rs
@@ -1,13 +1,14 @@
+use std::{collections::HashMap, hash::BuildHasher};
+
 use jrsonnet_interner::IStr;
 use jrsonnet_parser::Source;
-use rustc_hash::FxHashMap;
 
 use crate::{
 	function::{CallLocation, TlaArg},
 	in_description_frame, with_state, Result, Val,
 };
 
-pub fn apply_tla(args: &FxHashMap<IStr, TlaArg>, val: Val) -> Result<Val> {
+pub fn apply_tla<H: BuildHasher>(args: &HashMap<IStr, TlaArg, H>, val: Val) -> Result<Val> {
 	Ok(if let Val::Func(func) = val {
 		in_description_frame(
 			|| "during TLA call".to_owned(),
modifiedcrates/jrsonnet-evaluator/src/typed/conversions.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/typed/conversions.rs
+++ b/crates/jrsonnet-evaluator/src/typed/conversions.rs
@@ -462,7 +462,7 @@
 		};
 		if let Some(bytes) = a.as_any().downcast_ref::<BytesArray>() {
 			return Ok(bytes.0.as_slice().into());
-		};
+		}
 		<Self as Typed>::TYPE.check(&value)?;
 		// Any::downcast_ref::<ByteArray>(&a);
 		let mut out = Vec::with_capacity(a.len());
modifiedcrates/jrsonnet-evaluator/src/val.rsdiffbeforeafterboth
after · crates/jrsonnet-evaluator/src/val.rs
1use std::{2	cell::RefCell,3	cmp::Ordering,4	fmt::{self, Debug, Display},5	marker::PhantomData,6	mem::replace,7	num::NonZeroU32,8	ops::Deref,9	rc::Rc,10};1112use jrsonnet_gcmodule::{cc_dyn, Acyclic, Cc, Trace};13use jrsonnet_interner::IStr;14pub use jrsonnet_macros::Thunk;15use jrsonnet_types::ValType;16use rustc_hash::FxHashMap;17use thiserror::Error;1819pub use crate::arr::{ArrValue, ArrayLike};20use crate::{21	bail,22	error::{Error, ErrorKind::*},23	function::FuncVal,24	gc::WithCapacityExt as _,25	manifest::{ManifestFormat, ToStringFormat},26	typed::{BoundedUsize, MAX_SAFE_INTEGER, MIN_SAFE_INTEGER},27	ObjValue, Result, SupThis, Unbound, WeakSupThis,28};2930pub trait ThunkValue: Trace {31	type Output;32	fn get(&self) -> Result<Self::Output>;33}3435#[derive(Trace)]36enum MemoizedClusureThunkInner<D: Trace, T: Trace> {37	Computed(T),38	Errored(Error),39	Waiting {40		env: D,41		// Carries no data, as it is not a real closure, all the42		// captured environment is stored in `env` field.43		#[trace(skip)]44		closure: fn(D) -> Result<T>,45	},46	Pending,47}48#[derive(Trace)]49pub struct MemoizedClosureThunk<D: Trace, T: Trace>(RefCell<MemoizedClusureThunkInner<D, T>>);50impl<D: Trace, T: Trace> MemoizedClosureThunk<D, T> {51	pub fn new(env: D, closure: fn(D) -> Result<T>) -> Self {52		Self(RefCell::new(MemoizedClusureThunkInner::Waiting {53			env,54			closure,55		}))56	}57}5859impl<D: Trace, T: Trace + Clone> ThunkValue for MemoizedClosureThunk<D, T> {60	type Output = T;6162	fn get(&self) -> Result<Self::Output> {63		match &*self.0.borrow() {64			MemoizedClusureThunkInner::Computed(v) => return Ok(v.clone()),65			MemoizedClusureThunkInner::Errored(e) => return Err(e.clone()),66			MemoizedClusureThunkInner::Pending => return Err(InfiniteRecursionDetected.into()),67			MemoizedClusureThunkInner::Waiting { .. } => (),68		}69		let MemoizedClusureThunkInner::Waiting { env, closure } = replace(70			&mut *self.0.borrow_mut(),71			MemoizedClusureThunkInner::Pending,72		) else {73			unreachable!();74		};75		let new_value = match closure(env) {76			Ok(v) => v,77			Err(e) => {78				*self.0.borrow_mut() = MemoizedClusureThunkInner::Errored(e.clone());79				return Err(e);80			}81		};82		*self.0.borrow_mut() = MemoizedClusureThunkInner::Computed(new_value.clone());83		Ok(new_value)84	}85}8687cc_dyn!(88	/// Lazily evaluated value89	#[derive(Clone)] Thunk<V: Trace>,90	ThunkValue<Output = V>,91	pub fn new() {...}92);9394impl<T: Trace> Thunk<T> {95	pub fn evaluated(val: T) -> Self96	where97		T: Clone,98	{99		#[derive(Trace)]100		struct EvaluatedThunk<T: Trace>(T);101		impl<T> ThunkValue for EvaluatedThunk<T>102		where103			T: Clone + Trace,104		{105			type Output = T;106107			fn get(&self) -> Result<Self::Output> {108				Ok(self.0.clone())109			}110		}111		Self::new(EvaluatedThunk(val))112	}113	pub fn errored(e: Error) -> Self {114		#[derive(Trace)]115		struct ErroredThunk<T: Trace>(Error, PhantomData<T>);116		impl<T> ThunkValue for ErroredThunk<T>117		where118			T: Trace,119		{120			type Output = T;121122			fn get(&self) -> Result<Self::Output> {123				Err(self.0.clone())124			}125		}126		Self::new(ErroredThunk(e, PhantomData))127	}128	pub fn result(res: Result<T, Error>) -> Self129	where130		T: Clone,131	{132		match res {133			Ok(o) => Self::evaluated(o),134			Err(e) => Self::errored(e),135		}136	}137}138139impl<T> Thunk<T>140where141	T: Clone + Trace,142{143	pub fn force(&self) -> Result<()> {144		self.evaluate()?;145		Ok(())146	}147148	/// Evaluate thunk, or return cached value149	///150	/// # Errors151	///152	/// - Lazy value evaluation returned error153	/// - This method was called during inner value evaluation154	pub fn evaluate(&self) -> Result<T> {155		self.0.get()156	}157}158159pub trait ThunkMapper<Input>: Trace {160	type Output;161	fn map(self, from: Input) -> Result<Self::Output>;162}163impl<Input> Thunk<Input>164where165	Input: Trace + Clone,166{167	pub fn map<M>(self, mapper: M) -> Thunk<M::Output>168	where169		M: ThunkMapper<Input>,170		M::Output: Trace + Clone,171	{172		let inner = self;173		Thunk!(move || {174			let value = inner.evaluate()?;175			let mapped = mapper.map(value)?;176			Ok(mapped)177		})178	}179}180181impl<T: Trace + Clone> From<Result<T>> for Thunk<T> {182	fn from(value: Result<T>) -> Self {183		match value {184			Ok(o) => Self::evaluated(o),185			Err(e) => Self::errored(e),186		}187	}188}189impl<T, V: Trace> From<T> for Thunk<V>190where191	T: ThunkValue<Output = V>,192{193	fn from(value: T) -> Self {194		Self::new(value)195	}196}197198impl<T: Trace + Default + Clone> Default for Thunk<T> {199	fn default() -> Self {200		Self::evaluated(T::default())201	}202}203204#[derive(Trace, Clone)]205pub struct CachedUnbound<I, T>206where207	I: Unbound<Bound = T>,208	T: Trace,209{210	cache: Cc<RefCell<FxHashMap<WeakSupThis, T>>>,211	value: I,212}213impl<I: Unbound<Bound = T>, T: Trace> CachedUnbound<I, T> {214	pub fn new(value: I) -> Self {215		Self {216			cache: Cc::new(RefCell::new(FxHashMap::new())),217			value,218		}219	}220}221impl<I: Unbound<Bound = T>, T: Clone + Trace> Unbound for CachedUnbound<I, T> {222	type Bound = T;223	fn bind(&self, sup_this: SupThis) -> Result<T> {224		let cache_key = sup_this.clone().downgrade();225		{226			if let Some(t) = self.cache.borrow().get(&cache_key) {227				return Ok(t.clone());228			}229		}230		let bound = self.value.bind(sup_this)?;231232		{233			let mut cache = self.cache.borrow_mut();234			cache.insert(cache_key, bound.clone());235		}236237		Ok(bound)238	}239}240241impl<T: Debug + Trace> Debug for Thunk<T> {242	fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {243		write!(f, "Lazy")244	}245}246impl<T: Trace> PartialEq for Thunk<T> {247	fn eq(&self, other: &Self) -> bool {248		Cc::ptr_eq(&self.0, &other.0)249	}250}251252/// Represents a Jsonnet value, which can be sliced or indexed (string or array).253#[allow(clippy::module_name_repetitions)]254pub enum IndexableVal {255	/// String.256	Str(IStr),257	/// Array.258	Arr(ArrValue),259}260impl IndexableVal {261	pub fn is_empty(&self) -> bool {262		match self {263			Self::Str(s) => s.is_empty(),264			Self::Arr(s) => s.is_empty(),265		}266	}267268	pub fn to_array(self) -> ArrValue {269		match self {270			Self::Str(s) => ArrValue::chars(s.chars()),271			Self::Arr(arr) => arr,272		}273	}274	/// Slice the value.275	///276	/// # Implementation277	///278	/// For strings, will create a copy of specified interval.279	///280	/// For arrays, nothing will be copied on this call, instead [`ArrValue::Slice`] view will be returned.281	pub fn slice(282		self,283		index: Option<i32>,284		end: Option<i32>,285		step: Option<BoundedUsize<1, { i32::MAX as usize }>>,286	) -> Result<Self> {287		match &self {288			Self::Str(s) => {289				let mut computed_len = None;290				let mut get_len = || {291					computed_len.unwrap_or_else(|| {292						let len = s.chars().count();293						let _ = computed_len.insert(len);294						len295					})296				};297				let mut get_idx = |pos: Option<i32>, default| {298					match pos {299						Some(v) if v < 0 => get_len().saturating_sub((-v) as usize),300						// No need to clamp, as iterator interface is used301						Some(v) => v as usize,302						None => default,303					}304				};305306				let index = get_idx(index, 0);307				let end = get_idx(end, usize::MAX);308				let step = step.as_deref().copied().unwrap_or(1);309310				if index >= end {311					return Ok(Self::Str("".into()));312				}313314				Ok(Self::Str(315					(s.chars()316						.skip(index)317						.take(end - index)318						.step_by(step)319						.collect::<String>())320					.into(),321				))322			}323			Self::Arr(arr) => Ok(Self::Arr(arr.clone().slice(324				index,325				end,326				step.map(|v| NonZeroU32::new(v.value() as u32).expect("bounded != 0")),327			))),328		}329	}330}331332#[derive(Debug, Clone, Acyclic)]333pub enum StrValue {334	Flat(IStr),335	Tree(Rc<(StrValue, StrValue, usize)>),336}337impl StrValue {338	pub fn concat(a: Self, b: Self) -> Self {339		// TODO: benchmark for an optimal value, currently just a arbitrary choice340		const STRING_EXTEND_THRESHOLD: usize = 100;341342		if a.is_empty() {343			b344		} else if b.is_empty() {345			a346		} else if a.len() + b.len() < STRING_EXTEND_THRESHOLD {347			Self::Flat(format!("{a}{b}").into())348		} else {349			let len = a.len() + b.len();350			Self::Tree(Rc::new((a, b, len)))351		}352	}353	pub fn into_flat(self) -> IStr {354		#[cold]355		fn write_buf(s: &StrValue, out: &mut String) {356			match s {357				StrValue::Flat(f) => out.push_str(f),358				StrValue::Tree(t) => {359					write_buf(&t.0, out);360					write_buf(&t.1, out);361				}362			}363		}364		match self {365			Self::Flat(f) => f,366			Self::Tree(_) => {367				let mut buf = String::with_capacity(self.len());368				write_buf(&self, &mut buf);369				buf.into()370			}371		}372	}373	pub fn len(&self) -> usize {374		match self {375			Self::Flat(v) => v.len(),376			Self::Tree(t) => t.2,377		}378	}379	pub fn is_empty(&self) -> bool {380		match self {381			Self::Flat(v) => v.is_empty(),382			// Can't create non-flat empty string383			Self::Tree(_) => false,384		}385	}386}387impl<T> From<T> for StrValue388where389	IStr: From<T>,390{391	fn from(value: T) -> Self {392		Self::Flat(IStr::from(value))393	}394}395impl Display for StrValue {396	fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {397		match self {398			Self::Flat(v) => write!(f, "{v}"),399			Self::Tree(t) => {400				write!(f, "{}", t.0)?;401				write!(f, "{}", t.1)402			}403		}404	}405}406impl PartialEq for StrValue {407	// False positive, into_flat returns not StrValue, but IStr, thus no infinite recursion here.408	#[allow(clippy::unconditional_recursion)]409	fn eq(&self, other: &Self) -> bool {410		let a = self.clone().into_flat();411		let b = other.clone().into_flat();412		a == b413	}414}415impl Eq for StrValue {}416impl PartialOrd for StrValue {417	fn partial_cmp(&self, other: &Self) -> Option<Ordering> {418		Some(self.cmp(other))419	}420}421impl Ord for StrValue {422	fn cmp(&self, other: &Self) -> Ordering {423		let a = self.clone().into_flat();424		let b = other.clone().into_flat();425		a.cmp(&b)426	}427}428429/// Represents jsonnet number430/// Jsonnet numbers are finite f64, with NaNs disallowed431#[derive(Trace, Clone, Copy)]432#[repr(transparent)]433pub struct NumValue(f64);434impl NumValue {435	/// Creates a [`NumValue`], if value is finite and not NaN436	pub fn new(v: f64) -> Option<Self> {437		if !v.is_finite() {438			return None;439		}440		Some(Self(v))441	}442	#[inline]443	pub const fn get(&self) -> f64 {444		self.0445	}446	pub(crate) fn truncate_for_bitwise(self) -> Result<i64> {447		if self.0 < MIN_SAFE_INTEGER || self.0 > MAX_SAFE_INTEGER {448			bail!("numberic value outside of safe integer range for bitwise operation");449		}450		Ok(self.0 as i64)451	}452}453impl PartialEq for NumValue {454	fn eq(&self, other: &Self) -> bool {455		self.0 == other.0456	}457}458impl Eq for NumValue {}459impl Ord for NumValue {460	#[inline]461	fn cmp(&self, other: &Self) -> Ordering {462		// Can't use `total_cmp`: its behavior for `-0` and `0`463		// is not following wanted.464		unsafe { self.0.partial_cmp(&other.0).unwrap_unchecked() }465	}466}467impl PartialOrd for NumValue {468	#[inline]469	fn partial_cmp(&self, other: &Self) -> Option<Ordering> {470		Some(self.cmp(other))471	}472}473impl Debug for NumValue {474	fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {475		Debug::fmt(&self.0, f)476	}477}478impl Display for NumValue {479	fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {480		Display::fmt(&self.0, f)481	}482}483impl Deref for NumValue {484	type Target = f64;485486	#[inline]487	fn deref(&self) -> &Self::Target {488		&self.0489	}490}491macro_rules! impl_num {492	($($ty:ty),+) => {$(493		impl From<$ty> for NumValue {494			#[inline]495			fn from(value: $ty) -> Self {496				Self(value.into())497			}498		}499	)+};500}501impl_num!(i8, u8, i16, u16, i32, u32);502503#[derive(Clone, Copy, Debug, Error, Trace)]504pub enum ConvertNumValueError {505	#[error("overflow")]506	Overflow,507	#[error("underflow")]508	Underflow,509	#[error("non-finite")]510	NonFinite,511}512impl From<ConvertNumValueError> for Error {513	fn from(e: ConvertNumValueError) -> Self {514		Self::new(e.into())515	}516}517518macro_rules! impl_try_num {519	($($ty:ty),+) => {$(520		impl TryFrom<$ty> for NumValue {521			type Error = ConvertNumValueError;522			#[inline]523			fn try_from(value: $ty) -> Result<Self, ConvertNumValueError> {524				let value = value as f64;525				if value < MIN_SAFE_INTEGER {526					return Err(ConvertNumValueError::Underflow)527				} else if value > MAX_SAFE_INTEGER {528					return Err(ConvertNumValueError::Overflow)529				}530				// Number is finite.531				Ok(Self(value))532			}533		}534	)+};535}536impl_try_num!(usize, isize, i64, u64);537538impl TryFrom<f64> for NumValue {539	type Error = ConvertNumValueError;540541	#[inline]542	fn try_from(value: f64) -> Result<Self, Self::Error> {543		Self::new(value).ok_or(ConvertNumValueError::NonFinite)544	}545}546impl TryFrom<f32> for NumValue {547	type Error = ConvertNumValueError;548549	#[inline]550	fn try_from(value: f32) -> Result<Self, Self::Error> {551		Self::new(f64::from(value)).ok_or(ConvertNumValueError::NonFinite)552	}553}554555/// Represents any valid Jsonnet value.556#[derive(Debug, Clone, Trace, Default)]557pub enum Val {558	/// Represents a Jsonnet boolean.559	Bool(bool),560	/// Represents a Jsonnet null value.561	#[default]562	Null,563	/// Represents a Jsonnet string.564	Str(StrValue),565	/// Represents a Jsonnet number.566	/// Should be finite, and not NaN567	/// This restriction isn't enforced by enum, as enum field can't be marked as private568	Num(NumValue),569	/// Experimental bigint570	#[cfg(feature = "exp-bigint")]571	BigInt(#[trace(skip)] Box<num_bigint::BigInt>),572	/// Represents a Jsonnet array.573	Arr(ArrValue),574	/// Represents a Jsonnet object.575	Obj(ObjValue),576	/// Represents a Jsonnet function.577	Func(FuncVal),578}579580#[cfg(target_pointer_width = "64")]581static_assertions::assert_eq_size!(Val, [u8; 24]);582583impl From<IndexableVal> for Val {584	fn from(v: IndexableVal) -> Self {585		match v {586			IndexableVal::Str(s) => Self::string(s),587			IndexableVal::Arr(a) => Self::Arr(a),588		}589	}590}591592impl Val {593	pub const fn as_bool(&self) -> Option<bool> {594		match self {595			Self::Bool(v) => Some(*v),596			_ => None,597		}598	}599	pub const fn as_null(&self) -> Option<()> {600		match self {601			Self::Null => Some(()),602			_ => None,603		}604	}605	pub fn as_str(&self) -> Option<IStr> {606		match self {607			Self::Str(s) => Some(s.clone().into_flat()),608			_ => None,609		}610	}611	pub const fn as_num(&self) -> Option<f64> {612		match self {613			Self::Num(n) => Some(n.get()),614			_ => None,615		}616	}617	#[cfg(feature = "exp-bigint")]618	pub fn as_bigint(&self) -> Option<num_bigint::BigInt> {619		match self {620			Self::BigInt(n) => Some(*n.clone()),621			_ => None,622		}623	}624	pub fn as_arr(&self) -> Option<ArrValue> {625		match self {626			Self::Arr(a) => Some(a.clone()),627			_ => None,628		}629	}630	pub fn as_obj(&self) -> Option<ObjValue> {631		match self {632			Self::Obj(o) => Some(o.clone()),633			_ => None,634		}635	}636	pub fn as_func(&self) -> Option<FuncVal> {637		match self {638			Self::Func(f) => Some(f.clone()),639			_ => None,640		}641	}642643	pub const fn value_type(&self) -> ValType {644		match self {645			Self::Str(..) => ValType::Str,646			Self::Num(..) => ValType::Num,647			#[cfg(feature = "exp-bigint")]648			Self::BigInt(..) => ValType::BigInt,649			Self::Arr(..) => ValType::Arr,650			Self::Obj(..) => ValType::Obj,651			Self::Bool(_) => ValType::Bool,652			Self::Null => ValType::Null,653			Self::Func(..) => ValType::Func,654		}655	}656657	pub fn manifest(&self, format: impl ManifestFormat) -> Result<String> {658		fn manifest_dyn(val: &Val, manifest: &dyn ManifestFormat) -> Result<String> {659			manifest.manifest(val.clone())660		}661		manifest_dyn(self, &format)662	}663664	pub fn to_string(&self) -> Result<IStr> {665		Ok(match self {666			Self::Bool(true) => "true".into(),667			Self::Bool(false) => "false".into(),668			Self::Null => "null".into(),669			Self::Str(s) => s.clone().into_flat(),670			_ => self.manifest(ToStringFormat).map(IStr::from)?,671		})672	}673674	pub fn into_indexable(self) -> Result<IndexableVal> {675		Ok(match self {676			Self::Str(s) => IndexableVal::Str(s.into_flat()),677			Self::Arr(arr) => IndexableVal::Arr(arr),678			_ => bail!(ValueIsNotIndexable(self.value_type())),679		})680	}681682	pub fn function(function: impl Into<FuncVal>) -> Self {683		Self::Func(function.into())684	}685	pub fn string(string: impl Into<StrValue>) -> Self {686		Self::Str(string.into())687	}688	pub fn num(num: impl Into<NumValue>) -> Self {689		Self::Num(num.into())690	}691	pub fn try_num<V, E>(num: V) -> Result<Self, E>692	where693		NumValue: TryFrom<V, Error = E>,694	{695		Ok(Self::Num(num.try_into()?))696	}697}698699impl From<IStr> for Val {700	fn from(value: IStr) -> Self {701		Self::string(value)702	}703}704impl From<String> for Val {705	fn from(value: String) -> Self {706		Self::string(value)707	}708}709impl From<&str> for Val {710	fn from(value: &str) -> Self {711		Self::string(value)712	}713}714impl From<ObjValue> for Val {715	fn from(value: ObjValue) -> Self {716		Self::Obj(value)717	}718}719720const fn is_function_like(val: &Val) -> bool {721	matches!(val, Val::Func(_))722}723724/// Native implementation of `std.primitiveEquals`725pub fn primitive_equals(val_a: &Val, val_b: &Val) -> Result<bool> {726	Ok(match (val_a, val_b) {727		(Val::Bool(a), Val::Bool(b)) => a == b,728		(Val::Null, Val::Null) => true,729		(Val::Str(a), Val::Str(b)) => a == b,730		(Val::Num(a), Val::Num(b)) => (a.get() - b.get()).abs() <= f64::EPSILON,731		#[cfg(feature = "exp-bigint")]732		(Val::BigInt(a), Val::BigInt(b)) => a == b,733		(Val::Arr(_), Val::Arr(_)) => {734			bail!("primitiveEquals operates on primitive types, got array")735		}736		(Val::Obj(_), Val::Obj(_)) => {737			bail!("primitiveEquals operates on primitive types, got object")738		}739		(a, b) if is_function_like(a) && is_function_like(b) => {740			bail!("cannot test equality of functions")741		}742		(_, _) => false,743	})744}745746/// Native implementation of `std.equals`747pub fn equals(val_a: &Val, val_b: &Val) -> Result<bool> {748	if val_a.value_type() != val_b.value_type() {749		return Ok(false);750	}751	match (val_a, val_b) {752		(Val::Arr(a), Val::Arr(b)) => {753			if ArrValue::ptr_eq(a, b) {754				return Ok(true);755			}756			if a.len() != b.len() {757				return Ok(false);758			}759			for (a, b) in a.iter().zip(b.iter()) {760				if !equals(&a?, &b?)? {761					return Ok(false);762				}763			}764			Ok(true)765		}766		(Val::Obj(a), Val::Obj(b)) => {767			if ObjValue::ptr_eq(a, b) {768				return Ok(true);769			}770			let fields = a.fields(771				#[cfg(feature = "exp-preserve-order")]772				false,773			);774			if fields775				!= b.fields(776					#[cfg(feature = "exp-preserve-order")]777					false,778				) {779				return Ok(false);780			}781			for field in fields {782				if !equals(783					&a.get(field.clone())?.expect("field exists"),784					&b.get(field)?.expect("field exists"),785				)? {786					return Ok(false);787				}788			}789			Ok(true)790		}791		(a, b) => Ok(primitive_equals(a, b)?),792	}793}
modifiedcrates/jrsonnet-interner/src/lib.rsdiffbeforeafterboth
--- a/crates/jrsonnet-interner/src/lib.rs
+++ b/crates/jrsonnet-interner/src/lib.rs
@@ -227,9 +227,11 @@
 type PoolMap = HashMap<Inner, (), FxBuildHasher>;
 
 thread_local! {
-	static POOL: RefCell<PoolMap> = RefCell::new(HashMap::with_capacity_and_hasher(200, FxBuildHasher::default()));
+	static POOL: RefCell<PoolMap> = RefCell::new(HashMap::with_capacity_and_hasher(200, FxBuildHasher));
 }
 
+/// Utils for embedding jrsonnet in non-rust.
+///
 /// Jrsonnet golang bindings require that it is possible to move jsonnet
 /// VM between OS threads, and this is not possible due to usage of
 /// `thread_local`. Instead, there is two methods added, one should be
modifiedcrates/jrsonnet-macros/src/lib.rsdiffbeforeafterboth
--- a/crates/jrsonnet-macros/src/lib.rs
+++ b/crates/jrsonnet-macros/src/lib.rs
@@ -127,6 +127,7 @@
 	Default(Expr),
 }
 
+#[allow(clippy::large_enum_variant, reason = "this macro is not that hot for it to matter")]
 enum ArgInfo {
 	Normal {
 		ty: Box<Type>,
modifiedcrates/jrsonnet-parser/src/expr.rsdiffbeforeafterboth
--- a/crates/jrsonnet-parser/src/expr.rs
+++ b/crates/jrsonnet-parser/src/expr.rs
@@ -166,6 +166,10 @@
 	pub fn len(&self) -> usize {
 		self.exprs.len()
 	}
+	pub fn is_empty(&self) -> bool {
+		self.exprs.is_empty()
+	}
+
 	pub fn binds_len(&self) -> usize {
 		self.binds_len
 	}
modifiedcrates/jrsonnet-stdlib/src/arrays.rsdiffbeforeafterboth
--- a/crates/jrsonnet-stdlib/src/arrays.rs
+++ b/crates/jrsonnet-stdlib/src/arrays.rs
@@ -98,9 +98,9 @@
 			for c in str.chars() {
 				match func(Either2::A(c.to_string()))? {
 					Val::Str(o) => write!(out, "{o}").unwrap(),
-					Val::Null => continue,
+					Val::Null => {},
 					_ => bail!("in std.join all items should be strings"),
-				};
+				}
 			}
 			Ok(IndexableVal::Str(out.into()))
 		}
@@ -114,9 +114,9 @@
 							out.push(oe?);
 						}
 					}
-					Val::Null => continue,
+					Val::Null => {},
 					_ => bail!("in std.join all items should be arrays"),
-				};
+				}
 			}
 			Ok(IndexableVal::Arr(out.into()))
 		}
@@ -205,7 +205,6 @@
 						out.push(item?);
 					}
 				} else if matches!(item, Val::Null) {
-					continue;
 				} else {
 					bail!("in std.join all items should be arrays");
 				}
@@ -226,7 +225,6 @@
 					first = false;
 					write!(out, "{item}").unwrap();
 				} else if matches!(item, Val::Null) {
-					continue;
 				} else {
 					bail!("in std.join all items should be strings");
 				}
modifiedcrates/jrsonnet-stdlib/src/manifest/xml.rsdiffbeforeafterboth
--- a/crates/jrsonnet-stdlib/src/manifest/xml.rs
+++ b/crates/jrsonnet-stdlib/src/manifest/xml.rs
@@ -46,7 +46,7 @@
 		};
 		if arr.is_empty() {
 			bail!("JSONML value should have tag (array length should be >=1)");
-		};
+		}
 		let tag = String::from_untyped(
 			arr.get(0)
 				.description("getting JSONML tag")?
modifiedcrates/jrsonnet-stdlib/src/manifest/yaml.rsdiffbeforeafterboth
--- a/crates/jrsonnet-stdlib/src/manifest/yaml.rs
+++ b/crates/jrsonnet-stdlib/src/manifest/yaml.rs
@@ -90,6 +90,7 @@
 		RESERVED.iter().any(|k| key.eq_ignore_ascii_case(k))
 	}
 
+	#[allow(clippy::if_same_then_else)]
 	// Check for unsafe characters
 	if !key
 		.chars()
@@ -98,7 +99,7 @@
 		return false;
 	}
 	// Check for reserved words
-	if is_reserved(key) {
+	else if is_reserved(key) {
 		return false;
 	}
 	// Check for timestamp values.  Since spaces and colons are already forbidden,
@@ -107,7 +108,7 @@
 	// - all characters match [0-9\-]
 	// - has exactly 2 dashes
 	// are considered dates.
-	if key.chars().all(|v| matches!(v, '0'..='9' | '-')) && count_char(key, '-') == 2 {
+	else if key.chars().all(|v| matches!(v, '0'..='9' | '-')) && count_char(key, '-') == 2 {
 		return false;
 	}
 	// Check for integers.  Keys that meet all of the following:
modifiedcrates/jrsonnet-stdlib/src/misc.rsdiffbeforeafterboth
--- a/crates/jrsonnet-stdlib/src/misc.rs
+++ b/crates/jrsonnet-stdlib/src/misc.rs
@@ -172,7 +172,7 @@
 	let Some(patch) = patch.as_obj() else {
 		return Ok(patch);
 	};
-	let target = target.as_obj().unwrap_or_else(|| ObjValue::empty());
+	let target = target.as_obj().unwrap_or_else(ObjValue::empty);
 	let target_fields = target
 		.fields(
 			// FIXME: Makes no sense to preserve order for BTreeSet, it would be better to use IndexSet here?
modifiedcrates/jrsonnet-stdlib/src/sets.rsdiffbeforeafterboth
--- a/crates/jrsonnet-stdlib/src/sets.rs
+++ b/crates/jrsonnet-stdlib/src/sets.rs
@@ -21,7 +21,7 @@
 	let x = keyF(x)?;
 
 	while low < high {
-		let middle = (high + low) / 2;
+		let middle = usize::midpoint(high, low);
 		let comp = keyF(arr.get_lazy(middle).expect("in bounds"))?;
 		match evaluate_compare_op(&comp, &x, BinaryOpType::Lt)? {
 			Ordering::Less => low = middle + 1,
@@ -66,7 +66,7 @@
 				bv = b.next();
 				bk = bv.map(keyF).transpose()?;
 			}
-		};
+		}
 	}
 	Ok(ArrValue::lazy(out))
 }
@@ -106,7 +106,7 @@
 				bv = b.next();
 				bk = bv.map(keyF).transpose()?;
 			}
-		};
+		}
 	}
 	while let Some(_ac) = &ak {
 		// In a, but not in b
@@ -154,7 +154,7 @@
 				bv = b.next();
 				bk = bv.clone().map(keyF).transpose()?;
 			}
-		};
+		}
 	}
 	// a.len() > b.len()
 	while let Some(_ac) = &ak {
modifiedcrates/jrsonnet-stdlib/src/sort.rsdiffbeforeafterboth
--- a/crates/jrsonnet-stdlib/src/sort.rs
+++ b/crates/jrsonnet-stdlib/src/sort.rs
@@ -66,7 +66,7 @@
 				return Err(err);
 			}
 		}
-	};
+	}
 	Ok(values)
 }
 
@@ -107,7 +107,7 @@
 				return Err(err);
 			}
 		}
-	};
+	}
 	Ok(vk.into_iter().map(|v| v.0).collect())
 }
 
@@ -204,7 +204,7 @@
 	}
 }
 
-fn eval_keyf(val: Val, key_f: &Option<FuncVal>) -> Result<Val> {
+fn eval_keyf(val: Val, key_f: Option<&FuncVal>) -> Result<Val> {
 	if let Some(key_f) = key_f {
 		key_f.evaluate_simple(&(val,), false)
 	} else {
@@ -212,13 +212,13 @@
 	}
 }
 
-fn array_top1(arr: ArrValue, key_f: Option<FuncVal>, ordering: Ordering) -> Result<Val> {
+fn array_top1(arr: ArrValue, key_f: Option<&FuncVal>, ordering: Ordering) -> Result<Val> {
 	let mut iter = arr.iter();
 	let mut min = iter.next().expect("not empty")?;
-	let mut min_key = eval_keyf(min.clone(), &key_f)?;
+	let mut min_key = eval_keyf(min.clone(), key_f)?;
 	for item in iter {
 		let cur = item?;
-		let cur_key = eval_keyf(cur.clone(), &key_f)?;
+		let cur_key = eval_keyf(cur.clone(), key_f)?;
 		if evaluate_compare_op(&cur_key, &min_key, BinaryOpType::Lt)? == ordering {
 			min = cur;
 			min_key = cur_key;
@@ -236,7 +236,7 @@
 	if arr.is_empty() {
 		return eval_on_empty(onEmpty);
 	}
-	array_top1(arr, keyF, Ordering::Less)
+	array_top1(arr, keyF.as_ref(), Ordering::Less)
 }
 #[builtin]
 pub fn builtin_max_array(
@@ -247,5 +247,5 @@
 	if arr.is_empty() {
 		return eval_on_empty(onEmpty);
 	}
-	array_top1(arr, keyF, Ordering::Greater)
+	array_top1(arr, keyF.as_ref(), Ordering::Greater)
 }
modifiedcrates/jrsonnet-stdlib/src/strings.rsdiffbeforeafterboth
--- a/crates/jrsonnet-stdlib/src/strings.rs
+++ b/crates/jrsonnet-stdlib/src/strings.rs
@@ -53,7 +53,7 @@
 
 #[builtin]
 pub fn builtin_equals_ignore_case(str1: String, str2: String) -> bool {
-	str1.to_ascii_lowercase() == str2.to_ascii_lowercase()
+	str1.eq_ignore_ascii_case(&str2)
 }
 
 #[builtin]
modifiedcrates/jrsonnet-types/src/lib.rsdiffbeforeafterboth
--- a/crates/jrsonnet-types/src/lib.rs
+++ b/crates/jrsonnet-types/src/lib.rs
@@ -133,7 +133,7 @@
 			Self::Sum(v) => write_union(f, false, v.iter())?,
 			Self::SumRef(v) => write_union(f, false, v.iter().copied())?,
 			Self::Lazy(lazy) => write!(f, "Lazy<{lazy}>")?,
-		};
+		}
 		Ok(())
 	}
 }
modifiedtests/tests/common.rsdiffbeforeafterboth
--- a/tests/tests/common.rs
+++ b/tests/tests/common.rs
@@ -57,12 +57,13 @@
 #[builtin]
 fn param_names(fun: FuncVal) -> Vec<String> {
 	fun.params()
-		.into_iter()
+		.iter()
 		.map(|v| v.name().as_str().unwrap_or("<unnamed>").to_owned())
 		.collect()
 }
 
 #[derive(Trace)]
+#[allow(dead_code)]
 pub struct ContextInitializer;
 impl ContextInitializerT for ContextInitializer {
 	fn populate(&self, _for_file: Source, builder: &mut ContextBuilder) {
modifiedtests/tests/cpp_test_suite.rsdiffbeforeafterboth
--- a/tests/tests/cpp_test_suite.rs
+++ b/tests/tests/cpp_test_suite.rs
@@ -23,29 +23,29 @@
 	// C++ test suite
 	std_context.add_ext_str("var1".into(), "test".into());
 	std_context
-		.add_ext_code("var2".into(), "{x:1,y:2}")
+		.add_ext_code("var2", "{x:1,y:2}")
 		.expect("code is valid");
 
 	// Golang test suite
 	std_context
-		.add_ext_code("codeVar".into(), "3+3")
+		.add_ext_code("codeVar", "3+3")
 		.expect("code is valid");
 	std_context.add_ext_str("stringVar".into(), "2 + 2".into());
 	std_context
 		.add_ext_code(
-			"selfRecursiveVar".into(),
+			"selfRecursiveVar",
 			r#"[42, std.extVar("selfRecursiveVar")[0] + 1]"#,
 		)
 		.expect("code is valid");
 	std_context
 		.add_ext_code(
-			"mutuallyRecursiveVar1".into(),
+			"mutuallyRecursiveVar1",
 			r#"[42, std.extVar("mutuallyRecursiveVar2")[0] + 1]"#,
 		)
 		.expect("code is valid");
 	std_context
 		.add_ext_code(
-			"mutuallyRecursiveVar2".into(),
+			"mutuallyRecursiveVar2",
 			r#"[42, std.extVar("mutuallyRecursiveVar1")[0] + 1]"#,
 		)
 		.expect("code is valid");
@@ -203,9 +203,9 @@
 		let root = root_tests.join(root_dir);
 		let root_override = root_tests.join(format!("{root_dir}_golden_override"));
 
-		for entry in fs::read_dir(&root).map_err(|e| io::Error::new(ErrorKind::Other, format!("failed to enumerate cpp_test_suite dir (Note: it needs to be cloned from C++ jsonnet repo for this test): {e}")))? {
+		for entry in fs::read_dir(&root).map_err(|e| io::Error::other(format!("failed to enumerate cpp_test_suite dir (Note: it needs to be cloned from C++ jsonnet repo for this test): {e}")))? {
 		let entry = entry?;
-		if !entry.path().extension().map_or(false, |e| e == "jsonnet") {
+		if entry.path().extension().is_none_or(|e| e != "jsonnet") {
 			continue;
 		}
 
@@ -213,7 +213,7 @@
 			.path()
 			.file_name()
 			.and_then(|v| v.to_str())
-			.map_or(false, |v| SKIPPED.contains(&v))
+			.is_some_and(|v| SKIPPED.contains(&v))
 		{
 			continue;
 		}
@@ -227,7 +227,7 @@
 		golden_path2.set_extension("golden");
 
 		let golden_override =
-			root_override.join(&golden_path.file_name().expect("file has basename"));
+			root_override.join(golden_path.file_name().expect("file has basename"));
 
 		// .jsonnet.golden for C++ tests
 		let mut golden = read_file(&golden_path)?;
@@ -282,7 +282,7 @@
 					}
 				}
 			}
-		};
+		}
 	}
 	}
 
modifiedtests/tests/golden.rsdiffbeforeafterboth
--- a/tests/tests/golden.rs
+++ b/tests/tests/golden.rs
@@ -40,8 +40,8 @@
 #[test]
 fn golden() {
 	glob!("../", "golden/*.jsonnet", |path| {
-		let result = run(&path);
+		let result = run(path);
 
-		assert_snapshot!(result)
+		assert_snapshot!(result);
 	});
 }
modifiedtests/tests/suite.rsdiffbeforeafterboth
--- a/tests/tests/suite.rs
+++ b/tests/tests/suite.rs
@@ -32,7 +32,7 @@
 			file.display(),
 			trace_format.format(&e).unwrap()
 		),
-	};
+	}
 }
 
 #[test]
@@ -42,11 +42,9 @@
 
 	for entry in fs::read_dir(&root)? {
 		let entry = entry?;
-		if !entry.path().extension().map_or(false, |e| e == "jsonnet") {
-			continue;
+		if entry.path().extension().is_some_and(|e| e == "jsonnet") {
+			run(&entry.path());
 		}
-
-		run(&entry.path());
 	}
 
 	Ok(())