Class SeekableIterator<T>

Wraps iterator to allow for seeking backwards and forwards. An internal cache of length maxLength is kept and progressively added to when iterating forwards.

Type Parameters

  • T

Implements

  • IterableIterator<T>

Constructors

constructor

Properties

cache i iterator iteratorDone maxLength

Accessors

done elements

Methods

[iterator] add next peek seek

Constructors

constructor

Properties

Protected cache

cache: T[] = []

Protected i

i: number = 0

Protected iterator

iterator: Iterator<T, any, undefined>

Protected iteratorDone

iteratorDone: boolean = false

Protected maxLength

maxLength: number = Infinity

Accessors

done

elements

Methods

[iterator]

Private add

next

  • next(...args): IteratorResult<T, any>

  • Parameters

    • Rest ...args: any[]

    Returns IteratorResult<T, any>

peek

  • peek<N>(ahead?): Tuple<T, N>

  • Peek ahead of where the current iteration is. This doesn't consume any values of the iterator.

    Type Parameters

    • N extends number = 1

    Parameters

    • ahead: N = ...

      optional, the number of elements to peek ahead.

    Returns Tuple<T, N>

seek

  • seek(i): void

  • Seeks forward/backwards to the index i. i may be any positive or negative number. Negative numbers seek starting from the end of the internal cache (e.g. -1 is the last element).

    Parameters

    • i: number

    Returns void

Settings

Member Visibility

Theme

On This Page

constructorcacheiiteratoriteratorDonemaxLengthdoneelements[iterator]addnextpeekseek