summaryrefslogtreecommitdiff
path: root/src/include
diff options
context:
space:
mode:
authorJihoon Kim <imfine98@gmail.com>2012-06-16 13:33:58 +0000
committerJihoon Kim <imfine98@gmail.com>2012-06-16 13:33:58 +0000
commit196aed8a511c097a89efd86b33324abf6be4c250 (patch)
tree37d1070e08a0630fc4f1ec8913fe2b6d6a78e1ad /src/include
parent36dfaf5da19b4db7e5df4eb7402ba407fb06da68 (diff)
downloadeina-196aed8a511c097a89efd86b33324abf6be4c250.tar.gz
eina: fix typos in some headers
SVN revision: 72236
Diffstat (limited to 'src/include')
-rw-r--r--src/include/eina_accessor.h2
-rw-r--r--src/include/eina_array.h6
-rw-r--r--src/include/eina_benchmark.h10
-rw-r--r--src/include/eina_object.h2
-rw-r--r--src/include/eina_rectangle.h4
-rw-r--r--src/include/eina_str.h2
6 files changed, 13 insertions, 13 deletions
diff --git a/src/include/eina_accessor.h b/src/include/eina_accessor.h
index 5ccc8f0..8665bb9 100644
--- a/src/include/eina_accessor.h
+++ b/src/include/eina_accessor.h
@@ -320,7 +320,7 @@ EAPI Eina_Bool eina_accessor_unlock(Eina_Accessor *accessor) EINA_ARG_NONNULL(1)
* @warning unless explicitly stated in functions returning accessors,
* do not modify the accessed object while you walk it, in this
* example using lists, do not remove list nodes or you might
- * crash! This is not a limitiation of accessors themselves,
+ * crash! This is not a limitation of accessors themselves,
* rather in the accessors implementations to keep them as simple
* and fast as possible.
*/
diff --git a/src/include/eina_array.h b/src/include/eina_array.h
index cd8bc5e..a9f5c7a 100644
--- a/src/include/eina_array.h
+++ b/src/include/eina_array.h
@@ -69,7 +69,7 @@
* And now we call a function on every member of our array to print it:
* @until foreach
*
- * One of the strenghts of @ref Eina_Array over @ref Eina_List is that it has
+ * One of the strengths of @ref Eina_Array over @ref Eina_List is that it has
* very fast random access to elements, so this is very efficient:
* @until printf
*
@@ -339,7 +339,7 @@ static inline void *eina_array_data_get(const Eina_Array *array,
* @brief Set the data at a given position in an array.
*
* @param array The array.
- * @param idx The potition of the data to set.
+ * @param idx The position of the data to set.
* @param data The data to set.
*
* This function sets the data at the position @p idx in @p
@@ -401,7 +401,7 @@ static inline Eina_Bool eina_array_foreach(Eina_Array *array,
* @brief Macro to iterate over an array easily.
*
* @param array The array to iterate over.
- * @param index The integer number that is increased while itareting.
+ * @param index The integer number that is increased while iterating.
* @param item The data
* @param iterator The iterator
*
diff --git a/src/include/eina_benchmark.h b/src/include/eina_benchmark.h
index 89010aa..a95aadf 100644
--- a/src/include/eina_benchmark.h
+++ b/src/include/eina_benchmark.h
@@ -36,14 +36,14 @@
*
* To create a basic benchmark, you have to follow these steps:
*
- * @li Create a new bechmark
- * @li Write the functions that wraps the the functions you want to
- * bechmark.
+ * @li Create a new benchmark
+ * @li Write the functions that wraps the functions you want to
+ * benchmark.
* @li Register these wrappers functions.
* @li Run the benchmark.
* @li Free the memory.
*
- * Here is a basic example of bechmark which creates two functions
+ * Here is a basic example of benchmark which creates two functions
* that will be run. These functions just print a message.
*
* @code
@@ -403,7 +403,7 @@ EAPI void eina_benchmark_free(Eina_Benchmark *bench);
* increasing by @p count_step from @p count_start to @p count_end is passed to @p
* bench_cb when eina_benchmark_run() is called.
*
- * If @p bench is @c NULL, this function returns imediatly. If the
+ * If @p bench is @c NULL, this function returns immediately. If the
* allocation of the memory of the test to add fails, the error is set
* to #EINA_ERROR_OUT_OF_MEMORY. This function returns #EINA_FALSE
* on failure, #EINA_TRUE otherwise.
diff --git a/src/include/eina_object.h b/src/include/eina_object.h
index 6c1cfb2..5773c93 100644
--- a/src/include/eina_object.h
+++ b/src/include/eina_object.h
@@ -31,7 +31,7 @@
*
* Each Eina_Object is in fact only an ID and a generation count. This
* make it possible to check if the ID is allocated by checking that it
- * is inside the boudary limit of the allocated range. The generation
+ * is inside the boundary limit of the allocated range. The generation
* count, give the possibility to check that we use a valid alive pointer
* as generation is increased each time an object is allocated/destroyed.
* And finally it provide type checking against Eina_Class.
diff --git a/src/include/eina_rectangle.h b/src/include/eina_rectangle.h
index 57e562c..0ad7224 100644
--- a/src/include/eina_rectangle.h
+++ b/src/include/eina_rectangle.h
@@ -138,7 +138,7 @@ EAPI void eina_rectangle_pool_data_set(Eina_Rectangle_Pool *pool
* @param pool The pool to free.
*
* This function frees the allocated data of @p pool. If @p pool is
- * @c NULL, ths function returned immediately.
+ * @c NULL, this function returned immediately.
*/
EAPI void eina_rectangle_pool_free(Eina_Rectangle_Pool *pool) EINA_ARG_NONNULL(1);
@@ -175,7 +175,7 @@ EAPI Eina_Rectangle *eina_rectangle_pool_request(Eina_Rectangle_Pool *pool,
* @param rect The rectangle to remove from the pool.
*
* This function removes @p rect from the pool. If @p rect is
- * @c NULL, the function returns immediately. Otherwise it remoes @p
+ * @c NULL, the function returns immediately. Otherwise it removes @p
* rect from the pool.
*/
EAPI void eina_rectangle_pool_release(Eina_Rectangle *rect) EINA_ARG_NONNULL(1);
diff --git a/src/include/eina_str.h b/src/include/eina_str.h
index 7e22e31..f199a9a 100644
--- a/src/include/eina_str.h
+++ b/src/include/eina_str.h
@@ -18,7 +18,7 @@
* eina:
* @until eina_init
*
- * It's frequentely necessary to split a string into its constituent parts,
+ * It's frequently necessary to split a string into its constituent parts,
* eina_str_split() make's it easy to do so:
* @until printf
*