GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaTutorial/src/23_Set_HashSet.java at master · Venkat2604/JavaTutorial Expand file tree/ Copy path23_Set_HashSet.javaMore file actions 55 lines (44 loc) · 1.19 KB / Copy path23_Set_HashSet.javaFile metadata and controls55 lines (44 loc) · 1.19 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 import java.util.HashSet; import java.util.Set; import java.util.TreeSet; public class Main { public static void main(String[] args) { // Set demonstration using HashSet Set<Integer> hashSet = new HashSet<>(); hashSet.add(23); hashSet.add(4); hashSet.add(4); hashSet.add(4); hashSet.add(10); for (int element: hashSet) { System.out.println(element + " "); } // hashSet.isEmpty(); // returns true, if Set is empty // hashSet.contains(10); // returns true, if the element is found // hashSet.remove(23); // returns true, if the element was deleted // hashSet.clear(); // Deletes all element System.out.println(); Set<Integer> treeSet = new TreeSet<>(); treeSet.add(23); treeSet.add(4); treeSet.add(4); treeSet.add(4); treeSet.add(10); treeSet.add(1); for (int element: treeSet) { System.out.println(element + " "); } } } /* * Set: Interface * HashSet: Implementation * TreeSet: Implementation [sorted] * * Properties: * 1. Unordered Collection * 2. Cannot store duplicate elements * 3. It has more implementation such as HashSet, TreeHashSet and TreeSet * * TreeSet contains elements in Sorted Order * */ |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |