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

std.algorithm: Add missing entries to module documentation summary

Browse source
This commit is contained in:
Vladimir Panteleev 2014-02-03 17:23:59 +00:00
parent 5529d8205a
commit b757dcea75
1 changed files with 12 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

12
std/algorithm.d
View file

@ -101,6 +101,9 @@ $(TR $(TDNW $(LREF countUntil)) $(TD $(D countUntil(a, b))
returns the number of steps taken in $(D a) to reach $(D b); for returns the number of steps taken in $(D a) to reach $(D b); for
example, $(D countUntil("hello!", "o")) returns $(D 4).) example, $(D countUntil("hello!", "o")) returns $(D 4).)
) )
$(TR $(TDNW $(LREF commonPrefix)) $(TD $(D commonPrefix("parakeet",
"parachute")) returns $(D "para").)
)
$(TR $(TDNW $(LREF endsWith)) $(TD $(D endsWith("rocks", "ks")) $(TR $(TDNW $(LREF endsWith)) $(TD $(D endsWith("rocks", "ks"))
returns $(D true).) returns $(D true).)
) )
@ -139,6 +142,9 @@ $(TR $(TDNW $(LREF minPos)) $(TD $(D minPos([2, 3, 1, 3, 4,
1])) returns the subrange $(D [1, 3, 4, 1]), i.e., positions the range 1])) returns the subrange $(D [1, 3, 4, 1]), i.e., positions the range
at the first occurrence of its minimal element.) at the first occurrence of its minimal element.)
) )
$(TR $(TDNW $(LREF mismatch)) $(TD $(D mismatch("parakeet", "parachute"))
returns the two ranges $(D "keet") and $(D "chute").)
)
$(TR $(TDNW $(LREF skipOver)) $(TD Assume $(D a = "blah"). Then $(TR $(TDNW $(LREF skipOver)) $(TD Assume $(D a = "blah"). Then
$(D skipOver(a, "bi")) leaves $(D a) unchanged and returns $(D false), $(D skipOver(a, "bi")) leaves $(D a) unchanged and returns $(D false),
whereas $(D skipOver(a, "bl")) advances $(D a) to refer to $(D "ah") whereas $(D skipOver(a, "bl")) advances $(D a) to refer to $(D "ah")
@ -241,6 +247,9 @@ $(TR $(TDNW $(LREF partialSort)) $(TD If $(D a = [5, 4, 3, 2,
$(TR $(TDNW $(LREF partition)) $(TD Partitions a range $(TR $(TDNW $(LREF partition)) $(TD Partitions a range
according to a predicate.) according to a predicate.)
) )
$(TR $(TDNW $(LREF partition3)) $(TD Partitions a range
in three parts (less than, equal, greater than the given pivot).)
)
$(TR $(TDNW $(LREF schwartzSort)) $(TD Sorts with the help of $(TR $(TDNW $(LREF schwartzSort)) $(TD Sorts with the help of
the $(LUCKY Schwartzian transform).) the $(LUCKY Schwartzian transform).)
) )
@ -306,6 +315,9 @@ range to another.)
$(TR $(TDNW $(LREF moveSome)) $(TD Moves as many elements as $(TR $(TDNW $(LREF moveSome)) $(TD Moves as many elements as
possible from one range to another.) possible from one range to another.)
) )
$(TR $(TDNW $(LREF remove)) $(TD Removes elements from a range
in-place, and returns the shortened range.)
)
$(TR $(TDNW $(LREF reverse)) $(TD If $(D a = [1, 2, 3]), $(D $(TR $(TDNW $(LREF reverse)) $(TD If $(D a = [1, 2, 3]), $(D
reverse(a)) changes it to $(D [3, 2, 1]).) reverse(a)) changes it to $(D [3, 2, 1]).)
) )