summaryrefslogtreecommitdiff
path: root/doc/todo
diff options
context:
space:
mode:
authorJoey Hess <joey@gnu.kitenet.net>2010-04-11 01:30:03 -0400
committerJoey Hess <joey@gnu.kitenet.net>2010-04-11 01:30:03 -0400
commit0bfc364a7df124509855b8ed0b1b33ab5bc9ebbb (patch)
tree18f7d7d765e463ac748a56afdbd728e6baeb10ba /doc/todo
parentcecbd529389788c1f1cb647e2ff297cda7554456 (diff)
optimization: pagespec_match_list with no num limit matches before sorting
This can be a lot faster, since huge numbers of pages are not sorted only to mostly be thrown away. It sped up a build of my blog by at least 5 minutes.
Diffstat (limited to 'doc/todo')
-rw-r--r--doc/todo/smarter_sorting.mdwn3
1 files changed, 3 insertions, 0 deletions
diff --git a/doc/todo/smarter_sorting.mdwn b/doc/todo/smarter_sorting.mdwn
index 5a6d63ef1..f8ac216dc 100644
--- a/doc/todo/smarter_sorting.mdwn
+++ b/doc/todo/smarter_sorting.mdwn
@@ -29,5 +29,8 @@ date range.) Well, in this case, it *does* make sense to flip it, limit by
pagespe first, and do a (quick)sort second. (No influence complications,
either.)
+> Flipping when there's no limit implemented, and it knocked 1/3 off
+> the rebuild time of my blog's archive pages. --[[Joey]]
+
Adding these special cases will be more complicated, but I think the best
of both worlds. --[[Joey]]