Bisecting data topic

Quickly find a value in a sorted list.

Functions

bisectCenter<T>(List<T> list, T x, {int lo = 0, int? hi, num comparator(T, T) = ascending, num delta(T, T)?}) → int Bisecting data
Similar to bisectLeft, but returns the index of the value closest to x in the given listaccording to the specified delta function.
bisectCenter<T>(List<T> list, T x, {int lo = 0, int? hi, num comparator(T, T) = ascending, num delta(T, T)?}) → int Bisecting data
Similar to bisectLeft, but returns the index of the value closest to x in the given listaccording to the specified delta function.
bisectCenter<T>(List<T> list, T x, {int lo = 0, int? hi, num comparator(T, T) = ascending, num delta(T, T)?}) → int Bisecting data
Similar to bisectLeft, but returns the index of the value closest to x in the given listaccording to the specified delta function.
bisectLeft<T>(List<T> list, T x, {int lo = 0, int? hi, num comparator(T, T) = ascending}) → int Bisecting data
Returns the insertion point for x in list to maintain sorted order according to the specified comparator.
bisectLeft<T>(List<T> list, T x, {int lo = 0, int? hi, num comparator(T, T) = ascending}) → int Bisecting data
Returns the insertion point for x in list to maintain sorted order according to the specified comparator.
bisectLeft<T>(List<T> list, T x, {int lo = 0, int? hi, num comparator(T, T) = ascending}) → int Bisecting data
Returns the insertion point for x in list to maintain sorted order according to the specified comparator.
bisectRight<T>(List<T> list, T x, {int lo = 0, int? hi, num comparator(T, T) = ascending}) → int Bisecting data
Similar to bisectLeft, but returns an insertion point which comes after (to the right of) any existing entries of x in list.
bisectRight<T>(List<T> list, T x, {int lo = 0, int? hi, num comparator(T, T) = ascending}) → int Bisecting data
Similar to bisectLeft, but returns an insertion point which comes after (to the right of) any existing entries of x in list.
bisectRight<T>(List<T> list, T x, {int lo = 0, int? hi, num comparator(T, T) = ascending}) → int Bisecting data
Similar to bisectLeft, but returns an insertion point which comes after (to the right of) any existing entries of x in list.