--- AnyEvent/lib/AnyEvent.pm	2009/08/09 16:05:11	1.279
+++ AnyEvent/lib/AnyEvent.pm	2009/09/01 10:40:05	1.288
@@ -594,7 +594,7 @@
    );
 
    # this "blocks" (while handling events) till the callback
-   # calls -<send
+   # calls ->send
    $result_ready->recv;
 
 Example: wait for a timer, but take advantage of the fact that condition
@@ -668,9 +668,10 @@
 
 Every call to C<< ->begin >> will increment a counter, and every call to
 C<< ->end >> will decrement it.  If the counter reaches C<0> in C<< ->end
->>, the (last) callback passed to C<begin> will be executed. That callback
-is I<supposed> to call C<< ->send >>, but that is not required. If no
-callback was set, C<send> will be called without any arguments.
+>>, the (last) callback passed to C<begin> will be executed, passing the
+condvar as first argument. That callback is I<supposed> to call C<< ->send
+>>, but that is not required. If no group callback was set, C<send> will
+be called without any arguments.
 
 You can think of C<< $cv->send >> giving you an OR condition (one call
 sends), while C<< $cv->begin >> and C<< $cv->end >> giving you an AND
@@ -707,7 +708,7 @@
    my $cv = AnyEvent->condvar;
 
    my %result;
-   $cv->begin (sub { $cv->send (\%result) });
+   $cv->begin (sub { shift->send (\%result) });
 
    for my $host (@list_of_hosts) {
       $cv->begin;
@@ -1117,7 +1118,7 @@
 
 use Carp ();
 
-our $VERSION = '5.0';
+our $VERSION = '5.112';
 our $MODEL;
 
 our $AUTOLOAD;
@@ -1913,16 +1914,9 @@
       },
    );
 
-   my $time_watcher; # can only be used once
-
-   sub new_timer {
-      $timer = AnyEvent->timer (after => 1, cb => sub {
-         warn "timeout\n"; # print 'timeout' about every second
-         &new_timer; # and restart the time
-      });
-   }
-
-   new_timer; # create first timer
+   my $time_watcher = AnyEvent->timer (after => 1, interval => 1, cb => sub {
+      warn "timeout\n"; # print 'timeout' at most every second
+   });
 
    $cv->recv; # wait until user enters /^q/i
 
@@ -2376,13 +2370,13 @@
 backend easily beats IO::Lambda and POE.
 
 And even the 100% non-blocking version written using the high-level (and
-slow :) L<AnyEvent::Handle> abstraction beats both POE and IO::Lambda by a
-large margin, even though it does all of DNS, tcp-connect and socket I/O
-in a non-blocking way.
+slow :) L<AnyEvent::Handle> abstraction beats both POE and IO::Lambda
+higher level ("unoptimised") abstractions by a large margin, even though
+it does all of DNS, tcp-connect and socket I/O in a non-blocking way.
 
 The two AnyEvent benchmarks programs can be found as F<eg/ae0.pl> and
 F<eg/ae2.pl> in the AnyEvent distribution, the remaining benchmarks are
-part of the IO::lambda distribution and were used without any changes.
+part of the IO::Lambda distribution and were used without any changes.
 
 
 =head1 SIGNALS