summaryrefslogtreecommitdiffstats
path: root/example/bin.c
blob: 40a7f77012b7109a91f2b2ab37c979eb567afb50 (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
#include <stdint.h>
#include <stdio.h>

typedef int32_t bin_key_t;

#define TEST_LENGTH 10
#define TEST_START -2
#define TEST_STEP 0.5;

struct sample_t {
  bin_key_t time;
  double data;
};

#define BIN_IMPLEMENTATION
#include "../include/bin.h"

int main() {
  char const *path = "./test.bin";
  FILE *bin = bin_init(path, sizeof(struct sample_t));

  bin_key_t half = (bin_key_t)((TEST_START + TEST_LENGTH) / 2.0);

  // Insert half of the values using bin_insert()
  for (bin_key_t i = half - 1; i >= TEST_START; i--) {
    bin_insert(bin, 0, &(struct sample_t){.time = i, .data = 2.0 * i}, 1);
  }

  // Append half of the values to the end
  for (bin_key_t i = half; i < TEST_START + TEST_LENGTH; i++) {
    bin_append(bin, &(struct sample_t){.time = i, .data = 2.0 * i}, 1);
  }

  uint64_t l = bin_length(bin);
  uint64_t bs = bin_block_size(bin);

  struct sample_t x[l];
  bin_read(bin, 0, x, l);

  // Test that all values are correct
  for (int32_t i = 0; i < TEST_LENGTH; i++) {
    bin_key_t key = TEST_START + i;
    assert(x[i].time == key && x[i].data == 2.0 * key);
  }

  bin_close(bin);
}