Make sure the POD headings are linkable

[perl/modules/Sub-Nary.git] / lib / Sub / Nary.pm

diff --git a/lib/Sub/Nary.pm b/lib/Sub/Nary.pm
index 7fe085855580aa53a478126802822797cf65a063..4b87e45bc779c0fd4a9c9a3e110b2816c95b8a1b 100644 (file)
--- a/lib/Sub/Nary.pm
+++ b/lib/Sub/Nary.pm
@@ -28,7 +28,7 @@ BEGIN {
 
     use Sub::Nary;
 
-    my $sn = Sub::Nary->new();
+    my $sn = Sub::Nary->new;
     my $r  = $sn->nary(\&hlagh);
 
 =head1 DESCRIPTION
@@ -39,11 +39,15 @@ This module uses the L<B> framework to walk into subroutines and try to guess ho
 
 =head2 C<new>
 
+    my $sn = Sub::Nary->new;
+
 The usual constructor. Currently takes no argument.
 
-=head2 C<nary $coderef>
+=head2 C<nary>
+
+    my $res = $sn->nary($coderef);
 
-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
+Takes a 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
 
     { 1 => 0.2, 2 => 0.4, 4 => 0.3, list => 0.1 }
 
@@ -59,7 +63,9 @@ The probability is computed as such :
 
 =over 4
 
-=item * When branching, each branch is considered equally possible.
+=item *
+
+When branching, each branch is considered equally possible.
 
 For example, the subroutine
 
@@ -85,9 +91,11 @@ As for
 
 it is considered to return C<3> scalars with probability C<1/2>, C<2> with probability C<1/2 * 1/2 = 1/4> and C<1> (when the two tests fail, the last computed value is returned, which here is C<< $x > 0.9 >> evaluated in the scalar context of the test) with remaining probability C<1/4>.
 
-=item * The total probability law for a given returning point is the convolution product of the probabilities of its list elements.
+=item *
 
-As such, 
+The total probability law for a given returning point is the convolution product of the probabilities of its list elements.
+
+As such,
 
     sub notsosimple {
      return 1, simple(), 2
@@ -101,11 +109,15 @@ 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 * If a core function may return different numbers of scalars, each kind is considered equally possible.
+=item *
+
+If a core function may return different numbers of scalars, each kind is considered equally possible.
 
 For example, C<stat> returns C<13> elements on success and C<0> on error. The according probability will then be C<< { 0 => 0.5, 13 => 0.5 } >>.
 
-=item * The C<list> state is absorbing in regard of all the other ones.
+=item *
+
+The C<list> 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
@@ -343,11 +355,9 @@ sub pp_entersub {
  my ($self, $op) = @_;
 
  $op = $op->first while $op->flags & OPf_KIDS;
- return undef, 0 if null $op;
- if (name($op) eq 'pushmark') {
-  $op = $op->sibling;
-  return undef, 0 if null $op;
- }
+ # First must be a pushmark
+ $op = $op->sibling;
+ # Next must be non null - at worse it's the rv2cv
 
  my $r;
  my $c = 1;
@@ -600,7 +610,7 @@ L<Carp> (standard since perl 5), L<B> (since perl 5.005) and L<XSLoader> (since
 
 Vincent Pit, C<< <perl at profvince.com> >>, L<http://www.profvince.com>.
 
-You can contact me by mail or on #perl @ FreeNode (vincent or Prof_Vince).
+You can contact me by mail or on C<irc.perl.org> (vincent).
 
 =head1 BUGS