If a foreach is encountered by the compiler
foreach (element; range) {
it's internally rewritten similar to the following:
for (auto it = range; !it.empty; it.popFront()) { auto element = it.front; ... }
Any object which fulfills the above interface is called an input range and is thus a type that can be iterated over:
struct InputRange {
@property bool empty();
@property T front();
void popFront();
}
import std.stdio; void main() { auto s = "hello world"; auto a = [1, 2, 3, 4]; foreach (c; s) { write(c, "!"); // h!e!l!l!o! !w!o!r!l!d! } writeln(); foreach (x; a) { write(x * x, ", "); // 1, 4, 9, 16, } }
The InputRange
concept has three functions, example:
struct InputRange(T) { @property bool empty(); @property T front(); void popFront(); }
In short, a way to
To make our own type a InputRange
, we must implement these three functions. Let's take a look at the infinite sequence of squares.
struct SquaresRange { int cur = 1; @property bool empty() { return false; } @property int front() { return cur^^2; } void popFront() { cur++; } }
See the D tour for an example with Fibonacci.