summaryrefslogtreecommitdiff
path: root/legacy/eina
diff options
context:
space:
mode:
authorDaniel Juyung Seo <seojuyung2@gmail.com>2011-06-11 09:16:45 +0000
committerDaniel Juyung Seo <seojuyung2@gmail.com>2011-06-11 09:16:45 +0000
commitbb41b4530ae3eec024b462c48fbf3791d1682f56 (patch)
tree3317ecdb1041d18568f1b4bef0955e162219e864 /legacy/eina
parentcf92b358ae0685cfbffb071dd5376f59f8b38469 (diff)
eina: Fixed doxygen.
SVN revision: 60228
Diffstat (limited to 'legacy/eina')
-rw-r--r--legacy/eina/src/include/eina_list.h10
1 files changed, 5 insertions, 5 deletions
diff --git a/legacy/eina/src/include/eina_list.h b/legacy/eina/src/include/eina_list.h
index 8df3dfc7fb..dc527facfd 100644
--- a/legacy/eina/src/include/eina_list.h
+++ b/legacy/eina/src/include/eina_list.h
@@ -48,7 +48,7 @@
48 * @image rtf eina_list_example_01_a.png 48 * @image rtf eina_list_example_01_a.png
49 * @image latex eina_list_example_01_a.eps 49 * @image latex eina_list_example_01_a.eps
50 * @until roslin 50 * @until roslin
51 * There a couple of interesting things happening here, first is that we are 51 * There are a couple of interesting things happening here, first is that we are
52 * passing a NULL pointer to the first @ref eina_list_append() call, when this 52 * passing a NULL pointer to the first @ref eina_list_append() call, when this
53 * is done a list is created. The other @b very important detail to notice is 53 * is done a list is created. The other @b very important detail to notice is
54 * that the return value is attributed to the @a list variable, this needs to 54 * that the return value is attributed to the @a list variable, this needs to
@@ -116,8 +116,8 @@
116 * be added with @ref eina_list_sorted_insert(): 116 * be added with @ref eina_list_sorted_insert():
117 * @until sorted_insert 117 * @until sorted_insert
118 * 118 *
119 * A noteworthy use case is adding a element to a list only if doesn't exist 119 * A noteworthy use case is adding an element to a list only if it doesn't exist
120 * already, this can accomplished by searching for the element that is closests 120 * already, this can accomplished by searching for the element that is closest
121 * to what is being added, and if that doesn't match add: 121 * to what is being added, and if that doesn't match add:
122 * @until append 122 * @until append
123 * @note @ref eina_list_search_sorted_near_list() will tell you not only the 123 * @note @ref eina_list_search_sorted_near_list() will tell you not only the
@@ -165,7 +165,7 @@
165 * Removing elements from a list can be done with ease: 165 * Removing elements from a list can be done with ease:
166 * @until sagitarius 166 * @until sagitarius
167 * 167 *
168 * To replace a element in the list it is not nescessary to remove it and then 168 * To replace an element in the list it is not nescessary to remove it and then
169 * add with the new value, it is possible to just change the value of a node: 169 * add with the new value, it is possible to just change the value of a node:
170 * @until aquarius 170 * @until aquarius
171 * 171 *
@@ -798,7 +798,7 @@ EAPI Eina_List *eina_list_reverse_clone(const Eina_List *list) EINA_W
798 798
799 799
800/** 800/**
801 * @brief Clone (copy) all the elements in the list in exact order. 801 * @brief Clone (copy) all the elements in the list in exactly same order.
802 * 802 *
803 * @param list The list to clone. 803 * @param list The list to clone.
804 * @return The new list that has been cloned. 804 * @return The new list that has been cloned.