HashTable

Object Hierarchy:

[ Compact ]
public class HashTable<K,V>

Namespace: GLib

Package: glib-2.0

public HashTable (HashFunc<K>? hash_func, EqualFunc<K>? key_equal_func)
public HashTable.full (HashFunc<K>? hash_func, EqualFunc<K>? key_equal_func, DestroyNotify? key_destroy_func, DestroyNotify? value_destroy_func)

public void insert (owned K key, owned V value)
public void replace (owned K key, owned V value)
Inserts a new key and value into a GenericSet similar to @set.
public void add (owned K key)
public weak V lookup (K key)
public bool lookup_extended (K lookup_key, out K orig_key, out V value)
Looks up a key in the GenericSet, returning the original key and the associated value and a bool which is true if the key was found.
public bool contains (K key)
public bool remove (K key)
public void remove_all ()
public uint foreach_remove (HRFunc<K,V> predicate)
public weak V @get (K key)
public void @set (owned K key, owned V value)
Inserts a new key and value into a GenericSet.
public List<weak K> get_keys ()
public (weak K)[] get_keys_as_array ()
public List<weak V> get_values ()
public void @foreach (HFunc<K,V> func)
public void for_each (HFunc<K,V> func)
public weak V find (HRFunc<K,V> predicate)
public uint size ()
Returns the number of elements contained in the GenericSet.
public bool steal (K key)
Removes a key and its associated value from a GenericSet without calling the key and value destroy functions.
public void steal_all ()
Removes all keys and their associated values from a GenericSet without calling the key and value destroy functions.
public V take (K key, out bool exists = null)