java.util.concurrent.ConcurrentSkipListSet.pollFirst()方法的使用及代码示例

x33g5p2x  于2022-01-18 转载在 其他  
字(7.7k)|赞(0)|评价(0)|浏览(153)

本文整理了Java中java.util.concurrent.ConcurrentSkipListSet.pollFirst()方法的一些代码示例，展示了ConcurrentSkipListSet.pollFirst()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。ConcurrentSkipListSet.pollFirst()方法的具体详情如下：
包路径：java.util.concurrent.ConcurrentSkipListSet
类名称：ConcurrentSkipListSet
方法名：pollFirst

ConcurrentSkipListSet.pollFirst介绍

暂无

代码示例

代码示例来源：origin: apache/geode

private void collectFreeHugeChunks(List<LongStack> l) {
 OffHeapStoredObject c = this.hugeChunkSet.pollFirst();
 OffHeapStoredObjectAddressStack result = null;
 while (c != null) {
  if (result == null) {
   result = new OffHeapStoredObjectAddressStack();
   l.add(result);
  }
  result.offer(c.getAddress());
  c = this.hugeChunkSet.pollFirst();
 }
}

代码示例来源：origin: apache/incubator-druid

@Nullable
@Override
public InputRow nextRow()
{
 if (nextIterator.hasNext()) {
  return nextIterator.next();
 }
 for (Map.Entry<MessageQueue, ConcurrentSkipListSet<MessageExt>> entry : messageQueueTreeSetMap.entrySet()) {
  if (!entry.getValue().isEmpty()) {
   MessageExt message = entry.getValue().pollFirst();
   nextIterator = theParser.parseBatch(ByteBuffer.wrap(message.getBody())).iterator();
   windows
     .computeIfAbsent(entry.getKey(), k -> new ConcurrentSkipListSet<>())
     .add(message.getQueueOffset());
   return nextIterator.next();
  }
 }
 // should never happen.
 throw new RuntimeException("Unexpected Fatal Error! There should have been one row available.");
}

代码示例来源：origin: linkedin/parseq

ProcessRequest request = _processRequestQueue.pollFirst();
if (request != null) {
 _processQueueSize.decrementAndGet();

代码示例来源：origin: apache/pulsar

MessageIdImpl msgId = pendingIndividualAcks.pollFirst();
if (msgId == null) {
  break;
MessageIdImpl msgId = pendingIndividualAcks.pollFirst();
if (msgId == null) {
  break;

代码示例来源：origin: apache/hbase

ProcedureEvent[] ev = new ProcedureEvent[waitQueue.size()];
for (int i = 0; i < ev.length; ++i) {
 ev[i] = waitQueue.pollFirst().getEvent();
 LOG.debug("WAKE BATCH " + ev[i] + " total=" + wakeCount.get());
int size = waitQueue.size();
while (size-- > 0) {
 ProcedureEvent ev = waitQueue.pollFirst().getEvent();
 ev.wake(procSched);
 LOG.debug("WAKE " + ev + " total=" + wakeCount.get());

代码示例来源：origin: de.dentrassi.eclipse.neoscada.utils/org.eclipse.scada.utils

@Override
public E poll ()
{
  return this.internalSet.pollFirst ();
}

代码示例来源：origin: org.axonframework/axon-kafka

/**
 * Extracts message and signals.
 * Call only when holding lock.
 */
private E remove() {
  E x = this.delegate.pollFirst();
  if (x != null) {
    this.count--;
    this.notFull.signal();
  }
  return x;
}

代码示例来源：origin: org.axonframework.extensions.kafka/axon-kafka

/**
 * Extracts message and signals.
 * Call only when holding lock.
 */
private E remove() {
  E x = this.delegate.pollFirst();
  if (x != null) {
    this.count--;
    this.notFull.signal();
  }
  return x;
}

代码示例来源：origin: org.copper-engine/cassandra-storage

QueueElement _poll(String ppoolId) {
  logger.trace("_poll({})", ppoolId);
  ConcurrentSkipListSet<QueueElement> queue = _findQueue(ppoolId);
  QueueElement qe = queue.pollFirst();
  if (qe != null) {
    logger.debug("dequeued for ppoolId={}: wfId={}", ppoolId, qe.wfId);
  }
  return qe;
}

代码示例来源：origin: org.copper-engine/cassandra-storage

QueueElement _take(String ppoolId) throws InterruptedException {
  logger.trace("_take({})", ppoolId);
  ConcurrentSkipListSet<QueueElement> queue = _findQueue(ppoolId);
  synchronized (queue) {
    for (;;) {
      QueueElement qe = queue.pollFirst();
      if (qe != null) {
        logger.debug("dequeued for ppoolId={}: wfId={}", ppoolId, qe.wfId);
        return qe;
      }
      queue.wait(10L);
    }
  }
}

代码示例来源：origin: io.snappydata/gemfire-core

public void collectFreeHugeChunks(List<SyncChunkStack> l) {
 Chunk c = this.hugeChunkSet.pollFirst();
 SyncChunkStack result = null;
 while (c != null) {
  if (result == null) {
   result = new SyncChunkStack();
   l.add(result);
  }
  result.offer(c.getMemoryAddress());
  c = this.hugeChunkSet.pollFirst();
 }
}

代码示例来源：origin: org.apache.geode/gemfire-core

private void collectFreeHugeChunks(List<SyncChunkStack> l) {
 Chunk c = this.hugeChunkSet.pollFirst();
 SyncChunkStack result = null;
 while (c != null) {
  if (result == null) {
   result = new SyncChunkStack();
   l.add(result);
  }
  result.offer(c.getMemoryAddress());
  c = this.hugeChunkSet.pollFirst();
 }
}

代码示例来源：origin: kontalk/tigase-server

while ((serv = forCompletion.pollFirst()) != null) {
  completionService.submit(serv);

代码示例来源：origin: kontalk/tigase-server

while ((s = waiting.pollFirst()) != null) {
  SocketChannel sc = s.getSocketChannel();

代码示例来源：origin: org.apache.pulsar/pulsar-client-original

MessageIdImpl msgId = pendingIndividualAcks.pollFirst();
if (msgId == null) {
  break;
MessageIdImpl msgId = pendingIndividualAcks.pollFirst();
if (msgId == null) {
  break;

代码示例来源：origin: org.apache.hbase/hbase-procedure

ProcedureEvent[] ev = new ProcedureEvent[waitQueue.size()];
for (int i = 0; i < ev.length; ++i) {
 ev[i] = waitQueue.pollFirst().getEvent();
 LOG.debug("WAKE BATCH " + ev[i] + " total=" + wakeCount.get());
int size = waitQueue.size();
while (size-- > 0) {
 ProcedureEvent ev = waitQueue.pollFirst().getEvent();
 ev.wake(procSched);
 LOG.debug("WAKE " + ev + " total=" + wakeCount.get());

代码示例来源：origin: com.aliyun.hbase/alihbase-procedure

ProcedureEvent[] ev = new ProcedureEvent[waitQueue.size()];
for (int i = 0; i < ev.length; ++i) {
 ev[i] = waitQueue.pollFirst().getEvent();
 LOG.debug("WAKE BATCH " + ev[i] + " total=" + wakeCount.get());
int size = waitQueue.size();
while (size-- > 0) {
 ProcedureEvent ev = waitQueue.pollFirst().getEvent();
 ev.wake(procSched);
 LOG.debug("WAKE " + ev + " total=" + wakeCount.get());

代码示例来源：origin: io.snappydata/gemfire-junit

list.add(keyToSeq2);
list.add(keyToSeq5);
KeyToSeqNumObject k = list.pollFirst();
this.c.getLoggerI18n().fine(" KeyToSeqNumObject  byte: " + k.getRegionkey()[0] + " seq num: " + k.getSeqNum());
assertTrue ("Order of elements in Concurrent list is not correct ", k.equals(keyToSeq3));
list.remove(k);
k = list.pollFirst();
this.c.getLoggerI18n().fine(" KeyToSeqNumObject  byte: " + k.getRegionkey()[0] + " seq num: " + k.getSeqNum());
assertTrue ("Order of elements in Concurrent list is not correct ", k.equals(keyToSeq2));
list.remove(k);
k = list.pollFirst();
this.c.getLoggerI18n().fine(" KeyToSeqNumObject  byte: " + k.getRegionkey()[0] + " seq num: " + k.getSeqNum());
assertTrue ("Order of elements in Concurrent list is not correct ", k.equals(keyToSeq1));
list.add(keyToSeq5);
list.add(keyToSeq1);
k = list.pollFirst();
this.c.getLoggerI18n().fine(" KeyToSeqNumObject  byte: " + k.getRegionkey()[0] + " seq num: " + k.getSeqNum());
assertTrue ("Order of elements in Concurrent list is not correct ", k.equals(keyToSeq3));
list.remove(k);
k = list.pollFirst();
this.c.getLoggerI18n().fine(" KeyToSeqNumObject  byte: " + k.getRegionkey()[0] + " seq num: " + k.getSeqNum());
assertTrue ("Order of elements in Concurrent list is not correct ", k.equals(keyToSeq1));
list.remove(k);
k = list.pollFirst();

代码示例来源：origin: MegaMek/megamek

public void run() {
  final String METHOD_NAME = "run()";
  getOwner().methodBegin(getClass(), METHOD_NAME);
  try {
    // todo There's probably a better way to handle this than a loop that only exits on an error.
    //noinspection InfiniteLoopStatement
    while (!getDone().get()) {
      if (!getEventsToProcess().isEmpty()) {
        processGameEvents();
        ecmInfo = ComputeECM.computeAllEntitiesECMInfo(
            getGame().getEntitiesVector());
      } else if (!getDirtyUnits().isEmpty()) {
        Entity entity = getGame().getEntity(getDirtyUnits().pollFirst());
        if ((entity != null) && isEntityOnMap(entity)) {
          unPause();
          getOwner().log(getClass(), METHOD_NAME, "recalculating paths for " + entity.getDisplayName());
          getPathEnumerator().recalculateMovesFor(entity);
          getOwner().log(getClass(), METHOD_NAME, "finished recalculating paths for " + entity
              .getDisplayName());
        }
      } else if (getWaitWhenDone().get()) {
        waitForUnpause(); // paused for a reason
      } else {
        waitForUnpause(); // idling because there's nothing to do
      }
    }
  } finally {
    getOwner().methodEnd(getClass(), METHOD_NAME);
  }
}

代码示例来源：origin: MegaMek/megamek

Integer entityId = getDirtyUnits().pollFirst();
Entity entity = getGame().getEntity(entityId);
if (entity != null) {

内容来源于网络，如有侵权，请联系作者删除！

ConcurrentSkipListSet

相关文章

    查看更多
    微信公众号

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多

    ConcurrentSkipListSet类方法

    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com