sort.c

Go to the documentation of this file.

 
#include "config.h"
#include <stdbool.h>
#include "private.h"
#include "mutt/lib.h"
#include "config/lib.h"
#include "core/lib.h"
#include "sort.h"
 
static int sb_sort_count(const void *a, const void *b, void *sdata)
{
  const struct SbEntry *sbe1 = *(struct SbEntry const *const *) a;
  const struct SbEntry *sbe2 = *(struct SbEntry const *const *) b;
  const struct Mailbox *m1 = sbe1->mailbox;
  const struct Mailbox *m2 = sbe2->mailbox;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = 0;
  if (m1->msg_count == m2->msg_count)
    rc = mutt_str_coll(mailbox_path(m1), mailbox_path(m2));
  else
    rc = mutt_numeric_cmp(m2->msg_count, m1->msg_count);
 
  return sort_reverse ? -rc : rc;
}
 
static int sb_sort_desc(const void *a, const void *b, void *sdata)
{
  const struct SbEntry *sbe1 = *(struct SbEntry const *const *) a;
  const struct SbEntry *sbe2 = *(struct SbEntry const *const *) b;
  const struct Mailbox *m1 = sbe1->mailbox;
  const struct Mailbox *m2 = sbe2->mailbox;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = mutt_str_cmp(m1->name, m2->name);
  return sort_reverse ? -rc : rc;
}
 
static int sb_sort_flagged(const void *a, const void *b, void *sdata)
{
  const struct SbEntry *sbe1 = *(struct SbEntry const *const *) a;
  const struct SbEntry *sbe2 = *(struct SbEntry const *const *) b;
  const struct Mailbox *m1 = sbe1->mailbox;
  const struct Mailbox *m2 = sbe2->mailbox;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = 0;
  if (m1->msg_flagged == m2->msg_flagged)
    rc = mutt_str_coll(mailbox_path(m1), mailbox_path(m2));
  else
    rc = mutt_numeric_cmp(m2->msg_flagged, m1->msg_flagged);
 
  return sort_reverse ? -rc : rc;
}
 
static int sb_sort_path(const void *a, const void *b, void *sdata)
{
  const struct SbEntry *sbe1 = *(struct SbEntry const *const *) a;
  const struct SbEntry *sbe2 = *(struct SbEntry const *const *) b;
  const struct Mailbox *m1 = sbe1->mailbox;
  const struct Mailbox *m2 = sbe2->mailbox;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = 0;
  rc = mutt_str_inbox_cmp(mailbox_path(m1), mailbox_path(m2));
  if (rc == 0)
    rc = mutt_str_coll(mailbox_path(m1), mailbox_path(m2));
 
  return sort_reverse ? -rc : rc;
}
 
static int sb_sort_unread(const void *a, const void *b, void *sdata)
{
  const struct SbEntry *sbe1 = *(struct SbEntry const *const *) a;
  const struct SbEntry *sbe2 = *(struct SbEntry const *const *) b;
  const struct Mailbox *m1 = sbe1->mailbox;
  const struct Mailbox *m2 = sbe2->mailbox;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = 0;
  if (m1->msg_unread == m2->msg_unread)
    rc = mutt_str_coll(mailbox_path(m1), mailbox_path(m2));
  else
    rc = mutt_numeric_cmp(m2->msg_unread, m1->msg_unread);
 
  return sort_reverse ? -rc : rc;
}
 
static int sb_sort_order(const void *a, const void *b, void *sdata)
{
  const struct SbEntry *sbe1 = *(struct SbEntry const *const *) a;
  const struct SbEntry *sbe2 = *(struct SbEntry const *const *) b;
  const struct Mailbox *m1 = sbe1->mailbox;
  const struct Mailbox *m2 = sbe2->mailbox;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = mutt_numeric_cmp(m1->gen, m2->gen);
  return sort_reverse ? -rc : rc;
}
 
static int sb_sort_unsorted(const void *a, const void *b, void *sdata)
{
  const struct SbEntry *sbe1 = *(struct SbEntry const *const *) a;
  const struct SbEntry *sbe2 = *(struct SbEntry const *const *) b;
 
  // This sort method isn't affected by the reverse flag
  return (sbe1->mailbox->gen - sbe2->mailbox->gen);
}
 
void sb_sort_entries(struct SidebarWindowData *wdata, enum SortType sort)
{
  sort_t fn = sb_sort_unsorted;
 
  switch (sort & SORT_MASK)
  {
    case SORT_COUNT:
      fn = sb_sort_count;
      break;
    case SORT_DESC:
      fn = sb_sort_desc;
      break;
    case SORT_FLAGGED:
      fn = sb_sort_flagged;
      break;
    case SORT_PATH:
      fn = sb_sort_path;
      break;
    case SORT_UNREAD:
      fn = sb_sort_unread;
      break;
    case SORT_ORDER:
      fn = sb_sort_order;
      FALLTHROUGH;
    default:
      break;
  }
 
  bool sort_reverse = (sort & SORT_REVERSE);
  ARRAY_SORT(&wdata->entries, fn, &sort_reverse);
}