@jiminp/tooltool
    Preparing search index...

    Module data-structure

    Classes

    Deque

    A double-ended queue with amortized O(1) insertion and removal at both ends.

    Variables

    bisect

    Alias for bisectRight.

    Functions

    arrayGetOrExtend

    Gets the element at the given index, extending with shallow copies if out of bounds.

    arrayGetOrExtendWith

    Gets the element at the given index, extending via a factory function if out of bounds.

    bisectLeft

    Finds the leftmost insertion point for target in a sorted array.

    bisectRight

    Finds the rightmost insertion point for target in a sorted array.

    multimapAdd

    Adds a value to the array for a key in a Map-backed multimap.

    partition

    Partitions an array into two arrays based on a predicate.

    partitionToMultimap

    Groups an array into a Map-based multimap using a key extractor.

    recordAccess

    Accesses a nested record at the given path, returning a value and setter.

    recursiveMerge

    Recursively merges a patch into a base object (deep merge).