[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kde-bugs-dist
Subject:    Bug#43104: Inverse thread grouping + sorting order
From:       e9625392 () student ! tuwien ! ac ! at
Date:       2002-05-26 18:11:16
[Download RAW message or body]

Package: kmail
Version: 1.4.1 (using KDE 3.0.1 )
Severity: wishlist
Installed from:    SuSE
Compiler:          gcc version 2.95.3 20010315 (SuSE)
OS:                Linux (i686) release 2.4.18-4GB
OS/Compiler notes: 

If you have subscribed to mailing lists you probably know this problem:
A thread gets very long and it gets harder and harder to keep track of new postings. \
It moves out of the visible area, because the original post was done quite some time \
ago.

I've got two suggestions which could help with this problem:
1. (Optionally) sort threads by the time of the last reply.

2. Support an 'inverse grouping' view mode which sorts threads after the last post of \
a thread too but additionaly inverses the thread tree. This way you only have the \
most up-to-date replys first and navigate deeper only if you're interested in older \
postings to that thread. 

I'd like the second approach best, though the only problem about it is, that an \
inverse tree has not just one root node. This could be solved by providing a dummy \
root entry which takes the name of the thread and the number of unread messages in \
parenthesis. Just like the folder view does ist. Additionally this thread-folder \
should be shown bold, if there is at least one unread message in the thread.

Example:
+ Thread name (2) | Original poster | Date of last posting
> + Re: Thread name | poster | date
> > + Thread name | original poster | date of original posting

(Hope this comes through unchanged)

This would help very much to keep track of postings in mailing lists.

Thanks,
	Andreas


(Submitted via bugs.kde.org)
(Called from KBugReport dialog)


[prev in list] [next in list] [prev in thread] [next in thread]