{"id":19020708,"url":"https://github.com/bhhbazinga/concurrentqueue","last_synced_at":"2025-08-31T12:10:40.623Z","repository":{"id":53497268,"uuid":"242659425","full_name":"bhhbazinga/ConcurrentQueue","owner":"bhhbazinga","description":"ConcurrentQueue implemented in c++, the algorithms involved are also used in Java ConcurrentLinkedQueue (Java Platform SE 8 ).","archived":false,"fork":false,"pushed_at":"2021-03-28T05:57:11.000Z","size":20,"stargazers_count":23,"open_issues_count":0,"forks_count":3,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-06-03T16:13:37.584Z","etag":null,"topics":["concurrent","cplusplus","lockfree","queue","thread"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/bhhbazinga.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2020-02-24T06:05:56.000Z","updated_at":"2024-09-05T08:08:09.000Z","dependencies_parsed_at":"2022-08-18T15:36:36.378Z","dependency_job_id":null,"html_url":"https://github.com/bhhbazinga/ConcurrentQueue","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/bhhbazinga/ConcurrentQueue","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bhhbazinga%2FConcurrentQueue","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bhhbazinga%2FConcurrentQueue/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bhhbazinga%2FConcurrentQueue/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bhhbazinga%2FConcurrentQueue/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bhhbazinga","download_url":"https://codeload.github.com/bhhbazinga/ConcurrentQueue/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bhhbazinga%2FConcurrentQueue/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272977453,"owners_count":25025140,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-31T02:00:09.071Z","response_time":79,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["concurrent","cplusplus","lockfree","queue","thread"],"created_at":"2024-11-08T20:18:19.773Z","updated_at":"2025-08-31T12:10:40.604Z","avatar_url":"https://github.com/bhhbazinga.png","language":"C++","readme":"# ConcurrentQueue\n ConcurrentQueue implemented in c++, the algorithms involved are also used in Java ConcurrentLinkedQueue (Java Platform SE 8 ).\n## Feature\n  * Thread-safe and Lock-free. \n  * Singly-linked list with a sentinel node.\n  * Support Multi-producer \u0026 Multi-consumer.\n  * Dynamic size.  \n  * Dynamically allocate and deallocate nodes. \n  * Use [Hazard Pointer with RAII style](https://github.com/bhhbazinga/HazardPointer) to avoid ABA problems and manage memory.\n## Benchmark\nI've compared it with another ConcurrentLinkedQueue implematation [LockFreeQueue](https://github.com/bhhbazinga/LockFreeQueue), and their efficiency are almost the same.See [test](test.cc). \n## Build\n```\nmake \u0026\u0026 ./test\n```\n## API\n```C++\nvoid Enqueue(const T\u0026 data);\nvoid Enqueue(T\u0026\u0026 data);\nvoid Emplace(Arg\u0026\u0026... args);\nbool Dequeue(T\u0026 data);\nsize_t size() const;\n```\n## Reference\n[1]Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects. Maged M. Michael\\\n[2]Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. Maged M. Michael Michael L. Scott\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbhhbazinga%2Fconcurrentqueue","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbhhbazinga%2Fconcurrentqueue","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbhhbazinga%2Fconcurrentqueue/lists"}