iterNegaFibonacciSeq

Create an iterator which generates a negaFibonacci sequence.

The negaFibonacci numbers are the integer sequence

0 comma 1 comma negative 1 comma 2 comma negative 3 comma 5 comma negative 8 comma 13 comma negative 21 comma 34 comma negative 55 comma 89 comma negative 144 comma ellipsis

The sequence is defined by the recurrence relation

upper F Subscript n minus 2 Baseline equals upper F Subscript n Baseline minus upper F Subscript n minus 1

which yields

upper F Subscript negative n Baseline equals left-parenthesis negative 1 right-parenthesis Superscript n plus 1 Baseline upper F Subscript n

with seed values F_0 = 0 and F_{-1} = 1.

Usage

var iterNegaFibonacciSeq = require( '@stdlib/math/iter/sequences/negafibonacci' );

iterNegaFibonacciSeq( [options] )

Returns an iterator which generates a negaFibonacci sequence.

var it = iterNegaFibonacciSeq();
// 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 negaFibonacci 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 = iterNegaFibonacciSeq( 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 iterNegaFibonacciSeq = require( '@stdlib/math/iter/sequences/negafibonacci' );

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

// Perform manual iteration...
var v;
while ( true ) {
    v = it.next();
    if ( v.done ) {
        break;
    }
    console.log( v.value );
}
Did you find this page helpful?