mirror of
https://git.code.sf.net/p/quake/quakeforge
synced 2024-11-29 23:52:22 +00:00
bcc5686606
Fuzzy bsearch is useful for finding an entry in a prefix sum array (value is >= ele[0], < ele[1]), and the reentrant version is good when data needs to be passed to the compare function. Adapted from the code used in pr_resolve.
41 lines
1.1 KiB
C
41 lines
1.1 KiB
C
/*
|
|
quicksort.h
|
|
|
|
Reentrant qsort for systems that don't have it
|
|
|
|
Copyright (C) 2021 Bill Currie <bill@taniwha.org>
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public License
|
|
as published by the Free Software Foundation; either version 2
|
|
of the License, or (at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
See the GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to:
|
|
|
|
Free Software Foundation, Inc.
|
|
59 Temple Place - Suite 330
|
|
Boston, MA 02111-1307, USA
|
|
|
|
*/
|
|
|
|
#ifndef quicksort_h
|
|
#define quicksort_h
|
|
|
|
#include <sys/types.h>
|
|
|
|
#ifndef __compar_d_fn_t_defined
|
|
#define __compar_d_fn_t_defined
|
|
typedef int (*__compar_d_fn_t)(const void *, const void *, void *);
|
|
#endif
|
|
|
|
void _quicksort(void *base, size_t nmemb, size_t size, __compar_d_fn_t cmp,
|
|
void *arg);
|
|
|
|
#endif// quicksort_h
|