utilArrayBinarySearch

Searches inside array for search_data by using the comparison function search_func. array must be sorted ascending.

As search_data is always passed as second argument to search_func it's not required that search_data has the same type as the array elements.

The complexity of this search function is O(log (num_elements)).

void*

(

void* array

const(void)* searchData = null

)

Parameters

array void*: the sorted input array
numElements uint: number of elements in the array
elementSize size_t: size of every element in bytes
searchFunc glib.types.CompareDataFunc: function to compare two elements, search_data will always be passed as second argument
mode gst.types.SearchMode: search mode that should be used
searchData const(void)*: element that should be found

Type: void*

The address of the found element or null if nothing was found

gst global functions