Java ConcurrentLinkedQueue 迭代元素顺序？

Question

当前正在 for 循环中处理的元素是队列的头部吗？

private Queue<User> users = new ConcurrentLinkedQueue<User>();

for(User u : users){
    users.remove(); // <- is this removing the currently iterated element?
}

或者这里使用 users.remove(u) 更好？

Answer 1

是的，ConcurrentLinkedQueue<E> 是正确的因为它按照 FIFO 顺序对元素进行排序。

来自docs :

This queue orders elements FIFO (first-in-first-out). The head of the queue is that element that has been on the queue the longest time. The tail of the queue is that element that has been on the queue the shortest time.