标签:count time1 java HashMap int System time2 TreeMap ++
很多时候,我们用jdbctemplate或mybatis的时候,为了查询通用,会选择使用map数据结构,因为hashmap本身无序,所以为了保证key的有序性,会采用linkedhashmap。所以我们要看一下Linkedhashmap的性能影响多大。如下:
@Test public void test() { Integer count =1000000; Random random =new Random(); Map<String, String> map = new HashMap<String, String>(); for (int i = 0; i < count; i++) { map.put(i+"", i+""); } long time1 = System.currentTimeMillis(); for (int i = 0; i < count; i++) { map.get((random.nextInt(count)+1)+""); } long time2 = System.currentTimeMillis(); System.out.println("HashMap time:" + (time2 - time1)); //////////////////////////////////////////////////////////////////////// Map<String, String> linkedMap = new LinkedHashMap<String, String>(); for (int i = 0; i < count; i++) { linkedMap.put(i+"", i+""); } time1 = System.currentTimeMillis(); for (int i = 0; i < count; i++) { linkedMap.get((random.nextInt(count)+1)+""); } time2 = System.currentTimeMillis(); System.out.println("LinkedHashMap time:" + (time2 - time1)); //////////////////////////////////////////////////////////////////////// Map<String, String> treeMap = new TreeMap<String, String>(); for (int i = 0; i < count; i++) { treeMap.put(i+"", i+""); } time1 = System.currentTimeMillis(); for (int i = 0; i < count; i++) { treeMap.get((random.nextInt(count)+1)+""); } time2 = System.currentTimeMillis(); System.out.println("TreeMap time:" + (time2 - time1)); }
执行结果:
HashMap time:641 LinkedHashMap time:703 TreeMap time:4040
读取数据是有序,则如下:
@Test public void test2() { Integer count =1000000; Random random =new Random(); Map<String, String> map = new HashMap<String, String>(); for (int i = 0; i < count; i++) { map.put(i+"", i+""); } long time1 = System.currentTimeMillis(); for (int i = 0; i < count; i++) { map.get(i+""); } long time2 = System.currentTimeMillis(); System.out.println("HashMap time:" + (time2 - time1)); //////////////////////////////////////////////////////////////////////// Map<String, String> linkedMap = new LinkedHashMap<String, String>(); for (int i = 0; i < count; i++) { linkedMap.put(i+"", i+""); } time1 = System.currentTimeMillis(); for (int i = 0; i < count; i++) { linkedMap.get(i+""); } time2 = System.currentTimeMillis(); System.out.println("LinkedHashMap time:" + (time2 - time1)); //////////////////////////////////////////////////////////////////////// Map<String, String> treeMap = new TreeMap<String, String>(); for (int i = 0; i < count; i++) { treeMap.put(i+"", i+""); } time1 = System.currentTimeMillis(); for (int i = 0; i < count; i++) { treeMap.get(i+""); } time2 = System.currentTimeMillis(); System.out.println("TreeMap time:" + (time2 - time1)); }
HashMap time:297
LinkedHashMap time:203
TreeMap time:438
从上可知,LinkedHashMap是可以完全代替HashMap的,不用担心性能问题。
标签:count,time1,java,HashMap,int,System,time2,TreeMap,++ 来源: https://www.cnblogs.com/zhjh256/p/11626524.html
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。