From: Peter W. <pet...@we...> - 2009-04-27 17:42:54
|
Albin Tonnerre schrieb: >> But you can append fast (O(1)) since it >> will keep a pointer to last element. >> > > Eina_List too. > > Anyway, TBH I only did it this way because cedric advised me to do so. I'll > change it to Eina_Inlists if you think that really would have a benefit, which I > doubt. > Imho, the main benefit of Ecore_List2/Eina_Inlist is that you can remove an element with O(1) where as the same operation is O(n) for Eina_List, because you have to search the node for it first. Peter |