branches/zip: ha_delete(): Remove this unused function that was

very similar to ha_search_and_delete_if_found().

ha/ha0ha.c

@@ -250,28 +250,6 @@ ha_delete_hash_node(
 	HASH_DELETE_AND_COMPACT(ha_node_t, next, table, del_node);
 }
 
-/*************************************************************//**
-Deletes an entry from a hash table. */
-UNIV_INTERN
-void
-ha_delete(
-/*======*/
-	hash_table_t*	table,	/*!< in: hash table */
-	ulint		fold,	/*!< in: folded value of data */
-	void*		data)	/*!< in: data, must not be NULL and must exist
-				in the hash table */
-{
-	ha_node_t*	node;
-
-	ASSERT_HASH_MUTEX_OWN(table, fold);
-
-	node = ha_search_with_data(table, fold, data);
-
-	ut_a(node);
-
-	ha_delete_hash_node(table, node);
-}
-
 /*********************************************************//**
 Looks for an element when we know the pointer to the data, and updates
 the pointer to data, if found. */

include/ha0ha.h

@@ -164,16 +164,6 @@ is inserted.
 # define ha_insert_for_fold(t,f,b,d) ha_insert_for_fold_func(t,f,d)
 #endif /* UNIV_AHI_DEBUG || UNIV_DEBUG */
 
-/*************************************************************//**
-Deletes an entry from a hash table. */
-UNIV_INTERN
-void
-ha_delete(
-/*======*/
-	hash_table_t*	table,	/*!< in: hash table */
-	ulint		fold,	/*!< in: folded value of data */
-	void*		data);	/*!< in: data, must not be NULL and must exist
-				in the hash table */
 /*********************************************************//**
 Looks for an element when we know the pointer to the data and deletes
 it from the hash table if found.