1use crate::builtin::std_format;2use crate::{equals, evaluate, Context, Val};3use crate::{error::Error::*, throw, Result};4use jrsonnet_parser::{BinaryOpType, LocExpr, UnaryOpType};56pub fn evaluate_unary_op(op: UnaryOpType, b: &Val) -> Result<Val> {7 use UnaryOpType::*;8 use Val::*;9 Ok(match (op, b) {10 (Not, Bool(v)) => Bool(!v),11 (Minus, Num(n)) => Num(-*n),12 (BitNot, Num(n)) => Num(!(*n as i32) as f64),13 (op, o) => throw!(UnaryOperatorDoesNotOperateOnType(op, o.value_type())),14 })15}1617pub fn evaluate_add_op(a: &Val, b: &Val) -> Result<Val> {18 use Val::*;19 Ok(match (a, b) {20 (Str(v1), Str(v2)) => Str(((**v1).to_owned() + v2).into()),2122 23 (Num(n), Str(o)) => Str(format!("{}{}", n, o).into()),24 (Str(o), Num(n)) => Str(format!("{}{}", o, n).into()),2526 (Str(s), o) => Str(format!("{}{}", s, o.clone().to_string()?).into()),27 (o, Str(s)) => Str(format!("{}{}", o.clone().to_string()?, s).into()),2829 (Obj(v1), Obj(v2)) => Obj(v2.extend_from(v1.clone())),30 (Arr(a), Arr(b)) => {31 let mut out = Vec::with_capacity(a.len() + b.len());32 out.extend(a.iter_lazy());33 out.extend(b.iter_lazy());34 Arr(out.into())35 }36 (Num(v1), Num(v2)) => Val::new_checked_num(v1 + v2)?,37 _ => throw!(BinaryOperatorDoesNotOperateOnValues(38 BinaryOpType::Add,39 a.value_type(),40 b.value_type(),41 )),42 })43}4445pub fn evaluate_mod_op(a: &Val, b: &Val) -> Result<Val> {46 use Val::*;47 match (a, b) {48 (Num(a), Num(b)) => Ok(Num(a % b)),49 (Str(str), vals) => std_format(str.clone(), vals.clone()),50 (a, b) => throw!(BinaryOperatorDoesNotOperateOnValues(51 BinaryOpType::Mod,52 a.value_type(),53 b.value_type()54 )),55 }56}5758pub fn evaluate_binary_op_special(59 context: Context,60 a: &LocExpr,61 op: BinaryOpType,62 b: &LocExpr,63) -> Result<Val> {64 use BinaryOpType::*;65 use Val::*;66 Ok(match (evaluate(context.clone(), a)?, op, b) {67 (Bool(true), Or, _o) => Val::Bool(true),68 (Bool(false), And, _o) => Val::Bool(false),69 (a, op, eb) => evaluate_binary_op_normal(&a, op, &evaluate(context, eb)?)?,70 })71}7273pub fn evaluate_binary_op_normal(a: &Val, op: BinaryOpType, b: &Val) -> Result<Val> {74 use BinaryOpType::*;75 use Val::*;76 Ok(match (a, op, b) {77 (a, Add, b) => evaluate_add_op(a, b)?,7879 (a, Eq, b) => Bool(equals(a, b)?),80 (a, Neq, b) => Bool(!equals(a, b)?),8182 (Str(a), In, Obj(obj)) => Bool(obj.has_field_ex(a.clone(), true)),83 (a, Mod, b) => evaluate_mod_op(a, b)?,8485 (Str(v1), Mul, Num(v2)) => Str(v1.repeat(*v2 as usize).into()),8687 88 (Bool(a), And, Bool(b)) => Bool(*a && *b),89 (Bool(a), Or, Bool(b)) => Bool(*a || *b),9091 92 (Str(v1), Lt, Str(v2)) => Bool(v1 < v2),93 (Str(v1), Gt, Str(v2)) => Bool(v1 > v2),94 (Str(v1), Lte, Str(v2)) => Bool(v1 <= v2),95 (Str(v1), Gte, Str(v2)) => Bool(v1 >= v2),9697 98 (Num(v1), Mul, Num(v2)) => Val::new_checked_num(v1 * v2)?,99 (Num(v1), Div, Num(v2)) => {100 if *v2 <= f64::EPSILON {101 throw!(DivisionByZero)102 }103 Val::new_checked_num(v1 / v2)?104 }105106 (Num(v1), Sub, Num(v2)) => Val::new_checked_num(v1 - v2)?,107108 (Num(v1), Lt, Num(v2)) => Bool(v1 < v2),109 (Num(v1), Gt, Num(v2)) => Bool(v1 > v2),110 (Num(v1), Lte, Num(v2)) => Bool(v1 <= v2),111 (Num(v1), Gte, Num(v2)) => Bool(v1 >= v2),112113 (Num(v1), BitAnd, Num(v2)) => Num(((*v1 as i32) & (*v2 as i32)) as f64),114 (Num(v1), BitOr, Num(v2)) => Num(((*v1 as i32) | (*v2 as i32)) as f64),115 (Num(v1), BitXor, Num(v2)) => Num(((*v1 as i32) ^ (*v2 as i32)) as f64),116 (Num(v1), Lhs, Num(v2)) => {117 if *v2 < 0.0 {118 throw!(RuntimeError("shift by negative exponent".into()))119 }120 Num(((*v1 as i32) << (*v2 as i32)) as f64)121 }122 (Num(v1), Rhs, Num(v2)) => {123 if *v2 < 0.0 {124 throw!(RuntimeError("shift by negative exponent".into()))125 }126 Num(((*v1 as i32) >> (*v2 as i32)) as f64)127 }128129 _ => throw!(BinaryOperatorDoesNotOperateOnValues(130 op,131 a.value_type(),132 b.value_type(),133 )),134 })135}