In this page I found a new JavaScript function type:
// NOTE: "function*" is not supported yet in Firefox.
// Remove the asterisk in order for this code to work in Firefox 13
function* fibonacci() { // !!! this is the interesting line !!!
let [prev, curr] = [0, 1];
for (;;) {
[prev, curr] = [curr, prev + curr];
yield curr;
}
}
I already know what yield
, let
and [?,?]=[?,?]
do, but have no idea what the function*
is meant to be. What is it?
P.S. don't bother trying Google, it's impossible to search for expressions with asterisks (they're used as placeholders).
Answer
It's a Generator function.
Generators are functions which can be exited and later re-entered. Their context (variable bindings) will be saved across re-entrances.
Calling a generator function does not execute its body immediately; an iterator object for the function is returned instead. When the iterator's
next()
method is called, the generator function's body is executed until the firstyield
expression, which specifies the value to be returned from the iterator or, withyield*
, delegates to another generator function.
Historical note:
It's a proposed syntax for EcmaScript.next
.
Dave Herman of Mozilla gave a talk about EcmaScript.next. At 30:15 he talks about generators.
Earlier, he explains how Mozilla is experimentally implementing proposed language changes to help steer the committee. Dave works closely with Brendan Eich, Mozilla's CTO (I think), and the original JavaScript designer.
You can find more detail on the EcmaScript working group wiki: http://wiki.ecmascript.org/doku.php?id=harmony:generators
The working group (TC-39) has general agreement that EcmaScript.next should have some kind of generator iterator proposal, but this is not final.
You shouldn't rely on this showing up without changes in the next version of the language, and even if it doesn't change, it probably won't show up widely in other browsers for a while.
Overview
First-class coroutines, represented as objects encapsulating suspended execution contexts (i.e., function activations). Prior art: Python, Icon, Lua, Scheme, Smalltalk.
Examples
The “infinite” sequence of Fibonacci numbers (notwithstanding behavior around 253):
function* fibonacci() {
let [prev, curr] = [0, 1];
for (;;) {
[prev, curr] = [curr, prev + curr];
yield curr;
}
}
Generators can be iterated over in loops:
for (n of fibonacci()) {
// truncate the sequence at 1000
if (n > 1000)
break;
print(n);
}
Generators are iterators:
let seq = fibonacci();
print(seq.next()); // 1
print(seq.next()); // 2
print(seq.next()); // 3
print(seq.next()); // 5
print(seq.next()); // 8
No comments:
Post a Comment