Jakub Sitnicki 32f5c8b1f6 mu: Sort containers by comparing their subtree leaders
Traverse the container tree depth first and for each container find
the node in the subtree rooted at this container which comes first in
the descending sort order. Remember it as the subtree leader. Then,
while sorting siblings, compare their subtree leaders instead of the
sibling containers themselves.

IOW, make threads containing the newest message float to the top when
sorting by date in the descending order.

There is no significant performance degradation when sorting a
mailbox with ~16k messages:

$ mu find maildir:/INBOX | wc -l
16503

Current state:

$ perf stat --event=task-clock --repeat=10 -- \
  mu find maildir:/INBOX -n 1 -t > /dev/null

 Performance counter stats for 'mu find maildir:/INBOX -n 1 -t' (10 runs):

       1231.761588      task-clock (msec)         #    0.996 CPUs utilized            ( +-  1.02% )

       1.236209133 seconds time elapsed                                          ( +-  1.08% )

With patch applied:

$ perf stat --event=task-clock --repeat=10 -- \
  mu find maildir:/INBOX -n 1 -t > /dev/null

 Performance counter stats for 'mu find maildir:/INBOX -n 1 -t' (10 runs):

       1459.883316      task-clock (msec)         #    0.998 CPUs utilized            ( +-  0.72% )

       1.462540088 seconds time elapsed                                          ( +-  0.77% )

This implements https://github.com/djcb/mu/issues/164.
2014-07-15 07:25:51 +02:00
2014-06-02 08:36:56 +03:00
2013-03-30 11:38:01 +02:00
2014-01-30 14:29:48 +02:00
2013-12-29 17:20:49 +02:00
2013-03-30 14:16:38 +02:00
2010-12-05 14:40:02 +02:00
2011-05-18 22:14:52 +03:00
2014-06-27 22:26:22 +03:00
2012-07-20 11:56:07 +03:00
2012-11-18 22:10:05 +02:00
2013-03-30 11:38:01 +02:00
2014-06-27 22:26:22 +03:00
2012-09-11 12:39:57 +03:00
2012-12-02 22:57:47 +02:00

                                README
                                ======
 
Welcome to mu! 
---------------

  Given the enormous amounts of e-mail many people gather and the importance of
  e-mail message in our work-flows, it's essential to quickly deal with all that
  mail - in particular, to instantly find that one important e-mail you need right
  now.
  
  [mu] is a tool for dealing with e-mail messages stored in the
  Maildir-format. =mu='s purpose in life is to help you to quickly find the
  messages you need; in addition, it allows you to view messages, extract
  attachments, create new maildirs, and so on. See the [mu cheatsheet] for some
  examples. =mu= is fully documented.
  
  After indexing your messages into a [Xapian]-database, you can search them using
  a custom query language. You can use various message fields or words in the
  body text to find the right messages.
  
  Built on top of the mu, are some extensions (included in this package):

  - mu-for-emacs ([mu4e]): a full-featured e-mail client that runs inside emacs
  - [mu-guile]: bindings for the Guile/Scheme programming language (version 2.0
    and later)
  - a toy GTK+-interface called 'mug' (in the 'toys/' subdir)

  =mu= is written in C and a bit of C++ (to interface with Xapian), with =mu4e=
  written in [Emacs-Lisp] and =mu-guile= in a mix of C and Scheme.
  
  Note, =mu= is available in Debian/Ubuntu under the name =maildir-utils=;
  apparently because they don't like short name. It's also possible to confuse
  that name with the [GNU Mailutils] project (which is totally unrelated) - but
  now you have been warned.
  

  [mu]: http://www.djcbsoftware.nl/code/mu
  [mu cheatsheet]: http://www.djcbsoftware.nl/code/mu/cheatsheet.html
  [Xapian]: http://www.xapian.org
  [mu4e]: http://www.djcbsoftware.nl/code/mu/mu4e.html
  [mu-guile]: http://www.djcbsoftware.nl/code/mu/mu-guile.html
  [Emacs-Lisp]: http://en.wikipedia.org/wiki/Emacs-Lisp
  [GNU Mailutils]: http://mailutils.org/

Description
No description provided
Readme 22 MiB
Languages
C++ 61.5%
Emacs Lisp 29.1%
Scheme 5%
Meson 3.1%
Shell 0.3%
Other 1%