Files
mongo/util/concurrency
2010-07-30 10:45:15 -04:00
..
2010-07-12 22:12:57 -04:00
2010-07-28 11:06:04 -04:00
2010-07-23 11:48:07 -04:00
2010-07-01 17:54:08 -04:00
2010-07-23 12:29:30 -04:00
2010-06-02 14:25:02 -04:00
2010-07-28 11:06:04 -04:00
2010-07-28 11:06:04 -04:00
2010-07-01 17:52:07 -04:00
2010-07-22 15:10:23 -04:00
2010-07-30 10:45:15 -04: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
thread_pool.h 
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