X-Git-Url: https://git.deb.at/w?p=pkg%2Fabook.git;a=blobdiff_plain;f=misc.c;h=0f96b7a878316948c11d98a70259865d5e70ac55;hp=9f0a0a3f6824dc88f7c28bdfacb35a1c4f2f7b16;hb=aa2211628a295b85990dbfd8af031d152b583f07;hpb=c6f9aac99da7e21fb3d717fe82f80382361a5dff

diff --git a/misc.c b/misc.c
index 9f0a0a3..0f96b7a 100644
--- a/misc.c
+++ b/misc.c
@@ -1,6 +1,6 @@
 
 /*
- * $Id: misc.c,v 1.21 2005/10/05 11:03:36 jheinonen Exp $
+ * $Id$
  *
  * by JH <jheinonen@users.sourceforge.net>
  *
@@ -19,6 +19,7 @@
 #	include "config.h"
 #endif
 #include <mbswidth.h>
+#include "abook.h"
 #include "misc.h"
 #include "xmalloc.h"
 
@@ -63,6 +64,41 @@ strtrim(char *s)
 	return s;
 }
 
+int
+is_number(char *p)
+{
+	if(!p || !*p || (*p == '-' && !*++p))
+		return 0;
+
+	for(; *p; p++)
+		if(!isdigit(*p))
+			return 0;
+
+	return 1;
+}
+
+#ifndef HAVE_STRCASESTR
+char *
+strcasestr(const char *haystack, const char *needle)
+{
+	int i;
+	int k;
+
+	assert(haystack != NULL);
+	assert(needle != NULL);
+
+	for(i=0; i<strlen(haystack)-strlen(needle)+1; i++) {
+		for(k=0; k<strlen(needle); k++, i++) {
+			if (tolower(haystack[i]) != tolower(needle[k]))
+				break;
+			else if ((k+1) == strlen(needle))
+				return &haystack[i];
+		}
+	}
+
+	return NULL;
+}
+#endif
 
 #ifdef HAVE_CONFIG_H
 #	include "config.h"
@@ -1076,3 +1112,189 @@ int main (void)
 #endif /* SNPRINTF_TEST */
 
 #endif /* !HAVE_SNPRINTF */
+
+
+
+
+/*
+ * List handling functions
+ */
+
+void
+abook_list_append(abook_list **list, char *str)
+{
+	abook_list *tmp;
+
+	if(!str)
+		return;
+
+	for(tmp = *list; tmp && tmp->next; tmp = tmp->next)
+		;
+
+	if(tmp) {
+		tmp->next = xmalloc(sizeof(abook_list));
+		tmp = tmp->next;
+	} else
+		tmp = *list = xmalloc(sizeof(abook_list));
+
+	tmp->data = xstrdup(str);
+	tmp->next = NULL;
+}
+
+void
+abook_list_free(abook_list **list)
+{
+	abook_list *prev = NULL, *tmp = *list;
+
+	if(!list)
+		return;
+
+	while(tmp) {
+		xfree(tmp->data);
+		prev = tmp;
+		tmp = tmp->next;
+		xfree(prev);
+	}
+
+	*list = NULL;
+}
+
+abook_list *
+csv_to_abook_list(char *str)
+{
+	char *start, *p = str, *end;
+	abook_list *list = NULL;
+
+	if(!str)
+		return NULL;
+
+	SKIPWS(p);
+	start = end = p;
+
+	while(*p) {
+		if(!strchr(", ", *p)) {
+			end = ++p;
+			continue;
+		}
+
+		if((*p == ',') && (end - start)) {
+			abook_list_append(&list, xstrndup(start, end - start));
+			p++;
+			SKIPWS(p);
+			start = end = p;
+			continue;
+		}
+
+		p++;
+	}
+	if(end - start)
+		abook_list_append(&list, xstrndup(start, end - start));
+
+	return list;
+}
+
+char *
+abook_list_to_csv(abook_list *list)
+{
+	abook_list *tmp;
+	char *res = NULL;
+
+	for(tmp = list; tmp; tmp = tmp->next) {
+		if(tmp == list)
+			res = xstrdup(tmp->data);
+		else {
+			res = xrealloc(res, strlen(res)+strlen(tmp->data)+2);
+			strcat(res, ",");
+			strcat(res, tmp->data);
+		}
+	}
+
+	return res;
+}
+
+void
+abook_list_rotate(abook_list **list, enum rotate_dir dir)
+{
+	abook_list *tmp = *list;
+
+	if(!tmp || !tmp->next)
+		return;
+
+	switch(dir) {
+		case ROTATE_LEFT:
+			for(; tmp && tmp->next; tmp = tmp->next)
+				;
+
+			tmp->next = *list;
+			tmp = *list;
+			*list = (*list)->next;
+			tmp->next = NULL;
+			break;
+		case ROTATE_RIGHT:
+			for(; tmp && tmp->next && tmp->next->next;
+					tmp = tmp->next)
+				;
+
+			tmp->next->next = *list;
+			*list = tmp->next;
+			tmp->next = NULL;
+			break;
+		default:
+			assert(0);
+	}
+}
+
+/* if str == NULL, deleting the list element */
+void
+abook_list_replace(abook_list **list, int index, char *str)
+{
+	abook_list *cur, *prev;
+	int i = 0;
+
+	cur = prev = *list;
+
+	if((index == 0) && !str) {
+		*list = cur->next;
+		free(cur->data);
+		free(cur);
+		return;
+	}
+	
+	while(1) {
+		if(!cur)
+			return;
+
+		if(i == index)
+			break;
+
+		prev = cur;
+		cur = cur->next;
+		i++;
+	}
+
+	if(str) {
+		free(cur->data);
+		cur->data = xstrdup(str);
+	} else {
+		prev->next = cur->next;
+		free(cur->data);
+		free(cur);
+	}
+}
+
+abook_list *
+abook_list_get(abook_list *list, int index)
+{
+	int i = 0;
+
+	while(1) {
+		if(!list)
+			return NULL;
+
+		if(i == index)
+			return list;
+
+		i++;
+		list = list->next;
+	}
+}