Crypto Key sorting functions. More...

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

Enumerations
enum	KeySortType { KEY_SORT_ADDRESS , KEY_SORT_DATE , KEY_SORT_KEYID , KEY_SORT_TRUST }
	Methods for sorting Crypto Keys. More...

Functions
void	gpgme_sort_keys (struct CryptKeyInfoArray *ckia)
	Sort an array of GPGME keys.
void	pgp_sort_keys (struct PgpUidArray *pua)
	Sort an array of PGP keys.

Detailed Description

Crypto Key sorting functions.

Authors

Richard Russon

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.

Enumeration Type Documentation

◆ KeySortType

enum KeySortType

Methods for sorting Crypto Keys.

Enumerator
KEY_SORT_ADDRESS	Sort by address.
KEY_SORT_DATE	Sort by date.
KEY_SORT_KEYID	Sort by key id.
KEY_SORT_TRUST	Sort by trust level.

Definition at line 32 of file sort.h.

{
  KEY_SORT_ADDRESS,    
  KEY_SORT_DATE,       
  KEY_SORT_KEYID,      
  KEY_SORT_TRUST,      
};

Function Documentation

◆ gpgme_sort_keys()

void gpgme_sort_keys ( struct CryptKeyInfoArray * ckia )

Sort an array of GPGME keys.

Parameters

ckia	Array to sort

Sort GPGME keys according to $pgp_sort_keys

Definition at line 176 of file sort_gpgme.c.

{
  const short c_pgp_sort_keys = cs_subset_sort(NeoMutt->sub, "pgp_key_sort");
  sort_t fn = NULL;
  switch (c_pgp_sort_keys & SORT_MASK)
  {
    case KEY_SORT_ADDRESS:
      fn = crypt_sort_address;
      break;
    case KEY_SORT_DATE:
      fn = crypt_sort_date;
      break;
    case KEY_SORT_KEYID:
      fn = crypt_sort_keyid;
      break;
    case KEY_SORT_TRUST:
    default:
      fn = crypt_sort_trust;
      break;
  }
 
  if (ARRAY_SIZE(ckia) > 1)
  {
    bool sort_reverse = c_pgp_sort_keys & SORT_REVERSE;
    ARRAY_SORT(ckia, fn, &sort_reverse);
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pgp_sort_keys()

void pgp_sort_keys ( struct PgpUidArray * pua )

Sort an array of PGP keys.

Parameters

pua	Array to sort

Sort PGP keys according to $pgp_sort_keys

Definition at line 142 of file sort_pgp.c.

{
  if (!pua)
    return;
 
  sort_t fn = NULL;
  short c_pgp_sort_keys = cs_subset_sort(NeoMutt->sub, "pgp_key_sort");
  switch (c_pgp_sort_keys & SORT_MASK)
  {
    case KEY_SORT_ADDRESS:
      fn = pgp_sort_address;
      break;
    case KEY_SORT_DATE:
      fn = pgp_sort_date;
      break;
    case KEY_SORT_KEYID:
      fn = pgp_sort_keyid;
      break;
    case KEY_SORT_TRUST:
    default:
      fn = pgp_sort_trust;
      break;
  }
 
  if (ARRAY_SIZE(pua) > 1)
  {
    bool sort_reverse = c_pgp_sort_keys & SORT_REVERSE;
    ARRAY_SORT(pua, fn, &sort_reverse);
  }
}