++ed by:
ABRAXXA AWNCORP BESSARABV DAMS MELO

5 PAUSE user(s)
1 non-PAUSE user(s).

Damien Krotkine

NAME

Action::Retry::Strategy::Fibonacci - Fibonacci incrementation of sleep time strategy

VERSION

version 0.24

SYNOPSIS

To be used as strategy in Action::Retry

DESCRIPTION

Sleeps incrementally by following the Fibonacci sequence : F(i) = F(i-1) + F(i-2) starting from 0,1. By default F(0) = 0, F(1) = 1, F(2) = 1, F(3) = 2

ATTRIBUTES

initial_term_index

  ro, Int, defaults to 0

Term number of the Fibonacci sequence to start at. Defaults to 0

multiplicator

  ro, Int, defaults to 1000

Number of milliseconds that will be multiplied by the fibonacci sequence term value. Defaults to 1000 ( 1 second )

max_retries_number

  ro, Int, defaults to 10

The number of times we should retry before giving up. If set to undef, never stop retrying

max_sleep_time

  ro, Int|Undef, defaults to undef

If Action::Retry is about to sleep more than this number ( in milliseconds ), stop retrying. If set to undef, never stop retrying

AUTHOR

Damien "dams" Krotkine

COPYRIGHT AND LICENSE

This software is copyright (c) 2013 by Damien "dams" Krotkine.

This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself.




Hosting generously
sponsored by Bytemark