git源码：https://github.com/apache/tomcat/blob/3e5ce3108e2684bc25013d9a84a7966a6dcd6e14/java/org/apache/tomcat/util/collections/ConcurrentCache.java public final class ConcurrentCache<K,V> { private final int size; private final Map<K,V&...

前因：业务代码需要一个每次查询比当前ID值大的数据，想找一个环形数据结构，有但是没有直接能用的，就仿写了个 package com.daojia.cs.service.saleclue.utility.datastructure; import org.apache.commons.collections.MapUtils; import java.util.*; /** * author: dengjingbo * date: 2020/6/18 * desc: 不支持插入相同key 相同

public class HashMapTools { public static void saveHashSet(HashSet<String> h, String fileName) { String[] o = h.toArray(new String[h.size()]); try { File f = new File(fi