/**
* Tests if the first hash_set is less than the second hash_set.
*/
bool_t hash_set_less(const hash_set_t* cphset_first, const hash_set_t* cphset_second)
{
assert(cphset_first != NULL);
assert(cphset_second != NULL);
return _hashtable_less(&cphset_first->_t_hashtable, &cphset_second->_t_hashtable);
}
/**
* Tests if the first hash_multimap is less than the second hash_multimap.
*/
bool_t hash_multimap_less(const hash_multimap_t* cphmmap_first, const hash_multimap_t* cphmmap_second)
{
assert(cphmmap_first != NULL);
assert(cphmmap_second != NULL);
assert(_pair_is_inited(&cphmmap_first->_pair_temp));
assert(_pair_is_inited(&cphmmap_second->_pair_temp));
assert(_hash_multimap_same_pair_type_ex(&cphmmap_first->_pair_temp, &cphmmap_second->_pair_temp));
return _hashtable_less(&cphmmap_first->_t_hashtable, &cphmmap_second->_t_hashtable);
}
/**
* Tests if the first rb tree is greater than the second rb tree.
*/
bool_t _hashtable_greater(const _hashtable_t* cpt_first, const _hashtable_t* cpt_second)
{
return _hashtable_less(cpt_second, cpt_first);
}
/**
* Tests if the first rb tree is less than or equal to the second rb tree.
*/
bool_t _hashtable_less_equal(const _hashtable_t* cpt_first, const _hashtable_t* cpt_second)
{
return (_hashtable_less(cpt_first, cpt_second) || _hashtable_equal(cpt_first, cpt_second)) ? true : false;
}