mirror of
https://github.com/profanity-im/profanity.git
synced 2024-12-04 14:46:46 -05:00
137 lines
3.2 KiB
C
137 lines
3.2 KiB
C
/*
|
|
* contact_list.c
|
|
*
|
|
* Copyright (C) 2012 James Booth <boothj5@gmail.com>
|
|
*
|
|
* This file is part of Profanity.
|
|
*
|
|
* Profanity 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 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* Profanity 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 Profanity. If not, see <http://www.gnu.org/licenses/>.
|
|
*
|
|
*/
|
|
|
|
#include <string.h>
|
|
|
|
#include <glib.h>
|
|
|
|
#include "contact.h"
|
|
#include "log.h"
|
|
#include "prof_autocomplete.h"
|
|
|
|
static PAutocomplete ac;
|
|
static GHashTable *contacts;
|
|
|
|
static gboolean _key_equals(void *key1, void *key2);
|
|
|
|
void
|
|
contact_list_init(void)
|
|
{
|
|
ac = p_autocomplete_new();
|
|
contacts = g_hash_table_new_full(g_str_hash, (GEqualFunc)_key_equals, g_free,
|
|
(GDestroyNotify)p_contact_free);
|
|
}
|
|
|
|
void
|
|
contact_list_clear(void)
|
|
{
|
|
p_autocomplete_clear(ac);
|
|
g_hash_table_remove_all(contacts);
|
|
}
|
|
|
|
void
|
|
contact_list_reset_search_attempts(void)
|
|
{
|
|
p_autocomplete_reset(ac);
|
|
}
|
|
|
|
gboolean
|
|
contact_list_add(const char * const jid, const char * const name,
|
|
const char * const presence, const char * const status,
|
|
const char * const subscription)
|
|
{
|
|
gboolean added = FALSE;
|
|
PContact contact = g_hash_table_lookup(contacts, jid);
|
|
|
|
if (contact == NULL) {
|
|
contact = p_contact_new(jid, name, presence, status, subscription);
|
|
g_hash_table_insert(contacts, strdup(jid), contact);
|
|
p_autocomplete_add(ac, strdup(jid));
|
|
added = TRUE;
|
|
}
|
|
|
|
return added;
|
|
}
|
|
|
|
gboolean
|
|
contact_list_update_contact(const char * const jid, const char * const presence,
|
|
const char * const status)
|
|
{
|
|
gboolean changed = FALSE;
|
|
PContact contact = g_hash_table_lookup(contacts, jid);
|
|
|
|
if (contact == NULL) {
|
|
log_warning("Contact not in list: %s", jid);
|
|
return FALSE;
|
|
}
|
|
|
|
if (g_strcmp0(p_contact_presence(contact), presence) != 0) {
|
|
p_contact_set_presence(contact, presence);
|
|
changed = TRUE;
|
|
}
|
|
|
|
if (g_strcmp0(p_contact_status(contact), status) != 0) {
|
|
p_contact_set_status(contact, status);
|
|
changed = TRUE;
|
|
}
|
|
|
|
return changed;
|
|
}
|
|
|
|
GSList *
|
|
get_contact_list(void)
|
|
{
|
|
GSList *result = NULL;
|
|
GHashTableIter iter;
|
|
gpointer key;
|
|
gpointer value;
|
|
|
|
g_hash_table_iter_init(&iter, contacts);
|
|
while (g_hash_table_iter_next(&iter, &key, &value)) {
|
|
result = g_slist_append(result, value);
|
|
}
|
|
|
|
// resturn all contact structs
|
|
return result;
|
|
}
|
|
|
|
char *
|
|
contact_list_find_contact(char *search_str)
|
|
{
|
|
return p_autocomplete_complete(ac, search_str);
|
|
}
|
|
|
|
PContact
|
|
contact_list_get_contact(const char const *jid)
|
|
{
|
|
return g_hash_table_lookup(contacts, jid);
|
|
}
|
|
|
|
static
|
|
gboolean _key_equals(void *key1, void *key2)
|
|
{
|
|
gchar *str1 = (gchar *) key1;
|
|
gchar *str2 = (gchar *) key2;
|
|
|
|
return (g_strcmp0(str1, str2) == 0);
|
|
}
|