seoz pushed a commit to branch master.
commit 3c9856f9e0095139ebd7dbdd860025a8dfb2a705
Author: Daniel Juyung Seo <[email protected]>
Date: Thu May 23 20:26:44 2013 +0900
eina_list.h: fixed documentation source formatting while reading the code.
---
src/lib/eina/eina_list.h | 72 +++++++++++++++++++++++++-----------------------
1 file changed, 37 insertions(+), 35 deletions(-)
diff --git a/src/lib/eina/eina_list.h b/src/lib/eina/eina_list.h
index ebae94a..a3c17d3 100644
--- a/src/lib/eina/eina_list.h
+++ b/src/lib/eina/eina_list.h
@@ -363,8 +363,8 @@ struct _Eina_List_Accounting
* list = eina_list_append(list, my_data);
* if (eina_error_get())
* {
- * fprintf(stderr, "ERROR: Memory is low. List allocation failed.\n");
- * exit(-1);
+ * fprintf(stderr, "ERROR: Memory is low. List allocation failed.\n");
+ * exit(-1);
* }
* @endcode
*
@@ -396,8 +396,8 @@ EAPI Eina_List *eina_list_append(Eina_List
*list, const void *data) E
* list = eina_list_prepend(list, my_data);
* if (eina_error_get())
* {
- * fprintf(stderr, "ERROR: Memory is low. List allocation failed.\n");
- * exit(-1);
+ * fprintf(stderr, "ERROR: Memory is low. List allocation failed.\n");
+ * exit(-1);
* }
* @endcode
*
@@ -433,14 +433,14 @@ EAPI Eina_List *eina_list_prepend(Eina_List
*list, const void *data)
* list = eina_list_append(list, relative_member);
* if (eina_error_get())
* {
- * fprintf(stderr, "ERROR: Memory is low. List allocation failed.\n");
- * exit(-1);
+ * fprintf(stderr, "ERROR: Memory is low. List allocation failed.\n");
+ * exit(-1);
* }
* list = eina_list_append_relative(list, my_data, relative_member);
* if (eina_error_get())
* {
- * fprintf(stderr, "ERROR: Memory is low. List allocation failed.\n");
- * exit(-1);
+ * fprintf(stderr, "ERROR: Memory is low. List allocation failed.\n");
+ * exit(-1);
* }
* @endcode
*
@@ -498,14 +498,14 @@ EAPI Eina_List
*eina_list_append_relative_list(Eina_List *list, const
* list = eina_list_append(list, relative_member);
* if (eina_error_get_error())
* {
- * fprintf(stderr, "ERROR: Memory is low. List allocation failed.\n");
- * exit(-1);
+ * fprintf(stderr, "ERROR: Memory is low. List allocation failed.\n");
+ * exit(-1);
* }
* list = eina_list_prepend_relative(list, my_data, relative_member);
* if (eina_error_get())
* {
- * fprintf(stderr, "ERROR: Memory is low. List allocation failed.\n");
- * exit(-1);
+ * fprintf(stderr, "ERROR: Memory is low. List allocation failed.\n");
+ * exit(-1);
* }
* @endcode
*
@@ -606,11 +606,11 @@ EAPI Eina_List *eina_list_remove(Eina_List
*list, const void *data) E
*
* EINA_LIST_FOREACH(list, l, data)
* {
- * if (data == my_data)
- * {
- * list = eina_list_remove_list(list, l);
- * break;
- * }
+ * if (data == my_data)
+ * {
+ * list = eina_list_remove_list(list, l);
+ * break;
+ * }
* }
* @endcode
*
@@ -640,11 +640,11 @@ EAPI Eina_List
*eina_list_remove_list(Eina_List *list, Eina_List *rem
*
* EINA_LIST_FOREACH(list, l, data)
* {
- * if (data == my_data)
- * {
- * list = eina_list_promote_list(list, l);
- * break;
- * }
+ * if (data == my_data)
+ * {
+ * list = eina_list_promote_list(list, l);
+ * break;
+ * }
* }
* @endcode
*
@@ -674,11 +674,11 @@ EAPI Eina_List
*eina_list_promote_list(Eina_List *list, Eina_List *mo
*
* EINA_LIST_FOREACH(list, l, data)
* {
- * if (data == my_data)
- * {
- * list = eina_list_demote_list(list, l);
- * break;
- * }
+ * if (data == my_data)
+ * {
+ * list = eina_list_demote_list(list, l);
+ * break;
+ * }
* }
* @endcode
*
@@ -1518,10 +1518,11 @@ EAPI Eina_Accessor *eina_list_accessor_new(const
Eina_List *list) EINA_MA
* // EINA_LIST_FOREACH_SAFE will be used to free elements that match "key".
*
* EINA_LIST_FOREACH_SAFE(list, l, l_next, data)
- * if (strcmp(data, "key") == 0) {
- * free(data);
- * list = eina_list_remove_list(list, l);
- * }
+ * if (strcmp(data, "key") == 0)
+ * {
+ * free(data);
+ * list = eina_list_remove_list(list, l);
+ * }
* @endcode
*
* @warning @p list must be a pointer to the first element of the list.
@@ -1574,10 +1575,11 @@ EAPI Eina_Accessor *eina_list_accessor_new(const
Eina_List *list) EINA_MA
* // EINA_LIST_REVERSE_FOREACH_SAFE will be used to free elements that match
"key".
*
* EINA_LIST_REVERSE_FOREACH_SAFE(list, l, l_prev, data)
- * if (strcmp(data, "key") == 0) {
- * free(data);
- * list = eina_list_remove_list(list, l);
- * }
+ * if (strcmp(data, "key") == 0)
+ * {
+ * free(data);
+ * list = eina_list_remove_list(list, l);
+ * }
* @endcode
*
* @warning @p list must be a pointer to the first element of the list.
--
------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may
