aboutsummaryrefslogtreecommitdiffstats
path: root/src/list.h
diff options
context:
space:
mode:
authorWarren Dukes <warren.dukes@gmail.com>2004-11-15 19:29:20 +0000
committerWarren Dukes <warren.dukes@gmail.com>2004-11-15 19:29:20 +0000
commitb00555667522f812440572016f3c1237941a63b2 (patch)
tree59e5acb5ab6c27bf2807d57d36ea53b7c5409b21 /src/list.h
parentf3e8d59d5c584f5925a8b23919aaa5b5c954cf85 (diff)
downloadmpd-b00555667522f812440572016f3c1237941a63b2.tar.gz
mpd-b00555667522f812440572016f3c1237941a63b2.tar.xz
mpd-b00555667522f812440572016f3c1237941a63b2.zip
this shit really needs to be cleaned up, but its good enough for testing,
intelligently use memmove, when inserting nodes in a sorted list git-svn-id: https://svn.musicpd.org/mpd/trunk@2677 09075e82-0dd4-0310-85a5-a0d7c8717e4f
Diffstat (limited to 'src/list.h')
-rw-r--r--src/list.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/list.h b/src/list.h
index 9a2a07484..ed54a3b02 100644
--- a/src/list.h
+++ b/src/list.h
@@ -74,7 +74,7 @@ List * makeList(ListFreeDataFunc * freeDataFunc, int strdupKeys);
ListNode * insertInList(List * list,char * key,void * data);
ListNode * insertInListBeforeNode(List * list, ListNode * beforeNode,
- char * key, void * data);
+ int pos, char * key, void * data);
int insertInListWithoutKey(List * list,void * data);
@@ -99,7 +99,7 @@ int findInList(List * list, char * key, void ** data);
/* if _key_ is not found, *_node_ is assigned to the node before which
the info would be found */
-int findNodeInList(List * list, char * key, ListNode ** node);
+int findNodeInList(List * list, char * key, ListNode ** node, int * pos);
/* frees memory malloc'd for list and its nodes
* _list_ -> List to be free'd