tommy/libpostal
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

[utils] Adding hash sort by values for numeric types

Browse Source
This commit is contained in:
Al
2016-01-05 14:37:38 -05:00
parent 6ef7c90278
commit a740417cab
1 changed files with 41 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

41
src/collections.h
View File

@@ -3,6 +3,7 @@
#include <stdlib.h> #include <stdlib.h>
#include <stdint.h> #include <stdint.h>
#include <stdbool.h>
#include "klib/khash.h" #include "klib/khash.h"
#include "klib/ksort.h" #include "klib/ksort.h"
@@ -46,6 +47,46 @@ VECTOR_INIT(char_array, char)
VECTOR_INIT(uchar_array, unsigned char) VECTOR_INIT(uchar_array, unsigned char)
VECTOR_INIT(string_array, char *) VECTOR_INIT(string_array, char *)
// Sorts
KSORT_INIT_STR KSORT_INIT_STR
// Sort by value (must be defined after the vectors)
#define KHASH_SORT_BY_VALUE(name, key_type, val_type, val_array_name) \
key_type *name##_hash_sort_keys_by_value(khash_t(name) *h, bool reversed) { \
size_t n = kh_size(h); \
key_type *keys = malloc(sizeof(key_type) * n); \
val_type *values = malloc(sizeof(val_type) * n); \
\
size_t i = 0; \
const key_type key; \
val_type value; \
kh_foreach(h, key, value, { \
values[i] = value; \
i++; \
}) \
\
size_t *sorted_indices = val_array_name##_argsort(values, n); \
key_type *sorted_keys = malloc(sizeof(key_type) * n); \
\
if (!reversed) { \
for (i = 0; i < n; i++) { \
sorted_keys[i] = keys[sorted_indices[i]]; \
} \
} else { \
for (i = n; i >= 0; i--) { \
sorted_keys[i] = keys[sorted_indices[i]]; \
} \
} \
\
free(keys); \
free(values); \
free(sorted_indices); \
return sorted_keys; \
}
KHASH_SORT_BY_VALUE(str_uint32, char *, uint32_t, uint32_array)
KHASH_SORT_BY_VALUE(str_double, char *, double, double_array)
#endif #endif