2012-05-13 16:40:39 -04:00
|
|
|
/*
|
|
|
|
* prof_autocomplete.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 <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
#include "prof_autocomplete.h"
|
|
|
|
|
|
|
|
struct p_autocomplete_t {
|
|
|
|
GSList *items;
|
|
|
|
GSList *last_found;
|
|
|
|
gchar *search_str;
|
2012-05-19 19:38:16 -04:00
|
|
|
PStrFunc str_func;
|
|
|
|
PCopyFunc copy_func;
|
2012-05-23 19:33:23 -04:00
|
|
|
PEqualDeepFunc equal_deep_func;
|
2012-05-19 19:38:16 -04:00
|
|
|
GDestroyNotify free_func;
|
2012-05-13 16:40:39 -04:00
|
|
|
};
|
|
|
|
|
2012-05-19 19:38:16 -04:00
|
|
|
static gchar * _search_from(PAutocomplete ac, GSList *curr);
|
2012-05-17 20:33:40 -04:00
|
|
|
static const char *_str_func_default(const char *orig);
|
2012-05-19 19:09:33 -04:00
|
|
|
static const char *_copy_func_default(const char *orig);
|
2012-05-23 19:33:23 -04:00
|
|
|
static int _deep_equals_func_default(const char *o1, const char *o2);
|
2012-05-13 16:40:39 -04:00
|
|
|
|
2012-07-24 18:19:48 -04:00
|
|
|
PAutocomplete
|
|
|
|
p_autocomplete_new(void)
|
2012-05-19 19:54:17 -04:00
|
|
|
{
|
2012-05-23 19:33:23 -04:00
|
|
|
return p_obj_autocomplete_new(NULL, NULL, NULL, NULL);
|
2012-05-19 19:54:17 -04:00
|
|
|
}
|
|
|
|
|
2012-07-24 18:19:48 -04:00
|
|
|
PAutocomplete
|
|
|
|
p_obj_autocomplete_new(PStrFunc str_func, PCopyFunc copy_func,
|
2012-05-23 19:33:23 -04:00
|
|
|
PEqualDeepFunc equal_deep_func, GDestroyNotify free_func)
|
2012-05-13 16:40:39 -04:00
|
|
|
{
|
|
|
|
PAutocomplete new = malloc(sizeof(struct p_autocomplete_t));
|
|
|
|
new->items = NULL;
|
|
|
|
new->last_found = NULL;
|
|
|
|
new->search_str = NULL;
|
|
|
|
|
2012-05-19 19:38:16 -04:00
|
|
|
if (str_func)
|
|
|
|
new->str_func = str_func;
|
|
|
|
else
|
|
|
|
new->str_func = (PStrFunc)_str_func_default;
|
|
|
|
|
|
|
|
if (copy_func)
|
|
|
|
new->copy_func = copy_func;
|
|
|
|
else
|
|
|
|
new->copy_func = (PCopyFunc)_copy_func_default;
|
|
|
|
|
|
|
|
if (free_func)
|
|
|
|
new->free_func = free_func;
|
|
|
|
else
|
|
|
|
new->free_func = (GDestroyNotify)free;
|
|
|
|
|
2012-05-23 19:33:23 -04:00
|
|
|
if (equal_deep_func)
|
|
|
|
new->equal_deep_func = equal_deep_func;
|
|
|
|
else
|
|
|
|
new->equal_deep_func = (PEqualDeepFunc)_deep_equals_func_default;
|
|
|
|
|
2012-05-13 16:40:39 -04:00
|
|
|
return new;
|
|
|
|
}
|
|
|
|
|
2012-07-24 18:19:48 -04:00
|
|
|
void
|
|
|
|
p_autocomplete_clear(PAutocomplete ac)
|
2012-05-13 16:40:39 -04:00
|
|
|
{
|
2012-05-19 19:38:16 -04:00
|
|
|
g_slist_free_full(ac->items, ac->free_func);
|
2012-05-13 16:40:39 -04:00
|
|
|
ac->items = NULL;
|
|
|
|
|
|
|
|
p_autocomplete_reset(ac);
|
|
|
|
}
|
|
|
|
|
2012-07-24 18:19:48 -04:00
|
|
|
void
|
|
|
|
p_autocomplete_reset(PAutocomplete ac)
|
2012-05-13 16:40:39 -04:00
|
|
|
{
|
|
|
|
ac->last_found = NULL;
|
|
|
|
if (ac->search_str != NULL) {
|
|
|
|
free(ac->search_str);
|
|
|
|
ac->search_str = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-07-24 18:19:48 -04:00
|
|
|
gboolean
|
|
|
|
p_autocomplete_add(PAutocomplete ac, void *item)
|
2012-05-13 16:40:39 -04:00
|
|
|
{
|
|
|
|
if (ac->items == NULL) {
|
|
|
|
ac->items = g_slist_append(ac->items, item);
|
2012-05-23 18:46:54 -04:00
|
|
|
return TRUE;
|
2012-05-13 16:40:39 -04:00
|
|
|
} else {
|
|
|
|
GSList *curr = ac->items;
|
|
|
|
|
|
|
|
while(curr) {
|
|
|
|
|
|
|
|
// insert
|
2012-05-19 19:38:16 -04:00
|
|
|
if (g_strcmp0(ac->str_func(curr->data), ac->str_func(item)) > 0) {
|
2012-05-13 16:40:39 -04:00
|
|
|
ac->items = g_slist_insert_before(ac->items,
|
|
|
|
curr, item);
|
2012-05-23 18:46:54 -04:00
|
|
|
return TRUE;
|
2012-05-13 16:40:39 -04:00
|
|
|
|
|
|
|
// update
|
2012-05-19 19:38:16 -04:00
|
|
|
} else if (g_strcmp0(ac->str_func(curr->data), ac->str_func(item)) == 0) {
|
2012-05-23 19:33:23 -04:00
|
|
|
// only update if data different
|
|
|
|
if (!ac->equal_deep_func(curr->data, item)) {
|
|
|
|
ac->free_func(curr->data);
|
|
|
|
curr->data = item;
|
|
|
|
return TRUE;
|
|
|
|
} else {
|
|
|
|
return FALSE;
|
|
|
|
}
|
2012-05-13 16:40:39 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
curr = g_slist_next(curr);
|
|
|
|
}
|
|
|
|
|
|
|
|
// hit end, append
|
|
|
|
ac->items = g_slist_append(ac->items, item);
|
|
|
|
|
2012-05-23 18:46:54 -04:00
|
|
|
return TRUE;
|
2012-05-13 16:40:39 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-07-24 18:19:48 -04:00
|
|
|
gboolean
|
|
|
|
p_autocomplete_remove(PAutocomplete ac, const char * const item)
|
2012-05-13 16:40:39 -04:00
|
|
|
{
|
|
|
|
// reset last found if it points to the item to be removed
|
|
|
|
if (ac->last_found != NULL)
|
2012-05-19 19:38:16 -04:00
|
|
|
if (g_strcmp0(ac->str_func(ac->last_found->data), item) == 0)
|
2012-05-13 16:40:39 -04:00
|
|
|
ac->last_found = NULL;
|
|
|
|
|
|
|
|
if (!ac->items) {
|
2012-05-23 18:46:54 -04:00
|
|
|
return FALSE;
|
2012-05-13 16:40:39 -04:00
|
|
|
} else {
|
|
|
|
GSList *curr = ac->items;
|
|
|
|
|
|
|
|
while(curr) {
|
2012-05-19 19:38:16 -04:00
|
|
|
if (g_strcmp0(ac->str_func(curr->data), item) == 0) {
|
2012-05-13 18:06:01 -04:00
|
|
|
void *current_item = curr->data;
|
2012-05-13 16:40:39 -04:00
|
|
|
ac->items = g_slist_remove(ac->items, curr->data);
|
2012-05-19 19:38:16 -04:00
|
|
|
ac->free_func(current_item);
|
2012-05-13 16:40:39 -04:00
|
|
|
|
2012-05-23 18:46:54 -04:00
|
|
|
return TRUE;
|
2012-05-13 16:40:39 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
curr = g_slist_next(curr);
|
|
|
|
}
|
|
|
|
|
2012-05-23 18:46:54 -04:00
|
|
|
return FALSE;
|
2012-05-13 16:40:39 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-07-24 18:19:48 -04:00
|
|
|
GSList *
|
|
|
|
p_autocomplete_get_list(PAutocomplete ac)
|
2012-05-13 16:40:39 -04:00
|
|
|
{
|
|
|
|
GSList *copy = NULL;
|
|
|
|
GSList *curr = ac->items;
|
|
|
|
|
|
|
|
while(curr) {
|
2012-05-19 19:38:16 -04:00
|
|
|
copy = g_slist_append(copy, ac->copy_func(curr->data));
|
2012-05-13 16:40:39 -04:00
|
|
|
curr = g_slist_next(curr);
|
|
|
|
}
|
|
|
|
|
|
|
|
return copy;
|
|
|
|
}
|
|
|
|
|
2012-07-24 18:19:48 -04:00
|
|
|
gchar *
|
|
|
|
p_autocomplete_complete(PAutocomplete ac, gchar *search_str)
|
2012-05-13 16:40:39 -04:00
|
|
|
{
|
|
|
|
gchar *found = NULL;
|
|
|
|
|
|
|
|
// no items to search
|
|
|
|
if (!ac->items)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
// first search attempt
|
|
|
|
if (ac->last_found == NULL) {
|
|
|
|
ac->search_str =
|
|
|
|
(gchar *) malloc((strlen(search_str) + 1) * sizeof(gchar));
|
|
|
|
strcpy(ac->search_str, search_str);
|
|
|
|
|
2012-05-19 19:38:16 -04:00
|
|
|
found = _search_from(ac, ac->items);
|
2012-05-13 16:40:39 -04:00
|
|
|
return found;
|
|
|
|
|
|
|
|
// subsequent search attempt
|
|
|
|
} else {
|
|
|
|
// search from here+1 tp end
|
2012-05-19 19:38:16 -04:00
|
|
|
found = _search_from(ac, g_slist_next(ac->last_found));
|
2012-05-13 16:40:39 -04:00
|
|
|
if (found != NULL)
|
|
|
|
return found;
|
|
|
|
|
|
|
|
// search from beginning
|
2012-05-19 19:38:16 -04:00
|
|
|
found = _search_from(ac, ac->items);
|
2012-05-13 16:40:39 -04:00
|
|
|
if (found != NULL)
|
|
|
|
return found;
|
|
|
|
|
|
|
|
// we found nothing, reset search
|
|
|
|
p_autocomplete_reset(ac);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-07-24 18:19:48 -04:00
|
|
|
static gchar *
|
|
|
|
_search_from(PAutocomplete ac, GSList *curr)
|
2012-05-13 16:40:39 -04:00
|
|
|
{
|
|
|
|
while(curr) {
|
|
|
|
|
|
|
|
// match found
|
2012-05-19 19:38:16 -04:00
|
|
|
if (strncmp(ac->str_func(curr->data),
|
2012-05-13 16:40:39 -04:00
|
|
|
ac->search_str,
|
2012-05-17 20:33:40 -04:00
|
|
|
strlen(ac->search_str)) == 0) {
|
2012-05-13 16:40:39 -04:00
|
|
|
gchar *result =
|
2012-05-19 19:38:16 -04:00
|
|
|
(gchar *) malloc((strlen(ac->str_func(curr->data)) + 1) * sizeof(gchar));
|
2012-05-13 16:40:39 -04:00
|
|
|
|
|
|
|
// set pointer to last found
|
|
|
|
ac->last_found = curr;
|
|
|
|
|
|
|
|
// return the string, must be free'd by caller
|
2012-05-19 19:38:16 -04:00
|
|
|
strcpy(result, ac->str_func(curr->data));
|
2012-05-13 16:40:39 -04:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
curr = g_slist_next(curr);
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2012-07-24 18:19:48 -04:00
|
|
|
static const char *
|
|
|
|
_str_func_default(const char *orig)
|
2012-05-17 20:33:40 -04:00
|
|
|
{
|
|
|
|
return orig;
|
|
|
|
}
|
|
|
|
|
2012-07-24 18:19:48 -04:00
|
|
|
static const char *
|
|
|
|
_copy_func_default(const char *orig)
|
2012-05-19 19:09:33 -04:00
|
|
|
{
|
|
|
|
return strdup(orig);
|
|
|
|
}
|
|
|
|
|
2012-07-24 18:19:48 -04:00
|
|
|
static int
|
|
|
|
_deep_equals_func_default(const char *o1, const char *o2)
|
2012-05-23 19:33:23 -04:00
|
|
|
{
|
|
|
|
return (strcmp(o1, o2) == 0);
|
|
|
|
}
|