/**
 * Performs a binary search on the provided sorted list and returns the index of the item if found. If it can't be found it'll return -1.
 * https://github.com/darkskyapp/binary-search
 */
export function binarySearch(haystack: any[], needle: any, opt_comparator?: () => void): number;
export function equals(arr1: any[] | Uint8ClampedArray, arr2: any[] | Uint8ClampedArray): boolean;
export function extend<VALUE>(arr: VALUE[], data: VALUE[] | VALUE): void;
export function find<VALUE>(arr: VALUE[], func: (p0: VALUE, p1: number, p2: any) => boolean): VALUE | null;
export function findIndex(arr: any[], func: () => void): number;
/**
 * Whether the array contains the given object.
 */
export function includes(arr: any[], obj: any): boolean;
export function isSorted(arr: any[], opt_func?: () => void, opt_strict?: boolean): boolean;
export function linearFindNearest(arr: number[], target: number, direction: number): number;
/**
 * Compare function for array sort that is safe for numbers.
 */
export function numberSafeCompareFunction(a: any, b: any): number;
export function remove<VALUE>(arr: VALUE[], obj: VALUE): boolean;
export function reverseSubArray(arr: any[], begin: number, end: number): void;
/**
 * Sort the passed array such that the relative order of equal elements is preverved.
 * See https://en.wikipedia.org/wiki/Sorting_algorithm#Stability for details.
 */
export function stableSort(arr: any[], compareFnc: (p0: any, p1: any) => number): void;