* @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.
*/
* 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
*
* @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
* @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
*
*
* 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
* 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.
*
* 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.
* @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);
* @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);
* 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
*