当前位置: 首页>>代码示例>>Java>>正文


Java IntSet类代码示例

本文整理汇总了Java中com.thinkaurelius.titan.util.datastructures.IntSet的典型用法代码示例。如果您正苦于以下问题:Java IntSet类的具体用法?Java IntSet怎么用?Java IntSet使用的例子?那么, 这里精选的类代码示例或许可以为您提供帮助。


IntSet类属于com.thinkaurelius.titan.util.datastructures包,在下文中一共展示了IntSet类的1个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: testIDPoolWith

import com.thinkaurelius.titan.util.datastructures.IntSet; //导入依赖的package包/类
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));
    }
}
 
开发者ID:graben1437,项目名称:titan1withtp3.1,代码行数:42,代码来源:IDPoolTest.java


注:本文中的com.thinkaurelius.titan.util.datastructures.IntSet类示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。