sysc/utils/sc_hash.h

50 class sc_phash_base {
83         return ((sc_phash_base*)this)->find_entry_q( hv, k, plast );
85 	return ((sc_phash_base*)this)->find_entry_c( hv, k, plast );
89     sc_phash_base( void* def       = 0,
96     ~sc_phash_base();
106     void copy( const sc_phash_base* );
107     void copy( const sc_phash_base& b ) { copy(&b); }
108     void copy( const sc_phash_base& b, void* (*kdup)(const void*), void (*kfree)(void*));
129     sc_phash_base*  table;
136     void reset(sc_phash_base* t);
137     void reset(sc_phash_base& t) { reset(&t); }
139     sc_phash_base_iter(sc_phash_base* t)
142     sc_phash_base_iter(sc_phash_base& t)
161 class sc_phash : public sc_phash_base {
174         : sc_phash_base((void*) def, size, density, grow, reorder, hash_fn, cmpr_fn) { }
177     void copy(const sc_phash<K,C>* b) { sc_phash_base::copy(b); }
178     void copy(const sc_phash<K,C>& b) { sc_phash_base::copy(b); }
179     void copy(const sc_phash<K,C>& b, void* (*kdup)(const void*), void (*kfree)(void*)) { sc_phash_base::copy(b, kdup, kfree); }
181     int insert(K k, C c) { return sc_phash_base::insert((void*) k, (void*) c); }
182     int insert(K k) { return sc_phash_base::insert((void*) k, default_value); }
183     int insert(K k, C c, void* (*kdup)(const void*)) { return sc_phash_base::insert((void*) k, (void*) c, kdup); }
186         return sc_phash_base::insert_if_not_exists((void*) k, (void*) c);
190         return sc_phash_base::insert_if_not_exists((void*) k, default_value);
194         return sc_phash_base::insert_if_not_exists((void*) k, (void*) c, kdup);
196     int remove(K k) { return sc_phash_base::remove((const void*) k); }
199         return sc_phash_base::remove((const void*) k, (void**) pk, (void**) pc);
203         return sc_phash_base::remove((const void*) k, kfree);
207         return sc_phash_base::remove_by_contents((const void*) c);
211         return sc_phash_base::remove_by_contents(predicate, arg);
215         return sc_phash_base::remove_by_contents(c, kfree);
219         return sc_phash_base::remove_by_contents(predicate, arg, kfree);
223         return sc_phash_base::lookup((const void*) k, (void**) pc);
227         return sc_phash_base::contains((const void*) k);
231         return (C) sc_phash_base::operator[]((const void*) k);
259 class sc_pdhash : public sc_phash_base {
277         : sc_phash_base((void*) def, size, density, grow, reorder, hash_fn, cmpr_fn)
288         sc_phash_base::erase(kfree);
290     void copy(const sc_pdhash<K,C>& b) { sc_phash_base::copy(b, kdup, kfree); }
291     int insert(K k, C c) { return sc_phash_base::insert((void*) k, (void*) c, kdup); }
292     int insert(K k) { return sc_phash_base::insert((void*) k, default_value, kdup); }
295         return sc_phash_base::insert_if_not_exists((void*) k, (void*) c, kdup);
299         return sc_phash_base::insert_if_not_exists((void*) k, default_value, kdup);
301     int remove(K k) { return sc_phash_base::remove((const void*) k, kfree); }
304         return sc_phash_base::remove((const void*) k, (void**) pk, (void**) pc);
308         return sc_phash_base::remove_by_contents((const void*) c, kfree);
312         return sc_phash_base::remove_by_contents(predicate, arg, kfree);
316         return sc_phash_base::lookup((const void*) k, (void**) pc);
320         return sc_phash_base::contains((const void*) k);
324         return (C) sc_phash_base::operator[]((const void*) k);
355 class sc_strhash : public sc_phash_base {
368         : sc_phash_base((void*) def, size, density, grow, reorder, hash_fn, cmpr_fn)
377     void erase() { sc_phash_base::erase(sc_strhash_kfree); }
378     void copy(const sc_strhash<C>* b) { sc_phash_base::copy(*b, sc_strhash_kdup, sc_strhash_kfree); }
379     void copy(const sc_strhash<C>& b) { sc_phash_base::copy(b, sc_strhash_kdup, sc_strhash_kfree); }
381     int insert(char* k, C c) { return sc_phash_base::insert((void*) k, (void*) c, sc_strhash_kdup); }
382     int insert(char* k) { return sc_phash_base::insert((void*) k, default_value, sc_strhash_kdup); }
385         return sc_phash_base::insert_if_not_exists((void*) k, (void*) c, sc_strhash_kdup);
389         return sc_phash_base::insert_if_not_exists((void*) k, default_value, sc_strhash_kdup);
391     int remove(const char* k) { return sc_phash_base::remove((const void*) k, sc_strhash_kfree); }
394         return sc_phash_base::remove((const void*) k, (void**) pk, (void**) pc);
398         return sc_phash_base::remove_by_contents((const void*) c, sc_strhash_kfree);
402         return sc_phash_base::remove_by_contents(predicate, arg, sc_strhash_kfree);
406         return sc_phash_base::lookup((const void*) k, (void** )pc);
410         return sc_phash_base::contains((const void*) k);
414         return (C) sc_phash_base::operator[]((const void*) k);