2022-02-11 09:07:11 +11:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
|
|
|
* Copyright 2013 Blender Foundation. All rights reserved. */
|
2013-09-05 22:24:12 +00:00
|
|
|
|
2019-02-18 08:08:12 +11:00
|
|
|
/** \file
|
|
|
|
|
* \ingroup bli
|
2013-09-05 22:24:12 +00:00
|
|
|
*
|
|
|
|
|
* Utility functions for sorting common types.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include "BLI_sort_utils.h" /* own include */
|
|
|
|
|
|
|
|
|
|
struct SortAnyByFloat {
|
|
|
|
|
float sort_value;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
struct SortAnyByInt {
|
|
|
|
|
int sort_value;
|
|
|
|
|
};
|
|
|
|
|
|
2018-03-31 19:25:27 +02:00
|
|
|
struct SortAnyByPtr {
|
|
|
|
|
const void *sort_value;
|
|
|
|
|
};
|
|
|
|
|
|
2013-09-05 22:24:12 +00:00
|
|
|
int BLI_sortutil_cmp_float(const void *a_, const void *b_)
|
|
|
|
|
{
|
|
|
|
|
const struct SortAnyByFloat *a = a_;
|
|
|
|
|
const struct SortAnyByFloat *b = b_;
|
2019-03-27 13:16:10 +11:00
|
|
|
if (a->sort_value > b->sort_value) {
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
2020-08-07 11:23:02 +02:00
|
|
|
if (a->sort_value < b->sort_value) {
|
2019-03-27 13:16:10 +11:00
|
|
|
return -1;
|
|
|
|
|
}
|
2020-08-07 11:23:02 +02:00
|
|
|
|
|
|
|
|
return 0;
|
2013-09-05 22:24:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int BLI_sortutil_cmp_float_reverse(const void *a_, const void *b_)
|
|
|
|
|
{
|
|
|
|
|
const struct SortAnyByFloat *a = a_;
|
|
|
|
|
const struct SortAnyByFloat *b = b_;
|
2019-03-27 13:16:10 +11:00
|
|
|
if (a->sort_value < b->sort_value) {
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
2020-08-07 11:23:02 +02:00
|
|
|
if (a->sort_value > b->sort_value) {
|
2019-03-27 13:16:10 +11:00
|
|
|
return -1;
|
|
|
|
|
}
|
2020-08-07 11:23:02 +02:00
|
|
|
|
|
|
|
|
return 0;
|
2013-09-05 22:24:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int BLI_sortutil_cmp_int(const void *a_, const void *b_)
|
|
|
|
|
{
|
|
|
|
|
const struct SortAnyByInt *a = a_;
|
|
|
|
|
const struct SortAnyByInt *b = b_;
|
2019-03-27 13:16:10 +11:00
|
|
|
if (a->sort_value > b->sort_value) {
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
2020-08-07 11:23:02 +02:00
|
|
|
if (a->sort_value < b->sort_value) {
|
2019-03-27 13:16:10 +11:00
|
|
|
return -1;
|
|
|
|
|
}
|
2020-08-07 11:23:02 +02:00
|
|
|
|
|
|
|
|
return 0;
|
2013-09-05 22:24:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int BLI_sortutil_cmp_int_reverse(const void *a_, const void *b_)
|
|
|
|
|
{
|
|
|
|
|
const struct SortAnyByInt *a = a_;
|
|
|
|
|
const struct SortAnyByInt *b = b_;
|
2019-03-27 13:16:10 +11:00
|
|
|
if (a->sort_value < b->sort_value) {
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
2020-08-07 11:23:02 +02:00
|
|
|
if (a->sort_value > b->sort_value) {
|
2019-03-27 13:16:10 +11:00
|
|
|
return -1;
|
|
|
|
|
}
|
2020-08-07 11:23:02 +02:00
|
|
|
|
|
|
|
|
return 0;
|
2013-09-05 22:24:12 +00:00
|
|
|
}
|
2018-03-31 19:25:27 +02:00
|
|
|
|
|
|
|
|
int BLI_sortutil_cmp_ptr(const void *a_, const void *b_)
|
|
|
|
|
{
|
|
|
|
|
const struct SortAnyByPtr *a = a_;
|
|
|
|
|
const struct SortAnyByPtr *b = b_;
|
2019-03-27 13:16:10 +11:00
|
|
|
if (a->sort_value > b->sort_value) {
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
2020-08-07 11:23:02 +02:00
|
|
|
if (a->sort_value < b->sort_value) {
|
2019-03-27 13:16:10 +11:00
|
|
|
return -1;
|
|
|
|
|
}
|
2020-08-07 11:23:02 +02:00
|
|
|
|
|
|
|
|
return 0;
|
2018-03-31 19:25:27 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int BLI_sortutil_cmp_ptr_reverse(const void *a_, const void *b_)
|
|
|
|
|
{
|
|
|
|
|
const struct SortAnyByPtr *a = a_;
|
|
|
|
|
const struct SortAnyByPtr *b = b_;
|
2019-03-27 13:16:10 +11:00
|
|
|
if (a->sort_value < b->sort_value) {
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
2020-08-07 11:23:02 +02:00
|
|
|
if (a->sort_value > b->sort_value) {
|
2019-03-27 13:16:10 +11:00
|
|
|
return -1;
|
|
|
|
|
}
|
2020-08-07 11:23:02 +02:00
|
|
|
|
|
|
|
|
return 0;
|
2018-03-31 19:25:27 +02:00
|
|
|
}
|