Changes between Version 10 and Version 11 of GSoC2008
- Timestamp:
- Jul 30, 2008, 12:53:41 AM (16 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
GSoC2008
v10 v11 11 11 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). 12 12 13 Added also other implementations for simpler paths called strategies. Performance of new implementation in comparision with previous one can be checked [wiki:XPath-benchmark here].13 Added also other implementations for simpler paths called strategies. Performance of new implementation in comparision with previous one can be checked [wiki:XPath-benchmarks here]. 14 14 15 15 === Simple pre-rendering ===