Lines Matching refs:in

31    -  Operations associated with a certain object must be performed in
46    Sequence the work items using a FIFO (first-in first-out structure).
47    Always keep an item in flight if possible. If no item is in flight
48    when a work item appears, put the item in flight. Otherwise, push the
49    item onto the FIFO. When the current item in flight completes, pop
50    another item from the FIFO and put it in flight.
55    number of items waiting and in flight. The example explains the
56    accounting in detail.
66    to implement local serialization in addition to priorities. It
86    the three constraints in the following table are met.
107    Constraints on a given functor are resolved from top to bottom in the
109    implementation of ``EnqueueWork`` packages the functor in a
164    Base class ``WorkItem`` is the same as class WorkItem in the example
188    Step 2 could be done after step 3 in some contexts to increase
203          std::atomic<int> count;         // Count of queued items and in-flight item
228    -  A count of queued or in-flight work.
238       that no other work is in flight and thus the work should be moved
243       1 to 0, then the queue is non-empty and another item in the queue
247    Class ``ReadyPile`` is explained in the example for Non-Preemptive