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

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

Java LinkedHashSet spliterator() Method

The Java LinkedHashSet spliterator() method is used to get late-binding and fail-fast Spliterator over the elements in this set. The elements are returned in no particular order.

Following is the declaration for java.util.LinkedHashSet.spliterator() method.

public Spliterator<E> spliterator()

NA

The method call returns an Spliterator over the elements in this set.

NA

The following example shows the usage of Java LinkedHashSet spliterator() method to iterate entries of the LinkedHashSet. We've created a LinkedHashSet object of Integer. Then few entries are added using add() method and then an spliterator is retrieved using spliterator() method and each value is printed by iterating through the spliterator.

package com.tutorialspoint;

import java.util.LinkedHashSet;
import java.util.Spliterator;

public class LinkedHashSetDemo {
   public static void main(String args[]) {
      
      // create hash set
      LinkedHashSet <Integer> newset = new LinkedHashSet <>();      

      // populate hash set
      newset.add(1); 
      newset.add(2);
      newset.add(3);  

      // create an spliterator
      Spliterator<Integer> spliterator = newset.spliterator(); 

      // check values
      spliterator.forEachRemaining(v -> System.out.println(v));
   }    
}

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

1
2
3

The following example shows the usage of Java LinkedHashSet spliterator() method to iterate entries of the LinkedHashSet. We've created a LinkedHashSet object of String. Then few entries are added using add() method and then an spliterator is retrieved using spliterator() method and each value is printed by iterating through the spliterator.

package com.tutorialspoint;

import java.util.LinkedHashSet;
import java.util.Spliterator;

public class LinkedHashSetDemo {
   public static void main(String args[]) {
      
      // create hash set
      LinkedHashSet <String> newset = new LinkedHashSet <>();      

      // populate hash set
      newset.add("Learning"); 
      newset.add("Easy");
      newset.add("Simply");  

      // create an spliterator
      Spliterator<String> spliterator = newset.spliterator(); 

      // check values
      spliterator.forEachRemaining(v -> System.out.println(v));
   }    
}

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

Learning
Easy
Simply 

The following example shows the usage of Java LinkedHashSet spliterator() method to iterate entries of the LinkedHashSet. We've created a LinkedHashSet object of Student objects. Then few entries are added using add() method and then an spliterator is retrieved using spliterator() method and each value is printed by iterating through the spliterator.

package com.tutorialspoint;

import java.util.LinkedHashSet;
import java.util.Spliterator;

public class LinkedHashSetDemo {
   public static void main(String args[]) {
      
      // create hash set
      LinkedHashSet <Student> newset = new LinkedHashSet <>();      

      // populate hash set
      newset.add(new Student(1, "Julie")); 
      newset.add(new Student(2, "Robert"));
      newset.add(new Student(3, "Adam"));	  

      // create an spliterator
      Spliterator<Student> spliterator = newset.spliterator(); 

      // check values
      spliterator.forEachRemaining(v -> System.out.println(v));
   }    
}
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 + " ]";
   }
}

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

[ 1, Julie ]
[ 2, Robert ]
[ 3, Adam ]

java_util_linkedhashset.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