#include <sc_hash.h>
Public 型 | |
typedef sc_pdhash_iter< K, C > | iterator |
Public メソッド | |
sc_pdhash (C def=(C) 0, int size=PHASH_DEFAULT_INIT_TABLE_SIZE, int density=PHASH_DEFAULT_MAX_DENSITY, double grow=PHASH_DEFAULT_GROW_FACTOR, bool reorder=PHASH_DEFAULT_REORDER_FLAG, hash_fn_t hash_fn=(hash_fn_t) 0, cmpr_fn_t cmpr_fn=(cmpr_fn_t) 0, void *(*kdup_fn)(const void *)=0, void(*kfree_fn)(void *)=0) | |
~sc_pdhash () | |
void | erase () |
void | copy (const sc_pdhash< K, C > &b) |
int | insert (K k, C c) |
int | insert (K k) |
int | insert_if_not_exists (K k, C c) |
int | insert_if_not_exists (K k) |
int | remove (K k) |
int | remove (K k, K *pk, C *pc) |
int | remove_by_contents (C c) |
int | remove_by_contents (bool(*predicate)(const void *, void *), void *arg) |
int | lookup (K k, C *pc) const |
bool | contains (K k) const |
C | operator[] (K k) const |
Private 変数 | |
void *(* | kdup )(const void *) |
void(* | kfree )(void *) |
フレンド | |
class | sc_pdhash_iter< K, C > |
typedef sc_pdhash_iter<K,C> sc_core::sc_pdhash< K, C >::iterator |
sc_core::sc_phash_baseを再定義しています。
sc_core::sc_pdhash< K, C >::sc_pdhash | ( | C | def = (C) 0 , |
|
int | size = PHASH_DEFAULT_INIT_TABLE_SIZE , |
|||
int | density = PHASH_DEFAULT_MAX_DENSITY , |
|||
double | grow = PHASH_DEFAULT_GROW_FACTOR , |
|||
bool | reorder = PHASH_DEFAULT_REORDER_FLAG , |
|||
hash_fn_t | hash_fn = (hash_fn_t) 0 , |
|||
cmpr_fn_t | cmpr_fn = (cmpr_fn_t) 0 , |
|||
void *(*)(const void *) | kdup_fn = 0 , |
|||
void(*)(void *) | kfree_fn = 0 | |||
) | [inline] |
sc_core::sc_pdhash< K, C >::~sc_pdhash | ( | ) | [inline] |
void sc_core::sc_pdhash< K, C >::erase | ( | ) | [inline] |
sc_core::sc_phash_baseを再定義しています。
void sc_core::sc_pdhash< K, C >::copy | ( | const sc_pdhash< K, C > & | b | ) | [inline] |
int sc_core::sc_pdhash< K, C >::insert | ( | K | k, | |
C | c | |||
) | [inline] |
int sc_core::sc_pdhash< K, C >::insert | ( | K | k | ) | [inline] |
int sc_core::sc_pdhash< K, C >::insert_if_not_exists | ( | K | k, | |
C | c | |||
) | [inline] |
int sc_core::sc_pdhash< K, C >::insert_if_not_exists | ( | K | k | ) | [inline] |
int sc_core::sc_pdhash< K, C >::remove | ( | K | k | ) | [inline] |
int sc_core::sc_pdhash< K, C >::remove | ( | K | k, | |
K * | pk, | |||
C * | pc | |||
) | [inline] |
int sc_core::sc_pdhash< K, C >::remove_by_contents | ( | C | c | ) | [inline] |
int sc_core::sc_pdhash< K, C >::remove_by_contents | ( | bool(*)(const void *, void *) | predicate, | |
void * | arg | |||
) | [inline] |
sc_core::sc_phash_baseを再定義しています。
int sc_core::sc_pdhash< K, C >::lookup | ( | K | k, | |
C * | pc | |||
) | const [inline] |
bool sc_core::sc_pdhash< K, C >::contains | ( | K | k | ) | const [inline] |
C sc_core::sc_pdhash< K, C >::operator[] | ( | K | k | ) | const [inline] |
friend class sc_pdhash_iter< K, C > [friend] |
void*(* sc_core::sc_pdhash< K, C >::kdup)(const void *) [private] |
void(* sc_core::sc_pdhash< K, C >::kfree)(void *) [private] |