GLib.HashTableIter¶
Fields¶
| Name | Type | Access | Description | 
|---|---|---|---|
| dummy1 | object | r | |
| dummy2 | object | r | |
| dummy3 | object | r | |
| dummy4 | int | r | |
| dummy5 | bool | r | |
| dummy6 | object | r | 
Details¶
- 
class GLib.HashTableIter¶
- A - GLib.HashTableIterstructure represents an iterator that can be used to iterate over the elements of a- GLib.HashTable.- GLib.HashTableIterstructures are typically allocated on the stack and then initialized with- GLib.HashTableIter.init().- The iteration order of a - GLib.HashTableIterover the keys/values in a hash table is not defined.- 
init(hash_table)[source]¶
- Parameters: - hash_table ({ - object:- object}) – a- GLib.HashTable- Initializes a key/value pair iterator and associates it with hash_table. Modifying the hash table after calling this function invalidates the returned iterator. - The iteration order of a - GLib.HashTableIterover the keys/values in a hash table is not defined.- GHashTableIter iter; gpointer key, value; g_hash_table_iter_init (&iter, hash_table); while (g_hash_table_iter_next (&iter, &key, &value)) { // do something with key and value } - New in version 2.16. 
 - 
next()[source]¶
- Returns: - Falseif the end of the- GLib.HashTablehas been reached.- key: - a location to store the key - value: - a location to store the value - Return type: - ( - bool, key:- object, value:- object)- Advances self and retrieves the key and/or value that are now pointed to as a result of this advancement. If - Falseis returned, key and value are not set, and the iterator becomes invalid.- New in version 2.16. 
 - 
remove()[source]¶
- Removes the key/value pair currently pointed to by the iterator from its associated - GLib.HashTable. Can only be called after- GLib.HashTableIter.next() returned- True, and cannot be called more than once for the same key/value pair.- If the - GLib.HashTablewas created using g_hash_table_new_full(), the key and value are freed using the supplied destroy functions, otherwise you have to make sure that any dynamically allocated values are freed yourself.- It is safe to continue iterating the - GLib.HashTableafterward:- while (g_hash_table_iter_next (&iter, &key, &value)) { if (condition) g_hash_table_iter_remove (&iter); } - New in version 2.16. 
 - 
replace(value)[source]¶
- Parameters: - value ( - objector- None) – the value to replace with- Replaces the value currently pointed to by the iterator from its associated - GLib.HashTable. Can only be called after- GLib.HashTableIter.next() returned- True.- If you supplied a value_destroy_func when creating the - GLib.HashTable, the old value is freed using that function.- New in version 2.30. 
 - 
steal()[source]¶
- Removes the key/value pair currently pointed to by the iterator from its associated - GLib.HashTable, without calling the key and value destroy functions. Can only be called after- GLib.HashTableIter.next() returned- True, and cannot be called more than once for the same key/value pair.- New in version 2.16. 
 
-