在Java中实现固定大小的非阻塞队列的最有效方法是什么？

I am trying to find (or write) a Java class that represents a fixed-size, non-blocking, auto-discarding FIFO queue. (e.g. if the queue has a capacity of 100, putting item 101 removes item 1 then successfully appends item 101.) The answer to I am trying to find (or write) a Java class tha