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

Add sum to std.algorithm's TOC

Browse source
This commit is contained in:
monarch dodra 2014-02-27 10:05:51 +01:00
parent 98d4c60840
commit 4d16df5a73
1 changed files with 4 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

5
std/algorithm.d
View file

@ -20,7 +20,7 @@ $(MYREF min) $(MYREF mismatch) )
) )
$(TR $(TDNW Iteration) $(TD $(MYREF filter) $(MYREF filterBidirectional) $(TR $(TDNW Iteration) $(TD $(MYREF filter) $(MYREF filterBidirectional)
$(MYREF group) $(MYREF joiner) $(MYREF map) $(MYREF reduce) $(MYREF $(MYREF group) $(MYREF joiner) $(MYREF map) $(MYREF reduce) $(MYREF
splitter) $(MYREF uniq) ) splitter) $(MYREF sum) $(MYREF uniq) )
) )
$(TR $(TDNW Sorting) $(TD $(MYREF completeSort) $(MYREF isPartitioned) $(TR $(TDNW Sorting) $(TD $(MYREF completeSort) $(MYREF isPartitioned)
$(MYREF isSorted) $(MYREF makeIndex) $(MYREF nextPermutation) $(MYREF isSorted) $(MYREF makeIndex) $(MYREF nextPermutation)
@ -213,6 +213,9 @@ $(TR $(TDNW $(LREF reduce)) $(TD $(D reduce!"a + b"([1, 2, 3,
$(TR $(TDNW $(LREF splitter)) $(TD Lazily splits a range by a $(TR $(TDNW $(LREF splitter)) $(TD Lazily splits a range by a
separator.) separator.)
) )
$(TR $(TDNW $(LREF sum)) $(TD Same as $(D reduce), but specialized for
accurate summation.)
)
$(TR $(TDNW $(LREF uniq)) $(TD Iterates over the unique elements $(TR $(TDNW $(LREF uniq)) $(TD Iterates over the unique elements
in a range, which is assumed sorted.) in a range, which is assumed sorted.)
) )