Lines Matching refs:is

9 push and pop elements from the queue. The queue is unbounded and has no
12 std::queue. The operation ``try_pop`` pops an item if it is available.
39 The equivalent thread-safe |full_name| code is:
52 In a single-threaded program, a queue is a first-in first-out structure.
54 definition of "first" is uncertain. Use of ``concurrent_queue``
60 Template class ``concurrent_queue`` is unbounded and has no methods that
61 wait. It is up to the user to provide synchronization to avoid overflow,
62 or to wait for the queue to become non-empty. Typically this is
66 Template class ``concurrent_bounded_queue<T,Alloc>`` is a variant that
85 The value of concurrent_queue::size() is defined as the number of push
88 ``concurrent_queue`` is empty, and there are ``n`` pending pop
91 ``empty()`` is defined to be true if and only if ``size()`` is not
95 By default, a ``concurrent_bounded_queue`` is unbounded. It may hold any
98 causes ``push`` to block until there is room in the queue. Bounded
99 queues are slower than unbounded queues, so if there is a constraint
101 large, it is better not to set the capacity. If you do not need the