The other question is, even if we do have functions that are similar to the genlist, would it be fast. For each new image, you'd have to go over all the other added images, so that you'd know where to add it. So would that be faster than sorting them on one go, and then adding them sequentially?
On Sun, Oct 3, 2010 at 12:39 PM, Cedric BAIL <cedric.b...@free.fr> wrote: > On Sun, Oct 3, 2010 at 11:21 AM, Viktor Kojouharov > <vkojouha...@gmail.com> wrote: > > I'm not sure how that would work. How would inserting into a sorted list > be > > any different than sorting at the end? The gengrid currently doesn't > support > > arbitrary insertion of items, so you'd have to have all the elements > before > > hand in order to sort them and then start inserting them. The readdir > still > > happens asyncronously, with the difference that now all elements are > added > > on one go. > > Then again, I might have misunderstand you, if you are talking about > using > > the elm_list instead (with sorted_items), but then, with directories that > > have lots of images, UI performance would suck if we move away from the > > gengrid (unless elm_list is like the gengrid|list, where it only builds > the > > visible elements). > > Yes, you are right, that means patching gengrid/list to handle such use > case. > -- > Cedric BAIL > ------------------------------------------------------------------------------ Start uncovering the many advantages of virtual appliances and start using them to simplify application deployment and accelerate your shift to cloud computing. http://p.sf.net/sfu/novell-sfdev2dev _______________________________________________ enlightenment-devel mailing list enlightenment-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/enlightenment-devel
