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


Java LinkedBlockingDeque.poll方法代码示例

本文整理汇总了Java中java.util.concurrent.LinkedBlockingDeque.poll方法的典型用法代码示例。如果您正苦于以下问题:Java LinkedBlockingDeque.poll方法的具体用法?Java LinkedBlockingDeque.poll怎么用?Java LinkedBlockingDeque.poll使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在java.util.concurrent.LinkedBlockingDeque的用法示例。


在下文中一共展示了LinkedBlockingDeque.poll方法的4个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: calculateTxnProfileTotals

import java.util.concurrent.LinkedBlockingDeque; //导入方法依赖的package包/类
private void calculateTxnProfileTotals(Procedure catalog_proc, long totals[]) {
    long tuple[] = null;
    LinkedBlockingDeque<long[]> queue = this.txn_profile_queues.get(catalog_proc); 
    while ((tuple = queue.poll()) != null) {
        totals[0]++;
        for (int i = 0, cnt = tuple.length; i < cnt; i++) {
            totals[i+1] += tuple[i];
        } // FOR
    } // FOR
}
 
开发者ID:s-store,项目名称:sstore-soft,代码行数:11,代码来源:HStoreSiteStatus.java

示例2: testDrainToN

import java.util.concurrent.LinkedBlockingDeque; //导入方法依赖的package包/类
/**
 * drainTo(c, n) empties first min(n, size) elements of queue into c
 */
public void testDrainToN() {
    LinkedBlockingDeque q = new LinkedBlockingDeque();
    for (int i = 0; i < SIZE + 2; ++i) {
        for (int j = 0; j < SIZE; j++)
            assertTrue(q.offer(new Integer(j)));
        ArrayList l = new ArrayList();
        q.drainTo(l, i);
        int k = (i < SIZE) ? i : SIZE;
        assertEquals(k, l.size());
        assertEquals(SIZE - k, q.size());
        for (int j = 0; j < k; ++j)
            assertEquals(l.get(j), new Integer(j));
        do {} while (q.poll() != null);
    }
}
 
开发者ID:AdoptOpenJDK,项目名称:openjdk-jdk10,代码行数:19,代码来源:LinkedBlockingDequeTest.java

示例3: testElement

import java.util.concurrent.LinkedBlockingDeque; //导入方法依赖的package包/类
/**
 * element returns next element, or throws NSEE if empty
 */
public void testElement() {
    LinkedBlockingDeque q = populatedDeque(SIZE);
    for (int i = 0; i < SIZE; ++i) {
        assertEquals(i, q.element());
        q.poll();
    }
    try {
        q.element();
        shouldThrow();
    } catch (NoSuchElementException success) {}
}
 
开发者ID:AdoptOpenJDK,项目名称:openjdk-jdk10,代码行数:15,代码来源:LinkedBlockingDequeTest.java

示例4: testContains

import java.util.concurrent.LinkedBlockingDeque; //导入方法依赖的package包/类
/**
 * contains(x) reports true when elements added but not yet removed
 */
public void testContains() {
    LinkedBlockingDeque q = populatedDeque(SIZE);
    for (int i = 0; i < SIZE; ++i) {
        assertTrue(q.contains(new Integer(i)));
        q.poll();
        assertFalse(q.contains(new Integer(i)));
    }
}
 
开发者ID:AdoptOpenJDK,项目名称:openjdk-jdk10,代码行数:12,代码来源:LinkedBlockingDequeTest.java


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