public class HashTable < K, V > : Boxed {
public HashTable ( HashFunc hash_func,
EqualFunc key_equal_func ) ;
public HashTable.full ( HashFunc hash_func,
EqualFunc key_equal_func,
DestroyNotify? key_destroy_func,
DestroyNotify? value_destroy_func ) ;
public void insert ( K key,
V value ) ;
public void replace ( K key,
V value ) ;
public weak V lookup ( K key ) ;
public bool remove ( K key ) ;
public void remove_all ( ) ;
public List< K > get_keys ( ) ;
public List< V > get_values ( ) ;
public void for_each ( HFunc func,
void** user_data ) ;
public uint size ( ) ;
}

public HashTable ( HashFunc hash_func,
EqualFunc key_equal_func ) ;
public HashTable.full ( HashFunc hash_func,
EqualFunc key_equal_func,
DestroyNotify? key_destroy_func,
DestroyNotify? value_destroy_func ) ;
public void insert ( K key,
V value ) ;
public void replace ( K key,
V value ) ;
public weak V lookup ( K key ) ;
public bool remove ( K key ) ;
public void remove_all ( ) ;
public List< K > get_keys ( ) ;
public List< V > get_values ( ) ;
public void for_each ( HFunc func,
void** user_data ) ;
public uint size ( ) ;
Created by Valadoc