Examples with IntHashSet com.thinkaurelius.titan.util.datastructures.IntHashSet used on opensource projects

Example 1 with IntHashSet

use of com.thinkaurelius.titan.util.datastructures.IntHashSet in project titan by thinkaurelius.

the class IDPoolTest method testIDPoolWith.

private void testIDPoolWith(IDPoolFactory poolFactory, final int numPartitions, final int numThreads, final int attemptsPerThread) throws InterruptedException {
    final Random random = new Random();
    final IntSet[] ids = new IntSet[numPartitions];
    final StandardIDPool[] idPools = new StandardIDPool[numPartitions];
    for (int i = 0; i < numPartitions; i++) {
        ids[i] = new IntHashSet(attemptsPerThread * numThreads / numPartitions);
        int partition = i * 100;
        idPools[i] = poolFactory.get(partition);
    }
    Thread[] threads = new Thread[numThreads];
    for (int i = 0; i < numThreads; i++) {
        threads[i] = new Thread(new Runnable() {

            @Override
            public void run() {
                for (int attempt = 0; attempt < attemptsPerThread; attempt++) {
                    int offset = random.nextInt(numPartitions);
                    long id = idPools[offset].nextID();
                    assertTrue(id < Integer.MAX_VALUE);
                    IntSet idset = ids[offset];
                    synchronized (idset) {
                        assertFalse(idset.contains((int) id));
                        idset.add((int) id);
                    }
                }
            }
        });
        threads[i].start();
    }
    for (int i = 0; i < numThreads; i++) threads[i].join();
    for (int i = 0; i < idPools.length; i++) idPools[i].close();
    //Verify consecutive id assignment
    for (int i = 0; i < ids.length; i++) {
        IntSet set = ids[i];
        int max = 0;
        int[] all = set.getAll();
        for (int j = 0; j < all.length; j++) if (all[j] > max)
            max = all[j];
        for (int j = 1; j <= max; j++) assertTrue(i + " contains: " + j, set.contains(j));
    }
}