sort.h File Reference

Assorted sorting methods. More...

#include <stdbool.h>
#include "core/lib.h"

Include dependency graph for sort.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros
#define	mutt_numeric_cmp(a, b)   ((a) < (b) ? -1 : ((a) > (b) ? 1 : 0))

Typedefs
typedef int(*	sort_mail_t) (const struct Email *a, const struct Email *b, bool reverse)

Functions
int	mutt_compare_emails (const struct Email *a, const struct Email *b, enum MailboxType type, short sort, short sort_aux)
	Compare two emails using up to two sort methods -.
void	mutt_sort_headers (struct MailboxView *mv, bool init)
	Sort emails by their headers.
void	mutt_sort_order (struct Mailbox *m)
	Sort emails by their disk order.
const char *	mutt_get_name (const struct Address *a)
	Pick the best name to display from an address.

Detailed Description

Assorted sorting methods.

Authors

• Michael R. Elkins
• Richard Russon
• Pietro Cerutti

Copyright

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, see http://www.gnu.org/licenses/.

Definition in file sort.h.

Macro Definition Documentation

mutt_numeric_cmp

#define mutt_numeric_cmp	(		a,
			b
	)		((a) < (b) ? -1 : ((a) > (b) ? 1 : 0))

Definition at line 35 of file sort.h.

Typedef Documentation

sort_mail_t

typedef int(* sort_mail_t) (const struct Email *a, const struct Email *b, bool reverse)

Definition at line 49 of file sort.h.

Function Documentation

mutt_sort_headers()

void mutt_sort_headers	(	struct MailboxView *	mv,
		bool	init
	)

Sort emails by their headers.

Parameters

mv	Mailbox View
init	If true, rebuild the thread

Definition at line 350 of file sort.c.

{
  if (!mv)
    return;
 
  struct Mailbox *m = mv->mailbox;
  if (!m || !m->emails[0])
    return;
 
  OptNeedResort = false;
 
  if (m->msg_count == 0)
  {
    /* this function gets called by mutt_sync_mailbox(), which may have just
     * deleted all the messages.  the virtual message numbers are not updated
     * in that routine, so we must make sure to zero the vcount member.  */
    m->vcount = 0;
    mutt_clear_threads(mv->threads);
    mv->vsize = 0;
    return; /* nothing to do! */
  }
 
  if (m->verbose)
    mutt_message(_("Sorting mailbox..."));
 
  const bool c_score = cs_subset_bool(NeoMutt->sub, "score");
  if (OptNeedRescore && c_score)
  {
    for (int i = 0; i < m->msg_count; i++)
    {
      struct Email *e = m->emails[i];
      if (!e)
        break;
      mutt_score_message(m, e, true);
    }
  }
  OptNeedRescore = false;
 
  if (OptResortInit)
  {
    OptResortInit = false;
    init = true;
  }
 
  if (init)
    mutt_clear_threads(mv->threads);
 
  const bool threaded = mutt_using_threads();
  if (threaded)
  {
    mutt_sort_threads(mv->threads, init);
  }
  else
  {
    struct EmailCompare cmp = { 0 };
    cmp.type = mx_type(m);
    cmp.sort = cs_subset_sort(NeoMutt->sub, "sort");
    cmp.sort_aux = cs_subset_sort(NeoMutt->sub, "sort_aux");
    mutt_qsort_r((void *) m->emails, m->msg_count, sizeof(struct Email *),
                 compare_email_shim, &cmp);
  }
 
  /* adjust the virtual message numbers */
  m->vcount = 0;
  for (int i = 0; i < m->msg_count; i++)
  {
    struct Email *e_cur = m->emails[i];
    if (!e_cur)
      break;
 
    if ((e_cur->vnum != -1) || (e_cur->collapsed && e_cur->visible))
    {
      e_cur->vnum = m->vcount;
      m->v2r[m->vcount] = i;
      m->vcount++;
    }
    e_cur->msgno = i;
  }
 
  /* re-collapse threads marked as collapsed */
  if (threaded)
  {
    mutt_thread_collapse_collapsed(mv->threads);
    mv->vsize = mutt_set_vnum(m);
  }
 
  if (m->verbose)
    mutt_clear_error();
}

Here is the call graph for this function:

Here is the caller graph for this function:

mutt_sort_order()

void mutt_sort_order

(

struct Mailbox *

m

)

Sort emails by their disk order.

Parameters

m

Mailbox

Definition at line 444 of file sort.c.

{
  if (!m)
    return;
 
  struct EmailCompare cmp = { 0 };
  cmp.type = mx_type(m);
  cmp.sort = SORT_ORDER;
  mutt_qsort_r((void *) m->emails, m->msg_count, sizeof(struct Email *),
               compare_email_shim, &cmp);
}

Here is the call graph for this function:

Here is the caller graph for this function:

mutt_get_name()

const char * mutt_get_name

(

const struct Address *

a

)

Pick the best name to display from an address.

Parameters

a	Address to use

Return values

ptr	Display name

This function uses:

1. Alias for email address
2. Personal name
3. Email address

Definition at line 134 of file sort.c.

{
  struct Address *ali = NULL;
 
  if (a)
  {
    const bool c_reverse_alias = cs_subset_bool(NeoMutt->sub, "reverse_alias");
    if (c_reverse_alias && (ali = alias_reverse_lookup(a)) && ali->personal)
      return buf_string(ali->personal);
    if (a->personal)
      return buf_string(a->personal);
    if (a->mailbox)
      return mutt_addr_for_display(a);
  }
  /* don't return NULL to avoid segfault when printing/comparing */
  return "";
}

Here is the call graph for this function:

Here is the caller graph for this function: