|Version 6 (modified by mkurczych, 7 years ago)|
Google Summer of Code 2008
- Reimplement XPath
- Add some kind of pre-rendering of parts that don't use variables
- Try compiling templates to Python bytecode
- Try adding some minor optimizations
What has been done
Current XPath implementation in Genshi is rather buggy (for example http://genshi.edgewall.org/ticket/185). I've rewritten it. Implemented algorithm works in O(qn) time, where q is length of XPath expression, n is number of stream events and O(qh) memory complexity, where h is height of document XML tree. It computes for every node which places of XPath expression does it match. O(qn) is pessimistic complexity, I think algorithm will work like O(n) in most cases (the worst case is when nearly every node matches to nearly every place of expression, which is quite rare).
Still need to add some tests covering more situations.
Currently working at:
There are many templates where much of code doesn't depend on context. It can be pre-rendered once and then only pasted as result. Also common situation is when there are only few possible variable values - for example only True or False. We can pre-reder parts of code for each of values and use them later. We only have to check for given fragment of template which values does it use and find recurrences of this values. There's also need of making filters compatible with this changes - probably somehow mark fragment of code they change.