Java LinkedBlockingDeque用法及代码示例

import java.util.concurrent.LinkedBlockingDeque;
public class LinkedBlockingDequeExample {
    public static void main(String[] args) throws InterruptedException {
        LinkedBlockingDeque<Integer> deque = new LinkedBlockingDeque<>(5);
         
        // Adding elements to the deque
        deque.offerFirst(1);
        deque.offerLast(2);
        deque.offerFirst(3);
        deque.offerLast(4);
         
        // Removing elements from the deque
        System.out.println(deque.pollFirst()); // Output: 3
        System.out.println(deque.pollLast()); // Output: 4
    }
}

// Java Program Demonstrate LinkedBlockingDeque
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class LinkedBlockingDequeDemo {
    public static void main(String[] args)
        throws InterruptedException
    {
        // create object of LinkedBlockingDeque
        // using LinkedBlockingDeque() constructor
        LinkedBlockingDeque<Integer> LBD
            = new LinkedBlockingDeque<Integer>();
        // Add numbers to end of LinkedBlockingDeque
        LBD.add(7855642);
        LBD.add(35658786);
        LBD.add(5278367);
        LBD.add(74381793);
        // print Deque
        System.out.println("Linked Blocking Deque1: "
                           + LBD);
        System.out.println("Size of Linked Blocking Deque1: "
                           + LBD.size());
        // create object of LinkedBlockingDeque
        // using LinkedBlockingDeque(int capacity) constructor
        LinkedBlockingDeque<Integer> LBD1
            = new LinkedBlockingDeque<Integer>(3);
        // Add numbers to end of LinkedBlockingDeque
        LBD1.add(7855642);
        LBD1.add(35658786);
        LBD1.add(5278367);
        try {
            // adding the 4th element
            // will throw exception for Deque full
            LBD1.add(74381793);
        }
        catch (Exception e) {
            System.out.println("Exception: " + e);
        }
        // print Deque
        System.out.println("Linked Blocking Deque2: "
                           + LBD1);
        System.out.println("Size of Linked Blocking Deque2: "
                           + LBD1.size());
        // create object of LinkedBlockingDeque
        // using LinkedBlockingDeque(Collection c) constructor
        LinkedBlockingDeque<Integer> LBD2
            = new LinkedBlockingDeque<Integer>(LBD1);
        // print Deque
        System.out.println("Linked Blocking Deque3: "
                           + LBD2);
    }
}

// Java code to illustrate methods of LinkedBlockingDeque
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class LinkedBlockingDequeDemo {
    public static void main(String[] args)
        throws InterruptedException
    {
        // create object of LinkedBlockingDeque
        LinkedBlockingDeque<Integer> LBD
            = new LinkedBlockingDeque<Integer>();
        // Add numbers to end of LinkedBlockingDeque
        // using add() method
        LBD.add(7855642);
        LBD.add(35658786);
        LBD.add(5278367);
        LBD.add(74381793);
        // prints the Deque
        System.out.println("Linked Blocking Deque: "
                           + LBD);
        // prints the size of Deque after removal
        // using size() method
        System.out.println("Size of Linked Blocking Deque: "
                           + LBD.size());
        // removes the front element and prints it
        // using removeFirst() method
        System.out.println("First element: "
                           + LBD.removeFirst());
        // prints the Deque
        System.out.println("Linked Blocking Deque: "
                           + LBD);
        // prints the size of Deque after removal
        // using size() method
        System.out.println("Size of Linked Blocking Deque: "
                           + LBD.size());
        // Add numbers to end of LinkedBlockingDeque
        // using offer() method
        LBD.offer(20);
        // prints the Deque
        System.out.println("Linked Blocking Deque: "
                           + LBD);
        // prints the size of Deque after removal
        // using size() method
        System.out.println("Size of Linked Blocking Deque: "
                           + LBD.size());
    }
}

// Java Program Demonstrate adding
// elements to LinkedBlockingDeque
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class AddingElementsExample {
    public static void main(String[] args)
        throws IllegalStateException
    {
        // create object of LinkedBlockingDeque
        LinkedBlockingDeque<Integer> lbd
            = new LinkedBlockingDeque<Integer>();
        // Add number to end of LinkedBlockingDeque
        lbd.add(7855642);
        // Add integer at the head or front
        lbd.addFirst(35658786);
        // Add integer at the tail or end
        lbd.addLast(5278367);
        // print Deque
        System.out.println("Linked Blocking Deque: " + lbd);
           
          // Create object of ArrayList collection 
        ArrayList<Integer> ArrLis 
            = new ArrayList<Integer>(); 
   
        // Add number to ArrayList 
        ArrLis.add(55); 
        ArrLis.add(66); 
        ArrLis.add(77); 
        ArrLis.add(88); 
   
        // Print ArrayList 
        System.out.println("ArrayList: " + ArrLis); 
   
        // Function addAll() adds all the elements of 
        // ArrayList to Deque 
        lbd.addAll(ArrLis); 
   
        // Print deque 
        System.out.println("Linked Blocking Deque: " + lbd); 
    }
}

// Java Program Demonstrate removing
// elements of LinkedBlockingDeque
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class RemovingElementsExample {
    public static void main(String[] args)
        throws InterruptedException
    {
        // create object of LinkedBlockingDeque
        LinkedBlockingDeque<Integer> lbd
            = new LinkedBlockingDeque<Integer>();
        // Add numbers to end of LinkedBlockingDeque
        lbd.add(7855642);
        lbd.add(35658786);
        lbd.add(5278367);
        lbd.add(74381793);
        lbd.add(12345566);
        // print Dequeue
        System.out.println("Linked Blocking Deque: " + lbd);
        // removes the front element
        lbd.remove();
        // print the modified deque
        System.out.println("Linked Blocking Deque: " + lbd);
        // removes the front element
        lbd.removeFirst();
        // print the modified deque
        System.out.println("Linked Blocking Deque: " + lbd);
        // removes the last element
        lbd.removeLast();
        // print the modified deque
        System.out.println("Linked Blocking Deque: " + lbd);
    }
}

// Java Program Demonstrate iterating
// over LinkedBlockingDeque
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class IteratingExample {
    public static void main(String[] args)
    {
        // create object of LinkedBlockingDeque
        LinkedBlockingDeque<Integer> LBD
            = new LinkedBlockingDeque<Integer>();
        // Add numbers to front of LinkedBlockingDeque
        LBD.addFirst(7855642);
        LBD.addFirst(35658786);
        LBD.addFirst(5278367);
        LBD.addFirst(74381793);
        // Call iterator() method of LinkedBlockingDeque
        Iterator iteratorVals = LBD.iterator();
        // Print elements of iterator
        // created from PriorityBlockingQueue
        System.out.println("The iterator values"
            + " of LinkedBlockingDeque are:");
        // prints the elements using an iterator
        while (iteratorVals.hasNext()) {
            System.out.println(iteratorVals.next());
        }
    }
}