BinarySearch | plannerjs - v0.4.1

Util class with binary search procedures Assumes that array is in ascending order according to predicate

Type parameters

T

Hierarchy

BinarySearch

Index

Constructors

constructor

Methods

Constructors

constructor

new BinarySearch(array: T[], predicate: function): BinarySearch

- Defined in src/util/BinarySearch.ts:7
Parameters
- array: T[]
- predicate: function
  - - (item: T): number
    - Parameters
      - item: T
      Returns number
Returns BinarySearch

Methods

findFirstIndex

findFirstIndex(key: number, start?: number, end?: number): number

- Defined in src/util/BinarySearch.ts:18
Find the first index of the given key, or the index before which that key would be hypothetically spliced in Adapted from: https://algorithmsandme.com/first-occurrence-of-element/

Parameters
- key: number
- Default value start: number = 0
- Default value end: number = (this.array.length - 1)
Returns number

findLastIndex

findLastIndex(key: number, start?: number, end?: number): number

- Defined in src/util/BinarySearch.ts:37
Find the last index of the given key, or the index after which that key would be hypothetically spliced in Adapted from: https://www.algorithmsandme.com/last-occurrence-of-element-with-binary-search/

Parameters
- key: number
- Default value start: number = 0
- Default value end: number = (this.array.length - 1)
Returns number

Generated using TypeDoc