summaryrefslogtreecommitdiff
path: root/src/eval/ops.rs
diff options
context:
space:
mode:
authorLaurenz <laurmaedje@gmail.com>2021-05-18 15:44:49 +0200
committerLaurenz <laurmaedje@gmail.com>2021-05-18 15:44:49 +0200
commit6b08862b83950c32890858431a680f4069cee439 (patch)
tree3cc6e11b6213156426ded9a59ec051fa57f67b19 /src/eval/ops.rs
parent8b58171d7ca036d71b32749286c251cc91bdd10e (diff)
Streamline value comparisons
Diffstat (limited to 'src/eval/ops.rs')
-rw-r--r--src/eval/ops.rs55
1 files changed, 12 insertions, 43 deletions
diff --git a/src/eval/ops.rs b/src/eval/ops.rs
index da3432a2..69a0b02b 100644
--- a/src/eval/ops.rs
+++ b/src/eval/ops.rs
@@ -1,4 +1,6 @@
-use super::{ArrayValue, DictValue, TemplateNode, Value};
+use std::cmp::Ordering::*;
+
+use super::{TemplateNode, Value};
use Value::*;
/// Apply the plus operator to a value.
@@ -164,61 +166,28 @@ pub fn or(lhs: Value, rhs: Value) -> Value {
/// Compute whether two values are equal.
pub fn eq(lhs: Value, rhs: Value) -> Value {
- Bool(value_eq(&lhs, &rhs))
+ Bool(lhs.eq(&rhs))
}
/// Compute whether two values are equal.
pub fn neq(lhs: Value, rhs: Value) -> Value {
- Bool(!value_eq(&lhs, &rhs))
-}
-
-/// Recursively compute whether two values are equal.
-fn value_eq(lhs: &Value, rhs: &Value) -> bool {
- match (lhs, rhs) {
- (&Int(a), &Float(b)) => a as f64 == b,
- (&Float(a), &Int(b)) => a == b as f64,
- (&Length(a), &Linear(b)) => a == b.abs && b.rel.is_zero(),
- (&Relative(a), &Linear(b)) => a == b.rel && b.abs.is_zero(),
- (&Linear(a), &Length(b)) => a.abs == b && a.rel.is_zero(),
- (&Linear(a), &Relative(b)) => a.rel == b && a.abs.is_zero(),
- (Array(a), Array(b)) => array_eq(a, b),
- (Dict(a), Dict(b)) => dict_eq(a, b),
- (a, b) => a == b,
- }
-}
-
-/// Compute whether two arrays are equal.
-fn array_eq(a: &ArrayValue, b: &ArrayValue) -> bool {
- a.len() == b.len() && a.iter().zip(b).all(|(x, y)| value_eq(x, y))
-}
-
-/// Compute whether two dictionaries are equal.
-fn dict_eq(a: &DictValue, b: &DictValue) -> bool {
- a.len() == b.len()
- && a.iter().all(|(k, x)| b.get(k).map_or(false, |y| value_eq(x, y)))
+ Bool(!lhs.eq(&rhs))
}
macro_rules! comparison {
- ($name:ident, $op:tt) => {
+ ($name:ident, $($pat:tt)*) => {
/// Compute how a value compares with another value.
pub fn $name(lhs: Value, rhs: Value) -> Value {
- match (lhs, rhs) {
- (Int(a), Int(b)) => Bool(a $op b),
- (Int(a), Float(b)) => Bool((a as f64) $op b),
- (Float(a), Int(b)) => Bool(a $op b as f64),
- (Float(a), Float(b)) => Bool(a $op b),
- (Angle(a), Angle(b)) => Bool(a $op b),
- (Length(a), Length(b)) => Bool(a $op b),
- _ => Error,
- }
+ lhs.cmp(&rhs)
+ .map_or(Value::Error, |x| Value::Bool(matches!(x, $($pat)*)))
}
};
}
-comparison!(lt, <);
-comparison!(leq, <=);
-comparison!(gt, >);
-comparison!(geq, >=);
+comparison!(lt, Less);
+comparison!(leq, Less | Equal);
+comparison!(gt, Greater);
+comparison!(geq, Greater | Equal);
/// Concatenate two collections.
fn concat<T, A>(mut a: T, b: T) -> T