/**
* Test the first iterator is before the second.
*/
bool_t _rb_tree_iterator_before(_rb_tree_iterator_t it_first, _rb_tree_iterator_t it_second)
{
_rb_tree_iterator_t it_iter;
_rb_tree_t* pt_rb_tree = NULL;
assert(_rb_tree_iterator_belong_to_rb_tree(_RB_TREE_ITERATOR_TREE(it_first), it_first));
assert(_rb_tree_iterator_belong_to_rb_tree(_RB_TREE_ITERATOR_TREE(it_second), it_second));
assert(_RB_TREE_ITERATOR_TREE(it_first) == _RB_TREE_ITERATOR_TREE(it_second));
/* first iterator equal to second iterator */
if (_RB_TREE_ITERATOR_COREPOS(it_first) == _RB_TREE_ITERATOR_COREPOS(it_second)) {
return false;
}
/* else travel subtree for search second iterator */
pt_rb_tree = _RB_TREE_ITERATOR_TREE(it_first);
for (it_iter = it_first;
!_rb_tree_iterator_equal(it_iter, _rb_tree_end(pt_rb_tree));
it_iter = _rb_tree_iterator_next(it_iter)) {
if (_rb_tree_iterator_equal(it_iter, it_second)) {
return true;
}
}
return _rb_tree_iterator_equal(it_second, _rb_tree_end(pt_rb_tree)) ? true : false;
}
/**
* Return iterator reference next element.
*/
_rb_tree_iterator_t _rb_tree_iterator_next(_rb_tree_iterator_t it_iter)
{
_rbnode_t* pt_next = NULL; /* next pos */
_rbnode_t* pt_cur = (_rbnode_t*)_RB_TREE_ITERATOR_COREPOS(it_iter);
assert(_rb_tree_iterator_belong_to_rb_tree(_RB_TREE_ITERATOR_TREE(it_iter), it_iter));
assert(!_rb_tree_iterator_equal(it_iter, _rb_tree_end(_RB_TREE_ITERATOR_TREE(it_iter))));
if (pt_cur->_pt_right != NULL) {
pt_next = pt_cur->_pt_right;
while (pt_next->_pt_left != NULL) {
pt_next = pt_next->_pt_left;
}
_RB_TREE_ITERATOR_COREPOS(it_iter) = (_byte_t*)pt_next;
} else {
pt_next = pt_cur->_pt_parent;
while (pt_cur == pt_next->_pt_right) {
pt_cur = pt_next;
pt_next = pt_next->_pt_parent;
}
/*
* this is special condition, when the next pos is root's parent.
* when the rb tree has only one node, this condition is came.
*/
if (pt_cur->_pt_right != pt_next) {
_RB_TREE_ITERATOR_COREPOS(it_iter) = (_byte_t*)pt_next;
} else {
_RB_TREE_ITERATOR_COREPOS(it_iter) = (_byte_t*)pt_cur;
}
}
return it_iter;
}
/**
* Test the two rb tree iterator are equal.
*/
bool_t _rb_tree_iterator_equal(_rb_tree_iterator_t it_first, _rb_tree_iterator_t it_second)
{
assert(_rb_tree_iterator_belong_to_rb_tree(_RB_TREE_ITERATOR_TREE(it_first), it_first));
assert(_rb_tree_iterator_belong_to_rb_tree(_RB_TREE_ITERATOR_TREE(it_second), it_second));
assert(_RB_TREE_ITERATOR_TREE(it_first) == _RB_TREE_ITERATOR_TREE(it_second));
return _RB_TREE_ITERATOR_COREPOS(it_first) == _RB_TREE_ITERATOR_COREPOS(it_second) ? true : false;
}
/**
* Get data value pointer referenced by iterator.
*/
const void* _rb_tree_iterator_get_pointer(_rb_tree_iterator_t it_iter)
{
assert(_rb_tree_iterator_belong_to_rb_tree(_RB_TREE_ITERATOR_TREE(it_iter), it_iter));
assert(!_rb_tree_iterator_equal(it_iter, _rb_tree_end(_RB_TREE_ITERATOR_TREE(it_iter))));
/* char* */
if (strncmp(_GET_RB_TREE_TYPE_BASENAME(_RB_TREE_ITERATOR_TREE(it_iter)), _C_STRING_TYPE, _TYPE_NAME_SIZE) == 0) {
return (char*)string_c_str((string_t*)((_rbnode_t*)_RB_TREE_ITERATOR_COREPOS(it_iter))->_pby_data);
} else {
return ((_rbnode_t*)_RB_TREE_ITERATOR_COREPOS(it_iter))->_pby_data;
}
}
/**
* Get data value referenced by iterator.
*/
void _rb_tree_iterator_get_value(_rb_tree_iterator_t it_iter, void* pv_value)
{
assert(pv_value != NULL);
assert(_rb_tree_iterator_belong_to_rb_tree(_RB_TREE_ITERATOR_TREE(it_iter), it_iter));
assert(!_rb_tree_iterator_equal(it_iter, _rb_tree_end(_RB_TREE_ITERATOR_TREE(it_iter))));
/* char* */
if (strncmp(_GET_RB_TREE_TYPE_BASENAME(_RB_TREE_ITERATOR_TREE(it_iter)), _C_STRING_TYPE, _TYPE_NAME_SIZE) == 0) {
*(char**)pv_value = (char*)string_c_str((string_t*)((_rbnode_t*)_RB_TREE_ITERATOR_COREPOS(it_iter))->_pby_data);
} else {
bool_t b_result = _GET_RB_TREE_TYPE_SIZE(_RB_TREE_ITERATOR_TREE(it_iter));
_GET_RB_TREE_TYPE_COPY_FUNCTION(_RB_TREE_ITERATOR_TREE(it_iter))(
pv_value, ((_rbnode_t*)_RB_TREE_ITERATOR_COREPOS(it_iter))->_pby_data, &b_result);
assert(b_result);
}
}
/**
* Get data value pointer referenced by iterator, but ignore char*.
*/
const void* _rb_tree_iterator_get_pointer_ignore_cstr(_rb_tree_iterator_t it_iter)
{
assert(_rb_tree_iterator_belong_to_rb_tree(_RB_TREE_ITERATOR_TREE(it_iter), it_iter));
assert(!_rb_tree_iterator_equal(it_iter, _rb_tree_end(_RB_TREE_ITERATOR_TREE(it_iter))));
return ((_rbnode_t*)_RB_TREE_ITERATOR_COREPOS(it_iter))->_pby_data;
}
/**
* Return iterator reference previous element.
*/
_rb_tree_iterator_t _rb_tree_iterator_prev(_rb_tree_iterator_t it_iter)
{
_rbnode_t* pt_prev = NULL;
_rbnode_t* pt_cur = (_rbnode_t*)_RB_TREE_ITERATOR_COREPOS(it_iter);
assert(_rb_tree_iterator_belong_to_rb_tree(_RB_TREE_ITERATOR_TREE(it_iter), it_iter));
assert(!_rb_tree_iterator_equal(it_iter, _rb_tree_begin(_RB_TREE_ITERATOR_TREE(it_iter))));
/* previous end */
if(_rb_tree_iterator_equal(it_iter, _rb_tree_end(_RB_TREE_ITERATOR_TREE(it_iter))))
{
_RB_TREE_ITERATOR_COREPOS(it_iter) = (_byte_t*)_RB_TREE_ITERATOR_TREE(it_iter)->_t_rbroot._pt_right;
}
else
{
if(pt_cur->_pt_left != NULL)
{
pt_prev = pt_cur->_pt_left;
while(pt_prev->_pt_right != NULL)
{
pt_prev = pt_prev->_pt_right;
}
_RB_TREE_ITERATOR_COREPOS(it_iter) = (_byte_t*)pt_prev;
}
else
{
pt_prev = pt_cur->_pt_parent;
while(pt_cur == pt_prev->_pt_left)
{
pt_cur = pt_prev;
pt_prev = pt_prev->_pt_parent;
}
/*
* there is no same special condition as next, because the begin
* iterator is the valid iterator
*/
_RB_TREE_ITERATOR_COREPOS(it_iter) = (_byte_t*)pt_prev;
}
}
return it_iter;
}
/**
* Test iterator referenced data is within the rb tree.
*/
bool_t _rb_tree_iterator_belong_to_rb_tree(const _rb_tree_t* cpt_rb_tree, _rb_tree_iterator_t it_iter)
{
assert(cpt_rb_tree != NULL);
assert(_rb_tree_is_inited(cpt_rb_tree));
assert(_RB_TREE_ITERATOR_COREPOS(it_iter) != NULL);
assert(_RB_TREE_ITERATOR_TREE(it_iter) == cpt_rb_tree);
/* if iterator is end */
if(_RB_TREE_ITERATOR_COREPOS(it_iter) == (_byte_t*)&cpt_rb_tree->_t_rbroot)
{
return true;
}
/* else travel rb tree for search the pointer */
else
{
return _rb_tree_rbnode_belong_to_rb_tree(
cpt_rb_tree->_t_rbroot._pt_parent, (_rbnode_t*)_RB_TREE_ITERATOR_COREPOS(it_iter));
}
}
/**
* Create rb tree iterator.
*/
_rb_tree_iterator_t _create_rb_tree_iterator(void)
{
_rb_tree_iterator_t it_iter;
_RB_TREE_ITERATOR_COREPOS(it_iter) = NULL;
_RB_TREE_ITERATOR_TREE_POINTER(it_iter) = NULL;
_ITERATOR_CONTAINER(it_iter) = NULL;
return it_iter;
}
