1 /* Ordered map data type implemented by a binary tree.
2 Copyright (C) 2006-2007, 2009-2020 Free Software Foundation, Inc.
3 Written by Bruno Haible <bruno@clisp.org>, 2018.
5 This program is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 3 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <https://www.gnu.org/licenses/>. */
21 #include "gl_rbtree_omap.h"
25 /* -------------------------- gl_omap_t Data Type -------------------------- */
27 /* Parameterization of gl_rbtree_ordered.h. */
28 #define CONTAINER_T gl_omap_t
29 #define CONTAINER_IMPL gl_omap_impl
30 #define CONTAINER_IMPL_BASE gl_omap_impl_base
31 #define NODE_IMPL gl_omap_node_impl
32 #define NODE_T gl_omap_node_t
33 #define NODE_PAYLOAD_FIELDS \
36 #define NODE_PAYLOAD_PARAMS \
37 const void *key, const void *value
38 #define NODE_PAYLOAD_ASSIGN(node) \
41 #define NODE_PAYLOAD_DISPOSE \
42 if (container->base.kdispose_fn != NULL) \
43 container->base.kdispose_fn (node->key);
45 #include "gl_rbtree_ordered.h"
47 /* Generic binary tree code. */
48 #include "gl_anytree_omap.h"
52 gl_rbtree_omap_check_invariants (gl_omap_t map
)
55 if (map
->root
!= NULL
)
56 check_invariants (map
->root
, NULL
, &counter
);
57 if (!(map
->count
== counter
))
61 const struct gl_omap_implementation gl_rbtree_omap_implementation
=
63 gl_tree_nx_create_empty
,
66 gl_tree_search_atleast
,
71 gl_tree_iterator_next
,