--- a/src/bisection_tree/btfn.rs Thu May 01 13:06:58 2025 -0500 +++ b/src/bisection_tree/btfn.rs Thu May 01 14:53:14 2025 -0500 @@ -838,7 +838,7 @@ // there should be a result, or new nodes above the `glb` inserted into the queue. Then the waiting // threads can also continue processing. If, however, numerical inaccuracy destroyes the `glb`, // the queue may run out, and we get “Refiner failure”. -impl<F: Float, G, BT, const N: usize> MinMaxMapping<N, F> for BTFN<F, G, BT, N> +impl<F: Float, G, BT, const N: usize> MinMaxMapping<Loc<N, F>, F> for BTFN<F, G, BT, N> where BT: BTSearch<N, F, Agg = Bounds<F>>, G: SupportGenerator<N, F, Id = BT::Data>,