El lun., 10 sep. 2018 17:24, <l...@howorth.org.uk> escribió: > From: Mario Rugiero <mrugi...@gmail.com> > > Double pointer allows to process lists in a more linear fashion. > The functions changed are: > icon_grid_add > icon_grid_set_constrain_width > icon_grid_remove > icon_grid_reorder_child > > NOTE I'm not exactly sure how to test this. > > > I suppose the first test/requirement would be to show that the existing > linked list demonstrates a performance problem somewhere? What is the > problem that is trying to be solved here? > The motivation is that (I think) writing it this way makes the code more straightforward, it eliminates several branches to think about.
> > Secondly, the most notorious problem with two-way lists is possible > inconsistencies among the pointers, either through coding errors or > through interruptions to processing at some point. So I suppose the > most useful tests would be to introduce some inconsistencies and > demonstrate that the code recovers the situation sensibly. > This isn't about two way lists, but about adding a layer of indirection that allows thinking about the elements on the list in a way that is independent of their order in the list. I.e., it saves branches derived from the distinction between the list structure and the elements structure. > > BTW, congrats on the series of patches you have provided. > Thanks! I'll try to provide more! > > > _______________________________________________ > Lxde-list mailing list > Lxde-list@lists.sourceforge.net > https://lists.sourceforge.net/lists/listinfo/lxde-list >
_______________________________________________ Lxde-list mailing list Lxde-list@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/lxde-list
