From ebfb2df22b7c51237915815e7b1b9f63abb848bf Mon Sep 17 00:00:00 2001 From: Christian Ebner Date: Tue, 17 Dec 2019 15:01:21 +0100 Subject: [PATCH] binary_search_tree: add additional doctest for search_binary_tree_by() Make sure a start indexes larger or equal to the array size results in a return value of `None`. Signed-off-by: Christian Ebner --- src/pxar/binary_search_tree.rs | 12 ++++++++++++ 1 file changed, 12 insertions(+) diff --git a/src/pxar/binary_search_tree.rs b/src/pxar/binary_search_tree.rs index 9d79ccd1..8865881b 100644 --- a/src/pxar/binary_search_tree.rs +++ b/src/pxar/binary_search_tree.rs @@ -132,6 +132,18 @@ pub fn copy_binary_search_tree( /// let skip_multiples = 1; /// let idx = search_binary_tree_by(0, vals.len(), skip_multiples, |idx| find.cmp(&vals[idx])); /// assert!(idx.is_none()); +/// +/// let find = 5; +/// let skip_multiples = 0; +/// // if start index is equal to the array length, `None` is returned. +/// let idx = search_binary_tree_by(vals.len(), vals.len(), skip_multiples, |idx| find.cmp(&vals[idx])); +/// assert!(idx.is_none()); +/// +/// let find = 5; +/// let skip_multiples = 0; +/// // if start index is larger than length, `None` is returned. +/// let idx = search_binary_tree_by(vals.len() + 1, vals.len(), skip_multiples, |idx| find.cmp(&vals[idx])); +/// assert!(idx.is_none()); /// ``` pub fn search_binary_tree_by Ordering>(