about summary refs log tree commit diff stats
path: root/src/contact_list.c
blob: d05d7412b154338af434ca6fc0ba1c2ac6871fda (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
/*
 * 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);
}