diff options
| author | David Bremner <david@tethera.net> | 2019-02-25 21:57:40 -0400 |
|---|---|---|
| committer | David Bremner <david@tethera.net> | 2019-05-25 07:17:27 -0300 |
| commit | 75bdce79527571c12c5de0c630747d6262b73fbd (patch) | |
| tree | 3b6b293ab053d247e74224337cd3eeb080facf07 /lib/database.cc | |
| parent | b52cda90f0b05ce5055fb840e6d9dd88c09f1f83 (diff) | |
lib: support user prefix names in term generation
This should not change the indexing process yet as nothing calls
_notmuch_message_gen_terms with a user prefix name. On the other hand,
it should not break anything either.
_notmuch_database_prefix does a linear walk of the list of (built-in)
prefixes, followed by a logarithmic time search of the list of user
prefixes. The latter is probably not really noticable.
Diffstat (limited to 'lib/database.cc')
| -rw-r--r-- | lib/database.cc | 20 |
1 files changed, 20 insertions, 0 deletions
diff --git a/lib/database.cc b/lib/database.cc index 4f02815f..b3fe6373 100644 --- a/lib/database.cc +++ b/lib/database.cc @@ -422,6 +422,26 @@ _find_prefix (const char *name) return ""; } +/* Like find prefix, but include the possibility of user defined + * prefixes specific to this database */ + +const char * +_notmuch_database_prefix (notmuch_database_t *notmuch, const char *name) +{ + unsigned int i; + + /*XXX TODO: reduce code duplication */ + for (i = 0; i < ARRAY_SIZE (prefix_table); i++) { + if (strcmp (name, prefix_table[i].name) == 0) + return prefix_table[i].prefix; + } + + if (notmuch->user_prefix) + return _notmuch_string_map_get (notmuch->user_prefix, name); + + return NULL; +} + static const struct { /* NOTMUCH_FEATURE_* value. */ _notmuch_features value; |
