Mercurial > repos > blastem
comparison tern.h @ 2207:de3d20e58555
Mostly fix label sorting post-refactor
author | Michael Pavone <pavone@retrodev.com> |
---|---|
date | Sat, 27 Aug 2022 17:35:28 -0700 |
parents | 63659fb92db4 |
children |
comparison
equal
deleted
inserted
replaced
2206:4c265d2f6c88 | 2207:de3d20e58555 |
---|---|
51 tern_node * tern_insert_node(tern_node *head, char const *key, tern_node *value); | 51 tern_node * tern_insert_node(tern_node *head, char const *key, tern_node *value); |
52 tern_node *tern_insert_path(tern_node *head, char const *key, tern_val val, uint8_t valtype); | 52 tern_node *tern_insert_path(tern_node *head, char const *key, tern_val val, uint8_t valtype); |
53 uint32_t tern_count(tern_node *head); | 53 uint32_t tern_count(tern_node *head); |
54 void tern_foreach(tern_node *head, iter_fun fun, void *data); | 54 void tern_foreach(tern_node *head, iter_fun fun, void *data); |
55 char * tern_int_key(uint32_t key, char * buf); | 55 char * tern_int_key(uint32_t key, char * buf); |
56 char * tern_sortable_int_key(uint32_t key, char * buf); | |
56 void tern_free(tern_node *head); | 57 void tern_free(tern_node *head); |
57 | 58 |
58 #endif //TERN_H_ | 59 #endif //TERN_H_ |