cln-plugin 0.6.0

A CLN plugin library. Write your plugin in Rust.
Documentation 
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

#include "config.h"
#include <assert.h>
#include <ccan/tal/tal.h>
#include <common/setup.h>
#include <inttypes.h>
#include <stdio.h>

#define ASKRENE_UNITTEST
#include "../child/priorityqueue.c"

#define CHECK(arg) if(!(arg)){fprintf(stderr, "failed CHECK at line %d: %s\n", __LINE__, #arg); abort();}

static void priorityqueue_show(struct priorityqueue *q)
{
	printf("size of queue: %zu\n", priorityqueue_size(q));
	printf("empty?: %s\n", priorityqueue_empty(q) ? "true" : "false");
	if (!priorityqueue_empty(q))
		printf("top of the queue: %" PRIu32 "\n", priorityqueue_top(q));
	const s64 *value = priorityqueue_value(q);
	for (u32 i = 0; i < priorityqueue_maxsize(q); i++) {
		printf("(%" PRIu32 ", %" PRIi64 ")", i, value[i]);
	}

	printf("\n\n");
}

int main(int argc, char *argv[])
{
	common_setup(argv[0]);
	printf("Hello world!\n");

	printf("Allocating a memory context\n");
	tal_t *ctx = tal(NULL, tal_t);
	CHECK(ctx);

	printf("Allocating a priorityqueue\n");
	struct priorityqueue *q;
	q = priorityqueue_new(ctx, 5);
	CHECK(q);

	/* reset all values */
	priorityqueue_init(q);
	priorityqueue_show(q);
	CHECK(priorityqueue_empty(q));
	CHECK(priorityqueue_size(q)==0);

	priorityqueue_update(q, 0, 10);
	priorityqueue_show(q);
	CHECK(!priorityqueue_empty(q));
	CHECK(priorityqueue_size(q)==1);
	CHECK(priorityqueue_top(q)==0);

	priorityqueue_update(q, 0, 3);
	priorityqueue_show(q);
	CHECK(!priorityqueue_empty(q));
	CHECK(priorityqueue_size(q)==1);
	CHECK(priorityqueue_top(q)==0);

	priorityqueue_update(q, 1, 3);
	priorityqueue_show(q);
	CHECK(!priorityqueue_empty(q));
	CHECK(priorityqueue_size(q)==2);
	// CHECK(priorityqueue_top(q)==0);

	priorityqueue_update(q, 1, 5);
	priorityqueue_show(q);
	CHECK(!priorityqueue_empty(q));
	CHECK(priorityqueue_size(q)==2);
	CHECK(priorityqueue_top(q)==0);

	priorityqueue_update(q, 1, -1);
	priorityqueue_show(q);
	CHECK(!priorityqueue_empty(q));
	CHECK(priorityqueue_size(q)==2);
	CHECK(priorityqueue_top(q)==1);

	priorityqueue_pop(q);
	priorityqueue_show(q);
	CHECK(!priorityqueue_empty(q));
	CHECK(priorityqueue_size(q)==1);
	CHECK(priorityqueue_top(q)==0);

	priorityqueue_update(q, 1, 0);
	priorityqueue_show(q);
	CHECK(!priorityqueue_empty(q));
	CHECK(priorityqueue_size(q)==2);
	CHECK(priorityqueue_top(q)==1);

	priorityqueue_update(q, 4, -10);
	priorityqueue_show(q);
	CHECK(!priorityqueue_empty(q));
	CHECK(priorityqueue_size(q)==3);
	CHECK(priorityqueue_top(q)==4);

	priorityqueue_pop(q);
	priorityqueue_show(q);
	CHECK(!priorityqueue_empty(q));
	CHECK(priorityqueue_size(q)==2);
	CHECK(priorityqueue_top(q)==1);

	printf("Freeing memory\n");
	ctx = tal_free(ctx);
	common_shutdown();
	return 0;
}