[std.algorithm.searching] Fix 2 typos in docs (#8728)

This commit is contained in:
Nick Treleaven 2023-03-31 13:38:47 +01:00 committed by GitHub
parent 17b1a11afd
commit 72da991685
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23

View file

@ -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: