DIB Engine: introduction of bitmaplist structure
[wine/hacks.git] / include / msvcrt / search.h
blob16a0850eaf6b471ac079bad61c0bb574d3b95234
1 /*
2 * Heap definitions
4 * Copyright 2001 Francois Gouget.
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
20 #ifndef __WINE_SEARCH_H
21 #define __WINE_SEARCH_H
23 #include <crtdefs.h>
25 #ifdef __cplusplus
26 extern "C" {
27 #endif
29 void* __cdecl _lfind(const void*,const void*,unsigned int*,unsigned int,int (*)(const void*,const void*));
30 void* __cdecl _lsearch(const void*,void*,unsigned int*,unsigned int,int (*)(const void*,const void*));
31 void* __cdecl bsearch(const void*,const void*,size_t,size_t,int (*)(const void*,const void*));
32 void __cdecl qsort(void*,size_t,size_t,int (*)(const void*,const void*));
34 #ifdef __cplusplus
36 #endif
39 static inline void* lfind(const void* match, const void* start, unsigned int* array_size, unsigned int elem_size, int (*cf)(const void*,const void*)) { return _lfind(match, start, array_size, elem_size, cf); }
40 static inline void* lsearch(const void* match, void* start, unsigned int* array_size, unsigned int elem_size, int (*cf)(const void*,const void*) ) { return _lsearch(match, start, array_size, elem_size, cf); }
42 #endif /* __WINE_SEARCH_H */