Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.tutorialspoint.com/java/queue_remove.htm below:

Java - Queue remove() Method

The Java Queue remove() method removes first element of the list. Shifts any subsequent elements to the left (subtracts one from their indices).

Following is the declaration for java.util.Queue.remove() method

public E remove(int index)

NA

This method returns the first element.

NoSuchElementException − if list is empty.

The following example shows the usage of Java Queue remove() method. We're creating a Queue of Integers. We're adding couple of Integers to the Queue object using add() method calls per element. Queue size is printed, queue is printed and using remove() method, first element is removed. Then size and queue is printed again.

package com.tutorialspoint;

import java.util.LinkedList;
import java.util.Queue;

public class QueueDemo {
   public static void main(String[] args) {
      
      // create an empty queue
      Queue<Integer> queue = new LinkedList<>();

      // use add() method to add elements in the queue
      queue.add(20);
      queue.add(15);
      queue.add(30);
      queue.add(45);

      System.out.println("Size of list: " + queue.size());
	  // let us print all the elements available in list again
      System.out.println("Queue = " + queue);
      
      // Removes first element 
      queue.remove();

      System.out.println("Now, Size of list: " + queue.size());
      
      // let us print all the elements available in list again
      System.out.println("Queue = " + queue);
   }
}   

Let us compile and run the above program, this will produce the following result −

Size of list: 4
Queue = [20, 15, 30, 45]
Now, Size of list: 3
Queue = [15, 30, 45]

The following example shows the usage of Java Queue remove(object) method. We're creating a Queue of String. We're adding couple of Strings to the Queue object using add() method calls per element. Queue size is printed, queue is printed and using remove(object) method, an element is removed. Then size and queue is printed again.

package com.tutorialspoint;

import java.util.LinkedList;
import java.util.Queue;

public class QueueDemo {
   public static void main(String[] args) {
      
      // create an empty queue
      Queue<String> queue = new LinkedList<>();

      // use add() method to add elements in the queue
      queue.add("A");
      queue.add("B");
      queue.add("C");
      queue.add("D");

      System.out.println("Size of list: " + queue.size());
	  // let us print all the elements available in list again
      System.out.println("Queue = " + queue);
      
      // Removes element B
      queue.remove("B");

      System.out.println("Now, Size of list: " + queue.size());
      
      // let us print all the elements available in list again
      System.out.println("Queue = " + queue);
   }
}   

Let us compile and run the above program, this will produce the following result −

Size of list: 4
Queue = [A, B, C, D]
Now, Size of list: 3
Queue = [A, C, D]

The following example shows the usage of Java Queue remove(index) method. We're creating a Queue of Student objects. We're adding couple of Students to the Queue object using add() method calls per element. Queue size is printed, queue is printed and using remove(index) method, an element is removed. Then size and queue is printed again.

package com.tutorialspoint;

import java.util.LinkedList;
import java.util.Queue;

public class QueueDemo {
   public static void main(String[] args) {
      
      // create an empty queue
      Queue<Student> queue = new LinkedList<>();

      // use add() method to add elements in the queue
      queue.add(new Student(1, "Julie"));
      queue.add(new Student(2, "Robert"));
      queue.add(new Student(3, "Adam"));

      System.out.println("Size of list: " + queue.size());
	  // let us print all the elements available in list again
      System.out.println("Queue = " + queue);
      
      // Removes element at 3rd position
      queue.remove(2);

      System.out.println("Now, Size of list: " + queue.size());
      
      // let us print all the elements available in list again
      System.out.println("Queue = " + queue);
   }
}
class Student {
   int rollNo;
   String name;

   Student(int rollNo, String name){
      this.rollNo = rollNo;
      this.name = name;
   }

   @Override
   public String toString() {
      return "[ " + this.rollNo + ", " + this.name + " ]";
   }
   
   @Override
   public boolean equals(Object obj) {
      Student s = (Student)obj;
      return this.rollNo == s.rollNo && this.name.equalsIgnoreCase(s.name);
   }
}   

Let us compile and run the above program, this will produce the following result −

Size of list: 3
Queue = [[ 1, Julie ], [ 2, Robert ], [ 3, Adam ]]
Now, Size of list: 2
Queue = [[ 1, Julie ], [ 2, Robert ]]

java_util_queue.htm

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4