Update to 0.4.1

release notes follow from http://concurrencykit.org/releases/
---
I am pleased to announce release 0.3.4 of Concurrency Kit. Acquire and
release fences have finally been introduced.  Significant performance
improvements were made to spinlock, rwlock, pflock, cohorts, brlocks and
bytelocks on RMO and PSO architectures (PPC*, SPARCv9+, ARM). Significant
improvements have been made to ck_hs write-side performance in the
presence of deletes. Latency improvements to ck_epoch for read-side
critical sections on x86 were introduced. Last but not least, the
parametric ck_ring has been re-introduced following discussion and
feedback.
---
I am pleased to announce release 0.3.5 of Concurrency Kit. This release
includes a critical bug fix for ck_ht_gc that affects CK_HT_MODE_DIRECT
hash tables (it does not affect bytestring hash tables). Additional
optimizations were made to ck_ht_gc and ck_hs_gc for empty hash tables.
---
I am pleased to announce release 0.4 of Concurrency Kit.
Critical bug fixes were made to ck_bytelock (thanks to Albi Kalvo)
for unslotted readers and 32-bit architectures (see below for
details). A new robin-hood hash set implementation was added by
Olivier Houchard that provides excellent stable performance
for delete and write-heavy workloads, while still providing
SPMC progress guarantees. A new operation has been added to
the bitmap, ck_bitmap_union, that provides a (non-linearized)
union of two bitmaps. Some other API changes were made to
ck_bitmap. Last but not least, the library now uses the correct
naming convention for Darwin targets.
---
I am pleased to announce release 0.4.1 of Concurrency Kit.
This fixes a calculation error in ck_bitmap_union, which
can lead to a crash condition. This was missed due to
a lack of the typical testing cycle for the function.


(mspo)