Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I was browsing through the Java docs to look for the Java equivalent for C++’s STL Queue, but all I found was an interface called Queue and a bunch of implementations I can’t make heads or tails of.
Does Java have an implementation for Queue that’s just a FIFO data structure without the added bells and whistles? I only need the enqueue, dequeue and front operations and the data structure should allow duplicates.
Queuewill work. Use any implementation you like.LinkedListorConcurrentLinkedQueuefor example.enqueue=offer(..)dequeue=poll()front=peek()