- LinkedHashSet Class extends extends HashSet shape together with Implements Set interface inward collection interface hierarchy.
- LinkedHashSet implementation differs from HashSet every bit it maintains doubly-linked listing running through all of its entries.
- It maintains element's entries inward laid upwards every bit per it's insertion order. So it volition permit y'all insertion companionship iteration over the set. So when y'all iterate over LinkedHashSet, In which companionship it volition provide elements? Answer is As per it's insertion order.
- So y'all volition function out same re-create of elements amongst the companionship how they inserted inward set.
- LinkedHashSetis non synchronized.
Bellow given example volition demonstrate y'all basic methods of LinkedHashSet together with it's usage.
package JAVAExamples; import java.util.Iterator; import java.util.LinkedHashSet; populace shape LinkedHashSetExample { populace static void main(String[] args) { LinkedHashSet<String> lhs = novel LinkedHashSet<String>(); // Add items to LinkedHashSet lhs.add("one"); lhs.add("two"); lhs.add("three"); lhs.add("four"); // Print LinkedHashSet. System.out.println(lhs); // Get size of LinkedHashSet. System.out.println("LinkedHashSet size Is : " + lhs.size()); // Check if LinkedHashSet is empty? System.out.println("Is LinkedHashSet emplty? : " + lhs.isEmpty()); // Iterate through LinkedHashSet. Iterator<String> itr = lhs.iterator(); System.out.println("LinkedHashSet Items are : "); acre (itr.hasNext()) { System.out.println(itr.next()); } // Remove special from LinkedHashSet. lhs.remove("three"); // Print LinkedHashSet. System.out.println("Now LinkedHashSet items are : " + lhs); } }Output :
[one, two, three, four] LinkedHashSet size Is : 4 Is LinkedHashSet emplty? : fake LinkedHashSet Items are : i 2 3 4 Now LinkedHashSet items are : [one, two, four]