From 65a19ed366d823479f14029a473c641dd06b13a1 Mon Sep 17 00:00:00 2001
From: Peter Wehrfritz <peter.wehrfritz@web.de>
Date: Wed, 25 Jul 2007 09:04:28 +0000
Subject: [PATCH] doxy

SVN revision: 30967
---
 legacy/ecore/src/lib/ecore/ecore_list.c | 20 ++++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

diff --git a/legacy/ecore/src/lib/ecore/ecore_list.c b/legacy/ecore/src/lib/ecore/ecore_list.c
index 8b4ce955a5..3baf139931 100644
--- a/legacy/ecore/src/lib/ecore/ecore_list.c
+++ b/legacy/ecore/src/lib/ecore/ecore_list.c
@@ -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