On Tue, Nov 11, 2008 at 5:28 PM, Ville M. Vainio <[EMAIL PROTECTED]> wrote:
>> Interestingly, the qt tree redraw is significantly slower than the >> tkinter tree code... > I don't really believe it's fundamentally slower - rather, there is > something that is broken in the implementation (apart from it not > having received significant optimizations yet, of course). You might > want to run the unit tests in the profiler and compare tk and qt > results. You are right to be dubious. The first step will have the unit tests report the total number of redraws. That is not guaranteed to be the same at present. > Creation of all 6000 nodes of leopyref took 0.5 seconds - I don't > think Tk will fare much faster. An interesting data point, but not conclusive. Leo's unit tests are close to the ultimate stress test for any tree widget. The key question is not how long a single redraw takes, but rather the effectiveness of the widget's storage allocation and recycling. The code in leoTkinterTree.py manages widgets by hand, and that results in a huge increase in performance. In short, the question is open at present. Edward --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "leo-editor" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/leo-editor?hl=en -~----------~----~----~----~------~----~------~--~---
