Hilaire Fernandes a écrit : > Alain Plantec a écrit : > >> Hilaire Fernandes a écrit : >> >>> nullPointer a écrit : >>> >>> >>>> Then, there is not way of to improve much more that speed. I want use Pharo >>>> for commercial apps too, and surely need load lots of data. >>>> >>>> >>>> >>>>> It seems that you're using the stepping mechanism, it is time consuming. >>>>> also the layout managing and invalid areas redrawing. >>>>> >>>>> >>>> Is possible fix that? >>>> >>>> >>> What about a late instantiation mechanism for invisible cell morph >>> >>> >> I've tried that (see LazyMorphTreeMorph). It seems to work well. >> A list is opened in a second whatever the number of items. >> the drawback (a serious one for very long list) is the scrolling >> because rows are recomputed when they become visible. >> try it with >> > > > Why not late initialization and caching. Thus rows are instantiated only > when they are first viewed. > I guess this is how LazyMorphTreeMorph works :) Alain > Hilaire > > > _______________________________________________ > Pharo-project mailing list > [email protected] > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project > >
_______________________________________________ Pharo-project mailing list [email protected] http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project
