UNPKG

antlr4ts

Version:

ANTLR 4 runtime for JavaScript written in Typescript

19 lines (18 loc) 1.2 kB
/*! * Copyright 2016 The ANTLR Project. All rights reserved. * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information. */ export declare namespace Arrays { /** * Searches the specified array of numbers for the specified value using the binary search algorithm. The array must * be sorted prior to making this call. If it is not sorted, the results are unspecified. If the array contains * multiple elements with the specified value, there is no guarantee which one will be found. * * @returns index of the search key, if it is contained in the array; otherwise, (-(insertion point) - 1). The * insertion point is defined as the point at which the key would be inserted into the array: the index of the first * element greater than the key, or array.length if all elements in the array are less than the specified key. Note * that this guarantees that the return value will be >= 0 if and only if the key is found. */ function binarySearch(array: ArrayLike<number>, key: number, fromIndex?: number, toIndex?: number): number; function toString<T>(array: Iterable<T>): string; }