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


Java LinkedBlockingDeque.addFirst方法代码示例

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


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

示例1: findSendablePacket

import java.util.concurrent.LinkedBlockingDeque; //导入方法依赖的package包/类
private Packet findSendablePacket(LinkedBlockingDeque<Packet> outgoingQueue,
                                  boolean tunneledAuthInProgres) {
    if (outgoingQueue.isEmpty()) {
        return null;
    }
    // If we've already starting sending the first packet, we better finish
    if (outgoingQueue.getFirst().bb != null || !tunneledAuthInProgres) {
        return outgoingQueue.getFirst();
    }
    // Since client's authentication with server is in progress,
    // send only the null-header packet queued by primeConnection().
    // This packet must be sent so that the SASL authentication process
    // can proceed, but all other packets should wait until
    // SASL authentication completes.
    Iterator<Packet> iter = outgoingQueue.iterator();
    while (iter.hasNext()) {
        Packet p = iter.next();
        if (p.requestHeader == null) {
            // We've found the priming-packet. Move it to the beginning of the queue.
            iter.remove();
            outgoingQueue.addFirst(p);
            return p;
        } else {
            // Non-priming packet: defer it until later, leaving it in the queue
            // until authentication completes.
            LOG.debug("deferring non-priming packet {} until SASL authentation completes.", p);
        }
    }
    return null;
}
 
开发者ID:didichuxing2,项目名称:https-github.com-apache-zookeeper,代码行数:31,代码来源:ClientCnxnSocketNIO.java

示例2: testAddFirst

import java.util.concurrent.LinkedBlockingDeque; //导入方法依赖的package包/类
/**
 * peekFirst returns element inserted with addFirst
 */
public void testAddFirst() {
    LinkedBlockingDeque q = populatedDeque(3);
    q.pollLast();
    q.addFirst(four);
    assertSame(four, q.peekFirst());
}
 
开发者ID:AdoptOpenJDK,项目名称:openjdk-jdk10,代码行数:10,代码来源:LinkedBlockingDequeTest.java


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