</row>
<row>
<entry><literal>new</literal></entry>
- <entry>Number of new messages</entry>
+ <entry>Number of unread messages</entry>
</row>
<row>
<entry><literal>path</literal></entry>
<entry>Alphabetically by path</entry>
</row>
+ <row>
+ <entry><literal>unread</literal></entry>
+ <entry>Number of unread messages</entry>
+ </row>
<row>
<entry><literal>unsorted</literal></entry>
<entry>Do not resort the paths</entry>
** .dl
** .dt %B .dd Name of the mailbox
** .dt %S .dd * Size of mailbox (total number of messages)
- ** .dt %N .dd * Number of New messages in the mailbox
+ ** .dt %N .dd * Number of unread messages in the mailbox
** .dt %n .dd N if mailbox has new mail, blank otherwise
** .dt %F .dd * Number of Flagged messages in the mailbox
** .dt %! .dd ``!'' : one flagged message;
** .dd alpha (alphabetically)
** .dd count (all message count)
** .dd flagged (flagged message count)
- ** .dd new (new message count)
+ ** .dd name (alphabetically)
+ ** .dd new (unread message count)
+ ** .dd path (alphabetically)
+ ** .dd unread (unread message count)
** .dd unsorted
** .ie
** .pp
{ "flagged", SORT_FLAGGED },
{ "mailbox-order", SORT_ORDER },
{ "name", SORT_PATH },
- { "new", SORT_COUNT_NEW },
+ { "new", SORT_UNREAD }, /* kept for compatibility */
{ "path", SORT_PATH },
+ { "unread", SORT_UNREAD },
{ "unsorted", SORT_ORDER },
{ NULL, 0 }
};
case SORT_COUNT:
result = (b2->msg_count - b1->msg_count);
break;
- case SORT_COUNT_NEW:
+ case SORT_UNREAD:
result = (b2->msg_unread - b1->msg_unread);
break;
case SORT_FLAGGED:
/* These are the only sort methods we understand */
if ((ssm == SORT_COUNT) ||
- (ssm == SORT_COUNT_NEW) ||
+ (ssm == SORT_UNREAD) ||
(ssm == SORT_FLAGGED) ||
(ssm == SORT_PATH))
qsort (Entries, EntryCount, sizeof (*Entries), cb_qsort_sbe);