java集合框架性能比较

比较对象：HashSet,  LinkedHashSet,  TreeSet,  ArrayList,  LinkedList

package com.yhao.JCF;

import java.util.*;

public class TestSetListPerformance {

 public static void main(String[] args) {
  //创建一个hashset，并测试其性能
  Collection<Integer> set1 = new HashSet<Integer>();
  System.out.println("Time for hash set is " + getRunTime(set1, 200000) + " milliseconds");

  //创建一个linkedhashset，并测试其性能
  Collection<Integer> set2 = new LinkedHashSet<Integer>();
  System.out.println("Time for linked set is " + getRunTime(set2, 200000) + " milliseconds");
 
  //创建一个treeset，并测试其性能
  Collection<Integer> set3 = new TreeSet<Integer>();
  System.out.println("Time for tree set is " + getRunTime(set3, 200000) + " milliseconds");
 
  //创建一个arraylist，并测试其性能
  Collection<Integer> set4 = new ArrayList<Integer>();
  System.out.println("Time for array list is " + getRunTime(set4, 200000) + " milliseconds");
 
  //创建一个linkedlist，并测试其性能
  Collection<Integer> set5 = new LinkedList<Integer>();
  System.out.println("Time for linked list is " + getRunTime(set5, 200000) + " milliseconds");
 }
 
 public static long getRunTime(Collection<Integer> c, int size) {
  long startTime = System.currentTimeMillis();
 
  List<Integer> list = new ArrayList<Integer>();
  for(int i = 0; i < size; i++) {
   list.add(i);
  }
 
  //打乱list元素顺序
  Collections.shuffle(list);
 
  //将list的元素添加到容器c中
  for(int element: list) {
   c.add(element);
  }
 
  Collections.shuffle(list);
 
  for(int element: list) {
   c.remove(element);
  }
 
  long endTime = System.currentTimeMillis();
  return endTime - startTime;
 }
}