summaryrefslogtreecommitdiff
path: root/src/vector.c
blob: 99ebffc0e94510ebe3b691d0668f6335be84622d (plain)
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
/*
* Copyright (C) 2023 Johnny Richard
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program.  If not, see <https://www.gnu.org/licenses/>.
*/
#include "vector.h"
#include <assert.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

vector_t*
vector_new()
{
  vector_t *vector = (vector_t *) malloc(sizeof(vector_t));

  if (vector == NULL) {
    fprintf(stderr, "failed to create vector: %s\n", strerror(errno));
    exit(EXIT_FAILURE);
  }

  vector->items = calloc(sizeof(void *), VECTOR_INITIAL_CAPACITY);

  if (vector->items == NULL) {
    free(vector);
    fprintf(stderr, "failed to create vector items: %s\n", strerror(errno));
    exit(EXIT_FAILURE);
  }

  vector->size = 0;
  vector->capacity = VECTOR_INITIAL_CAPACITY;
  return vector;
}

void
vector_resize(vector_t *vector)
{
  vector->capacity = vector->capacity * 2;
  vector->items = realloc(vector->items, sizeof(void *) * vector->capacity);
  if (vector->items == NULL) {
    vector_destroy(vector);
    fprintf(stderr, "failed to reallocat memory for vector: %s\n", strerror(errno));
    exit(EXIT_FAILURE);
  }
}

void
vector_push_back(vector_t *vector, void *item)
{
  assert(vector);
  assert(item);
  if (vector->size == vector->capacity) {
    vector_resize(vector);
  }
  vector->items[vector->size++] = item;
}

void*
vector_at(vector_t *vector, uint32_t index)
{
  assert(vector);
  return vector->items[index];
}

void
vector_destroy(vector_t * vector)
{
  assert(vector);
  free(vector->items);
  free(vector);
}