| 
|   | sc_phash (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=default_ptr_hash_fn, cmpr_fn_t cmpr_fn=0) | 
|   | 
|   | ~sc_phash () | 
|   | 
| void  | copy (const sc_phash< K, C > *b) | 
|   | 
| void  | copy (const sc_phash< K, C > &b) | 
|   | 
| void  | copy (const sc_phash< K, C > &b, void *(*kdup)(const void *), void(*kfree)(void *)) | 
|   | 
| int  | insert (K k, C c) | 
|   | 
| int  | insert (K k) | 
|   | 
| int  | insert (K k, C c, void *(*kdup)(const void *)) | 
|   | 
| int  | insert_if_not_exists (K k, C c) | 
|   | 
| int  | insert_if_not_exists (K k) | 
|   | 
| int  | insert_if_not_exists (K k, C c, void *(*kdup)(const void *)) | 
|   | 
| int  | remove (K k) | 
|   | 
| int  | remove (K k, K *pk, C *pc) | 
|   | 
| int  | remove (K k, void(*kfree)(void *)) | 
|   | 
| int  | remove_by_contents (C c) | 
|   | 
| int  | remove_by_contents (bool(*predicate)(const void *, void *), void *arg) | 
|   | 
| int  | remove_by_contents (const void *c, void(*kfree)(void *)) | 
|   | 
| int  | remove_by_contents (bool(*predicate)(const void *, void *), void *arg, void(*kfree)(void *)) | 
|   | 
| int  | lookup (K k, C *pc) const  | 
|   | 
| bool  | contains (K k) const  | 
|   | 
| C  | operator[] (K k) const  | 
|   | 
|   | sc_phash_base (void *def=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=default_ptr_hash_fn, cmpr_fn_t cmpr_fn=0) | 
|   | 
|   | ~sc_phash_base () | 
|   | 
| void  | set_cmpr_fn (cmpr_fn_t) | 
|   | 
| void  | set_hash_fn (hash_fn_t) | 
|   | 
| bool  | empty () const  | 
|   | 
| unsigned  | count () const  | 
|   | 
| void  | erase () | 
|   | 
| void  | erase (void(*kfree)(void *)) | 
|   | 
| void  | copy (const sc_phash_base *) | 
|   | 
| void  | copy (const sc_phash_base &b) | 
|   | 
| void  | copy (const sc_phash_base &b, void *(*kdup)(const void *), void(*kfree)(void *)) | 
|   | 
| int  | insert (void *k, void *c) | 
|   | 
| int  | insert (void *k) | 
|   | 
| int  | insert (void *k, void *c, void *(*kdup)(const void *)) | 
|   | 
| int  | insert_if_not_exists (void *k, void *c) | 
|   | 
| int  | insert_if_not_exists (void *k) | 
|   | 
| int  | insert_if_not_exists (void *k, void *c, void *(*kdup)(const void *)) | 
|   | 
| int  | remove (const void *k) | 
|   | 
| int  | remove (const void *k, void **pk, void **pc) | 
|   | 
| int  | remove (const void *k, void(*kfree)(void *)) | 
|   | 
| int  | remove_by_contents (const void *c) | 
|   | 
| int  | remove_by_contents (bool(*predicate)(const void *, void *), void *arg) | 
|   | 
| int  | remove_by_contents (const void *c, void(*kfree)(void *)) | 
|   | 
| int  | remove_by_contents (bool(*predicate)(const void *, void *), void *arg, void(*kfree)(void *)) | 
|   | 
| int  | lookup (const void *k, void **pc) const  | 
|   | 
| bool  | contains (const void *k) const  | 
|   | 
| void *  | operator[] (const void *key) const  | 
|   | 
template<class K, class C>
class sc_core::sc_phash< K, C >
Definition at line 159 of file sc_hash.h.