git.delta.rocks / jrsonnet / refs/commits / 0111266c91b4

1#![allow(non_snake_case)]23use jrsonnet_evaluator::{4	bail,5	function::{builtin, FuncVal},6	runtime_error,7	typed::{BoundedI32, BoundedUsize, Either2, NativeFn, Typed},8	val::{equals, ArrValue, IndexableVal},9	Either, IStr, ObjValue, ObjValueBuilder, Result, ResultExt, Thunk, Val,10};1112pub fn eval_on_empty(on_empty: Option<Thunk<Val>>) -> Result<Val> {13	if let Some(on_empty) = on_empty {14		on_empty.evaluate()15	} else {16		bail!("expected non-empty array")17	}18}1920#[builtin]21pub fn builtin_make_array(sz: BoundedI32<0, { i32::MAX }>, func: FuncVal) -> Result<ArrValue> {22	if *sz == 0 {23		return Ok(ArrValue::empty());24	}25	func.evaluate_trivial().map_or_else(26		|| Ok(ArrValue::range_exclusive(0, *sz).map(func)),27		|trivial| {28			let mut out = Vec::with_capacity(*sz as usize);29			for _ in 0..*sz {30				out.push(trivial.clone());31			}32			Ok(ArrValue::eager(out))33		},34	)35}3637#[builtin]38pub fn builtin_repeat(what: Either![IStr, ArrValue], count: usize) -> Result<Val> {39	Ok(match what {40		Either2::A(s) => Val::string(s.repeat(count)),41		Either2::B(arr) => Val::Arr(42			ArrValue::repeated(arr, count)43				.ok_or_else(|| runtime_error!("repeated length overflow"))?,44		),45	})46}4748#[builtin]49pub fn builtin_slice(50	indexable: IndexableVal,51	index: Option<Option<i32>>,52	end: Option<Option<i32>>,53	step: Option<Option<BoundedUsize<1, { i32::MAX as usize }>>>,54) -> Result<Val> {55	indexable56		.slice(index.flatten(), end.flatten(), step.flatten())57		.map(Val::from)58}5960#[builtin]61pub fn builtin_map(func: FuncVal, arr: IndexableVal) -> ArrValue {62	let arr = arr.to_array();63	arr.map(func)64}6566#[builtin]67pub fn builtin_map_with_index(func: FuncVal, arr: IndexableVal) -> ArrValue {68	let arr = arr.to_array();69	arr.map_with_index(func)70}7172#[builtin]73pub fn builtin_map_with_key(func: FuncVal, obj: ObjValue) -> Result<ObjValue> {74	let mut out = ObjValueBuilder::new();75	for (k, v) in obj.iter(76		// Makes sense mapped object should be ordered the same way, should not break anything when the output is not ordered (the default).77		// The thrown error might be different, but jsonnet78		// does not specify the evaluation order.79		#[cfg(feature = "exp-preserve-order")]80		true,81	) {82		let v = v?;83		out.field(k.clone())84			.value(func.evaluate_simple(&(k, v), false)?);85	}86	Ok(out.build())87}8889#[builtin]90pub fn builtin_flatmap(91	func: NativeFn<((Either![String, Val],), Val)>,92	arr: IndexableVal,93) -> Result<IndexableVal> {94	use std::fmt::Write;95	match arr {96		IndexableVal::Str(str) => {97			let mut out = String::new();98			for c in str.chars() {99				match func(Either2::A(c.to_string()))? {100					Val::Str(o) => write!(out, "{o}").unwrap(),101					Val::Null => {},102					_ => bail!("in std.join all items should be strings"),103				}104			}105			Ok(IndexableVal::Str(out.into()))106		}107		IndexableVal::Arr(a) => {108			let mut out = Vec::new();109			for el in a.iter() {110				let el = el?;111				match func(Either2::B(el))? {112					Val::Arr(o) => {113						for oe in o.iter() {114							out.push(oe?);115						}116					}117					Val::Null => {},118					_ => bail!("in std.join all items should be arrays"),119				}120			}121			Ok(IndexableVal::Arr(out.into()))122		}123	}124}125126#[builtin]127pub fn builtin_filter(func: FuncVal, arr: ArrValue) -> Result<ArrValue> {128	arr.filter(|val| bool::from_untyped(func.evaluate_simple(&(val.clone(),), false)?))129}130131#[builtin]132pub fn builtin_filter_map(133	filter_func: FuncVal,134	map_func: FuncVal,135	arr: ArrValue,136) -> Result<ArrValue> {137	Ok(builtin_filter(filter_func, arr)?.map(map_func))138}139140#[builtin]141pub fn builtin_foldl(func: FuncVal, arr: Either![ArrValue, IStr], init: Val) -> Result<Val> {142	let mut acc = init;143	match arr {144		Either2::A(arr) => {145			for i in arr.iter() {146				acc = func.evaluate_simple(&(acc, i?), false)?;147			}148		}149		Either2::B(arr) => {150			for i in arr.chars() {151				acc = func.evaluate_simple(&(acc, Val::string(i)), false)?;152			}153		}154	}155	Ok(acc)156}157158#[builtin]159pub fn builtin_foldr(func: FuncVal, arr: Either![ArrValue, IStr], init: Val) -> Result<Val> {160	let mut acc = init;161	match arr {162		Either2::A(arr) => {163			for i in arr.iter().rev() {164				acc = func.evaluate_simple(&(i?, acc), false)?;165			}166		}167		Either2::B(arr) => {168			for i in arr.chars().rev() {169				acc = func.evaluate_simple(&(Val::string(i), acc), false)?;170			}171		}172	}173	Ok(acc)174}175176#[builtin]177pub fn builtin_range(from: i32, to: i32) -> Result<ArrValue> {178	if to < from {179		return Ok(ArrValue::empty());180	}181	Ok(ArrValue::range_inclusive(from, to))182}183184#[builtin]185pub fn builtin_join(sep: IndexableVal, arr: ArrValue) -> Result<IndexableVal> {186	use std::fmt::Write;187	Ok(match sep {188		IndexableVal::Arr(joiner_items) => {189			let mut out = Vec::new();190191			let mut first = true;192			for item in arr.iter() {193				let item = item?.clone();194				if let Val::Arr(items) = item {195					if !first {196						out.reserve(joiner_items.len());197						// TODO: extend198						for item in joiner_items.iter() {199							out.push(item?);200						}201					}202					first = false;203					out.reserve(items.len());204					for item in items.iter() {205						out.push(item?);206					}207				} else if matches!(item, Val::Null) {208				} else {209					bail!("in std.join all items should be arrays");210				}211			}212213			IndexableVal::Arr(out.into())214		}215		IndexableVal::Str(sep) => {216			let mut out = String::new();217218			let mut first = true;219			for item in arr.iter() {220				let item = item?.clone();221				if let Val::Str(item) = item {222					if !first {223						out += &sep;224					}225					first = false;226					write!(out, "{item}").unwrap();227				} else if matches!(item, Val::Null) {228				} else {229					bail!("in std.join all items should be strings");230				}231			}232233			IndexableVal::Str(out.into())234		}235	})236}237238#[builtin]239pub fn builtin_lines(arr: ArrValue) -> Result<IndexableVal> {240	builtin_join(241		IndexableVal::Str("\n".into()),242		ArrValue::extended(arr, ArrValue::eager(vec![Val::string("")])),243	)244}245246#[builtin]247pub fn builtin_resolve_path(f: String, r: String) -> String {248	let Some(pos) = f.rfind('/') else {249		return r;250	};251	format!("{}{}", &f[..=pos], r)252}253254pub fn deep_join_inner(out: &mut String, arr: IndexableVal) -> Result<()> {255	use std::fmt::Write;256	match arr {257		IndexableVal::Str(s) => write!(out, "{s}").expect("no error"),258		IndexableVal::Arr(arr) => {259			for ele in arr.iter() {260				let indexable = IndexableVal::from_untyped(ele?)?;261				deep_join_inner(out, indexable)?;262			}263		}264	}265	Ok(())266}267268#[builtin]269pub fn builtin_deep_join(arr: IndexableVal) -> Result<String> {270	let mut out = String::new();271	deep_join_inner(&mut out, arr)?;272	Ok(out)273}274275#[builtin]276pub fn builtin_reverse(arr: ArrValue) -> ArrValue {277	arr.reversed()278}279280#[builtin]281pub fn builtin_any(arr: ArrValue) -> Result<bool> {282	for v in arr.iter() {283		let v = bool::from_untyped(v?)?;284		if v {285			return Ok(true);286		}287	}288	Ok(false)289}290291#[builtin]292pub fn builtin_all(arr: ArrValue) -> Result<bool> {293	for v in arr.iter() {294		let v = bool::from_untyped(v?)?;295		if !v {296			return Ok(false);297		}298	}299	Ok(true)300}301302#[builtin]303pub fn builtin_member(arr: IndexableVal, x: Val) -> Result<bool> {304	match arr {305		IndexableVal::Str(str) => {306			let x: IStr = IStr::from_untyped(x)?;307			Ok(!x.is_empty() && str.contains(&*x))308		}309		IndexableVal::Arr(a) => {310			for item in a.iter() {311				let item = item?;312				if equals(&item, &x)? {313					return Ok(true);314				}315			}316			Ok(false)317		}318	}319}320321#[builtin]322pub fn builtin_find(value: Val, arr: ArrValue) -> Result<Vec<usize>> {323	let mut out = Vec::new();324	for (i, ele) in arr.iter().enumerate() {325		let ele = ele?;326		if equals(&ele, &value)? {327			out.push(i);328		}329	}330	Ok(out)331}332333#[builtin]334pub fn builtin_contains(arr: IndexableVal, elem: Val) -> Result<bool> {335	builtin_member(arr, elem)336}337338#[builtin]339pub fn builtin_count(arr: ArrValue, x: Val) -> Result<usize> {340	let mut count = 0;341	for item in arr.iter() {342		if equals(&item?, &x)? {343			count += 1;344		}345	}346	Ok(count)347}348349#[builtin]350pub fn builtin_avg(arr: Vec<f64>, onEmpty: Option<Thunk<Val>>) -> Result<Val> {351	if arr.is_empty() {352		return eval_on_empty(onEmpty);353	}354	Ok(Val::try_num(arr.iter().sum::<f64>() / (arr.len() as f64))?)355}356357#[builtin]358pub fn builtin_remove_at(arr: ArrValue, at: i32) -> Result<ArrValue> {359	let newArrLeft = arr.clone().slice(None, Some(at), None);360	let newArrRight = arr.slice(Some(at + 1), None, None);361362	Ok(ArrValue::extended(newArrLeft, newArrRight))363}364365#[builtin]366pub fn builtin_remove(arr: ArrValue, elem: Val) -> Result<ArrValue> {367	for (index, item) in arr.iter().enumerate() {368		if equals(&item?, &elem)? {369			return builtin_remove_at(arr.clone(), index as i32);370		}371	}372	Ok(arr)373}374375#[builtin]376pub fn builtin_flatten_arrays(arrs: Vec<ArrValue>) -> ArrValue {377	pub fn flatten_inner(values: &[ArrValue]) -> ArrValue {378		if values.len() == 1 {379			return values[0].clone();380		} else if values.len() == 2 {381			return ArrValue::extended(values[0].clone(), values[1].clone());382		}383		let (a, b) = values.split_at(values.len() / 2);384		ArrValue::extended(flatten_inner(a), flatten_inner(b))385	}386	if arrs.is_empty() {387		return ArrValue::empty();388	} else if arrs.len() == 1 {389		return arrs.into_iter().next().expect("single");390	}391	flatten_inner(&arrs)392}393394#[builtin]395pub fn builtin_flatten_deep_array(value: Val) -> Result<Vec<Val>> {396	fn process(value: Val, out: &mut Vec<Val>) -> Result<()> {397		match value {398			Val::Arr(arr) => {399				for ele in arr.iter() {400					process(ele?, out)?;401				}402			}403			_ => out.push(value),404		}405		Ok(())406	}407	let mut out = Vec::new();408	process(value, &mut out)?;409	Ok(out)410}411412#[builtin]413pub fn builtin_prune(414	a: Val,415416	#[default(false)]417	#[cfg(feature = "exp-preserve-order")]418	preserve_order: bool,419) -> Result<Val> {420	fn is_content(val: &Val) -> bool {421		match val {422			Val::Null => false,423			Val::Arr(a) => !a.is_empty(),424			Val::Obj(o) => !o.is_empty(),425			_ => true,426		}427	}428	Ok(match a {429		Val::Arr(a) => {430			let mut out = Vec::new();431			for (i, ele) in a.iter().enumerate() {432				let ele = ele433					.and_then(|v| {434						builtin_prune(435							v,436							#[cfg(feature = "exp-preserve-order")]437							preserve_order,438						)439					})440					.with_description(|| format!("elem <{i}> pruning"))?;441				if is_content(&ele) {442					out.push(ele);443				}444			}445			Val::Arr(ArrValue::eager(out))446		}447		Val::Obj(o) => {448			let mut out = ObjValueBuilder::new();449			for (name, value) in o.iter(450				#[cfg(feature = "exp-preserve-order")]451				preserve_order,452			) {453				let value = value454					.and_then(|v| {455						builtin_prune(456							v,457							#[cfg(feature = "exp-preserve-order")]458							preserve_order,459						)460					})461					.with_description(|| format!("field <{name}> pruning"))?;462				if !is_content(&value) {463					continue;464				}465				out.field(name).value(value);466			}467			Val::Obj(out.build())468		}469		_ => a,470	})471}