View source code
Display the source code in std/range/package.d from which thispage was generated on github.
Report a bug
If you spot a problem with this page, click here to create aBugzilla issue.
Improve this page
Quickly fork, edit online, and submit a pull request for this page.Requires a signed-in GitHub account. This works well for small changes.If you'd like to make larger changes you may want to consider usinglocal clone.
Function std.range.dropExactly
Similar to drop and dropBack but they call
range and popFrontExactly(n)range
instead.
R dropExactly(R)(
R range,
size_t n
)
if (isInputRange!R);
Note
Unlike drop, dropExactly will assume that the
range holds at least n elements. This makes dropExactly
faster than drop, but it also means that if range does
not contain at least n elements, it will attempt to call popFront
on an empty range, which is undefined behavior. So, only use
popFrontExactly when it is guaranteed that range holds at least
n elements.
Parameters
| Name | Description |
|---|---|
| range | the input range to drop from |
| n | the number of elements to drop |
Returns
See Also
Example
import std .algorithm .comparison : equal;
import std .algorithm .iteration : filterBidirectional;
auto a = [1, 2, 3];
writeln(a .dropExactly(2)); // [3]
writeln(a .dropBackExactly(2)); // [1]
string s = "日本語";
writeln(s .dropExactly(2)); // "語"
writeln(s .dropBackExactly(2)); // "日"
auto bd = filterBidirectional!"true"([1, 2, 3]);
assert(bd .dropExactly(2) .equal([3]));
assert(bd .dropBackExactly(2) .equal([1]));
Authors
Andrei Alexandrescu, David Simcha, Jonathan M Davis, and Jack Stouffer. Credit for some of the ideas in building this module goes to Leonardo Maffi.
License
Copyright © 1999-2026 by the D Language Foundation | Page generated by ddox.