library/src/datastructures/BP-HashTable.cc
// The entry is a named hash table containing zero or more sub entries which can be
// iterated through
The entry is a named hash table containing zero or more sub entries which can be
iterated through
The entry is a named hash table containing zero or more sub entries which can be iterated through
BP_ERROR_T ht_entry_is_table(P_BP_HASH_TABLE_KEYED_ENTRY entry)
{
	if(!entry)
		return ERR_FAILURE;
	switch(entry->type)
	{
		case BP_HASH_TABLE_KEYED_ENTRY_TYPE_NAMED_HASH_TABLE:
			return ERR_SUCCESS;
			break;
		default:
			break;
	}
	return ERR_FAILURE;
}
BP_ERROR_T ht_entry_is_table ( P_BP_HASH_TABLE_KEYED_ENTRY entry ) { if ( ! entry ) return ERR_FAILURE ; switch ( entry -> type ) { case BP_HASH_TABLE_KEYED_ENTRY_TYPE_NAMED_HASH_TABLE : return ERR_SUCCESS ; break ; default : break ; } return ERR_FAILURE ; }
The entry is a named hash table containing zero or more sub entries which can be
iterated through
The entry is a named hash table containing zero or more sub entries which can be iterated through
// ensure we have an entry pointer // switch on the entry type // if the type matches any of our buffer types, indicate it here // return failure on mismatch