From c67b71b65ccad1df28bc9441c5ad6704bb46cd17 Mon Sep 17 00:00:00 2001 From: "Jonas M. Gastal" Date: Thu, 31 May 2012 13:09:05 +0000 Subject: [PATCH] Removing wrong info about inlist performance from docs. SVN revision: 71581 --- legacy/eina/src/include/eina_inlist.h | 12 +++--------- legacy/eina/src/include/eina_list.h | 6 ++---- 2 files changed, 5 insertions(+), 13 deletions(-) diff --git a/legacy/eina/src/include/eina_inlist.h b/legacy/eina/src/include/eina_inlist.h index 5b8a92f005..e4de689176 100644 --- a/legacy/eina/src/include/eina_inlist.h +++ b/legacy/eina/src/include/eina_inlist.h @@ -340,11 +340,6 @@ * 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 @@ -740,10 +735,9 @@ EAPI Eina_Inlist *eina_inlist_sorted_state_insert(Eina_Inlist *list, * @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. * * Example: * @code diff --git a/legacy/eina/src/include/eina_list.h b/legacy/eina/src/include/eina_list.h index fc6341a7fc..7f54b38491 100644 --- a/legacy/eina/src/include/eina_list.h +++ b/legacy/eina/src/include/eina_list.h @@ -895,10 +895,8 @@ EAPI Eina_List *eina_list_clone(const Eina_List *list) EINA_WARN_UNUS * @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. * * Example: * @code