enlightenment/efl
enlightenment
/
efl
8
7
Fork 14
Code Issues 13 Pull Requests 3 Projects Releases Wiki Activity

doxy 

SVN revision: 30967
This commit is contained in:
Peter Wehrfritz 2007-07-25 09:04:28 +00:00
parent eda1f13b33
commit 65a19ed366
1 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
legacy/ecore/src/lib/ecore/ecore_list.c
View File

@ -1135,8 +1135,8 @@ _ecore_list_find(Ecore_List *list, Ecore_Compare_Cb function, const void *user_d
* Sort data in @p list using the compare function @p compare
* @param list The list.
* @param compare The function to compare the data of @p list
* @param order The sort direction
*
* @param order The sort direction, possible values are ECORE_SORT_MIN and
* ECORE_SORT_MAX
* @return true on success
*
* This is a wrapper function for mergesort and heapsort. It
@ -1162,8 +1162,8 @@ ecore_list_sort(Ecore_List *list, Ecore_Compare_Cb compare, char order)
* Sort data in @p list using the compare function @p compare
* @param list The list.
* @param compare The function to compare the data of @p list
* @param order The sort direction
*
* @param order The sort direction, possible values are ECORE_SORT_MIN and
* ECORE_SORT_MAX
* @return true on success
*
* Mergesort is a stable, in-place sorting algorithm
@ -1288,8 +1288,8 @@ _ecore_list_node_merge(Ecore_List_Node *first, Ecore_List_Node *second,
* Sort data in @p list using the compare function @p compare
* @param list The list.
* @param compare The function to compare the data of @p list
* @param order The sort direction
*
* @param order The sort direction, possible values are ECORE_SORT_MIN and
* ECORE_SORT_MAX
* @return true on success
*
* Heapsort is a unstable sorting algorithm, it needs to allocate extra memomry,
@ -1990,8 +1990,8 @@ ecore_dlist_clear(Ecore_DList *list)
* Sort data in @p list using the compare function @p compare
* @param list The list.
* @param compare The function to compare the data of @p list
* @param order The sort direction
*
* @param order The sort direction, possible values are ECORE_SORT_MIN and
* ECORE_SORT_MAX
* @return true on success
*
* This is a wrapper function for mergesort and heapsort. It
@ -2017,8 +2017,8 @@ ecore_dlist_sort(Ecore_List *list, Ecore_Compare_Cb compare, char order)
* Sort data in @p list using the compare function @p compare
* @param list The list.
* @param compare The function to compare the data of @p list
* @param order The sort direction
*
* @param order The sort direction, possible values are ECORE_SORT_MIN and
* ECORE_SORT_MAX
* @return true on success
*
* Mergesort is a stable, in-place sorting algorithm