This is the simplest implementation of the BlockingQueue and also its subinterface BlockingDeque. As we discussed in the previous chapter, a Deque is a double-ended queue that has add, remove, offer, and so on, type of methods in the form of xxxFirst and xxxLast to do the act with one or the other end of the queue. The Deque interface defines getFirst and getLast instead of consistently naming elementFirst and elementLast, so this is something you should get used to. After all, the IDEs help with automatic code completion so this should not be a really big problem.