59 lines
1.3 KiB
C
59 lines
1.3 KiB
C
/**
|
|
* @file lv_utils.h
|
|
*
|
|
*/
|
|
|
|
#ifndef LV_UTILS_H
|
|
#define LV_UTILS_H
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
/*********************
|
|
* INCLUDES
|
|
*********************/
|
|
#include <stdint.h>
|
|
|
|
/*********************
|
|
* DEFINES
|
|
*********************/
|
|
|
|
/**********************
|
|
* TYPEDEFS
|
|
**********************/
|
|
|
|
/**********************
|
|
* GLOBAL PROTOTYPES
|
|
**********************/
|
|
|
|
/** Searches base[0] to base[n - 1] for an item that matches *key.
|
|
*
|
|
* @note The function cmp must return negative if it's first
|
|
* argument (the search key) is less that it's second (a table entry),
|
|
* zero if equal, and positive if greater.
|
|
*
|
|
* @note Items in the array must be in ascending order.
|
|
*
|
|
* @param key Pointer to item being searched for
|
|
* @param base Pointer to first element to search
|
|
* @param n Number of elements
|
|
* @param size Size of each element
|
|
* @param cmp Pointer to comparison function (see #unicode_list_compare as a comparison function
|
|
* example)
|
|
*
|
|
* @return a pointer to a matching item, or NULL if none exists.
|
|
*/
|
|
void * _lv_utils_bsearch(const void * key, const void * base, uint32_t n, uint32_t size,
|
|
int32_t (*cmp)(const void * pRef, const void * pElement));
|
|
|
|
/**********************
|
|
* MACROS
|
|
**********************/
|
|
|
|
#ifdef __cplusplus
|
|
} /*extern "C"*/
|
|
#endif
|
|
|
|
#endif
|