mirror of
https://github.com/dlang/phobos.git
synced 2025-04-29 06:30:28 +03:00
Make references to input ranges a link to isInputRange
This commit is contained in:
parent
3bb8d7fd16
commit
e14f89e170
17 changed files with 84 additions and 54 deletions
|
@ -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
|
||||
|
|
|
@ -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
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue