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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
|
/*
* Balanced tree type functions
*
* Copyright (C) 2006-2024, Joachim Metz <joachim.metz@gmail.com>
*
* Refer to AUTHORS for acknowledgements.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#if !defined( _LIBCDATA_BTREE_H )
#define _LIBCDATA_BTREE_H
#include <common.h>
#include <types.h>
#include "libcdata_extern.h"
#include "libcdata_libcerror.h"
#include "libcdata_libcthreads.h"
#include "libcdata_types.h"
#if defined( __cplusplus )
extern "C" {
#endif
/* The balanced tree uses the list and tree node
* The value of a tree node contains a list where each value in the list corresponds with either a sub node or a leaf value
* The values array is used for sequential access to the leaf values
*/
typedef struct libcdata_internal_btree libcdata_internal_btree_t;
struct libcdata_internal_btree
{
/* The values array
*/
libcdata_array_t *values_array;
/* The root node
*/
libcdata_tree_node_t *root_node;
/* The maximum number of values
*/
int maximum_number_of_values;
#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )
/* The read/write lock
*/
libcthreads_read_write_lock_t *read_write_lock;
#endif
};
LIBCDATA_EXTERN \
int libcdata_btree_initialize(
libcdata_btree_t **tree,
int maximum_number_of_sub_nodes,
libcerror_error_t **error );
LIBCDATA_EXTERN \
int libcdata_btree_free(
libcdata_btree_t **tree,
int (*value_free_function)(
intptr_t **value,
libcerror_error_t **error ),
libcerror_error_t **error );
/* TODO clone function */
LIBCDATA_EXTERN \
int libcdata_btree_get_number_of_values(
libcdata_btree_t *tree,
int *number_of_values,
libcerror_error_t **error );
LIBCDATA_EXTERN \
int libcdata_btree_get_value_by_index(
libcdata_btree_t *tree,
int value_index,
intptr_t **value,
libcerror_error_t **error );
LIBCDATA_EXTERN \
int libcdata_btree_get_value_by_value(
libcdata_btree_t *tree,
intptr_t *value,
int (*value_compare_function)(
intptr_t *first_value,
intptr_t *second_value,
libcerror_error_t **error ),
libcdata_tree_node_t **upper_node,
intptr_t **existing_value,
libcerror_error_t **error );
LIBCDATA_EXTERN \
int libcdata_btree_insert_value(
libcdata_btree_t *tree,
int *value_index,
intptr_t *value,
int (*value_compare_function)(
intptr_t *first_value,
intptr_t *second_value,
libcerror_error_t **error ),
libcdata_tree_node_t **upper_node,
intptr_t **existing_value,
libcerror_error_t **error );
LIBCDATA_EXTERN \
int libcdata_btree_replace_value(
libcdata_btree_t *tree,
libcdata_tree_node_t *upper_node,
int *value_index,
intptr_t *value,
int *replacement_value_index,
intptr_t *replacement_value,
libcerror_error_t **error );
LIBCDATA_EXTERN \
int libcdata_btree_remove_value(
libcdata_btree_t *tree,
libcdata_tree_node_t *upper_node,
int *value_index,
intptr_t *value,
libcerror_error_t **error );
#if defined( __cplusplus )
}
#endif
#endif /* !defined( _LIBCDATA_BTREE_H ) */
|
