I am using std::queue for implementing JobQueue class. ( Basically this class process each job in FIFO manner). In one scenario, I want to clear the queue in one shot( delete all jobs from the queue). I don’t see any clear method available in std::queue class. How do I efficiently implement the clear method for … Read more
A very simple & quick question on Java libraries: is there a ready-made class that implements a Queue with a fixed maximum size – i.e. it always allows addition of elements, but it will silently remove head elements to accomodate space for newly added elements. Of course, it’s trivial to implement it manually: import java.util.LinkedList; … Read more
I need a queue which multiple threads can put stuff into, and multiple threads may read from. Python has at least two queue classes, Queue.Queue and collections.deque, with the former seemingly using the latter internally. Both claim to be thread-safe in the documentation. However, the Queue docs also state: collections.deque is an alternative implementation of … Read more
Suppose we have two stacks and no other temporary variable. Is to possible to “construct” a queue data structure using only the two stacks? 21 Answers 21
What is the best way to implement a Stack and a Queue in JavaScript? I’m looking to do the shunting-yard algorithm and I’m going to need these data-structures. 29 s 29 var stack = []; stack.push(2); // stack is now [2] stack.push(5); // stack is now [2, 5] var i = stack.pop(); // stack is … Read more
FIFO based Queue implementations?
This is my main method for a stacks/queues assignment. I keep getting an error with my queue, but not my Stack. The stack class seems to be working just fine. I’m completely stuck. It says “cannot instantiate type Queue”. Any help would be most appreciated! public class mainMeth { public static void main(String[] args) throws … Read more
Java queues don’t have enqueue and dequeue methods, these operations are done using the following methods: Enqueuing: add(e): throws exception if it fails to insert the object offer(e): returns false if it fails to insert the object Dequeuing: remove(): throws exception if the queue is empty poll(): returns null if the queue is empty Take … Read more
