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/24_Map_HashMap.java at master · AlexeyNovichenko/JavaTutorial Expand file tree/ Copy path24_Map_HashMap.javaMore file actions 51 lines (40 loc) · 1.2 KB / Copy path24_Map_HashMap.javaFile metadata and controls51 lines (40 loc) · 1.2 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 import java.util.HashMap; import java.util.Map; public class Main { public static void main(String[] args) { /* KEY : VALUE * "red" : "apple" * "yellow" : "banana" * "white" : "radish" * "green" : "apple" * */ Map<String, String> fruits = new HashMap<>(); fruits.put("red", "apple"); fruits.put("yellow", "banana"); fruits.put("white", "radish"); fruits.put("green", "apple"); // fruits.containsKey("red"); // returns true, if key is found // fruits.containsValue("apple"); // returns true, if value is found // fruits.size(); // returns the size of the MAP // fruits.remove("red"); // Deletes the Entry whose key is "red" // fruits.clear(); System.out.println(fruits.get("red")); for (Map.Entry pairEntry: fruits.entrySet()) { System.out.println(pairEntry.getKey() + " : " + pairEntry.getValue()); } } } /* * Map: Interface * HashMap: Class that implements interface Map * * class HashMap implements Map { * ... * } * * Map Properties: * 1. They contain values based on key * 2. They are not ordered * 3. "KEY" should be unique * 4. "VALUE" can be duplicate * */ |
| 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. |