Java ConcurrentLinkedQueue迭代元素顺序？

Question

Is the element currently being processed in a for loop, the head of the queue?

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

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

Or is using users.remove(u) preferable here?

Answer 1

Yes, that is correct for ConcurrentLinkedQueue<E> since it orders elements in FIFO order.

From the 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.