On Mar 22, 10:43 am, "Edward K. Ream" <[email protected]> wrote: > I continue to work on the leo-pylint branch. This is slow work, but I > console myself that it could form the basis of a relatively simple, > yet very powerful autocompletion framework.
The first real test of the sudoku-like scheme has just passed. Unless I am greatly mistaken, this test shows that the overall design is sound. Initial passes preprocess all files in Leo's core in about 5 seconds. The sudoku-like resolution scheme then resolves all needed deductions in what I think is pretty clearly the fastest possible time. Thus, we have traded pre-passes for a substantial speedup in what was formerly a very slow algorithm. Many details remain. The present code handles only simple assignments. It does not handle chains of attributes, like a.b.c, nor does it import or analyze imported files. Finally, it does not handle complex expression on the rhs of assignments. However, I believe I can fill in the blanks fairly easily. As always, for details, see http://groups.google.com/group/leo-and-pylint 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.
