lifegpc/c-utils
1
0
Fork 0
mirror of https://github.com/lifegpc/c-utils.git synced 2026-06-06 05:08:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update

Browse Source
This commit is contained in:
lifegpc
2022-01-14 17:58:41 +08:00
parent fc9a3faa56
commit 4468799a86
2 changed files with 37 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
dict.h
View File

@@ -54,6 +54,18 @@ void dict_iter(struct Dict<K, V>* d, void(*callback)(K key, V value, Args... arg
callback(t->d.key, t->d.value, args...); callback(t->d.key, t->d.value, args...);
} }
} }
template <typename K, typename V, typename ... Args>
void dict_iter(struct Dict<K, V>* d, void(*callback)(size_t index, K key, V value, Args... args), Args... args) {
if (!d || !callback) return;
struct Dict<K, V>* t = d;
size_t i = 0;
callback(i, t->d.key, t->d.value, args...);
while (t->next) {
t = t->next;
i++;
callback(i, t->d.key, t->d.value, args...);
}
}
template <typename K, typename V> template <typename K, typename V>
bool dict_set(struct Dict<K, V>*& d, K key, V value, void(*free_func)(V) = nullptr) { bool dict_set(struct Dict<K, V>*& d, K key, V value, void(*free_func)(V) = nullptr) {
if (!d) { if (!d) {

25
linked_list.h
View File

@@ -259,6 +259,31 @@ void linked_list_iter(struct LinkedList<T>* list, void(*callback)(size_t index,
} }
} }
template <typename T, typename ... Args>
void linked_list_iter(struct LinkedList<T>* list, void(*callback)(T data, Args... args), Args... args) {
if (!list || !callback) return;
struct LinkedList<T>* t = list;
callback(t->d, args...);
while (t->next) {
t = t->next;
callback(t->d, args...);
}
}
template <typename T, typename D, typename ... Args>
D linked_list_iter(struct LinkedList<T>* list, D(*callback)(T data, Args... args), D failed, Args... args) {
if (!list || !callback) return failed;
struct LinkedList<T>* t = list;
D re = callback(t->d, args...);
if (re == failed) return re;
while (t->next) {
t = t->next;
re = callback(t->d, args...);
if (re == failed) return re;
}
return re;
}
template <typename T> template <typename T>
void linked_list_remove(struct LinkedList<T>*& node, void(*free_func)(T) = nullptr) { void linked_list_remove(struct LinkedList<T>*& node, void(*free_func)(T) = nullptr) {
if (!node) return; if (!node) return;