#include <worldhashmap.h>
|
entryT * | match (const keyT &key) const |
|
| Spinlock (int junk=0) |
| Make and initialize a spinlock ... initial state is unlocked.
|
|
virtual | ~Spinlock () |
|
void | lock () const |
| Acquire the spinlock waiting if necessary.
|
|
bool | try_lock () const |
| Try to acquire the spinlock ... return true on success, false on failure.
|
|
void | unlock () const |
| Free a spinlock owned by this thread.
|
|
◆ datumT
◆ entryT
◆ bin()
◆ ~bin()
◆ clear()
◆ del()
References madness::Spinlock::lock(), madness::Hash_private::entry< keyT, valueT >::next, madness::Hash_private::bin< keyT, valueT >::ninbin, madness::nonlinear_vector_solver(), madness::Hash_private::bin< keyT, valueT >::p, status, and madness::Spinlock::unlock().
Referenced by madness::ConcurrentHashMap< keyT, valueT, hashfunT >::erase(), and madness::ConcurrentHashMap< keyT, valueT, hashfunT >::erase().
◆ find()
References madness::Spinlock::lock(), madness::Hash_private::bin< keyT, valueT >::match(), madness::nonlinear_vector_solver(), madness::MutexReaderWriter::try_lock(), and madness::Spinlock::unlock().
Referenced by madness::ConcurrentHashMap< keyT, valueT, hashfunT >::find(), madness::ConcurrentHashMap< keyT, valueT, hashfunT >::find(), madness::ConcurrentHashMap< keyT, valueT, hashfunT >::find(), and madness::ConcurrentHashMap< keyT, valueT, hashfunT >::find().
◆ insert()
References madness::Spinlock::lock(), madness::Hash_private::bin< keyT, valueT >::match(), madness::Hash_private::bin< keyT, valueT >::ninbin, madness::nonlinear_vector_solver(), madness::Hash_private::bin< keyT, valueT >::p, madness::MutexReaderWriter::try_lock(), and madness::Spinlock::unlock().
Referenced by madness::ConcurrentHashMap< keyT, valueT, hashfunT >::insert(), madness::ConcurrentHashMap< keyT, valueT, hashfunT >::insert(), and madness::ConcurrentHashMap< keyT, valueT, hashfunT >::insert().
◆ match()
◆ size()
◆ ninbin
The documentation for this class was generated from the following file: