3 docs tagged with "queue"

Boost.Lockfree provides lock-free and wait-free data structures — concurrent queues and

A queue looks like a data structure and is really a design decision. The structure part is unremarkable — a circular buffer with a head, a tail and two waiting lists. The decision is what makes it worth a page: a FreeRTOS queue copies the item in and copies it out again, and every property people value in queues follows from that one fact.

Stacks and queues are not new storage — they are restrictions on storage. Both hold a sequence,