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
|
/*
* Copyright (c) 2014-2017 Pavel Kalvoda <me@pavelkalvoda.com>
*
* libcbor is free software; you can redistribute it and/or modify
* it under the terms of the MIT license. See LICENSE for details.
*/
#include "cbor.h"
#include <stdio.h>
#include <stdlib.h>
/*
* Illustrates how to use the contiguous storage of nested items with
* standard library functions.
*/
int comparUint(const void * a, const void * b)
{
uint8_t av = cbor_get_uint8(*(cbor_item_t **)a),
bv = cbor_get_uint8(*(cbor_item_t **)b);
if (av < bv) return -1;
else if (av == bv) return 0;
else return 1;
}
int main(int argc, char * argv[])
{
cbor_item_t * array = cbor_new_definite_array(4);
cbor_array_push(array, cbor_move(cbor_build_uint8(4)));
cbor_array_push(array, cbor_move(cbor_build_uint8(3)));
cbor_array_push(array, cbor_move(cbor_build_uint8(1)));
cbor_array_push(array, cbor_move(cbor_build_uint8(2)));
qsort(
cbor_array_handle(array),
cbor_array_size(array),
sizeof(cbor_item_t *),
comparUint
);
cbor_describe(array, stdout);
fflush(stdout);
}
|
