server/src/common/util/goodies.c

111 lines
2 KiB
C
Raw Normal View History

2001-01-25 10:37:55 +01:00
/* vi: set ts=2:
*
* $Id: goodies.c,v 1.3 2001/02/09 13:53:52 corwin Exp $
2001-01-25 10:37:55 +01:00
* Eressea PB(E)M host Copyright (C) 1998-2000
* Christian Schlittchen (corwin@amber.kn-bremen.de)
* Katja Zedel (katze@felidae.kn-bremen.de)
* Henning Peters (faroul@beyond.kn-bremen.de)
* Enno Rehling (enno@eressea-pbem.de)
* Ingo Wilken (Ingo.Wilken@informatik.uni-oldenburg.de)
*
* based on:
*
* Atlantis v1.0 13 September 1993 Copyright 1993 by Russell Wallace
* Atlantis v1.7 Copyright 1996 by Alex Schr<EFBFBD>der
*
* This program may not be used, modified or distributed without
* prior permission by the authors of Eressea.
* This program may not be sold or used commercially without prior written
* permission from the authors.
*/
#include <config.h>
#include "goodies.h"
/* libc includes */
#include <ctype.h>
#include <stdlib.h>
#include <string.h>
/* Simple Integer-Liste */
int *
intlist_init(void)
{
return (calloc(1, sizeof(int)));
}
int *
intlist_add(int *i_p, int i)
{
i_p[0]++;
i_p = realloc(i_p, (i_p[0]+1) * sizeof(int));
i_p[i_p[0]] = i;
return (i_p);
}
int *
intlist_find(int *i_p, int fi)
{
int i;
for(i=1; i <= i_p[0]; i++) {
if(i_p[i] == fi) return (&i_p[i]);
}
return NULL;
}
int
hashstring(const char* s)
{
int key = 0;
int i = strlen(s);
while (i) {
--i;
key = ((key >> 31) & 1) ^ (key << 1) ^ s[i];
}
return key & 0x7fff;
}
/* Standardfunktion aus Sedgewick: Algorithmen in C++ */
#define HASH_MAX 100001
int
hashstring_new(const char* s)
{
int key = 0;
int i = strlen(s);
while (i) {
--i;
key = (256 * key + s[i])%HASH_MAX;
}
return key /* & 0x7fffffff */;
}
2001-01-25 10:37:55 +01:00
char *
escape_string(char * str, char replace)
{
char * c = str;
while (*c) {if (isspace(*c)) *c = replace; c++;}
return str;
}
char *
unescape_string(char * str, char replace)
{
char * c = str;
while (*c) { if (*c==replace) *c = ' '; c++; }
return str;
}
char *
set_string (char **s, const char *neu)
{
*s = realloc(*s, strlen(neu) + 1);
return strcpy(*s, neu);
}