view Meerwald/coord.c @ 4:9cf6ec970448 v0.5

mention filter param.
author Peter Meerwald <pmeerw@cosy.sbg.ac.at>
date Tue, 14 Aug 2007 21:13:11 +0200
parents be303a3f5ea8
children f83ef905a63d
line wrap: on
line source

#include <stdlib.h>
#include <stdio.h>
#include "coord.h"

struct coords *alloc_coords(int n) {
  struct coords *c;

  if (c = malloc(sizeof(struct coords)))
    init_coords(c, n);
#ifdef DEBUG
  else
    fprintf(stderr, "alloc_coords(): malloc failed\n");
#endif

  return c;
}

void free_coords(struct coords *c) {

#ifdef DEBUG
  if (!c)
    fprintf(stderr, "free_coords(): got NULL pointer\n");
#endif

  free(c->values);
  free(c);
}

int init_coords(struct coords *c, int n) {

#ifdef DEBUG
  if (!c)
    fprintf(stderr, "init_coords(): got NULL poiner\n");

  if (n <= 0)
    fprintf(stderr, "init_coords(): n out of range\n");
#endif

  c->count = 0;
  c->max = n;

  if (c->values = malloc(n * sizeof(struct coord)))
    return 0;
  else
    return -1;
}

int add_coord(struct coords *c, int x, int y) {
  struct coord *v;
  int n;

#ifdef DEBUG
  if (!c)
    fprintf(stderr, "add_coord(): got NULL pointer\n");

  if (c->count >= c->max)
    fprintf(stderr, "add_coord(): maximum reached\n");
#endif

  v = c->values;

  for (n = 0; n < c->count; v++, n++)
    if (v->x == x && v->y == y) break;

  if (n == c->count) {
    v->x = x;
    v->y = y;
    c->count++;
    return 0;
  }
  else
    return -1;
}


Repositories maintained by Peter Meerwald, pmeerw@pmeerw.net.