time-to-botec/squiggle/node_modules/@stdlib/math/iter/sequences/fibonacci

iterFibonacciSeq

Create an iterator which generates a Fibonacci sequence.

The Fibonacci numbers are the integer sequence

The sequence is defined by the recurrence relation

with seed values F_0 = 0 and F_1 = 1.

Usage

var iterFibonacciSeq = require( '@stdlib/math/iter/sequences/fibonacci' );

iterFibonacciSeq( [options] )

Returns an iterator which generates a Fibonacci sequence.

var it = iterFibonacciSeq();
// returns <Object>

var v = it.next().value;
// returns 0

v = it.next().value;
// returns 1

v = it.next().value;
// returns 1

// ...

The returned iterator protocol-compliant object has the following properties:

• next: function which returns an iterator protocol-compliant object containing the next iterated value (if one exists) assigned to a value property and a done property having a boolean value indicating whether the iterator is finished.
• return: function which closes an iterator and returns a single (optional) argument in an iterator protocol-compliant object.

The function supports the following options:

• iter: number of iterations. Default: 79.

The returned iterator can only generate the first 79 Fibonacci numbers, as larger Fibonacci numbers cannot be safely represented in double-precision floating-point format. By default, the function returns an iterator which generates all 79 numbers. To limit the number of iterations, set the iter option.

var opts = {
    'iter': 2
};
var it = iterFibonacciSeq( opts );
// returns <Object>

var v = it.next().value;
// returns 0

v = it.next().value;
// returns 1

var bool = it.next().done;
// returns true

Notes

• If an environment supports Symbol.iterator, the returned iterator is iterable.

Examples

var iterFibonacciSeq = require( '@stdlib/math/iter/sequences/fibonacci' );

// Create an iterator:
var it = iterFibonacciSeq();

// Perform manual iteration...
var v;
while ( true ) {
    v = it.next();
    if ( v.done ) {
        break;
    }
    console.log( v.value );
}