0
|
1
|
|
2 /*
|
|
3 * Copyright (C) Igor Sysoev
|
|
4 */
|
|
5
|
|
6
|
|
7 #ifndef _NGX_RBTREE_H_INCLUDED_
|
|
8 #define _NGX_RBTREE_H_INCLUDED_
|
|
9
|
|
10
|
|
11 #include <ngx_config.h>
|
|
12 #include <ngx_core.h>
|
|
13
|
|
14
|
106
|
15 typedef ngx_uint_t ngx_rbtree_key_t;
|
|
16 typedef ngx_int_t ngx_rbtree_key_int_t;
|
|
17
|
|
18
|
0
|
19 typedef struct ngx_rbtree_s ngx_rbtree_t;
|
|
20
|
|
21 struct ngx_rbtree_s {
|
106
|
22 ngx_rbtree_key_t key;
|
|
23 ngx_rbtree_t *left;
|
|
24 ngx_rbtree_t *right;
|
|
25 ngx_rbtree_t *parent;
|
|
26 char color;
|
0
|
27 };
|
|
28
|
|
29
|
|
30 void ngx_rbtree_insert(ngx_rbtree_t **root, ngx_rbtree_t *sentinel,
|
42
|
31 ngx_rbtree_t *node);
|
0
|
32 void ngx_rbtree_delete(ngx_rbtree_t **root, ngx_rbtree_t *sentinel,
|
42
|
33 ngx_rbtree_t *node);
|
0
|
34
|
|
35
|
42
|
36 static ngx_inline ngx_rbtree_t *
|
|
37 ngx_rbtree_min(ngx_rbtree_t *node, ngx_rbtree_t *sentinel)
|
0
|
38 {
|
106
|
39 while (node->left != sentinel) {
|
|
40 node = node->left;
|
|
41 }
|
0
|
42
|
106
|
43 return node;
|
0
|
44 }
|
|
45
|
|
46
|
|
47 #endif /* _NGX_RBTREE_H_INCLUDED_ */
|