// SPDX-License-Identifier: GPL-2.0-only /* * A generic implementation of binary search for the Linux kernel * * Copyright ( C ) 2008 - 2009 Ksplice , Inc . * Author : Tim Abbott < tabbott @ ksplice . com > #include <linux/export.h>#include <linux/bsearch.h>#include <linux/kprobes.h>/* * bsearch - binary search an array of elements * @ key : pointer to item being searched for * @ base : pointer to first element to search * @ num : number of elements * @ size : size of each element * @ cmp : pointer to comparison function * * This function does a binary search on the given array . The * contents of the array should already be in ascending sorted order * under the provided comparison function . * * Note that the key need not have the same type as the elements in * the array , e . g . key could be a string and the comparison function * could compare the string with the struct ' s name field . However , if * the key and elements in the array are of the same type , you can use * the same comparison function for both sort ( ) and bsearch ( ) . void *bsearch(const void *key, const void *base, size_t num, size_t size, cmp_func_t cmp)return __inline_bsearch(key, base, num, size, cmp);
Messung V0.5 in Prozent C=93 H=100 G=96
¤ Dauer der Verarbeitung: 0.9 Sekunden
(vorverarbeitet am 2026-09-27)
¤ *© Formatika GbR, Deutschland
