Is there a material difference between pop() and remove() in Java ArrayDeque?

Question

Both remove and pop remove and return an element from the front of the Queue. They both throw an exception if there's an empty Queue.

Joni · Accepted Answer · 2020-07-07 03:43:17Z

1

There is no difference. In fact, pop() and remove() methods both call removeFirst. See https://github.com/openjdk/jdk/blob/master/src/java.base/share/classes/java/util/ArrayDeque.java

public E remove() {
    return removeFirst();
}

public E pop() {
    return removeFirst();
}

answered Jul 7, 2020 at 3:43

Joni

112k14 gold badges151 silver badges201 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

Alex78191 Over a year ago

Why are there so many identical methods?

Arpit · Accepted Answer · 2020-07-07 03:47:31Z

1

Both the methods internally calls removeFirst(), so there is not difference. ArrayDeque can be used as stack as well as LinkedList hence we have different interfaces, based on how we want to use it (as a stack, queue or linkedlist). It was introduced in version 1.6 of java API which is much later than Stack and LinkedList. As per oracle documentation

ArrayDeque class is likely to be faster than Stack when used as a stack, and faster than LinkedList when used as a queue.

public E remove() {
    return removeFirst();
}

public E pop() {
    return removeFirst();
}

answered Jul 7, 2020 at 3:47

Arpit

1,09115 silver badges18 bronze badges

Collectives™ on Stack Overflow

Is there a material difference between pop() and remove() in Java ArrayDeque?

2 Answers 2

1 Comment

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

1 Comment

Comments

Your Answer

Sign up or log in

Post as a guest

Related