GDestroyNotify value_destroy_func;
};
-/**
+/*
* g_hash_table_lookup_node:
* @hash_table: our #GHashTable
* @key: the key to lookup against
* non-%NULL then the computed hash value is returned. This is to
* save insertions from having to compute the hash record again for
* the new record.
- **/
+ */
static inline GHashNode **
g_hash_table_lookup_node (GHashTable *hash_table,
gconstpointer key,
return node_ptr;
}
-/**
+/*
* g_hash_table_remove_node:
* @hash_table: our #GHashTable
* @node_ptr_ptr: a pointer to the return value from
* either a pointer to the next node or a %NULL pointer as
* appropriate, the pointer at the end of @node_ptr_ptr will never be
* modified at all. Stay tuned. :)
- **/
+ */
static void
g_hash_table_remove_node (GHashTable *hash_table,
GHashNode ***node_ptr_ptr,
hash_table->nnodes--;
}
-/**
+/*
* g_hash_table_remove_all_nodes:
* @hash_table: our #GHashTable
* @notify: %TRUE if the destroy notify handlers are to be called
*
* If @notify is %TRUE then the destroy notify functions are called
* for the key and value of the hash node.
- **/
+ */
static void
g_hash_table_remove_all_nodes (GHashTable *hash_table,
gboolean notify)
hash_table->nnodes = 0;
}
-/**
+/*
* g_hash_table_resize:
* @hash_table: our #GHashTable
*
* nodes currently held. If you call this function then a resize will
* occur, even if one does not need to occur. Use
* g_hash_table_maybe_resize() instead.
- **/
+ */
static void
g_hash_table_resize (GHashTable *hash_table)
{
hash_table->size = new_size;
}
-/**
+/*
* g_hash_table_maybe_resize:
* @hash_table: our #GHashTable
*
*
* Essentially, calls g_hash_table_resize() if the table has strayed
* too far from its ideal size for its number of nodes.
- **/
+ */
static inline void
g_hash_table_maybe_resize (GHashTable *hash_table)
{
return TRUE;
}
-/**
+/*
* g_hash_table_insert_internal:
* @hash_table: our #GHashTable
* @key: the key to insert
* Do a lookup of @key. If it is found, replace it with the new
* @value (and perhaps the new @key). If it is not found, create a
* new node.
- **/
+ */
static void
g_hash_table_insert_internal (GHashTable *hash_table,
gpointer key,
return g_hash_table_insert_internal (hash_table, key, value, TRUE);
}
-/**
+/*
* g_hash_table_remove_internal:
* @hash_table: our #GHashTable
* @key: the key to remove
*
* Do a lookup of @key and remove it if it is found, calling the
* destroy notify handlers only if @notify is %TRUE.
- **/
+ */
static gboolean
g_hash_table_remove_internal (GHashTable *hash_table,
gconstpointer key,
g_hash_table_maybe_resize (hash_table);
}
-/**
+/*
* g_hash_table_foreach_remove_or_steal:
* @hash_table: our #GHashTable
* @func: the user's callback function
*
* If @notify is true then the destroy notify handlers will be called
* for each removed node.
- **/
+ */
static guint
g_hash_table_foreach_remove_or_steal (GHashTable *hash_table,
GHRFunc func,