The usual constructor. Currently takes no argument.
-=head2 C<nary $coderf>
+=head2 C<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
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<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
}
is considered as always returning an unbounded list.
-The convolution law also does not behave the same when C<list> elements are involved : in the following example,
+
+Also, the convolution law does not behave the same when C<list> elements are involved : in the following example,
sub oneorlist {
if (rand < 0.1) {
}
my %ops;
+
$ops{$_} = 1 for scalops;
$ops{$_} = 0 for qw/stub nextstate/;
$ops{$_} = 1 for qw/padsv/;
$ops{$_} = 'list' for qw/padav/;
$ops{$_} = 'list' for qw/padhv rv2hv/;
-$ops{$_} = 'list' for qw/padany flip match/;
+$ops{$_} = 'list' for qw/padany match entereval readline/;
+
+$ops{each} = { 0 => 0.5, 2 => 0.5 };
+$ops{stat} = { 0 => 0.5, 13 => 0.5 };
+
+$ops{caller} = sub { my @a = caller 0; scalar @a }->();
+$ops{localtime} = do { my @a = localtime; scalar @a };
+$ops{gmtime} = do { my @a = gmtime; scalar @a };
+
+$ops{$_} = { 0 => 0.5, 10 => 0.5 } for map "gpw$_", qw/nam uid ent/;
+$ops{$_} = { 0 => 0.5, 4 => 0.5 } for map "ggr$_", qw/nam gid ent/;
+$ops{$_} = 'list' for qw/ghbyname ghbyaddr ghostent/;
+$ops{$_} = { 0 => 0.5, 4 => 0.5 } for qw/gnbyname gnbyaddr gnetent/;
+$ops{$_} = { 0 => 0.5, 3 => 0.5 } for qw/gpbyname gpbynumber gprotoent/;
+$ops{$_} = { 0 => 0.5, 4 => 0.5 } for qw/gsbyname gsbyport gservent/;
sub enter {
my ($self, $cv) = @_;
+ return 'list' if class($cv) ne 'CV';
my $op = $cv->ROOT;
my $tag = tag($op);
my $n = name($op);
my $meth = $self->can('pp_' . $n);
return $self->$meth($op) if $meth;
- return $ops{$n} => 0 if exists $ops{$n};
+ if (exists $ops{$n}) {
+ my $r = $ops{$n};
+ $r = { %$r } if ref $r eq 'HASH';
+ return $r => 0;
+ }
if ($op->flags & OPf_KIDS) {
my @res = (0);
return ($self->expect_list($op))[0] => 1 if name($op) eq 'return';
- if (class($op) eq 'LOGOP') {
+ if (class($op) eq 'LOGOP' and not null $op->first) {
my @res;
my ($p, $r);
return $self->expect_list($op);
}
-# Stolen from Sub::Deparse
+# Stolen from B::Deparse
sub padval { $_[0]->{cv}->[0]->PADLIST->ARRAYelt(1)->ARRAYelt($_[1]) }
sub pp_leaveloop { $_[0]->expect_return($_[1]->first->sibling) }
+sub pp_flip {
+ my ($self, $op) = @_;
+
+ $op = $op->first;
+ return 'list' if name($op) ne 'range';
+
+ my $begin = $op->first;
+ if (name($begin) eq 'const') {
+ my $end = $begin->sibling;
+ if (name($end) eq 'const') {
+ $begin = $self->const_sv($begin);
+ $end = $self->const_sv($end);
+ no warnings 'numeric';
+ return int(${$end->object_2svref}) - int(${$begin->object_2svref}) + 1;
+ } else {
+ my ($p, $r) = $self->expect_return($end);
+ return $p => 1 if $r;
+ }
+ } else {
+ my ($p, $r) = $self->expect_return($begin);
+ return $p => 1 if $r;
+ }
+
+ return 'list'
+}
+
=head1 EXPORT
An object-oriented module shouldn't export any function, and so does this one.