File Coverage

blib/lib/Math/NumSeq/Tribonacci.pm

Criterion	Covered	Total	%
statement	52	53	98.1
branch	5	6	83.3
condition			n/a
subroutine	14	14	100.0
pod	3	3	100.0
total	74	76	97.3

# Copyright 2010, 2011, 2012, 2013, 2014 Kevin Ryde

# This file is part of Math-NumSeq.
#
# Math-NumSeq is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by the
# Free Software Foundation; either version 3, or (at your option) any later
# version.
#
# Math-NumSeq is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
# or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
# for more details.
#
# You should have received a copy of the GNU General Public License along
# with Math-NumSeq.  If not, see .

package Math::NumSeq::Tribonacci;
use 5.004;
use strict;

use vars '$VERSION', '@ISA';
$VERSION = 72;
use Math::NumSeq::Base::Sparse;
@ISA = ('Math::NumSeq::Base::Sparse');
*_is_infinite = \&Math::NumSeq::_is_infinite;


# uncomment this to run the ### lines
#use Smart::Comments;

# use constant name => Math::NumSeq::__('Tribonacci Numbers');
use constant description => Math::NumSeq::__('Tribonacci numbers 0, 0, 1, 1, 2, 4, 7, 13, 24, being T(i) = T(i-1) + T(i-2) + T(i-3) starting from 0,0,1.');
use constant characteristic_non_decreasing => 1;
use constant characteristic_increasing_from_i => 3;
use constant characteristic_integer => 1;
use constant values_min => 0;
use constant i_start => 0;
use constant oeis_anum => 'A000073'; # tribonacci

# The biggest f0 for which f0,f1,f2 all fit into a UV, but the sum f0+f1+f2
# would overflow and so require BigInt.  Then back from there because the
# code checks the f0 after the sum f0+f1+f2 is formed.
#
my $uv_limit = do {
  my $max = ~0;

  # f2+f1+f0 <= max
  # f0 <= max-f1
  # and f0+f1 <= max-f2
  #
  my $f0 = 0;
  my $f1 = 0;
  my $f2 = 1;
  my $prev_prev_f0;
  my $prev_f0;
  while ($f0 <= $max - $f1
         && $f0+$f1 <= $max - $f2) {
    $prev_prev_f0 = $prev_f0;
    $prev_f0 = $f0;
    ($f0,$f1,$f2) = ($f1, $f2, $f2+$f1+$f0);
  }

  ### Tribonacci UV limit ...
  ### $prev_prev_f0
  ### $prev_f0
  ### $f0
  ### $f1
  ### $f2
  ### ~0 : ~0

  $prev_prev_f0
};

sub rewind {
  my ($self) = @_;
  $self->{'i'} = $self->i_start;
  $self->{'f0'} = 0;
  $self->{'f1'} = 0;
  $self->{'f2'} = 1;
}
sub next {
  my ($self) = @_;
  ### Tribonacci next(): "i=$self->{'i'}  $self->{'f0'} $self->{'f1'} $self->{'f2'}"
  (my $ret,
   $self->{'f0'},
   $self->{'f1'},
   $self->{'f2'})
   = ($self->{'f0'},
      $self->{'f1'},
      $self->{'f2'},
      $self->{'f0'}+$self->{'f1'}+$self->{'f2'});

  if ($ret == $uv_limit) {
    ### go to bigint f2 ...
    $self->{'f2'} = Math::NumSeq::_to_bigint($self->{'f2'});
  }

  return ($self->{'i'}++, $ret);
}

sub value_to_i_estimate {
  my ($self, $value) = @_;

  if (_is_infinite($value)) {
    return $value;
  }

  my $f0 = my $f1 = ($value * 0);  # inherit bignum 0
  my $f2 = $f0 + 1;                # inherit bignum 1

  my $i = 0;
  for (;;) {
    if ($value <= $f0) {
      return $i;
    }
    ($f0,$f1,$f2) = ($f1,$f2, $f0+$f1+$f2);
    $i++;
  }
}

1;
__END__