Postmodern immutable and persistent data structures for C++ — value semantics at scale
ConcurrentQueue is a header-only C++ template library that provides a lock-free data structure for multi-producer multi-consumer thread communication. It functions as a synchronization primitive designed to coordinate data flow between concurrent execution units using atomic operations rather than traditional mutex locking. The library distinguishes itself through a design that minimizes contention and synchronization overhead. It utilizes sub-queue token mapping to distribute workloads across partitioned internal queues and supports bulk operations to transfer multiple data elements in singl
Go package implementing Bloom filters, used by many important systems
The main features of bits-and-blooms/bloom are: Data Structures.
Open-source alternatives to bits-and-blooms/bloom include: bits-and-blooms/bitset — Go package implementing bitsets. deckarep/golang-set — This project is a set theory library for Go that provides a data structure for storing unique elements of any… alandefreitas/small — C++ small containers. arximboldi/immer — Postmodern immutable and persistent data structures for C++ — value semantics at scale. cameron314/concurrentqueue — ConcurrentQueue is a header-only C++ template library that provides a lock-free data structure for multi-producer… facebook/immutable-js — This is a persistent data structure library for JavaScript that provides collections which prevent the direct mutation…
