LinkedHashMap

插入元素

// 创建一个LinkedHashMap，注意默认是按插入顺序排序
LinkedHashMap<String, Integer> linkedHashMap = new LinkedHashMap<>();

// 插入元素
linkedHashMap.put("Apple", 1);
linkedHashMap.put("Banana", 2);
linkedHashMap.put("Cherry", 3);
linkedHashMap.put("Date", 4);
linkedHashMap.put("Elderberry", 5);

// 输出插入顺序的键值对
for (Map.Entry<String, Integer> entry : linkedHashMap.entrySet()) {
    System.out.println(entry.getKey() + ": " + entry.getValue());
}

Apple: 1
Banana: 2
Cherry: 3
Date: 4
Elderberry: 5

---

LRU 缓存功能（Least Recently Used 最近最少使用）

// 如果需要访问顺序排序，构造时设置accessOrder为true
LinkedHashMap<String, Integer> accessOrderMap = new LinkedHashMap<>(16, 0.75f, true);

accessOrderMap.put("Apple", 1);
accessOrderMap.put("Banana", 2);
accessOrderMap.put("Cherry", 3);
accessOrderMap.put("Date", 4);
accessOrderMap.put("Elderberry", 5);

// 访问顺序排序会在每次get/put/remove后更新顺序
System.out.println(accessOrderMap.get("Apple"));

for (Map.Entry<String, Integer> entry : accessOrderMap.entrySet()) {
    System.out.println(entry.getKey() + ": " + entry.getValue());
}

注意观察排序：
1
Banana: 2
Cherry: 3
Date: 4
Elderberry: 5
Apple: 1

LinkedHashMap<String, Integer> accessOrderMap = new LinkedHashMap<>(16, 0.75f);  // 顺序就不会改变
1
Apple: 1
Banana: 2
Cherry: 3
Date: 4
Elderberry: 5

---