- Java.util Package Classes
- Java.util - Home
- Java.util - ArrayDeque
- Java.util - ArrayList
- Java.util - Arrays
- Java.util - BitSet
- Java.util - Calendar
- Java.util - Collections
- Java.util - Currency
- Java.util - Date
- Java.util - Dictionary
- Java.util - EnumMap
- Java.util - EnumSet
- Java.util - Formatter
- Java.util - GregorianCalendar
- Java.util - HashMap
- Java.util - HashSet
- Java.util - Hashtable
- Java.util - IdentityHashMap
- Java.util - LinkedHashMap
- Java.util - LinkedHashSet
- Java.util - LinkedList
- Java.util - ListResourceBundle
- Java.util - Locale
- Java.util - Observable
- Java.util - PriorityQueue
- Java.util - Properties
- Java.util - PropertyPermission
- Java.util - PropertyResourceBundle
- Java.util - Random
- Java.util - ResourceBundle
- Java.util - ResourceBundle.Control
- Java.util - Scanner
- Java.util - ServiceLoader
- Java.util - SimpleTimeZone
- Java.util - Stack
- Java.util - StringTokenizer
- Java.util - Timer
- Java.util - TimerTask
- Java.util - TimeZone
- Java.util - TreeMap
- Java.util - TreeSet
- Java.util - UUID
- Java.util - Vector
- Java.util - WeakHashMap
- Java.util Package Extras
- Java.util - Interfaces
- Java.util - Exceptions
- Java.util - Enumerations
- Java.util Useful Resources
- Java.util - Useful Resources
- Java.util - Discussion
Java LinkedHashSet Class
Introduction
The Java LinkedHashSet class is a Hash table and Linked list implementation of the Set interface, with predictable iteration order.Following are the important points about LinkedHashSet −
This class provides all of the optional Set operations, and permits null elements.
Class declaration
Following is the declaration for java.util.LinkedHashSet class −
public class LinkedHashSet<E> extends HashSet<E> implements Set<E>, Cloneable, Serializable
Parameters
Following is the parameter for java.util.LinkedHashSet class −
E − This is the type of elements maintained by this set.
Class constructors
Sr.No. | Constructor & Description |
---|---|
1 | LinkedHashSet() This constructs a new, empty linked hash set with the default initial capacity (16) and load factor (0.75). |
2 | LinkedHashSet(Collection<? extends E> c) This constructs a new linked hash set with the same elements as the specified collection. |
3 | LinkedHashSet(int initialCapacity) This constructs a new, empty linked hash set with the specified initial capacity and the default load factor (0.75). |
4 | LinkedHashSet(int initialCapacity, float loadFactor) This constructs a new, empty linked hash set with the specified initial capacity and load factor. |
Class methods
Sr.No. | Method & Description |
---|---|
1 | Spliterator<E> spliterator()
This method returns a late-binding and fail-fast Spliterator over the elements in this set. |
This class inherits methods from the following classes −
- java.util.HashSet
- java.util.AbstractSet
- java.util.AbstractCollection
- java.util.Object
- java.util.Set
Getting a Spliterator() to Iterate Entries of LinkedHashSet Example
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