From: Vincent Pit Date: Mon, 4 Aug 2008 22:53:16 +0000 (+0200) Subject: POD nits X-Git-Tag: v0.02~13 X-Git-Url: http://git.vpit.fr/?a=commitdiff_plain;h=bc367a7dd7fb618bed54c0afe0e29d8e328b74a8;p=perl%2Fmodules%2FSub-Nary.git POD nits --- diff --git a/lib/Sub/Nary.pm b/lib/Sub/Nary.pm index 0b505f3..e658fd7 100644 --- a/lib/Sub/Nary.pm +++ b/lib/Sub/Nary.pm @@ -42,7 +42,7 @@ This module uses the L framework to walk into subroutines and try to guess ho The usual constructor. Currently takes no argument. -=head2 C +=head2 C Takes a code reference to a named or anonymous subroutine, and returns a hash reference whose keys are the possible numbers of returning scalars, and the corresponding values the "probability" to get them. The special key C<'list'> is used to denote a possibly infinite number of returned arguments. The return value hence would look at @@ -102,7 +102,7 @@ returns C<3> or C<4> arguments with probability C<1/2> ; and never returns C<1> argument but returns C<2> with probability C<1/2 * 1/2 = 1/4>, C<3> with probability C<1/2 * 1/2 + 1/2 * 1/2 = 1/2> and C<4> with probability C<1/4> too. -=item * The C<'list'> state is absorbant in regard of all the other ones. +=item * The C state is absorbing in regard of all the other ones. This is just a pedantic way to say that "list + fixed length = list". That's why @@ -112,7 +112,8 @@ That's why } is considered as always returning an unbounded list. -The convolution law also does not behave the same when C elements are involved : in the following example, + +Also, the convolution law does not behave the same when C elements are involved : in the following example, sub oneorlist { if (rand < 0.1) {