blob: 5a83c94121f5e4fcfac22ecbdb4d192955c490f2 (
plain)
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
|
/*
* Copyright (C) 1996-8 Michael R. Elkins <me@cs.hmc.edu>
*
* 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., 675 Mass Ave, Cambridge, MA 02139, 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_MASK 0xf
#define SORT_REVERSE (1<<4)
#define SORT_LAST (1<<5)
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);
HEADER *mutt_sort_subthreads (HEADER *, sort_t *);
WHERE short BrowserSort INITVAL (SORT_SUBJECT);
WHERE short Sort INITVAL (SORT_DATE);
WHERE short SortAux INITVAL (SORT_DATE); /* auxiallary sorting method */
WHERE short SortAlias INITVAL (SORT_ALIAS);
#ifdef _PGPPATH
WHERE short PgpSortKeys INITVAL (SORT_ADDRESS);
#endif
extern const struct mapping_t SortMethods[];
|
