Java Util vs. Trove - HashSet contains()

package utiltest;

import gnu.trove.set.TIntSet;
import gnu.trove.set.hash.TIntHashSet;

import java.util.HashSet;
import java.util.Set;

public class UtilTest {

    private static final int INIT_SIZE = 10;
    private static final int      ADDS = 10;
    private static final int  CONTAINS = 100000000;
    private static final int   REMOVES = 0;
    private static int x;

    public static void main(String[] args) {
        trove();
        util();
    }

    // trove
    private static void trove() {
        x = 0;
        long time = System.nanoTime();
        TIntSet map = new TIntHashSet(INIT_SIZE);
        for (int i = 0; i < ADDS; i++) {
            if (map.add(i)) x++;
        }
        for (int i = 0; i < CONTAINS; i++) {
            if (map.contains(i)) x++;
        }
        for (int i = 0; i < REMOVES; i++) {
            if (map.remove(i)) x++;
        }
        time = System.nanoTime() - time;
        System.out.println("Trove - " + time/1000000 + " ms");
        map.clear();
    }

    // java collections
    private static void util() {
        x = 0;
        long time = System.nanoTime();
        Set<Integer> map = new HashSet<Integer>(INIT_SIZE);
        for (int i = 0; i < ADDS; i++) {
            if (map.add(i)) x++;
        }
        for (int i = 0; i < CONTAINS; i++) {
            if (map.contains(i)) x++;
        }
        for (int i = 0; i < REMOVES; i++) {
            if (map.remove(i)) x++;
        }
        time = System.nanoTime() - time;
        System.out.println("Java Util - " + time/1000000 + " ms");
        map.clear();
    }

}