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

[fix] sort hash keys by value

Browse Source
This commit is contained in:
Al
2016-01-09 03:38:25 -05:00
parent 62017fd33d
commit 29930fa7b6
1 changed files with 5 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
src/collections.h
View File

@@ -5,6 +5,7 @@
#include <stdint.h> #include <stdint.h>
#include <stdbool.h> #include <stdbool.h>
#include "log/log.h"
#include "klib/khash.h" #include "klib/khash.h"
#include "klib/ksort.h" #include "klib/ksort.h"
#include "vector.h" #include "vector.h"
@@ -63,23 +64,17 @@ KSORT_INIT_STR
const key_type key; \ const key_type key; \
val_type value; \ val_type value; \
kh_foreach(h, key, value, { \ kh_foreach(h, key, value, { \
keys[i] = (key_type)key; \
values[i] = value; \ values[i] = value; \
i++; \ i++; \
}) \ }) \
\
size_t *sorted_indices = val_array_name##_argsort(values, n); \ size_t *sorted_indices = val_array_name##_argsort(values, n); \
key_type *sorted_keys = malloc(sizeof(key_type) * n); \ key_type *sorted_keys = malloc(sizeof(key_type) * n); \
\ \
if (!reversed) { \ for (i = 0; i < n; i++) { \
for (i = 0; i < n; i++) { \ size_t idx = !reversed ? sorted_indices[i] : sorted_indices[n - i - 1]; \
sorted_keys[i] = keys[sorted_indices[i]]; \ sorted_keys[i] = keys[idx]; \
} \
} else { \
for (i = n; i >= 0; i--) { \
sorted_keys[i] = keys[sorted_indices[i]]; \
} \
} \ } \
\
free(keys); \ free(keys); \
free(values); \ free(values); \
free(sorted_indices); \ free(sorted_indices); \