minimize diff

fidget/src/core/context/mod.rs

@@ -734,7 +734,7 @@ impl Context {
     /// # let mut ctx = fidget::context::Context::new();
     /// let x = ctx.x();
     /// let y = ctx.y();
-    /// let op = ctx.less_than(x, y).unwrap();
+    /// let op = ctx.less_than_or_equal(x, y).unwrap();
     /// let v = ctx.eval_xyz(op, 0.0, 1.0, 0.0).unwrap();
     /// assert_eq!(v, 1.0);
     /// let v = ctx.eval_xyz(op, 1.0, 1.0, 0.0).unwrap();
@@ -751,7 +751,7 @@ impl Context {
         let rhs = rhs.into_node(self)?;
         let cmp = self.op_binary(rhs, lhs, BinaryOpcode::Compare)?;
         let shift = self.add(cmp, 1.0)?;
-        self.div(shift, 2.0)
+        self.min(shift, 1.0)
     }
 
     /// Builds a node that takes the modulo (least non-negative remainder)

fidget/src/core/eval/test/grad_slice.rs

@@ -392,7 +392,7 @@ impl<F: Function + MathFunction> TestGradSlice<F> {
         let mut eval = F::new_grad_slice_eval();
 
         for i in 0..3 {
-            let args_g = args
+            let args = args
                 .iter()
                 .map(|&v| match i {
                     0 => Grad::new(v, 1.0, 0.0, 0.0),
@@ -401,9 +401,8 @@ impl<F: Function + MathFunction> TestGradSlice<F> {
                     _ => unreachable!(),
                 })
                 .collect::<Vec<Grad>>();
-            let out = eval.eval(&tape, &[args_g.as_slice()]).unwrap();
-
-            for (a, &o) in args_g.iter().zip(out.iter()) {
+            let out = eval.eval(&tape, &[args.as_slice()]).unwrap();
+            for (a, &o) in args.iter().zip(out.iter()) {
                 let v = C::eval_f64(a.v as f64);
                 let err = (v as f32 - o.v).abs();
                 let err_frac = err / (v.abs() as f32).max(o.v.abs());