mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-05-03 08:30:33 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions 2

Fix dox

Browse source
This commit is contained in:
Andrei Alexandrescu 2016-09-22 14:11:13 -04:00
parent 63f9713feb
commit d5e2b607d7
1 changed files with 3 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

6
std/algorithm/sorting.d
View file

@ -575,9 +575,9 @@ $(LI All elements `e` in subrange $(D r[0 .. k]) satisfy $(D !less(r[k], e))
(i.e. `r[k]` is greater than or equal to each element to its left according to
predicate `less`))
$(LI $(LI All elements `e` in subrange $(D r[0 .. k]) satisfy $(D !less(e,
$(LI All elements `e` in subrange $(D r[0 .. k]) satisfy $(D !less(e,
r[k])) (i.e. `r[k]` is less than or equal to each element to its right
according to predicate `less`))))
according to predicate `less`)))
If `r` contains equivalent elements, multiple permutations of `r` satisfy these
constraints. In such cases, `pivotPartition` attempts to distribute equivalent
@ -586,7 +586,7 @@ r.length / 2).
Params:
less = The predicate used for comparison, modeled as a $(LUCKY strict weak
ordering) (irreflexive, antisymmetric, transitive, and implies transitive
ordering) (irreflexive, antisymmetric, transitive, and implying a transitive
equivalence)
r = The range being partitioned
pivot = The index of the pivot for partitioning, must be less than `r.length` or