C Standard Library Extensions
1.2.3
|
cxptr cx_multimap_get_key(const cx_multimap *multimap, cx_multimap_const_iterator position)
Get the key from a given iterator position.
Definition: cxmultimap.c:392
cx_tree_iterator cx_multimap_iterator
The multimap iterator datatype.
Definition: cxmultimap.h:50
cxbool(* cx_tree_compare_func)(cxcptr, cxcptr)
The tree's key comparison operator function.
Definition: cxtree.h:72
cxsize cx_tree_count(const cx_tree *tree, cxcptr key)
Get the number of elements matching a key.
Definition: cxtree.c:1616
cxsize cx_multimap_erase(cx_multimap *multimap, cxcptr key)
Erase an element from a multimap according to the provided key.
Definition: cxmultimap.c:648
cx_multimap_iterator cx_multimap_lower_bound(const cx_multimap *multimap, cxcptr key)
Find the beginning of a subsequence matching a given key.
Definition: cxmultimap.c:469
cx_tree_iterator cx_tree_end(const cx_tree *tree)
Get an iterator for the position after the last pair in the tree.
Definition: cxtree.c:1056
cx_tree_iterator cx_tree_upper_bound(const cx_tree *tree, cxcptr key)
Find the end of a subsequence.
Definition: cxtree.c:1557
cx_multimap_iterator cx_multimap_end(const cx_multimap *multimap)
Get an iterator for the position after the last pair in the multimap.
Definition: cxmultimap.c:86
void cx_multimap_clear(cx_multimap *multimap)
Remove all pairs from a multimap.
Definition: cxmultimap.c:161
void cx_tree_equal_range(const cx_tree *tree, cxcptr key, cx_tree_iterator *begin, cx_tree_iterator *end)
Find a subsequence matching a given key.
Definition: cxtree.c:1588
cx_tree_iterator cx_tree_find(const cx_tree *tree, cxcptr key)
Locate an element in the tree.
Definition: cxtree.c:1499
cx_multimap_iterator cx_multimap_previous(const cx_multimap *multimap, cx_multimap_const_iterator position)
Get an iterator for the previous pair in the multimap.
Definition: cxmultimap.c:137
void cx_multimap_delete(cx_multimap *multimap)
Destroy a multimap and all its elements.
Definition: cxmultimap.c:251
cxptr cx_multimap_get_value(const cx_multimap *multimap, cx_multimap_const_iterator position)
Get the data from a given iterator position.
Definition: cxmultimap.c:415
cx_multimap_iterator cx_multimap_insert(cx_multimap *multimap, cxcptr key, cxcptr data)
Insert data into a multimap.
Definition: cxmultimap.c:571
cx_tree_const_iterator cx_multimap_const_iterator
The multimap constant iterator datatype.
Definition: cxmultimap.h:62
cx_tree_iterator cx_tree_next(const cx_tree *tree, cx_tree_const_iterator position)
Get an iterator for the next pair in the tree.
Definition: cxtree.c:1083
cxptr cx_tree_get_value(const cx_tree *tree, cx_tree_const_iterator position)
Get the data from a given iterator position.
Definition: cxtree.c:1468
cx_tree_iterator cx_tree_insert_equal(cx_tree *tree, cxcptr key, cxcptr data)
Insert data into a tree.
Definition: cxtree.c:1688
cx_tree_iterator cx_tree_lower_bound(const cx_tree *tree, cxcptr key)
Find the beginning of a subsequence.
Definition: cxtree.c:1528
void cx_tree_erase_position(cx_tree *tree, cx_tree_iterator position)
Erase an element from a tree.
Definition: cxtree.c:1715
cx_multimap_iterator cx_multimap_begin(const cx_multimap *multimap)
Get an iterator to the first pair in a multimap.
Definition: cxmultimap.c:62
void cx_tree_clear(cx_tree *tree)
Remove all pairs from a tree.
Definition: cxtree.c:1148
cxsize cx_tree_erase(cx_tree *tree, cxcptr key)
Erase all elements from a tree matching the provided key.
Definition: cxtree.c:1785
cx_tree * cx_tree_new(cx_tree_compare_func compare, cx_free_func key_destroy, cx_free_func value_destroy)
Create a new tree without any elements.
Definition: cxtree.c:1212
cx_tree_iterator cx_tree_previous(const cx_tree *tree, cx_tree_const_iterator position)
Get an iterator for the previous pair in the tree.
Definition: cxtree.c:1117
cx_tree_iterator cx_tree_begin(const cx_tree *tree)
Get an iterator to the first pair in the tree.
Definition: cxtree.c:1030
cx_multimap * cx_multimap_new(cx_multimap_compare_func compare, cx_free_func key_destroy, cx_free_func value_destroy)
Create a new multimap without any elements.
Definition: cxmultimap.c:223
cx_multimap_iterator cx_multimap_find(const cx_multimap *multimap, cxcptr key)
Locate an element in the multimap.
Definition: cxmultimap.c:442
cx_tree cx_multimap
The multimap datatype.
Definition: cxmultimap.h:39
cx_tree_compare_func cx_tree_key_comp(const cx_tree *tree)
Get the key comparison function.
Definition: cxtree.c:1326
cxsize cx_tree_max_size(const cx_tree *tree)
Get the maximum number of pairs possible.
Definition: cxtree.c:1299
cx_multimap_compare_func cx_multimap_key_comp(const cx_multimap *multimap)
Retrieve a multimap's key comparison function.
Definition: cxmultimap.c:317
cxsize cx_multimap_size(const cx_multimap *multimap)
Get the actual number of pairs in the multimap.
Definition: cxmultimap.c:272
void cx_multimap_erase_position(cx_multimap *multimap, cx_multimap_iterator position)
Erase an element from a multimap.
Definition: cxmultimap.c:595
cxbool cx_multimap_empty(const cx_multimap *multimap)
Check whether a multimap is empty.
Definition: cxmultimap.c:187
void cx_tree_erase_range(cx_tree *tree, cx_tree_iterator begin, cx_tree_iterator end)
Erase a range of elements from a tree.
Definition: cxtree.c:1749
void cx_multimap_swap(cx_multimap *multimap1, cx_multimap *multimap2)
Swap the contents of two multimaps.
Definition: cxmultimap.c:341
cxptr cx_multimap_assign(cx_multimap *multimap, cx_multimap_iterator position, cxcptr data)
Assign data to an iterator position.
Definition: cxmultimap.c:365
void cx_multimap_equal_range(const cx_multimap *multimap, cxcptr key, cx_multimap_iterator *begin, cx_multimap_iterator *end)
Find a subsequence matching a given key.
Definition: cxmultimap.c:525
cx_tree_compare_func cx_multimap_compare_func
The multimap's key comparison operator function.
Definition: cxmultimap.h:78
cxptr cx_tree_assign(cx_tree *tree, cx_tree_iterator position, cxcptr data)
Assign data to an iterator position.
Definition: cxtree.c:1404
void cx_tree_delete(cx_tree *tree)
Destroy a tree and all its elements.
Definition: cxtree.c:1250
cxptr cx_tree_get_key(const cx_tree *tree, cx_tree_const_iterator position)
Get the key from a given iterator position.
Definition: cxtree.c:1441
void cx_tree_swap(cx_tree *tree1, cx_tree *tree2)
Swap the contents of two trees.
Definition: cxtree.c:1352
cxbool cx_tree_empty(const cx_tree *tree)
Check whether a tree is empty.
Definition: cxtree.c:1176
cxsize cx_multimap_max_size(const cx_multimap *multimap)
Get the maximum number of pairs possible.
Definition: cxmultimap.c:293
cx_multimap_iterator cx_multimap_upper_bound(const cx_multimap *multimap, cxcptr key)
Find the end of a subsequence matching a given key.
Definition: cxmultimap.c:496
void cx_multimap_erase_range(cx_multimap *multimap, cx_multimap_iterator begin, cx_multimap_iterator end)
Erase a range of elements from a multimap.
Definition: cxmultimap.c:622
cxsize cx_tree_size(const cx_tree *tree)
Get the actual number of pairs in the tree.
Definition: cxtree.c:1276
cxsize cx_multimap_count(const cx_multimap *multimap, cxcptr key)
Get the number of elements matching a key.
Definition: cxmultimap.c:548
cx_multimap_iterator cx_multimap_next(const cx_multimap *multimap, cx_multimap_const_iterator position)
Get an iterator for the next pair in the multimap.
Definition: cxmultimap.c:111