GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

No menu could be recovered. Follow the blue links in the page.

This view

  • Original page
  • New address

GeezerVison is showing raw.githubusercontent.com — raw.githubusercontent.com

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 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 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 01402520 — 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.