blob: 1533cea75ff0856dc4e83048748ce29ecdd45eac (
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
|
/**
* @file lv_rb.h
*
*/
#ifndef LV_RB_H
#define LV_RB_H
#ifdef __cplusplus
extern "C" {
#endif
/*********************
* INCLUDES
*********************/
#include "lv_types.h"
#include "stdbool.h"
#include "lv_assert.h"
/*********************
* DEFINES
*********************/
/**********************
* TYPEDEFS
**********************/
typedef enum {
LV_RB_COLOR_RED,
LV_RB_COLOR_BLACK
} lv_rb_color_t;
typedef struct lv_rb_node_t {
struct lv_rb_node_t * parent;
struct lv_rb_node_t * left;
struct lv_rb_node_t * right;
lv_rb_color_t color;
void * data;
} lv_rb_node_t;
typedef int8_t lv_rb_compare_res_t;
typedef lv_rb_compare_res_t (*lv_rb_compare_t)(const void * a, const void * b);
typedef struct {
lv_rb_node_t * root;
lv_rb_compare_t compare;
size_t size;
} lv_rb_t;
/**********************
* GLOBAL PROTOTYPES
**********************/
bool lv_rb_init(lv_rb_t * tree, lv_rb_compare_t compare, size_t node_size);
lv_rb_node_t * lv_rb_insert(lv_rb_t * tree, void * key);
lv_rb_node_t * lv_rb_find(lv_rb_t * tree, const void * key);
void * lv_rb_remove_node(lv_rb_t * tree, lv_rb_node_t * node);
void * lv_rb_remove(lv_rb_t * tree, const void * key);
bool lv_rb_drop_node(lv_rb_t * tree, lv_rb_node_t * node);
bool lv_rb_drop(lv_rb_t * tree, const void * key);
lv_rb_node_t * lv_rb_minimum(lv_rb_t * node);
lv_rb_node_t * lv_rb_maximum(lv_rb_t * node);
lv_rb_node_t * lv_rb_minimum_from(lv_rb_node_t * node);
lv_rb_node_t * lv_rb_maximum_from(lv_rb_node_t * node);
void lv_rb_destroy(lv_rb_t * tree);
/*************************
* GLOBAL VARIABLES
*************************/
/**********************
* MACROS
**********************/
#ifdef __cplusplus
} /*extern "C"*/
#endif
#endif /*LV_RB_H*/
|
