mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-04-30 15:10:46 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

Sort lists of functions

Browse source
This commit is contained in:
e10s 2015-01-03 00:46:22 +09:00
parent 95095812ce
commit e12596b359
1 changed files with 10 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

20
std/algorithm.d
View file

@ -14,10 +14,10 @@ $(MYREF findSplitAfter) $(MYREF findSplitBefore) $(MYREF minCount)
$(MYREF minPos) $(MYREF mismatch) $(MYREF skipOver) $(MYREF startsWith) $(MYREF minPos) $(MYREF mismatch) $(MYREF skipOver) $(MYREF startsWith)
$(MYREF until) ) $(MYREF until) )
) )
$(TR $(TDNW Comparison) $(TD $(MYREF among) $(MYREF castSwitch) $(MYREF cmp) $(TR $(TDNW Comparison) $(TD $(MYREF among) $(MYREF castSwitch) $(MYREF clamp)
$(MYREF equal) $(MYREF levenshteinDistance) $(MYREF levenshteinDistanceAndPath) $(MYREF cmp) $(MYREF equal) $(MYREF levenshteinDistance) $(MYREF
$(MYREF max) $(MYREF min) $(MYREF mismatch) $(MYREF clamp) $(MYREF levenshteinDistanceAndPath) $(MYREF max) $(MYREF min) $(MYREF mismatch)
predSwitch)) $(MYREF predSwitch))
) )
$(TR $(TDNW Iteration) $(TD $(MYREF cache) $(MYREF cacheBidirectional) $(TR $(TDNW Iteration) $(TD $(MYREF cache) $(MYREF cacheBidirectional)
$(MYREF filter) $(MYREF filterBidirectional) $(MYREF filter) $(MYREF filterBidirectional)
@ -25,9 +25,9 @@ $(MYREF group) $(MYREF groupBy) $(MYREF joiner) $(MYREF map) $(MYREF reduce)
$(MYREF splitter) $(MYREF sum) $(MYREF uniq) ) $(MYREF 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 multiSort) $(MYREF nextPermutation) $(MYREF isSorted) $(MYREF makeIndex) $(MYREF multiSort) $(MYREF
$(MYREF nextEvenPermutation) $(MYREF partialSort) $(MYREF nextEvenPermutation) $(MYREF nextPermutation) $(MYREF partialSort)
partition) $(MYREF partition3) $(MYREF schwartzSort) $(MYREF sort) $(MYREF partition) $(MYREF partition3) $(MYREF schwartzSort) $(MYREF sort)
$(MYREF topN) $(MYREF topNCopy) ) $(MYREF topN) $(MYREF topNCopy) )
) )
$(TR $(TDNW Set operations) $(TD $(MYREF cartesianProduct) $(MYREF $(TR $(TDNW Set operations) $(TD $(MYREF cartesianProduct) $(MYREF
@ -232,12 +232,12 @@ $(T2 isSorted,
$(D isSorted([1, 1, 2, 3])) returns $(D true).) $(D isSorted([1, 1, 2, 3])) returns $(D true).)
$(T2 makeIndex, $(T2 makeIndex,
Creates a separate index for a range.) Creates a separate index for a range.)
$(T2 nextPermutation,
Computes the next lexicographically greater permutation of a range
in-place.)
$(T2 nextEvenPermutation, $(T2 nextEvenPermutation,
Computes the next lexicographically greater even permutation of a range Computes the next lexicographically greater even permutation of a range
in-place.) in-place.)
$(T2 nextPermutation,
Computes the next lexicographically greater permutation of a range
in-place.)
$(T2 partialSort, $(T2 partialSort,
If $(D a = [5, 4, 3, 2, 1]), then $(D partialSort(a, 3)) leaves If $(D a = [5, 4, 3, 2, 1]), then $(D partialSort(a, 3)) leaves
$(D a[0 .. 3] = [1, 2, 3]). $(D a[0 .. 3] = [1, 2, 3]).