summaryrefslogtreecommitdiff
path: root/src/lib/eina
diff options
context:
space:
mode:
authorJihoon Kim <jihoon48.kim@samsung.com>2015-04-13 19:11:13 +0900
committerJihoon Kim <jihoon48.kim@samsung.com>2015-04-13 19:12:28 +0900
commit0d4f4721ea1bc18a73b6647eb0eb24f3f09fa61d (patch)
tree24130e601e37af72a42cee7bd4c63e231fac74fa /src/lib/eina
parenta14f97a06e7fae8b3dde4e2e588a575eb13327f4 (diff)
eina: fix typos in doxygen
Diffstat (limited to 'src/lib/eina')
-rw-r--r--src/lib/eina/eina_inlist.h6
-rw-r--r--src/lib/eina/eina_list.h14
2 files changed, 10 insertions, 10 deletions
diff --git a/src/lib/eina/eina_inlist.h b/src/lib/eina/eina_inlist.h
index 6c1b1cc951..09cec165a0 100644
--- a/src/lib/eina/eina_inlist.h
+++ b/src/lib/eina/eina_inlist.h
@@ -672,7 +672,7 @@ EAPI Eina_Accessor *eina_inlist_accessor_new(const Eina_Inlist *in_list) EINA_MA
672 * @since 1.1.0 672 * @since 1.1.0
673 * 673 *
674 * This function inserts item into a linked list assuming it was 674 * This function inserts item into a linked list assuming it was
675 * sorted and the result will be sorted. If @p list is @c NULLL, item 675 * sorted and the result will be sorted. If @p list is @c NULL, item
676 * is returned. On success, a new list pointer that should be 676 * is returned. On success, a new list pointer that should be
677 * used in place of the one given to this function is 677 * used in place of the one given to this function is
678 * returned. Otherwise, the old pointer is returned. 678 * returned. Otherwise, the old pointer is returned.
@@ -704,7 +704,7 @@ EAPI Eina_Inlist_Sorted_State *eina_inlist_sorted_state_new(void);
704 * @since 1.1.0 704 * @since 1.1.0
705 * 705 *
706 * See eina_inlist_sorted_state_insert() for more information. This function is 706 * See eina_inlist_sorted_state_insert() for more information. This function is
707 * usefull if you didn't use eina_inlist_sorted_state_insert() at some point, but 707 * useful if you didn't use eina_inlist_sorted_state_insert() at some point, but
708 * still think you have a sorted list. It will only correctly work on a sorted list. 708 * still think you have a sorted list. It will only correctly work on a sorted list.
709 */ 709 */
710EAPI int eina_inlist_sorted_state_init(Eina_Inlist_Sorted_State *state, Eina_Inlist *list); 710EAPI int eina_inlist_sorted_state_init(Eina_Inlist_Sorted_State *state, Eina_Inlist *list);
@@ -834,7 +834,7 @@ EAPI Eina_Inlist *eina_inlist_sort(Eina_Inlist *head, Eina_Compare_Cb func);
834/** 834/**
835 * @def EINA_INLIST_FOREACH_SAFE 835 * @def EINA_INLIST_FOREACH_SAFE
836 * @param list The list to iterate on. 836 * @param list The list to iterate on.
837 * @param list2 Auxiliar Eina_Inlist variable so we can save the pointer to the 837 * @param list2 Auxiliary Eina_Inlist variable so we can save the pointer to the
838 * next element, allowing us to free/remove the current one. Note that this 838 * next element, allowing us to free/remove the current one. Note that this
839 * macro is only safe if the next element is not removed. Only the current one 839 * macro is only safe if the next element is not removed. Only the current one
840 * is allowed to be removed. 840 * is allowed to be removed.
diff --git a/src/lib/eina/eina_list.h b/src/lib/eina/eina_list.h
index e06f4a6227..e35943e9e4 100644
--- a/src/lib/eina/eina_list.h
+++ b/src/lib/eina/eina_list.h
@@ -163,7 +163,7 @@
163 * 163 *
164 * You can move elements around in a list using @ref eina_list_move() or using 164 * You can move elements around in a list using @ref eina_list_move() or using
165 * @ref eina_list_promote_list() and @ref eina_list_demote_list() which move a 165 * @ref eina_list_promote_list() and @ref eina_list_demote_list() which move a
166 * list node to the head and end of the list respectevely: 166 * list node to the head and end of the list respectively:
167 * @until demote 167 * @until demote
168 * 168 *
169 * Removing elements from a list can be done with ease: 169 * Removing elements from a list can be done with ease:
@@ -515,7 +515,7 @@ EAPI Eina_List *eina_list_prepend_relative_list(Eina_List *list, cons
515 * @return A list pointer. 515 * @return A list pointer.
516 * 516 *
517 * This function inserts values into a linked list assuming it was 517 * This function inserts values into a linked list assuming it was
518 * sorted and the result will be sorted. If @p list is @c NULLL, a new 518 * sorted and the result will be sorted. If @p list is @c NULL, a new
519 * list is returned. On success, a new list pointer that should be 519 * list is returned. On success, a new list pointer that should be
520 * used in place of the one given to this function is 520 * used in place of the one given to this function is
521 * returned. Otherwise, the old pointer is returned. 521 * returned. Otherwise, the old pointer is returned.
@@ -834,7 +834,7 @@ EAPI Eina_List *eina_list_reverse_clone(const Eina_List *list) EINA_W
834 * @return The new list that has been cloned. 834 * @return The new list that has been cloned.
835 * 835 *
836 * This function clone in order of all elements in @p list. If @p list 836 * This function clone in order of all elements in @p list. If @p list
837 * is @c NULL, this functon returns @c NULL. This returns a copy of 837 * is @c NULL, this function returns @c NULL. This returns a copy of
838 * the given list. 838 * the given list.
839 * 839 *
840 * @note @b copy: this will copy the list and you should then 840 * @note @b copy: this will copy the list and you should then
@@ -894,7 +894,7 @@ EAPI Eina_List *eina_list_sort(Eina_List *list, unsigned int limit, E
894 * @brief Shuffle list. 894 * @brief Shuffle list.
895 * 895 *
896 * @param list The list handle to shuffle. 896 * @param list The list handle to shuffle.
897 * @param func A function pointer that can return an int between 2 inclusives values 897 * @param func A function pointer that can return an int between 2 inclusive values
898 * @return the new head of list. 898 * @return the new head of list.
899 * 899 *
900 * This function shuffles @p list. 900 * This function shuffles @p list.
@@ -944,7 +944,7 @@ EAPI Eina_List *eina_list_merge(Eina_List *left, Eina_List *right) EI
944 * smallest one to be head of the returned list. It will continue this process 944 * smallest one to be head of the returned list. It will continue this process
945 * for all entry of both list. 945 * for all entry of both list.
946 * 946 *
947 * Both left and right lists are not vailid anymore after the merge and should 947 * Both left and right lists are not valid anymore after the merge and should
948 * not be used. If @p func is @c NULL, it will return @c NULL. 948 * not be used. If @p func is @c NULL, it will return @c NULL.
949 * 949 *
950 * Example: 950 * Example:
@@ -952,7 +952,7 @@ EAPI Eina_List *eina_list_merge(Eina_List *left, Eina_List *right) EI
952 * int 952 * int
953 * sort_cb(void *d1, void *d2) 953 * sort_cb(void *d1, void *d2)
954 * { 954 * {
955 * const char *txt = NULL; 955 * const char *txt = NULL;
956 * const char *txt2 = NULL; 956 * const char *txt2 = NULL;
957 * 957 *
958 * if(!d1) return(1); 958 * if(!d1) return(1);
@@ -1020,7 +1020,7 @@ EAPI Eina_List *eina_list_split_list(Eina_List *list, Eina_List *rela
1020 * 1020 *
1021 * However this has the downside of walking through the list twice, once to 1021 * However this has the downside of walking through the list twice, once to
1022 * check if the data is already present and another to insert the element in the 1022 * check if the data is already present and another to insert the element in the
1023 * corret position. This can be done more eficiently: 1023 * correct position. This can be done more efficiently:
1024 * @code 1024 * @code
1025 * int cmp_result; 1025 * int cmp_result;
1026 * l = eina_list_search_sorted_near_list(list, cmp_func, "my data", 1026 * l = eina_list_search_sorted_near_list(list, cmp_func, "my data",