list

HashSetDemo

/**
 * @qvthor liuwenzheng
 * @date 2021/5/8 9:16
 */
public class HashSetDemo {
    public static void main(String[] args) {
        HashSet<String>set = new HashSet<>();  // <> 鉆石語法
        set.add("111");
        set.add("xxx");
        set.add("上顯");
        set.add("333");
        System.out.println(set);
        set.remove("xxx"); // 根據(jù)內(nèi)容移除
        System.out.println(set);
        int size = set.size();
        boolean  empty = set.isEmpty(); //判斷是否為空
        System.out.println(size);
        System.out.println(empty);
        set.clear(); //清楚
        System.out.println(set);

    }
}

TreeSetDemo

/**
 * @qvthor liuwenzheng
 * @date 2021/5/8 9:26
 */
public class TreeSetDemo {
    public static void main(String[] args) {
        TreeSet<String> set = new TreeSet<>();
        set.add("111");
        set.add("222");
        set.add("地理");
        set.add("化學");
        set.add("abc");
        set.add("efg");
        System.out.println(set);
    }
}

HashMapDemo

/**
 * @qvthor liuwenzheng
 * @date 2021/5/8 10:06
 */
public class HashMapDemo {
    public static void main(String[] args) {
        HashMap<String, String> map = new HashMap<>();  //DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka 16 默認的初始值為16
        map.put("henan","河南");  //entry  實例
        map.put("hebei","河北");
        map.put("hubei", "湖北");
        map.put("hubei", "湖北1");  //鍵重復會覆蓋掉原有的值


        map.put("null","空1");
        map.put(null,"空2");
        System.out.println(map);

        for (Map.Entry<String,String> m : map.entrySet()){
            System.out.println(m);
        }
        for (String  k  : map.keySet()){
            System.out.println(k + "=" + map.get(k));

        }
        for (String v : map.values()){
            System.out.println(v);
        }
    }
}
        //DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka 16 默認的初始值為16
        //DEFAULT_LOAD_FACTOR = 0.75f; 當體內(nèi)容量達到全部的百分之75的時候直接擴容
        //TREEIFY_THRESHOLD = 8;  當長度為8的時候樹化
        //UNTREEIFY_THRESHOLD = 6; 當長度為6的時候 退化為數(shù)組
        //MAXIMUM_CAPACITY = 1 << 30;  默認的最大  = 2的30次方

TrueMapDemo

/**
 * @qvthor liuwenzheng
 * @date 2021/5/8 11:03
 */
public class TrueMapDemo {
    public static <TrueMap> void main(String[] args) {
        TreeMap<String, String> map = new TreeMap<>();  //DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka 16 默認的初始值為16
        map.put("henan","河南");  //entry  實例
        map.put("hebei","河北");
        map.put("hubei", "湖北");
        map.put("hubei", "湖北1");  //鍵重復會覆蓋掉原有的值


        map.put("null","空1");
        map.put(null,"空2");
        System.out.println(map);

        for (Map.Entry<String,String> m : map.entrySet()){
            System.out.println(m);
        }
        for (String  k  : map.keySet()){
            System.out.println(k + "=" + map.get(k));

        }
        for (String v : map.values()){
            System.out.println(v);
        }
    }
}
//DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka 16 默認的初始值為16
//DEFAULT_LOAD_FACTOR = 0.75f; 當體內(nèi)容量達到全部的百分之75的時候直接擴容
//TREEIFY_THRESHOLD = 8;  當長度為8的時候樹化
//UNTREEIFY_THRESHOLD = 6; 當長度為6的時候 退化為數(shù)組
//MAXIMUM_CAPACITY = 1 << 30;  默認的最大  = 2的30次方