concurrentqueue

{
  "aliases": [],
  "alternatives": [],
  "build_dependencies": [
    "cmake"
  ],
  "categories": [],
  "caveats": null,
  "conflicts_with": [],
  "dependencies": [],
  "deprecated": 0,
  "deprecation_reason": null,
  "desc": "Fast multi-producer, multi-consumer lock-free concurrent queue for C++11",
  "disable_reason": null,
  "disabled": 0,
  "enrichment_fetched_at": "2026-06-20T23:36:34+00:00",
  "first_seen": "2026-06-20T23:34:18+00:00",
  "full_name": "concurrentqueue",
  "github_default_branch": "master",
  "github_last_commit_at": "2026-04-28T13:16:53Z",
  "github_readme_excerpt": "# moodycamel::ConcurrentQueue\u003cT\u003e\r\n\r\nAn industrial-strength lock-free queue for C++.\r\n\r\nNote: If all you need is a single-producer, single-consumer queue, I have [one of those too][spsc].\r\n\r\n## Features\r\n\r\n- Knock-your-socks-off [blazing fast performance][benchmarks].\r\n- Single-header implementation. Just drop it in your project.\r\n- Fully thread-safe lock-free queue. Use concurrently from any number of threads.\r\n- C++11 implementation -- elements are moved (instead of copied) where possible.\r\n- Templated, obviating the need to deal exclusively with pointers -- memory is managed for you.\r\n- No artificial limitations on element types or maximum count.\r\n- Memory can be allocated once up-front, or dynamically as needed.\r\n- Fully portable (no assembly; all is done through standard C++11 primitives).\r\n- Supports super-fast bulk operations.\r\n- Includes a low-overhead blocking version (BlockingConcurrentQueue).\r\n- Exception safe.\r\n\r\n## Reasons to use\r\n\r\nThere are not that many full-fledged lock-free queues for C++. Boost has one, but it\u0027s limited to objects with trivial\r\nassignment operators and trivial destructors, for example.\r\nIntel\u0027s TBB queue isn\u0027t lock-free, and requires trivial constructors too.\r\nThere\u0027re many academic papers that implement lock-free queues in C++, but usable source code is\r\nhard to find, and tests even more so.\r\n\r\nThis queue not only has less limitations than others (for the most part), but [it\u0027s also faster][benchmarks].\r\nIt\u0027s been fairly well-tested, and offers advanced features like **bulk enqueueing/dequeueing**\r\n(which, with my new design, is much faster than one element at a time, approaching and even surpassing\r\nthe speed of a non-concurrent queue even under heavy contention).\r\n\r\nIn short, there was a lock-free queue shaped hole in the C++ open-source universe, and I set out\r\nto fill it with the fastest, most complete, and well-tested design and implementation I could.\r\nThe result is `moodycamel::ConcurrentQueue` :-)\r\n\r\n## Reasons *not* to use",
  "github_repo": "cameron314/concurrentqueue",
  "github_stars": 12335,
  "github_topics": [],
  "homepage": "https://github.com/cameron314/concurrentqueue",
  "homepage_og_description": null,
  "homepage_og_image": null,
  "homepage_title": null,
  "installs_30d": 1,
  "installs_365d": 29,
  "installs_90d": 16,
  "keg_only": 0,
  "keg_only_reason": null,
  "last_seen": "2026-06-20T23:34:18+00:00",
  "license": "(BSD-2-Clause OR BSL-1.0) AND Zlib",
  "llm_generated_at": null,
  "llm_model": null,
  "name": "concurrentqueue",
  "oldnames": [],
  "one_liner": null,
  "optional_dependencies": [],
  "rank_30d": 15882,
  "rank_365d": 12769,
  "rank_90d": 10362,
  "raw_hash": "3d1982d5251858d8",
  "recommended_dependencies": [],
  "revision": 0,
  "ruby_source_path": "Formula/c/concurrentqueue.rb",
  "tap": "homebrew/core",
  "test_dependencies": [],
  "uses_from_macos": [],
  "version_head": null,
  "version_stable": "1.0.5",
  "versioned_formulae": [],
  "why_use_this": null
}