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

Update

Browse Source
This commit is contained in:
lifegpc
2022-01-09 18:03:02 +08:00
parent 0a9e149e66
commit 78a3e890d2
6 changed files with 228 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

99
linked_list.h
View File

@@ -110,6 +110,49 @@ size_t linked_list_count(struct LinkedList<T>* list) {
return c;
}
template <typename T>
bool linked_list_delete(struct LinkedList<T>*& list, T data) {
if (!list) return false;
struct LinkedList<T>* t = list;
while (t->prev) {
t = t->prev;
}
if (t->d == data) {
if (t->prev) t->prev->next = t->next;
if (t->next) t->next->prev = t->prev;
if (t == list) {
if (t->prev) {
list = t->prev;
} else if (t->next) {
list = t->next;
} else {
list = nullptr;
}
}
free(t);
return true;
}
while (t->next) {
t = t->next;
if (t->d == data) {
if (t->prev) t->prev->next = t->next;
if (t->next) t->next->prev = t->prev;
if (t == list) {
if (t->prev) {
list = t->prev;
} else if (t->next) {
list = t->next;
} else {
list = nullptr;
}
}
free(t);
return true;
}
}
return false;
}
template <typename T>
void linked_list_free_tail(struct LinkedList<T>*& list, void(*free_func)(T) = nullptr) {
if (!list) return;
@@ -125,6 +168,50 @@ void linked_list_free_tail(struct LinkedList<T>*& list, void(*free_func)(T) = nu
}
}
template <typename T, typename D>
struct LinkedList<T>* linked_list_get(struct LinkedList<T>* list, D data, bool(*compare_func)(T, D)) {
if (!list || !compare_func) return nullptr;
struct LinkedList<T>* t = list;
while (t->prev) {
t = t->prev;
}
if (compare_func(t->d, data)) return t;
while (t->next) {
t = t->next;
if (compare_func(t->d, data)) return t;
}
return nullptr;
}
template <typename T>
struct LinkedList<T>* linked_list_get(struct LinkedList<T>* list, size_t index) {
if (!list) return nullptr;
struct LinkedList<T>* t = list;
while (t->prev) {
t = t->prev;
}
size_t n = 0;
if (index == n) return t;
while (t->next) {
t = t->next;
n++;
if (index == n) return t;
}
return nullptr;
}
template <typename T>
bool linked_list_have(struct LinkedList<T>* list, T data) {
if (!list) return false;
struct LinkedList<T>* t = list;
if (t->d == data) return true;
while (t->next) {
t = t->next;
if (t->d == data) return true;
}
return false;
}
template <typename T, typename ... Args>
bool linked_list_have(struct LinkedList<T>* list, T data, bool(*compare_func)(T, T, Args...), Args... args) {
if (!list || !compare_func) return false;
@@ -137,6 +224,18 @@ bool linked_list_have(struct LinkedList<T>* list, T data, bool(*compare_func)(T,
return false;
}
template <typename T, typename D, typename ... Args>
bool linked_list_have(struct LinkedList<T>* list, D data, bool(*compare_func)(T, D, Args...), Args... args) {
if (!list || !compare_func) return false;
struct LinkedList<T>* t = list;
if (compare_func(t->d, data, args...)) return true;
while (t->next) {
t = t->next;
if (compare_func(t->d, data, args...)) return true;
}
return false;
}
template <typename T>
void linked_list_remove(struct LinkedList<T>*& node, void(*free_func)(T) = nullptr) {
if (!node) return;