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

remove whitespace in ddoc output of std/algorithm

Browse source
This commit is contained in:
Sebastian Wilzbach 2016-05-25 02:50:55 +02:00
parent 2f124dee5d
commit 614294cd70
6 changed files with 0 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

2
std/algorithm/comparison.d
View file

@ -4,9 +4,7 @@ This is a submodule of $(MREF std, algorithm).
It contains generic _comparison algorithms. It contains generic _comparison algorithms.
$(BOOKTABLE Cheat Sheet, $(BOOKTABLE Cheat Sheet,
$(TR $(TH Function Name) $(TH Description)) $(TR $(TH Function Name) $(TH Description))
$(T2 among, $(T2 among,
Checks if a value is among a set of values, e.g. Checks if a value is among a set of values, e.g.
$(D if (v.among(1, 2, 3)) // `v` is 1, 2 or 3)) $(D if (v.among(1, 2, 3)) // `v` is 1, 2 or 3))

2
std/algorithm/iteration.d
View file

@ -4,9 +4,7 @@ This is a submodule of $(MREF std, algorithm).
It contains generic _iteration algorithms. It contains generic _iteration algorithms.
$(BOOKTABLE Cheat Sheet, $(BOOKTABLE Cheat Sheet,
$(TR $(TH Function Name) $(TH Description)) $(TR $(TH Function Name) $(TH Description))
$(T2 cache, $(T2 cache,
Eagerly evaluates and caches another range's $(D front).) Eagerly evaluates and caches another range's $(D front).)
$(T2 cacheBidirectional, $(T2 cacheBidirectional,

2
std/algorithm/mutation.d
View file

@ -4,9 +4,7 @@ This is a submodule of $(MREF std, algorithm).
It contains generic _mutation algorithms. It contains generic _mutation algorithms.
$(BOOKTABLE Cheat Sheet, $(BOOKTABLE Cheat Sheet,
$(TR $(TH Function Name) $(TH Description)) $(TR $(TH Function Name) $(TH Description))
$(T2 bringToFront, $(T2 bringToFront,
If $(D a = [1, 2, 3]) and $(D b = [4, 5, 6, 7]), If $(D a = [1, 2, 3]) and $(D b = [4, 5, 6, 7]),
$(D bringToFront(a, b)) leaves $(D a = [4, 5, 6]) and $(D bringToFront(a, b)) leaves $(D a = [4, 5, 6]) and

2
std/algorithm/searching.d
View file

@ -4,9 +4,7 @@ This is a submodule of $(MREF std, algorithm).
It contains generic _searching algorithms. It contains generic _searching algorithms.
$(BOOKTABLE Cheat Sheet, $(BOOKTABLE Cheat Sheet,
$(TR $(TH Function Name) $(TH Description)) $(TR $(TH Function Name) $(TH Description))
$(T2 all, $(T2 all,
$(D all!"a > 0"([1, 2, 3, 4])) returns $(D true) because all elements $(D all!"a > 0"([1, 2, 3, 4])) returns $(D true) because all elements
are positive) are positive)

2
std/algorithm/setops.d
View file

@ -4,9 +4,7 @@ This is a submodule of $(MREF std, algorithm).
It contains generic algorithms that implement set operations. It contains generic algorithms that implement set operations.
$(BOOKTABLE Cheat Sheet, $(BOOKTABLE Cheat Sheet,
$(TR $(TH Function Name) $(TH Description)) $(TR $(TH Function Name) $(TH Description))
$(T2 cartesianProduct, $(T2 cartesianProduct,
Computes Cartesian product of two ranges.) Computes Cartesian product of two ranges.)
$(T2 largestPartialIntersection, $(T2 largestPartialIntersection,

2
std/algorithm/sorting.d
View file

@ -4,9 +4,7 @@ This is a submodule of $(MREF std, algorithm).
It contains generic _sorting algorithms. It contains generic _sorting algorithms.
$(BOOKTABLE Cheat Sheet, $(BOOKTABLE Cheat Sheet,
$(TR $(TH Function Name) $(TH Description)) $(TR $(TH Function Name) $(TH Description))
$(T2 completeSort, $(T2 completeSort,
If $(D a = [10, 20, 30]) and $(D b = [40, 6, 15]), then If $(D a = [10, 20, 30]) and $(D b = [40, 6, 15]), then
$(D completeSort(a, b)) leaves $(D a = [6, 10, 15]) and $(D b = [20, $(D completeSort(a, b)) leaves $(D a = [6, 10, 15]) and $(D b = [20,