Hence, it is generally used in multi-threading applications. It is considered as a thread-safe collection. The LinkedBlockingQueue uses linked lists as its internal storage. Returns the length of the linked blocking queue.Ĭonverts linked blocking queue to an array and return the array.Ĭonverts the linked blocking queue to string If the element is found, it returns true, if not it returns false. Searches the linked blocking queue for the specified element. Hence, we must enclose it inside a try.catch block. Here, the take() method will throw an InterrupedException if it is interrupted while waiting. If the linked blocking queue is empty, it waits until there are elements in the linked blocking queue to be deleted. To return and remove an element from the front of the linked blocking queue, we can use the take() method.
Here, the put() method may throw an InterruptedException if it is interrupted while waiting. If the linked blocking queue is full, it waits until there is space in the linked blocking queue to insert the element. To insert the specified element to the end of a linked blocking queue, we use the put() method. These methods will wait until they can be successfully executed. In multithreading processes, we can use put() and take() to block the operation of one thread to synchronize it with another thread. ("Updated LinkedBlockingQueue " + animals) clear() - Removes all the elements from the linked blocking queue.poll() - Returns and removes a specified element from the linked blocking queue.It throws an exception if the queue is empty.
remove() - Returns and removes a specified element from the linked blocking queue.LinkedBlockingQueue Elements: Dog, Cat, Horse, iterator() - Returns an iterator object to sequentially access an element from the linked blocking queue.peek() - Returns an element from the front of the linked blocking queue.It returns false if the queue is full.įor example, import offer() - Inserts a specified element to the linked blocking queue.It throws an exception if the queue is full. add() - Inserts a specified element to the linked blocking queue.These two methods distinguish the linked blocking queue from other typical queues. These methods are used to insert, access and delete elements from linked blocking queues.Īlso, we will learn about two methods put() and take() that support the blocking operation in the linked blocking queue. The LinkedBlockingQueue class provides the implementation of all the methods in the BlockingQueue interface. Note: It is not compulsory to provide the size of the linked list. LinkedBlockingQueue age = new LinkedBlockingQueue(5) Creating Integer type LinkedBlockingQueue with size 5 LinkedBlockingQueue animals = new LinkedBlockingQueue(5) capacity - the size of the linked blocking queueįor example, // Creating String type LinkedBlockingQueue with size 5.Type - the type of the linked blocking queue.With the initial capacity LinkedBlockingQueue animal = new LinkedBlockingQueue(int capacity) Here the default initial capacity will be 2 31-1.Ģ. Without the initial capacity LinkedBlockingQueue animal = new LinkedBlockingQueue() Here is how we can create a linked blocking queue in Java:ġ.
In order to create a linked blocking queue, we must import the package. It implements the Java BlockingQueue interface.
The LinkedBlockingQueue class of the Java Collections framework provides the blocking queue implementation using a linked list.
0 kommentar(er)
