D Recurrences

[bearophile]

Ben Grabham:

> import std.range;
> import std.stdio;
> int main() {
> 	auto a = recurrence!("a[n-1] + a[n-2]")(0,1);
> 	int i = 0;
> 	foreach(int n; a) {
> 		if(i++ > 20) break;
> 		writefln("%d", n);
> 	}
> 	return 0;
> }

This program does something similar to yours (but it doesn't print newlines):


import std.stdio, std.range;

void main() {
    auto fib = recurrence!q{ a[n-1] + a[n-2] }(0, 1);
    writeln(take(fib, 21));
}

Bye,
bearophile