Inserts a new key and value into a glib.HashTable similar to
HashTable.insert. The difference is that if the key
already exists in the glib.HashTable, it gets replaced by the
new key. If you supplied a value_destroy_func when creating
the glib.HashTable, the old value is freed using that function.
If you supplied a key_destroy_func when creating the
glib.HashTable, the old key is freed using that function.
Starting from GLib 2.40, this function returns a boolean value to
indicate whether the newly added value was already in the hash table
or not.
Inserts a new key and value into a glib.HashTable similar to HashTable.insert. The difference is that if the key already exists in the glib.HashTable, it gets replaced by the new key. If you supplied a value_destroy_func when creating the glib.HashTable, the old value is freed using that function. If you supplied a key_destroy_func when creating the glib.HashTable, the old key is freed using that function.
Starting from GLib 2.40, this function returns a boolean value to indicate whether the newly added value was already in the hash table or not.