a function to create a hash value from a key
a function to check two keys for equality
a function to free the memory allocated for the key used when removing the entry from the glib.HashTable, or NULL if you don't want to supply such a function.
a function to free the memory allocated for the value used when removing the entry from the glib.HashTable, or NULL if you don't want to supply such a function.
a new glib.HashTable
ConstructionException GTK+ fails to create the object.
Creates a new glib.HashTable like HashTable.new with a reference count of 1 and allows to specify functions to free the memory allocated for the key and value that get called when removing the entry from the glib.HashTable
Since version 2.42 it is permissible for destroy notify functions to recursively remove further items from the hash table. This is only permissible if the application still holds a reference to the hash table. This means that you may need to ensure that the hash table is empty by calling HashTable.removeAll before releasing the last reference using HashTable.unref.