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

Merge pull request #6435 from JackStouffer/input-range-link

Browse source 
Make references to input ranges a link to isInputRange
merged-on-behalf-of: Sebastian Wilzbach <sebi.wilzbach@gmail.com>
This commit is contained in:
The Dlang Bot 2018-04-15 01:42:45 +02:00 • committed by GitHub
commit e13e3889ac
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
17 changed files with 84 additions and 54 deletions
Download patch file Download diff file Expand all files Collapse all files

2
std/algorithm/iteration.d
View file

@ -1091,7 +1091,7 @@ that can be executed via `pred(element)`.
Params:
predicate = Function to apply to each element of range
range = Input range of elements
range = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) of elements
Returns:
`filter!(predicate)(range)` returns a new range containing only elements `x` in `range` for

8
std/algorithm/setops.d
View file

@ -930,7 +930,8 @@ alias nWayUnion = multiwayMerge;
alias NWayUnion = MultiwayMerge;
/**
Computes the union of multiple ranges. The input ranges are passed
Computes the union of multiple ranges. The
$(REF_ALTTEXT input ranges, isInputRange, std,range,primitives) are passed
as a range of ranges and each is assumed to be sorted by $(D
less). Computation is done lazily, one union element at a time.
`multiwayUnion(ror)` is functionally equivalent to `multiwayMerge(ror).uniq`.
@ -1117,8 +1118,9 @@ SetDifference!(less, R1, R2) setDifference(alias less = "a < b", R1, R2)
}
/**
Lazily computes the intersection of two or more input ranges $(D
ranges). The ranges are assumed to be sorted by `less`. The element
Lazily computes the intersection of two or more
$(REF_ALTTEXT input ranges, isInputRange, std,range,primitives)
`ranges`. The ranges are assumed to be sorted by `less`. The element
types of the ranges must have a common type.
In the case of multisets, the range with the minimum number of