diff -r 3697375f4ee9 -r 1f301affeae3 src/bisection_tree.rs
--- a/src/bisection_tree.rs	Thu Mar 19 18:21:40 2026 -0500
+++ b/src/bisection_tree.rs	Wed Apr 22 23:41:59 2026 -0500
@@ -14,8 +14,10 @@
 value of the sum, each $f_k$ also needs to implement [`Mapping`][crate::mapping::Mapping].
 Moreover, the sum needs to be represented by a [`SupportGenerator`] that associates to a
 low-storage-requirement identifier (typically `usize`) an object of the type that represents
-$f_k$. [`BTFN`]s support basic vector space operations, and [minimisation][BTFN::minimise] and
-[maximisation][BTFN::maximise] via a [branch-and-bound strategy][BTSearch::search_and_refine].
+$f_k$. [`BTFN`]s support basic vector space operations, and
+[minimisation][crate::bounds::MinMaxMapping::minimise] and
+[maximisation][crate::bounds::MinMaxMapping::maximise]
+via a [branch-and-bound strategy][BTSearch::search_and_refine].
 
 The nodes of a bisection tree also store aggregate information about the objects stored in the
 tree via an [`Aggregator`]. This way, rough upper and lower [bound][Bounds] estimates on
@@ -42,10 +44,12 @@
 a [`SupportGenerator`]. They can be summed and multipliced by a schalar using standard arithmetic
 operations. The types of the objects in two summed `BTFN`s do not need to be the same.
 To find an approximate minimum of a `BTFN` using a branch-and-bound strategy,
-use [`BTFN::minimise`]. [`Bounded::bounds`] provides a shortcut to [`GlobalAnalysis`] with the
+use [`crate::bounds::MinMaxMapping::minimise`].
+[`crate::bounds::Bounded::bounds`] provides a shortcut to [`GlobalAnalysis`] with the
 [`Bounds`] aggregator. If the rough bounds so obtained do not indicate that the `BTFN` is in some
 given bounds, instead of doing a full minimisation and maximisation for higher quality bounds,
-it is more efficient to use [`BTFN::has_upper_bound`] and [`BTFN::has_lower_bound`].
+it is more efficient to use [`crate::bounds::MinMaxMapping::has_upper_bound`] and
+[`crate::bounds::MinMaxMapping::has_lower_bound`].
 */
 
 mod supportid;