From a0225ceee50cafe9e974699e1cbf7fa9a1dcf901 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Robert=20Br=C3=BCnig?= Date: Mon, 17 Jun 2024 12:39:12 +0200 Subject: [PATCH] tree_reduce doc: fix formatting --- src/lib.rs | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/src/lib.rs b/src/lib.rs index c05e28266..0e7e68fb8 100644 --- a/src/lib.rs +++ b/src/lib.rs @@ -2536,10 +2536,10 @@ pub trait Itertools: Iterator { /// /// Moreover, the output of `tree_reduce` is preferable to that of [`Iterator::reduce`] in /// certain cases. For example, building a binary search tree using `tree_reduce` will result in - /// a balanced tree with height O(ln(n)), while [`Iterator::reduce`] will output a tree with - /// height O(n), essentially a linked list. + /// a balanced tree with height `O(ln(n))`, while [`Iterator::reduce`] will output a tree with + /// height `O(n)`, essentially a linked list. /// - /// If 'f' does not benefit from such a reordering, like `u32::wrapping_add`, prefer the + /// If `f` does not benefit from such a reordering, like `u32::wrapping_add`, prefer the /// normal [`Iterator::reduce`] instead since it will most likely result in the generation of /// simpler code because the compiler is able to optimize it. ///