1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
/*
* Copyright (C) 1996-2000 Michael R. Elkins <me@mutt.org>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#define SORT_DATE 1 /* the date the mail was sent. */
#define SORT_SIZE 2
#define SORT_SUBJECT 3
#define SORT_FROM 4
#define SORT_ORDER 5 /* the order the messages appear in the mailbox. */
#define SORT_THREADS 6
#define SORT_RECEIVED 7 /* when the message were delivered locally */
#define SORT_TO 8
#define SORT_SCORE 9
#define SORT_ALIAS 10
#define SORT_ADDRESS 11
#define SORT_KEYID 12
#define SORT_TRUST 13
#define SORT_SPAM 14
#define SORT_COUNT 15
#define SORT_UNREAD 16
#define SORT_FLAGGED 17
#define SORT_PATH 18
#define SORT_LABEL 19
#define SORT_AUX 20 /* $sort_thread_groups delegation to $sort_aux */
#define SORT_UID 21 /* used internally by the IMAP code */
/* Sort and sort_aux are shorts, and are a composite of a
* constant sort operation number and a set of compounded
* bitflags.
*
* Everything below SORT_MASK is a constant. There's room for
* SORT_MASK constant SORT_ values.
*
* Everything above is a bitflag. It's OK to move SORT_MASK
* down by powers of 2 if we need more, so long as we don't
* collide with the constants above. (Or we can just expand
* sort and sort_aux to uint32_t.)
*/
#define SORT_MASK ((1<<8) - 1)
#define SORT_REVERSE (1<<8)
#define SORT_LAST (1<<9)
typedef int sort_t (const void *, const void *);
sort_t *mutt_get_sort_func (int);
void mutt_clear_threads (CONTEXT *);
void mutt_sort_headers (CONTEXT *, int);
void mutt_sort_threads (CONTEXT *, int);
int mutt_select_sort (int);
THREAD *mutt_sort_subthreads (THREAD *, int);
WHERE short BrowserSort INITVAL (SORT_SUBJECT);
WHERE short BrowserSortMailboxes INITVAL (SORT_ORDER);
WHERE short Sort INITVAL (SORT_DATE);
WHERE short SortAux INITVAL (SORT_DATE); /* auxiliary sorting method */
WHERE short SortThreadGroups INITVAL (SORT_AUX); /* thread roots sorting method */
WHERE short SortAlias INITVAL (SORT_ALIAS);
WHERE short SidebarSortMethod INITVAL (SORT_ORDER);
/* FIXME: This one does not belong to here */
WHERE short PgpSortKeys INITVAL (SORT_ADDRESS);
#include "mapping.h"
extern const struct mapping_t SortMethods[];
|
