Searched refs:fib (Results 1 - 5 of 5) sorted by relevance

/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Memoize/t/
H A Dspeed.t34 # We do this by running the fib() function with successfily larger
36 # to execute. Then we memoize fib() and run the same call cagain. If
44 sub fib { subroutine
48 fib($n-1) + fib($n-2);
64 $RESULT = fib($N);
68 print "# fib($N) took $ELAPSED seconds.\n" if $N % 1 == 0;
69 # we'd expect that fib(n+1) takes about 1.618 times as long as fib(n)
82 print "# OK, fib(
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/t/cmd/
H A Dsubval.t55 sub fib { subroutine
63 $foo = &fib($arg-1) + &fib($arg-2);
73 if (&fib($i) == $good[$i]) {
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/
H A DMemoize.pm401 sub fib {
404 fib($n-1) + fib($n-2);
407 This function is very slow. Why? To compute fib(14), it first wants
408 to compute fib(13) and fib(12), and add the results. But to compute
409 fib(13), it first has to compute fib(12) and fib(11), and then it
410 comes back and computes fib(1
[all...]
H A DBenchmark.t18 sub fib { subroutine
21 fib($n-1) + fib($n-2);
51 my $coderef = sub {$baz += fib($ballast)};
83 my $again = countit(1, '$baz += fib($ballast)');
182 $got = timethis(-2, sub {$foo+= fib($ballast)}, $title, 'none');
258 my $code_to_test = { Foo => sub {$foo+=fib($ballast-2)},
259 Bar => sub {$bar+=fib($ballast)}};
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Tie/
H A DFile.pm2361 (Actually, the preceding discussion is something of a fib. You don't

Completed in 38 milliseconds