mongo-debian/util/concurrency
2011-12-15 09:35:47 +01:00
..
list.h Imported Upstream version 2.0.0 2011-09-14 17:08:06 +02:00
msg.h Imported Upstream version 1.8.0 2011-03-17 00:05:43 +01:00
mutex.h Imported Upstream version 2.0.0 2011-09-14 17:08:06 +02:00
mvar.h Imported Upstream version 1.8.0 2011-03-17 00:05:43 +01:00
race.h Imported Upstream version 2.0.0 2011-09-14 17:08:06 +02:00
README Imported Upstream version 1.8.0 2011-03-17 00:05:43 +01:00
rwlock.h Imported Upstream version 2.0.2 2011-12-15 09:35:47 +01:00
shared_mutex_win.hpp Imported Upstream version 2.0.0 2011-09-14 17:08:06 +02:00
spin_lock.cpp Imported Upstream version 2.0.2 2011-12-15 09:35:47 +01:00
spin_lock.h Imported Upstream version 2.0.0 2011-09-14 17:08:06 +02:00
synchronization.cpp Imported Upstream version 2.0.0 2011-09-14 17:08:06 +02:00
synchronization.h Imported Upstream version 2.0.0 2011-09-14 17:08:06 +02:00
task.cpp Imported Upstream version 1.8.0 2011-03-17 00:05:43 +01:00
task.h Imported Upstream version 1.8.0 2011-03-17 00:05:43 +01:00
thread_pool.cpp Imported Upstream version 1.8.0 2011-03-17 00:05:43 +01:00
thread_pool.h Imported Upstream version 1.8.0 2011-03-17 00:05:43 +01:00
value.h Imported Upstream version 2.0.2 2011-12-15 09:35:47 +01:00
vars.cpp Imported Upstream version 2.0.2 2011-12-15 09:35:47 +01:00

util/concurrency/ files

list.h - a list class that is lock-free for reads
rwlock.h - read/write locks (RWLock)
msg.h - message passing between threads
task.h - an abstraction around threads
mutex.h - small enhancements that wrap boost::mutex
mvar.h
 This is based on haskell's MVar synchronization primitive:
 http://www.haskell.org/ghc/docs/latest/html/libraries/base-4.2.0.0/Control-Concurrent-MVar.html
 It is a thread-safe queue that can hold at most one object.
 You can also think of it as a box that can be either full or empty.
value.h
 Atomic wrapper for values/objects that are copy constructable / assignable
thread_pool.h 
spinlock.h
synchronization.h 
 A class to establish a sinchronization point between two threads. One thread is the waiter and one 
 is the notifier. After the notification event, both proceed normally.