Manage flow of control in continuation-passing style
The functions in this module implement or assist the writing of programs, or parts of them, in Continuation Passing Style (\s-1CPS\s0). Briefly, \s-1CPS\s0 is a style of writing code where the normal call/return mechanism is replaced by explicit \*(L"continuations\*(R", values passed in to functions which they should invoke, to implement return behaviour. For more detail on \s-1CPS\s0, see the \s-1SEE\s0 \s-1ALSO\s0 section.
What this module implements is not in fact true \s-1CPS\s0, as Perl does not natively support the idea of a real continuation (such as is created by a co-routine). Furthermore, for \s-1CPS\s0 to be efficient in languages that natively support it, their runtimes typically implement a lot of optimisation of \s-1CPS\s0 code, which the Perl interpreter would be unable to perform. Instead, \s-1CODE\s0 references are passed around to stand in their place. While not particularly useful for most regular cases, this becomes very useful whenever some form of asynchronous or event-based programming is being used. Continuations passed in to the body function of a control structure can be stored in the event handlers of the asynchronous or event-driven framework, so that when they are invoked later, the code continues, eventually arriving at its final answer at some point in the future.
In order for these examples to make sense, a fictional and simple asynchronisation framework has been invented. The exact details of operation should not be important, as it simply stands to illustrate the point. I hope its general intention should be obvious. :)
read_stdin_line( \&on_line ); # wait on a line from STDIN, then pass it
# to the handler function
This module itself provides functions that manage the flow of control through a continuation passing program. They do not directly facilitate the flow of data through a program. That can be managed by lexical variables captured by the closures passed around. See the \s-1EXAMPLES\s0 section.
For \s-1CPS\s0 versions of data-flow functionals, such as \*(C`map\*(C' and \*(C`grep\*(C', see also CPS::Functional. For backward compatibility with previous versions, the functions in \*(C`CPS::Functional\*(C' are also exported here; and \*(C`kunfold\*(C' is renamed to \*(C`kgenerate\*(C'. This may be removed in a later version.
use CPS qw( kloop );
kloop( sub { my ( $knext, $klast ) = @_;
print "Enter a number, or q to quit: ";
read_stdin_line( sub { my ( $first ) = @_; chomp $first;
return $klast->() if $first eq "q";
print "Enter a second number: ";
read_stdin_line( sub { my ( $second ) = @_;
print "The sum is " . ( $first + $second ) . "\n";
$knext->(); } ); } ); }, sub { exit } );
In all of the following functions, the \*(C`\&body\*(C' function can provide results by invoking its continuation / one of its continuations, either synchronously or asynchronously at some point later (via some event handling or other mechanism); the next invocation of \*(C`\&body\*(C' will not take place until the previous one exits if it is done synchronously.
They all take the prefix \*(C`k\*(C' before the name of the regular perl keyword or function they aim to replace. It is common in \s-1CPS\s0 code in other languages, such as Scheme or Haskell, to store a continuation in a variable called \*(C`k\*(C'. This convention is followed here. \s-1CPS\s0 version of perl's \*(C`while(true)\*(C' loop. Repeatedly calls the \*(C`body\*(C' code until it indicates the end of the loop, then invoke $k.
$body->( $knext, $klast ) $knext->() $klast->()
$k->()
If $knext is invoked, the body will be called again. If $klast is invoked, the continuation $k is invoked. Compatibility synonym for \*(C`kloop\*(C'; it was renamed after version 0.10. New code should use \*(C`kloop\*(C' instead. \s-1CPS\s0 version of perl's \*(C`foreach\*(C' loop. Calls the \*(C`body\*(C' code once for each element in @items, until either the items are exhausted or the \*(C`body\*(C' invokes its $klast continuation, then invoke $k.
$body->( $item, $knext, $klast ) $knext->() $klast->()
$k->() \s-1CPS\s0 version of recursive descent on a tree-like structure, defined by a function, \*(C`body\*(C', which when given a node in the tree, yields a list of child nodes.
$body->( $node, $kmore ) $kmore->( @child_nodes )
$k->()
The first value to be passed into \*(C`body\*(C' is $root.
At each iteration, a node is given to the \*(C`body\*(C' function, and it is expected to pass a list of child nodes into its $kmore continuation. These will then be iterated over, in the order given. The tree-like structure is visited depth-first, descending fully into one subtree of a node before moving on to the next.
This function does not provide a way for the body to accumulate a resultant data structure to pass into its own continuation. The body is executed simply for its side-effects and its continuation is invoked with no arguments. A variable of some sort should be shared between the body and the continuation if this is required. A breadth-first variation of \*(C`kdescendd\*(C'. This function visits each child node of the parent, before iterating over all of these nodes's children, recursively until the bottom of the tree. This \s-1CPS\s0 function takes a list of function bodies and calls them all immediately. Each is given its own continuation. Once every body has invoked its continuation, the main continuation $k is invoked.
$body->( $kdone ) $kdone->()
$k->()
This allows running multiple operations in parallel, and waiting for them all to complete before continuing. It provides in a \s-1CPS\s0 form functionality similar to that provided in a more object-oriented fashion by modules such as Async::MergePoint or Event::Join. This \s-1CPS\s0 function takes a list of items and a function body, and calls the body immediately once for each item in the list. Each invocation is given its own continuation. Once every body has invoked its continuation, the main continuation $k is invoked.
$body->( $item, $kdone ) $kdone->()
$k->()
This is similar to \*(C`kforeach\*(C', except that the body is started concurrently for all items in the list list, rather than each item waiting for the previous to finish. This \s-1CPS\s0 function takes a list of function bodies and calls them each, one at a time in sequence. Each is given a continuation to invoke, which will cause the next body to be invoked. When the last body has invoked its continuation, the main continuation $k is invoked.
$body->( $kdone ) $kdone->()
$k->()
A benefit of this is that it allows a long operation that uses many continuation \*(L"pauses\*(R", to be written without code indenting further and further to the right. Another is that it allows easy skipping of conditional parts of a computation, which would otherwise be tricky to write in a \s-1CPS\s0 form. See the \s-1EXAMPLES\s0 section.
All of the above functions are implemented using a loop which repeatedly calls the body function until some terminating condition. By controlling the way this loop re-invokes itself, a program can control the behaviour of the functions.
For every one of the above functions, there also exists a variant which takes a CPS::Governor object as its first argument. These functions use the governor object to control their iteration.
kloop( \&body, $k ) gkloop( $gov, \&body, $k )
kforeach( \@items, \&body, $k ) gkforeach( $gov, \@items, \&body, $k )
etc...
In this way, other governor objects can be constructed which have different running properties; such as interleaving iterations of their loop with other \s-1IO\s0 activity in an event-driven framework, or giving rate-limitation control on the speed of iteration of the loop.
These function names do not begin with \*(C`k\*(C' because they are not themselves \s-1CPS\s0 primatives, but may be useful in CPS-oriented code. Returns a new \s-1CODE\s0 reference to a CPS-wrapped version of the code block or passed \s-1CODE\s0 reference. When $kfunc is invoked, the function &func is called in list context, being passed all the arguments given to $kfunc apart from the last, expected to be its continuation. When &func returns, the result is passed into the continuation.
$kfunc->( @func_args, $k ) $k->( @func_ret )
The following are equivalent
print func( 1, 2, 3 );
my $kfunc = liftk( \&func ); $kfunc->( 1, 2, 3, sub { print @_ } );
Note that the returned wrapper function only has one continuation slot in its arguments. It therefore cannot be used as the body for \*(C`kloop()\*(C', \*(C`kforeach()\*(C' or \*(C`kgenerate()\*(C', because these pass two continuations. There does not exist a \*(L"natural\*(R" way to lift a normal call/return function into a \s-1CPS\s0 function which requires more than one continuation, because there is no way to distinguish the different named returns. Returns a new \s-1CODE\s0 reference to a plain call/return version of the passed CPS-style \s-1CODE\s0 reference. When the returned (\*(L"dropped\*(R") function is called, it invokes the passed \s-1CPS\s0 function, then waits for it to invoke its continuation. When it does, the list that was passed to the continuation is returned by the dropped function. If called in scalar context, only the first value in the list is returned.
$kfunc->( @func_args, $k ) $k->( @func_ret )
$waitfunc->()
@func_ret = $func->( @func_args )
Given the following trivial \s-1CPS\s0 function:
$kadd = sub { $_[2]->( $_[0] + $_[1] ) };
The following are equivalent
$kadd->( 10, 20, sub { print "The total is $_[0]\n" } );
$add = dropk { } $kadd; print "The total is ".$add->( 10, 20 )."\n";
In the general case the \s-1CPS\s0 function hasn't yet invoked its continuation by the time it returns (such as would be the case when using any sort of asynchronisation or event-driven framework). For \*(C`dropk\*(C' to actually work in this situation, it requires a way to run the event framework, to cause it to process events until the continuation has been invoked.
This is provided by the block, or the first passed \s-1CODE\s0 reference. When the returned function is invoked, it repeatedly calls the block or wait function, until the \s-1CPS\s0 function has invoked its continuation.
No facilities are provided directly to return data from \s-1CPS\s0 body functions in \*(C`kloop\*(C', \*(C`kpar\*(C' and \*(C`kseq\*(C'. Instead, normal lexical variable capture may be used here.
my $bat; my $ball;
kpar( sub { my ( $k ) = @_; get_bat( on_bat => sub { $bat = shift; goto &$k } ); }, sub { my ( $k ) = @_; serve_ball( on_ball => sub { $ball = shift; goto &$k } ); },
sub { $bat->hit( $ball ); }, );
The body function can set the value of a variable that it and its final continuation both capture. Consider the call/return style of code
A(); if( $maybe ) { B(); } C();
We cannot easily write this in \s-1CPS\s0 form without naming C twice
kA( sub { $maybe ? kB( sub { kC() } ) : kC(); } );
While not so problematic here, it could get awkward if C were in fact a large code block, or if more than a single conditional were employed in the logic; a likely scenario. A further issue is that the logical structure becomes much harder to read.
Using \*(C`kseq\*(C' allows us to name the continuation so each arm of \*(C`kmaybe\*(C' can invoke it indirectly.
kseq( \&kA, sub { my $k = shift; $maybe ? kB( $k ) : goto &$k; }, \&kC );
CPS::Functional - functional utilities in Continuation-Passing Style
http://en.wikipedia.org/wiki/Continuation-passing_style <http://en.wikipedia.org/wiki/Continuation-passing_style> on wikipedia
Coro - co-routines in Perl
Matt S. Trout (mst) <[email protected]> - for the inspiration of \*(C`kpareach\*(C' and with apologies to for naming of the said. ;)
Paul Evans <[email protected]>