Użytkownik Paul McNett napisał: > I believe these to be good changes, and all relevant tests still pass, > but please test on your applications and let me know.
I repeat it again. Such approach, I mean checking changes across data tree level is faster if there are no changes in data at all. But it's enough I change only one, the last node in branch, we get large overhead in db layer trying to save every unchanged node in dataset. In such situation, checking changes in depth, as it was previously, costs much less. These changes increase saving time in one of my cases (very large and deep parent-child data tree) for about 8 seconds. -- Regards Jacek Kałucki _______________________________________________ Post Messages to: [email protected] Subscription Maintenance: http://leafe.com/mailman/listinfo/dabo-dev Searchable Archives: http://leafe.com/archives/search/dabo-dev This message: http://leafe.com/archives/byMID/[email protected]
