pssac2/array.c at master · savage13/pssac2 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166

#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <stddef.h>
#include <string.h>

#ifdef WIN32
#define pointer char *
#else
#define pointer void *
#endif

struct xarray_header {
  size_t len;
  size_t nalloc;
  char   type;
  size_t size;
  char   buf[];
};

struct xarray_header *
xarray_header(void *a) {
  struct xarray_header *ah;
  if(!a || !(ah = (struct xarray_header *)((pointer) a - offsetof(struct xarray_header, buf)))) {
    return NULL;
  }
  return ah;
}

int
xarray_length(void *a) {
  struct xarray_header *ah;
  if(!(ah = xarray_header(a))) {
    return 0;
  }
  return ah->len;
}

void *
xarray_new_with_len(char t, size_t n) {
  struct xarray_header *ah;
  size_t size;
  size_t nalloc = 2;
  switch(t) {
  case 'p': size = sizeof(void *); break;
  case 'i': size = sizeof(int); break;
  case 'f': size = sizeof(float); break;
  case 'd': size = sizeof(double); break;
  case 'c': size = sizeof(char); break;
  default: size = 0; break;
  }
  if(size == 0) {
    printf("arr invalid element type\n");
    return NULL;
  }
  while(n > nalloc) {
    nalloc *= 2;
  }
  ah = malloc(sizeof *ah + size * nalloc);
  if(!ah) {
    return NULL;
  }
  ah->len    = n;
  ah->nalloc = nalloc;
  ah->type   = t;
  ah->size   = size;
  return (void *) ah->buf;
}

void *
xarray_new(char t) {
  return xarray_new_with_len(t, 0);
}


void
xarray_free(void *a) {
  struct xarray_header *ah;
  if(!(ah = xarray_header(a))) {
    return;
  }
  free(ah);
}

void
xarray_clear(void *a) {
  struct xarray_header *ah;
  if(!(ah = xarray_header(a))) {
    return;
  }
  memset(a, 0, ah->size * ah->nalloc);
  ah->len = 0;
}

struct xarray_header *
xarray_grow(struct xarray_header *ah, size_t n) {
  struct xarray_header *new;
  if(n < ah->nalloc) {
    return ah;
  }
  while(n >= ah->nalloc) {
    ah->nalloc *= 2;
  }
  new = realloc(ah, sizeof(struct xarray_header) + ah->size * ah->nalloc );
  if(!new) {
    return NULL;
  }
  return new;
}

void *
xarray_append(void *a, ...) {
  struct xarray_header *ah;
  va_list ap;
  if(!(ah = xarray_header(a))) {
    return NULL;
  }
  ah = xarray_grow(ah, ah->len + 1);
  va_start(ap, a);
  switch(ah->type) {
  case 'p': ((void **) (ah->buf))[ah->len] =         va_arg(ap, void *); break;
  case 'i': ((int *)   (ah->buf))[ah->len] =         va_arg(ap, int);    break;
  case 'f': ((float *) (ah->buf))[ah->len] = (float) va_arg(ap, double); break;
  case 'd': ((double *)(ah->buf))[ah->len] =         va_arg(ap, double); break;
  case 'c': ((char *)  (ah->buf))[ah->len] = (char)  va_arg(ap, int);    break;
  default: break;
  }
  va_end(ap);
  ah->len++;
  return ah->buf;
}

void
xarray_delete(void *a, int i) {
  int n;
  struct xarray_header *ah;
  if(!(ah = xarray_header(a))) {
    return;
  }
  if(i < 0 || (size_t)i > ah->len) {
    printf("xarray: attempt to delete a non-existant value\n");
    return;
  }
  n = ah->len - 1 - i;
  memmove((pointer) a + ah->size * i, (pointer)a + ah->size * (i+1), ah->size * n);
  ah->len--;
}

void
xarray_pop(void *a) {
  struct xarray_header *ah;
  if(!(ah = xarray_header(a))) {
    return;
  }
  xarray_delete(a, ah->len - 1);
}

void
xarray_sort(void *a, int (*compare)(const void *a, const void *b)) {
  struct xarray_header *ah;
  if(!(ah = xarray_header(a))) {
    return;
  }
  qsort(a, ah->len, ah->size, compare);
}