3 - Changed: CMake is used for build libcds. Ancient build.sh is removed
4 - Changed: unit and stress tests are migrated to googletest framework
8 - Added: FeldmanHashSet/Map - an interesting hash map algorithm
9 based on multi-level array, requires perfect hashing or fixed-sized keys.
10 Supports thread-safe bidirectional iterators.
11 - Added: BronsonAVLTreeMap - Bronson's et al AVL tree implementation
12 - Added: CMake build script, thanks to Eugeny Kalishenko
13 - Changed: SplitList performance improving, thanks to Mike Krinkin
14 - Changed: semantic of member functions extract(), get() and its
15 variants for MichaelList RCU-based specialization: extract() does not
16 require RCU locking, get() now returns special wrapper object of type raw_ptr,
18 Thus, semantics of extract()/get() of all RCU-based set and maps based on
19 MichaelList (MichaelSet/Map, SplitListSet/Map) has been changed too.
20 - Changed: SplitListSet/Map functions get() and get_with() return special wrapper
21 object of type raw_ptr, see doc.
22 - Removed: SplitListSet/Map force_dispose() function.
23 - cds::lock namespace is renamed to cds::sync. All classes defined in cds::lock namespace
24 are moved to cds::sync with new names (for example, cds::lock::SpinLock is renamed to
25 cds::sync::spin_lock). cds::lock namespace and its contents is deprecated, it is kept
26 for backward compatibility.
27 - The library has been checked by ThreadSanitizer, a lot of bugs has been fixed
28 - Added support for clang 3.7 with libc++
32 - the library has been rewritten to support at least C++11. Compilers: GCC 4.8+, clang 3.3+,
33 MS Visual C++ 12 (2013) Update 4 an above.
34 - Removed: MichaelDeque, reason: the implementation is heavy-weighted, inefficient,
36 - Removed: cds::gc::HRC garbage collector, reason: the implementation is inefficient
38 - Changed: all container's declaration except StripedSet has been unified to the
39 following traits-based form:
40 class Container< GC, T, Traits >
41 - Added: new member function pop_with(Func) to cds::container::TreiberStack
42 - Added: new member functions enqueue_with(Func), dequeue_with(Func) to
43 cds::container::MSQueue
44 cds::container::MoirQueue
45 cds::container::BasketQueue
46 cds::container::OptimisticQueue
47 cds::container::RWQueue
48 cds::container::SegmentedQueue
49 cds::container::TsigasCycleQueue
50 cds::container::VyukovMPMCCycleQueue
51 - Added: new member functions push_with(Func) and pop_with(Func) to cds::container::MSPriorityQueue
52 - SegmentedQueue: add padding into segmented_queue::traits to eliminate false sharing.
53 - Changed: guarded_ptr and exempt_ptr have move semantics now. The container's extract() and get()
54 member functions return the objects of that type.
55 - Changed: improved cds::gc::HP and cds::gc::DHP internal implementation
56 - Changed: map member function insert_key() has been renamed to insert_with()
57 - Changed: cds/cxx11_atomic.h has been renamed to cds/algo/atomic.h
58 - Removed: cds/refcounter.h
62 - Add flat combining (FC) technique and FC-based containers: FCStack, FCQueue,
63 FCDeque, FCPriorityQueue
64 - Add elimination back-off feature to TreiberStack class
65 - Add SegmentedQueue - an unfair queue implementation
66 - New member functions for sets and maps:
67 Functions get() and get_with() search a key and return the pointer to item found
69 Function extract() searches a key, unlinks the item found from the container
70 and returns pointer to item in safe manner.
71 The functions get, get_with, extract, extract_with extract_min, extract_max
72 has been added to the following container:
73 SkipListSet, SkipListMap
74 EllenBinTree, EllenBinTreeSet, EllenBinTreeMap
75 The functions get, get_with, extract, extract_with has been added
76 to the following container:
78 MichaelHashSet, MichaelHashMap
79 SplitListSet, SplitListMap
80 - Fix a serious bug in cds::gc::HRC
81 - Changed MSPriorityQueue to simplify interface and to fix possible pop() deadlock
82 - Fix a bug in BasketQueue
83 - Fix EllenBinTree crash under high contention
84 - Changed: the thread manager detach order to prevent crashing of signal-handled RCU
86 - Changed: cds::gc::HP calls Scan() when a thread is detached.
87 This prevents accumulating retired data.
88 - Changed: minimal boost version is 1.51
89 - Removed: file cds/lock/rwlock.h
93 1. Added: EllenBinTree - an implementation of unbalanced binary search
94 tree based on paper [2010] F.Ellen, P.Fatourou, E.Ruppert, F.van Breugel
95 "Non-blocking Binary Search Tree".
96 2. Added: MSPriorityQueue - an array-based lock-based priority queue heap,
97 see [1996] G.Hunt, M.Michael, S. Parthasarathy, M.Scott "An efficient
98 algorithm for concurrent priority queue heaps"
99 3. Added support for boost.atomic for boost 1.54 and above.
100 Now, libcds supports processor architecture like ARM, PowerPC and any other
101 that are supported by boost.atomic or by C++11 compiler. Any feedbacks are appreciated.
102 To use boost.atomic you should specify -DCDS_USE_BOOST_ATOMIC in compiler's command line.
103 4. Added: a new CDS_USE_LIBCDS_ATOMIC preprocessor flag has been added to direct
104 the compiler to use libcds atomic unconditionally.
105 5. build.sh has been modified to relax processor architecture and OS requirements.
106 This allows to use libcds with native compiler atomic support (or boost.atomic)
107 for a processor architecture that has not been tested by libcds's developers.
108 6. Added support for CLang 3.3
109 7. Added support for MS VC++ 2013
110 8. Added support for Mac OS X, see build/sample/build-osx-clang-libc++.sh,
111 build/sample/build-osx-gcc.sh for example.
112 9. Fixed: SkipListSet::erase_with does not take into account "less" predicate parameter.
113 10.Fixed: some bugs in SkipListSet leading to deadloop
114 11.Fixed: MichaelMap bug: computing hash value for type Q different from key type.
118 1. Added: user-space RCU garbage collector (5 different implementations),
119 see cds::urcu namespace
120 2. Added: RCU-related set/map container specializations
121 3. Added: Skip-list specialization for cds::gc::nogc (undeletable skip-list)
122 4. For set/map classes: find_with and erase_with member functions have been added.
123 These functions allow to use different predicates for searching.
124 5. Added: threading model based on Ñ++11 thread_local keyword (CDS_THREADING_CXX11).
125 At present, only gcc 4.8 supports such model.
126 6. Fixed: bug #11 "ABA bug in libcds 1.3.1 cds/intrusive/msqueue.h"
127 Thanks to Jelle van den Hooff.
128 7. Added support for GCC 4.8
132 - Bug fixed: building libcds with boost versions before 1.48
133 Thanks Lucas Larsch who points me to this problem.
137 1. Added: StripedSet, StripedMap - hash set and hash map
138 implementation based on fine-grained lock-striping technique
139 2. Added: CuckooSet, CuckooMap - implementation of cuckoo hashing algorithm
140 based on fine-grained lock-striping technique
141 3. Added: SkipListSet, SkipListMap - implementation of lock-free skip list
142 4. Added: template <typename... Args> emplace(Args&&... args) member function
143 for all containers in cds::container namespace. This function is available
144 only if the compiler supports new C++11 features - variadic
145 templates and move semantics.
146 5. Changed: lambda functions are used internally instead of wrapping functors.
147 If the compiler does not support C++11 lambdas the old-style wrapping functors are used.
148 6. Changed: test projects has been splitted for optimizing compile time.
149 7. Breaking change: class cds::lock::Auto has been renamed to cds::lock::scoped_lock,
150 class cds::lock::AutoUnlock has been removed
151 8. Added: support for MinGW (tested with TDM-GCC 64bit, gcc 4.7)
153 1.2.0 20.08.2012 (beta)
155 1. Added: MichaelDeque - deque lock-free algo discovered by Maged Michael
156 2. Added: BasketQueue - Michael's queue modification discovered by Nir Shavit et al.
157 3. Added: support of Clang 3.0, 3.1 compiler (tested on Linux with boost 1.49)
158 4. Fixed: solving problem of 8-byte atomic data alignment on 32-bit platforms
159 5. Fixed bug 3536393: OptimisticQueue core dump
161 1.1.0 17.04.2012 (beta)
163 1. Added: C++11 atomic operations support. The library has been rewritten
164 for using std::atomic class and operations proposed in C++11 Standard.
165 If the compiler does not support the standard <atomic> library,
166 own partial implementation declared in cds/cxx11_atomic.h is used.
167 cxx11_atomic.h contains implementation for lock-free part of C++11
168 <atomic> header needed for libcds.
169 2. Added: support for C++11 feature (if applicable):
170 - inline namespace (for GCC 4.4+)
171 - function =default and =delete specifiers (for GCC 4.4+)
172 3. Changed: the main reclamation cycle ("liberate" function) of cds::gc::PTB
173 memory reclamation schema has been optimized. Previous implementation
174 could lead to unbounded memory consumption under high contention.
175 4. Changed: the internal structure of cds::intrusive::OptimisticQueue is greatly simplified.
176 The interface of the class is slightly changed.
177 5. Fixed: some problem with cds::gc::HRC memory reclamation schema that
178 could be the cause of occasional program crash.
179 6. Fixed: an error in node reclamation algo in queue implementation (MSQueue, MoirQueue,
180 OptimisticQueue). As an result of the error, some items could be lost with memory leaks.
181 7. Changed: cds::concept namespace and its content has been removed
182 8. Added support for Microsoft Visual C++ 11 Beta
183 9. Added support for GCC 4.7
185 1.0.0 31.12.2011 (beta)
186 This version is completely rewritten to support intrusive version of lock-free containers
187 and more lightweight garbage collectors interface.
188 The class hierarchy and interfaces have been completely reimplemented from scratch.
190 1. Added: intrusive containers. Many lock-free containers in libcds have the intrusive
191 counterparts. The library is fully refactored to support intrusive containers.
192 Class hierarchy is changed: almost all non-intrusive container classes are based
193 on their intrusive versions.
194 Two new namespace is added:
195 cds::intrusive - for intrusive containers
196 cds::container - for non-intrusive containers
197 Namespaces by container type (cds::queue, cds::map and so on) have been removed.
198 2. Added: New option-based approach is used for class declaration instead
199 old traits-based one. This approach allows to declare template arguments
200 in position-independent manner that is very useful for complex template declarations.
201 Option-based declarations use C++0x variadic templates if compiler supports it (GCC),
202 otherwise (MS VC) an emulation is used.
203 3. Changed: garbage collectors interface is generalized. cds::gc::GC (where GC is
204 one of HP, HRC, PTB) classes has been added.
205 4. Removed: tagged pointer GC. This GC
206 - unsafe for complex data structure
207 - x86-specific since it requires double-width CAS primitive
208 - memory-consuming since it requires separate free-list for each type stored in the containers
209 5. Default threading model is changed (see doc for cds::threading namespace):
210 - for Windows and MSVC++, CDS_THREADING_WIN_TLS is the default now
211 - for *nix and GCC, CDS_THREADING_PTHREAD is the default now
212 6. Added GCC 4.6 support (constexpr)
213 7. Added Microsoft Visual Studio 2010 (vc10) solution
215 0.8.0 28.03.2011 (beta)
216 1. Added: cds::Initialize and cds::Terminate functions that initializes and frees library's
218 2. Added: cds::memory::michael::Heap - Michael's lock-free allocator
219 3. Added: Exponential back-off strategy for spinning
220 4. Added: cds::queue::vyukov_mpmc_bounded - bounded queue
221 developed by Dmitry Vyukov (http://www.1024cores.net)
222 5. Added: support for FreeBSD amd64, x86
224 0.7.2 27.02.2011 (beta)
225 1. [Bug 3157201] Added implementation of threading manager based on Windows TLS API, see
226 cds::threading::wintls::Manager. Added CDS_THREADING_WIN_TLS macro. See docs for
227 cds::threading namespace for details.
228 2. Fixed bug in cds::threading::pthread::Manager: ptb_gc has not been initialized properly.
230 template <typename T, typename FUNC>
231 bool erase( const key_type& key, T& dest, FUNC func ) ;
232 has been added to all map classes.
234 template <typename T, typename FUNC>
235 bool insert( const key_type& key, T& val, FUNC func ) ;
236 has been added to all map classes.
237 5. Added new argument "bNew" to functor "func" of map's "ensure" member function:
238 void func( VALUE& itemValue, const VALUE& val, bool bNew ) ;
239 bNew = true if new item has been added
240 bNew = false if key is found
241 6. Fixed bug in cds::map::SplitOrderedList: LSB of dummy node's hash should be zero
242 7. Changed: thread liveliness checking on *nix has been changed to pthread_kill(id, 0).
243 8. Fixed: in map template member functions the functor may be passed by value
244 or by reference; use boost::ref( yourFunctor ) to pass your functor by reference
245 9. Fixed: cds::gc::tagged GC and all classes based on this GC has been rewritten
246 to solve stability problems.
248 0.7.1 30.12.2010 (beta)
249 1. [Bug 3130852] cds::queue::TZCyclicQueue::empty() has been corrected
250 2. [Bug 3128161] It seems, GCC 4.4 has a bug in __thread on x86 and x86_64. New "threading model"
251 CDS_THREADING_AUTODETECT has been added. See docs of cds::threading namespace for details
252 3. Fixed errors in the "Pass-the-Buck" garbage collector (namespace cds::gc::ptb)
253 4. [Bug 3128148] The code is aligned with the C++ standard (minor violations has been removed)
254 5. [Bug 3141654] missing break statement for atomic store - fixed
255 6. Added in-place scan strategy to cds::gc::hzp::GarbageCollector that does not allocate any memory.
256 7. Fixed bugs in HRC and tagged GC
258 0.7.0 05.12.2010 (beta)
259 1. Preliminary support for "Pass The Buck" memory manager is added. See cds::gc::ptb namespace.
260 2. Many part of library is rewritten to generalize the usage of various GCs
261 3. The new class cds::details::aligned_allocator has been added for allocating aligned memory
262 blocks. It is useful for Tagged Pointer memory reclamation schema (cds::gc::tagged_gc).
263 4. [Break change] New argument has been added to the member functions "ensure" and "find"
264 for ordered list and map classes
265 5. New member function "emplace" has been added to ordered list and map classes. This member function
266 allows change the value (or a part of it) of list/map item.
267 6. The internal structure of class cds::map::MichaelHashMap is completely refactored to support
268 cds::gc::no_gc correctly
269 7. The classes RecursiveSpinT, RecursiveSpin32, RecursiveSpin64, and RecursiveSpin from cds::lock
270 namespace have been renamed to ReentrantSpinT, ReentrantSpin32, ReentrantSpin64, and ReentrantSpin
272 8. Compiler support: GCC version below 4.3.0 is not supported
273 9. Fixed memory leak in cds::map::SplitOrderedList
274 10. Added compiler barrier to spin-lock release primitive for x86 and amd64
275 11. Makefile script is changed to resolve the problem when an user calls 'make clean' directly.
276 Thanks to Tamas Lengyel to point me to this bug.
277 12. The file dictionary.txt is excluded from distributive. This file is used for testing purposes only.
278 You may create dictionary.txt in this way:
282 0.6.0 26.03.2010 (beta)
283 1. The library is rewritten using atomic primitives with explicit memory ordering (based on C++
284 memory model proposal). The implementation of atomic primitives for supported architectures
285 is developed from scratch.
288 0.5.0 31.12.2009 (beta)