/** * Get data value referenced by iterator. */ void _hashtable_iterator_get_value(_hashtable_iterator_t it_iter, void* pv_value) { assert(pv_value != NULL); assert(_hashtable_iterator_belong_to_hashtable(_HASHTABLE_ITERATOR_HASHTABLE(it_iter), it_iter)); assert(!_hashtable_iterator_equal(it_iter, _hashtable_end(_HASHTABLE_ITERATOR_HASHTABLE(it_iter)))); /* char* */ if(strncmp(_GET_HASHTABLE_TYPE_BASENAME(_HASHTABLE_ITERATOR_HASHTABLE(it_iter)), _C_STRING_TYPE, _TYPE_NAME_SIZE) == 0) { *(char**)pv_value = (char*)string_c_str((string_t*)((_hashnode_t*)_HASHTABLE_ITERATOR_COREPOS(it_iter))->_pby_data); } else { bool_t b_result = _GET_HASHTABLE_TYPE_SIZE(_HASHTABLE_ITERATOR_HASHTABLE(it_iter)); _GET_HASHTABLE_TYPE_COPY_FUNCTION(_HASHTABLE_ITERATOR_HASHTABLE(it_iter))( pv_value, ((_hashnode_t*)_HASHTABLE_ITERATOR_COREPOS(it_iter))->_pby_data, &b_result); assert(b_result); } }
/** * Inserts an element into a hashtable. */ _hashtable_iterator_t _hashtable_insert_equal(_hashtable_t* pt_hashtable, const void* cpv_value) { size_t t_bucketcount = 0; _hashnode_t* pt_node = NULL; _hashnode_t* pt_cur = NULL; _hashnode_t** ppt_nodelist = NULL; _hashtable_iterator_t it_iter = _create_hashtable_iterator(); bool_t b_result = false; size_t t_tmp = 0; size_t t_pos = 0; bool_t b_less = false; bool_t b_greater = false; assert(pt_hashtable != NULL); assert(cpv_value != NULL); assert(_hashtable_is_inited(pt_hashtable)); /* resize */ _hashtable_resize(pt_hashtable, _hashtable_size(pt_hashtable) + 1); /* allocate node */ pt_node = _alloc_allocate( &pt_hashtable->_t_allocator, _HASHTABLE_NODE_SIZE(_GET_HASHTABLE_TYPE_SIZE(pt_hashtable)), 1); assert(pt_node != NULL); _hashtable_init_elem_auxiliary(pt_hashtable, pt_node); b_result = _GET_HASHTABLE_TYPE_SIZE(pt_hashtable); _GET_HASHTABLE_TYPE_COPY_FUNCTION(pt_hashtable)(pt_node->_pby_data, cpv_value, &b_result); assert(b_result); /* hash */ t_bucketcount = _hashtable_bucket_count(pt_hashtable); t_tmp = _GET_HASHTABLE_TYPE_SIZE(pt_hashtable); _hashtable_hash_auxiliary(pt_hashtable, pt_node->_pby_data, &t_tmp); t_pos = t_tmp % t_bucketcount; /* insert node into hashtable, note the node has same value together */ ppt_nodelist = (_hashnode_t**)vector_at(&pt_hashtable->_vec_bucket, t_pos); assert(ppt_nodelist != NULL); pt_cur = *ppt_nodelist; if(pt_cur == NULL) { pt_node->_pt_next = pt_cur; *ppt_nodelist = pt_node; } else { b_less = b_greater = _GET_HASHTABLE_TYPE_SIZE(pt_hashtable); _hashtable_elem_compare_auxiliary(pt_hashtable, pt_cur->_pby_data, pt_node->_pby_data, &b_less); _hashtable_elem_compare_auxiliary(pt_hashtable, pt_node->_pby_data, pt_cur->_pby_data, &b_greater); if(!b_less && !b_greater) { pt_node->_pt_next = pt_cur; *ppt_nodelist = pt_node; } else { while(pt_cur->_pt_next != NULL) { b_less = b_greater = _GET_HASHTABLE_TYPE_SIZE(pt_hashtable); _hashtable_elem_compare_auxiliary( pt_hashtable, pt_cur->_pt_next->_pby_data, pt_node->_pby_data, &b_less); _hashtable_elem_compare_auxiliary( pt_hashtable, pt_node->_pby_data, pt_cur->_pt_next->_pby_data, &b_greater); if(b_less || b_greater) { pt_cur = pt_cur->_pt_next; } else { break; } } pt_node->_pt_next = pt_cur->_pt_next; pt_cur->_pt_next = pt_node; } } pt_hashtable->_t_nodecount++; _GET_HASHTABLE_BUCKETPOS(it_iter) = (_byte_t*)ppt_nodelist; _GET_HASHTABLE_COREPOS(it_iter) = (_byte_t*)pt_node; _GET_HASHTABLE_POINTER(it_iter) = pt_hashtable; return it_iter; }