1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
|
/*
Copyright (C) 2024 Abe Tomoaki <abe@clear-code.com>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "grn.h"
#include "grn_portability.h"
#include <algorithm>
extern "C" {
/* todo: Implement the general grn_qsort_r() that takes `base` as `void *`. */
void
grn_qsort_r_grn_id(grn_id *base,
size_t n_members,
int (*compare)(const grn_id id1,
const grn_id id2,
void *arg),
void *arg)
{
std::sort(base,
base + n_members,
[&compare, &arg](const grn_id id1, const grn_id id2) {
return compare(id1, id2, arg) < 0;
});
}
}
|
