Java arrayblockingqueue, synchronousqueue

The blockingqueue interface defines a blocking FIFO queue. Each blockingqueue has a capacity, which causes blocking when the capacity is full and data is added to blockingqueue;When the capacity is empty, the element fetch operation will be blocked.

SynchronousqueuE: Yes.A blocking queue. Each put must wait for one take, and vice versa. The synchronization queue does not have any internal capacity or even the capacity of a queue. You cannot perform peek on the synchronization queue, because this element exists only when you try to obtain it. This element cannot exist unless another thread tries to remove it (using any method) you cannot add an element or iterate a queue because no element can be used for iteration.The queue header is the first queued thread element to be added to the queue. If no queued thread exists, no element is added and the header is null..