git-svn-id: http://svn.enlightenment.org/svn/e/trunk/eina@71581
7cbeb6ba-43b4-40fd-8cce-
4c39aea84d33
* eina_inlist_count() is order-N, while @ref eina_list_count() is order-1 (constant
* time).
*
* eina_inlist_count() is order-N, while @ref eina_list_count() is order-1 (constant
* time).
*
- * For the same reasons, @ref eina_inlist_sort() is slower than @ref
- * eina_list_sort() . If the list is intended to have faster access, be
- * sorted/merged frequently, or needs to have other complex operations, consider
- * using @ref Eina_List instead.
- *
* @section inlist_advanced Advanced Usage
*
* The basic usage considers a struct that will have the user data, and also
* @section inlist_advanced Advanced Usage
*
* The basic usage considers a struct that will have the user data, and also
* @note @b in-place: this will change the given list, so you should
* now point to the new list head that is returned by this function.
*
* @note @b in-place: this will change the given list, so you should
* now point to the new list head that is returned by this function.
*
- * @note worst case is O(n * log2(n)) comparisons (calls to func()),
- * O(n) comparisons average case. That means that for 1,000,000 list
- * elements, sort will usually do 1,000,000 comparisons, but may do up
- * to 20,000,000.
+ * @note Worst case is O(n * log2(n)) comparisons (calls to func()).
+ * That means that for 1,000,000 list elements, sort will do 20,000,000
+ * comparisons.
* @note @b in-place: this will change the given list, so you should
* now point to the new list head that is returned by this function.
*
* @note @b in-place: this will change the given list, so you should
* now point to the new list head that is returned by this function.
*
- * @note worst case is O(n * log2(n)) comparisons (calls to func()),
- * O(n) comparisons average case. That means that for 1,000,000 list
- * elements, sort will usually do 1,000,000 comparisons, but may do up
- * to 20,000,000.
+ * @note Worst case is O(n * log2(n)) comparisons (calls to func()).
+ * That means that for 1,000,000 list sort will do 20,000,000 comparisons.