summaryrefslogtreecommitdiff
path: root/tests/test_dom_traverse.cpp
diff options
context:
space:
mode:
authorArseny Kapoulkine <arseny.kapoulkine@gmail.com>2014-10-05 04:20:38 +0000
committerArseny Kapoulkine <arseny.kapoulkine@gmail.com>2014-10-05 04:20:38 +0000
commite66356715c8ab207350bc30904b30c4de4515506 (patch)
treee4f758d06167adbf8b9d24f54d7efc705a627471 /tests/test_dom_traverse.cpp
parent42219590f3ea1e88e41f8250da5a123f3a9236b2 (diff)
Optimize XPath sorting for sorted sequences
XPath evaluation frequently produces sequences that are sorted but are not tagged as such (area for improvement...). Doing a linear scan before sorting is cheap and results in tremendous speedup for already sorted sequences (especially if document_buffer_order optimization does not apply). git-svn-id: https://pugixml.googlecode.com/svn/trunk@1049 99668b35-9821-0410-8761-19e4c4f06640
Diffstat (limited to 'tests/test_dom_traverse.cpp')
0 files changed, 0 insertions, 0 deletions