forked from github/server
149 lines
3.7 KiB
C
149 lines
3.7 KiB
C
/* vi: set ts=2:
|
|
*
|
|
* $Id: vmap.c,v 1.2 2001/01/26 16:19:41 enno Exp $
|
|
* 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ö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.
|
|
*/
|
|
|
|
#ifdef _MSC_VER
|
|
#pragma warning (disable: 4711)
|
|
#endif
|
|
|
|
#include <assert.h>
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include <config.h>
|
|
#include "vmap.h"
|
|
|
|
unsigned int
|
|
vmap_lowerbound(const vmap * vm, const int key)
|
|
/* returns the index of the entry which has the greatest key that is less or
|
|
* equal to 'key' */
|
|
{
|
|
vmapentry *first = vm->data, *middle;
|
|
unsigned int half, len = vm->size;
|
|
while (len > 0) {
|
|
half = len / 2;
|
|
middle = first;
|
|
middle += half;
|
|
if (middle->key < key) {
|
|
first = middle + 1;
|
|
len = len - half - 1;
|
|
} else
|
|
len = half;
|
|
}
|
|
return first - vm->data;
|
|
}
|
|
|
|
void
|
|
vmap_init(vmap * map)
|
|
{
|
|
map->size = 0; /* !! */
|
|
map->maxsize = 4;
|
|
map->data = calloc(4, sizeof(vmapentry));
|
|
}
|
|
|
|
unsigned int
|
|
vmap_upperbound(const vmap * vm, const int key)
|
|
/* returns the index of the entry which has the smallest key that is greater
|
|
* or equal to 'key' */
|
|
{
|
|
unsigned int half, len = vm->size;
|
|
vmapentry *first = vm->data, *middle;
|
|
while (len > 0) {
|
|
half = len / 2;
|
|
middle = first;
|
|
middle += half;
|
|
if (key < middle->key)
|
|
len = half;
|
|
else {
|
|
first = middle + 1;
|
|
len = len - half - 1;
|
|
}
|
|
}
|
|
return first - vm->data;
|
|
}
|
|
|
|
unsigned int
|
|
vmap_get(vmap * vm, const int key)
|
|
{
|
|
unsigned int insert = vmap_lowerbound(vm, key);
|
|
vmapentry *at;
|
|
|
|
/* make sure it's a unique key: */
|
|
if (insert != vm->size && vm->data[insert].key == key)
|
|
return insert;
|
|
/* insert at this position: */
|
|
if (vm->size == vm->maxsize) {
|
|
/* need more space */
|
|
vm->maxsize *= 2;
|
|
vm->data = realloc(vm->data, vm->maxsize * sizeof(vmapentry));
|
|
}
|
|
at = vm->data + insert;
|
|
memmove(at + 1, at, (vm->size - insert) * sizeof(vmapentry)); /* !1.3! */
|
|
at->key = key;
|
|
at->value = 0;
|
|
++vm->size;
|
|
return insert;
|
|
}
|
|
|
|
unsigned int
|
|
vmap_insert(vmap * vm, const int key, void *data)
|
|
/* inserts an object into the vmap, identifies it with the 'key' which must be
|
|
* unique, and returns the vmapentry it created. */
|
|
{
|
|
unsigned int insert = vmap_lowerbound(vm, key);
|
|
vmapentry *at;
|
|
|
|
/* make sure it's a unique key: */
|
|
assert(insert == vm->size || vm->data[insert].key != key);
|
|
/* insert at this position: */
|
|
if (vm->size == vm->maxsize) {
|
|
/* need more space */
|
|
vm->maxsize = vm->maxsize ? (vm->maxsize * 2) : 4;
|
|
vm->data = realloc(vm->data, vm->maxsize * sizeof(vmapentry));
|
|
}
|
|
at = vm->data + insert;
|
|
memmove(at + 1, at, (vm->size - insert) * sizeof(vmapentry));
|
|
at->key = key;
|
|
at->value = data;
|
|
++vm->size;
|
|
return insert;
|
|
}
|
|
|
|
unsigned int
|
|
vmap_find(const vmap * vm, const int key)
|
|
/* returns the index of the vmapentry that's identified by the key or size (a
|
|
* past-the-end value) if it is not found. */
|
|
{
|
|
vmapentry *first = vm->data, *middle;
|
|
unsigned int half, len = vm->size;
|
|
while (len > 0) {
|
|
half = len / 2;
|
|
middle = first;
|
|
middle += half;
|
|
if (middle->key < key) {
|
|
first = middle + 1;
|
|
len = len - half - 1;
|
|
} else
|
|
len = half;
|
|
}
|
|
if (first != vm->data + vm->size && first->key == key)
|
|
return first - vm->data;
|
|
else
|
|
return vm->size;
|
|
}
|