-
-
Notifications
You must be signed in to change notification settings - Fork 21
Expand file tree
/
Copy pathmain.c
More file actions
52 lines (46 loc) · 1.74 KB
/
main.c
File metadata and controls
52 lines (46 loc) · 1.74 KB
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
#include <assert.h>
#include <stdio.h>
#include "arrays_bp.h"
int main(void) {
// Encode.
struct M m = {};
for (int i = 0; i < 7; i++) m.a[i] = (unsigned char)(i);
for (int i = 0; i < 7; i++) m.b[i] = (int32_t)(i);
for (int i = 0; i < 7; i++) m.c[i] = (int8_t)(i);
for (int i = 0; i < 7; i++) m.d[i] = (uint8_t)(i & 7);
for (int i = 0; i < 7; i++) m.e[i] = (uint32_t)(i + 11811);
for (int i = 0; i < 7; i++)
m.f[i] = (struct Note){i, false, {1, 2, 3, 4, 5, 6, 7}};
m.g = (struct Note){2, false, {7, 2, 3, 4, 5, 6, 7}};
for (int i = 0; i < 7; i++)
for (int j = 0; j < 7; j++) m.t[i][j] = (int32_t)(i + j + 1291291);
m.x[0] = -13;
m.x[1] = -89;
m.x[2] = 13;
unsigned char s[BYTES_LENGTH_M] = {0};
EncodeM(&m, s);
// Output
for (int i = 0; i < BYTES_LENGTH_M; i++) printf("%u ", s[i]);
// Decode.
struct M m1 = {0};
DecodeM(&m1, s);
for (int i = 0; i < 7; i++) assert(m1.a[i] == m.a[i]);
for (int i = 0; i < 7; i++) assert(m1.b[i] == m.b[i]);
for (int i = 0; i < 7; i++) assert(m1.c[i] == m.c[i]);
for (int i = 0; i < 7; i++) assert(m1.d[i] == m.d[i]);
for (int i = 0; i < 7; i++) assert(m1.e[i] == m.e[i]);
for (int i = 0; i < 7; i++) {
for (int j = 0; j < 7; j++) assert(m1.f[i].arr[j] == m.f[i].arr[j]);
assert(m1.f[i].number == m.f[i].number);
assert(m1.f[i].ok == m.f[i].ok);
}
for (int j = 0; j < 7; j++) assert(m1.g.arr[j] == m.g.arr[j]);
assert(m1.g.number == m.g.number);
assert(m1.g.ok == m.g.ok);
for (int i = 0; i < 7; i++)
for (int j = 0; j < 7; j++) assert(m1.t[i][j] = m.t[i][j]);
assert(m1.x[0] == m.x[0]);
assert(m1.x[1] == m.x[1]);
assert(m1.x[2] == m.x[2]);
return 0;
}