|
36 | 36 | */
|
37 | 37 | class rcs_chunked_list_t
|
38 | 38 | {
|
39 |
| - public: |
40 |
| - /** |
41 |
| - * List node |
42 |
| - */ |
43 |
| - typedef struct |
44 |
| - { |
45 |
| - mem_cpointer_t prev_cp; /**< prev list's node */ |
46 |
| - mem_cpointer_t next_cp; /**< next list's node */ |
47 |
| - } node_t; |
| 39 | +public: |
| 40 | + /** |
| 41 | + * List node |
| 42 | + */ |
| 43 | + typedef struct |
| 44 | + { |
| 45 | + mem_cpointer_t prev_cp; /**< prev list's node */ |
| 46 | + mem_cpointer_t next_cp; /**< next list's node */ |
| 47 | + } node_t; |
48 | 48 |
|
49 |
| - void init (void); |
50 |
| - void free (void); |
| 49 | + void init (void); |
| 50 | + void free (void); |
51 | 51 |
|
52 |
| - node_t *get_first (void) const; |
53 |
| - node_t *get_last (void) const; |
| 52 | + node_t *get_first (void) const; |
| 53 | + node_t *get_last (void) const; |
54 | 54 |
|
55 |
| - node_t *get_prev (node_t *node_p) const; |
56 |
| - node_t *get_next (node_t *node_p) const; |
| 55 | + node_t *get_prev (node_t *node_p) const; |
| 56 | + node_t *get_next (node_t *node_p) const; |
57 | 57 |
|
58 |
| - node_t *append_new (void); |
59 |
| - node_t *insert_new (node_t *after_p); |
| 58 | + node_t *append_new (void); |
| 59 | + node_t *insert_new (node_t *after_p); |
60 | 60 |
|
61 |
| - void remove (node_t *node_p); |
| 61 | + void remove (node_t *node_p); |
62 | 62 |
|
63 |
| - node_t *get_node_from_pointer (void *ptr) const; |
64 |
| - uint8_t* get_data_space (node_t *node_p) const; |
| 63 | + node_t *get_node_from_pointer (void *ptr) const; |
| 64 | + uint8_t* get_data_space (node_t *node_p) const; |
65 | 65 |
|
66 |
| - static size_t get_data_space_size (void); |
| 66 | + static size_t get_data_space_size (void); |
67 | 67 |
|
68 |
| - private: |
69 |
| - void set_prev (node_t *node_p, node_t *prev_node_p); |
70 |
| - void set_next (node_t *node_p, node_t *next_node_p); |
| 68 | +private: |
| 69 | + void set_prev (node_t *node_p, node_t *prev_node_p); |
| 70 | + void set_next (node_t *node_p, node_t *next_node_p); |
71 | 71 |
|
72 |
| - static size_t get_node_size (void); |
| 72 | + static size_t get_node_size (void); |
73 | 73 |
|
74 |
| - void assert_list_is_correct (void) const; |
75 |
| - void assert_node_is_correct (const node_t *node_p) const; |
| 74 | + void assert_list_is_correct (void) const; |
| 75 | + void assert_node_is_correct (const node_t *node_p) const; |
76 | 76 |
|
77 |
| - node_t* head_p; /**< head node of list */ |
78 |
| - node_t* tail_p; /**< tail node of list */ |
| 77 | + node_t* head_p; /**< head node of list */ |
| 78 | + node_t* tail_p; /**< tail node of list */ |
79 | 79 | };
|
80 | 80 |
|
81 | 81 | /**
|
|
0 commit comments