/*
* Delete the hash Table
*
* free key's, free node's, and free the users data, if they
* supply a free function
*/
void sfghash_delete( SFGHASH * h )
{
int i;
SFGHASH_NODE * node, * onode;
if( !h ) return;
sfhashfcn_free( h->sfhashfcn );
if( h->table )
{
for(i=0;i<h->nrows;i++)
{
for( node=h->table[i]; node; )
{
onode = node;
node = node->next;
if( !h->userkey && onode->key )
s_free( onode->key );
if( h->userfree && onode->data )
h->userfree( onode->data ); /* free users data, with users function */
s_free( onode );
}
}
s_free( h->table );
h->table = 0;
}
s_free( h );
}
/*!
* Delete the hash Table
*
* free key's, free node's, and free the users data.
*
* @param h SFXHASH table pointer
*
*/
void sfxhash_delete( SFXHASH * h )
{
unsigned i;
SFXHASH_NODE * node, * onode;
if( !h ) return;
if( h->sfhashfcn ) sfhashfcn_free( h->sfhashfcn );
if( h->table )
{
for(i=0;i<h->nrows;i++)
{
for( node=h->table[i]; node; )
{
onode = node;
node = node->next;
/* Notify user that we are about to free this node function */
if( h->usrfree )
h->usrfree( onode->key, onode->data );
s_free( h,onode );
}
}
s_free( h, h->table );
h->table = 0;
}
free( h ); /* free the table from general memory */
}
