From 72da9916851572cfc84e447d61c01cd39ce48523 Mon Sep 17 00:00:00 2001 From: Nick Treleaven Date: Fri, 31 Mar 2023 13:38:47 +0100 Subject: [PATCH] [std.algorithm.searching] Fix 2 typos in docs (#8728) --- std/algorithm/searching.d | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/std/algorithm/searching.d b/std/algorithm/searching.d index 15f7ca99e..e2c99363d 100644 --- a/std/algorithm/searching.d +++ b/std/algorithm/searching.d @@ -1313,8 +1313,8 @@ returned. Params: map = custom accessor for the comparison key selector = custom mapping for the extrema selection - seed = custom seed to use as initial element r = Range from which the extreme value will be selected + seedElement = custom seed to use as initial element Returns: The extreme value according to `map` and `selector` of the passed-in values. @@ -1552,7 +1552,7 @@ Complexity: `find` performs $(BIGOH walkLength(haystack)) evaluations of `pred`. There are specializations that improve performance by taking advantage of $(REF_ALTTEXT bidirectional, isBidirectionalRange, std,range,primitives) - or $(REF_ALTTEXT random access, isRandomAccess, std,range,primitives) + or $(REF_ALTTEXT random access, isRandomAccessRange, std,range,primitives) ranges (where possible). Params: