projects / notmuch.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 60cd3b9) | patch
tag-util: optimization of tag application
authorDavid Bremner <bremner@debian.org>
Tue, 13 Nov 2012 04:23:49 +0000 (00:23 -0400)
committerDavid Bremner <bremner@debian.org>
Sun, 9 Dec 2012 17:33:34 +0000 (13:33 -0400)
commit5c7990f2510e2783ba4d02ad893d712ef201336d
treea0d2d3aa33d2e12272b1666d12587cfbed3bf357tree | snapshot
parent60cd3b9a0623a1cb71a1a1eb440accf9236a41e7commit | diff
tag-util: optimization of tag application

The idea is not to bother with restore operations if they don't change
the set of tags. This is actually a relatively common case.

In order to avoid fancy datastructures, this method is quadratic in
the number of tags; at least on my mail database this doesn't seem to
be a big problem.
tag-util.c diff | blob | history
Thread-based e-mail indexer, supporting quick search and tagging