JAVA EXAMPLE PROGRAMS

JAVA EXAMPLE PROGRAMS

Publish Your Article Here

Program: How to iterate through LinkedHashSet?


Description:

Below example shows how to read all elements from LinkedHashSet object by using Iterator object.


Code:
package com.java2novice.linkedhashset;

import java.util.Iterator;
import java.util.LinkedHashSet;

public class MyLhsIterateEx {

	public static void main(String a[]){
		LinkedHashSet<String> lhs = new LinkedHashSet<String>();
		//add elements to HashSet
		lhs.add("first");
		lhs.add("second");
		lhs.add("third");
		Iterator<String> itr = lhs.iterator();
		while(itr.hasNext()){
			System.out.println(itr.next());
		}
	}
}

Output:
first
second
third
<< Previous Program | Next Program >>

List Of All LinkedHashSet Sample Programs:

  1. Basic LinkedHashSet Operations.
  2. How to delete all elements from LinkedHashSet?
  3. How to add another collection to LinkedHashSet?
  4. How to iterate through LinkedHashSet?
  5. How to compare two LinkedHashSet and retain elements which are same on both LinkedHashSet?
  6. How to copy content of LinkedHashSet to an array?
  7. How to delete specific element from LinkedHashSet?
  8. How to search an object from LinkedHashSet?
  9. How to eliminate duplicate user defined objects from LinkedHashSet?
  10. How to find user defined objects from LinkedHashSet?
  11. How to delete user defined objects from LinkedHashSet?
Knowledge Centre
When to use LinkedList or ArrayList?
Accessing elements are faster with ArrayList, because it is index based. But accessing is difficult with LinkedList. It is slow access. This is to access any element, you need to navigate through the elements one by one. But insertion and deletion is much faster with LinkedList, because if you know the node, just change the pointers before or after nodes. Insertion and deletion is slow with ArrayList, this is because, during these operations ArrayList need to adjust the indexes according to deletion or insetion if you are performing on middle indexes. Means, an ArrayList having 10 elements, if you are inserting at index 5, then you need to shift the indexes above 5 to one more.
Famous Quotations
The pessimist complains about the wind; the optimist expects it to change; the realist adjusts the sails.
-- William Arthur Ward

About Author

I'm Nataraja Gootooru, programmer by profession and passionate about technologies. All examples given here are as simple as possible to help beginners. The source code is compiled and tested in my dev environment.

If you come across any mistakes or bugs, please email me to [email protected].

Most Visited Pages

Other Interesting Sites

Reference: Java™ Platform Standard Ed. 7 - API Specification | Java™ Platform Standard Ed. 8 - API Specification | Java is registered trademark of Oracle.
Privacy Policy | Copyright © 2022 by Nataraja Gootooru. All Rights Reserved.