forked from enlightenment/efl
944be7e745
eina_list_search_sorted_near_list() was broken and barfed at my face during development of eina_list_sorted_insert(), so I rewrote it following more traditional approach, also adding special cases for head/tail remembering that random access in lists is not as fast as array. I also simplified that code. eina_list_sorted_insert() should be fast, O(log2 n) insert, with special cases to insert already sorted arrays forwards or backwards, however I believe that it's better to simply append/prepend in those cases (if known). SVN revision: 41625 |
||
|---|---|---|
| .. | ||
| include | ||
| lib | ||
| modules | ||
| tests | ||
| .cvsignore | ||
| Makefile.am | ||