Edgewall Software

Changes between Version 10 and Version 11 of GSoC2008

Show
Ignore:
Timestamp:
07/30/08 00:53:41 (6 years ago)
Author:
mkurczych
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • GSoC2008

    v10 v11  
    1111Current 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). 
    1212 
    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]. 
     13Added also other implementations for simpler paths called strategies. Performance of new implementation in comparision with previous one can be checked [wiki:XPath-benchmarks here]. 
    1414 
    1515=== Simple pre-rendering ===