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

LinkedBlockingDeque.<init>介绍

[英]Creates a LinkedBlockingDeque with a capacity of Integer#MAX_VALUE.
[中]创建容量为整数#MAX_值的LinkedBlockingDeque。

代码示例

代码示例来源：origin: springside/springside4

/**
 * 创建并发阻塞情况下，长度不受限的双端队列.
 * 
 * 长度不受限，即生产者不会因为满而阻塞，但消费者会因为空而阻塞.
 */
public static <E> LinkedBlockingDeque<E> newBlockingUnlimitDeque() {
  return new LinkedBlockingDeque<E>();
}

代码示例来源：origin: springside/springside4

/**
 * 创建并发阻塞情况下，长度受限，头队尾两把锁, 但使用更多内存的双端队列.
 */
public static <E> LinkedBlockingDeque<E> newBlockingDeque(int capacity) {
  return new LinkedBlockingDeque<E>(capacity);
}

代码示例来源：origin: vipshop/vjtools

/**
 * 创建并发阻塞情况下，长度不受限的双端队列.
 * 
 * 长度不受限，即生产者不会因为满而阻塞，但消费者会因为空而阻塞.
 */
public static <E> LinkedBlockingDeque<E> newBlockingUnlimitDeque() {
  return new LinkedBlockingDeque<E>();
}

代码示例来源：origin: vipshop/vjtools

/**
 * 创建并发阻塞情况下，长度受限，头队尾两把锁, 但使用更多内存的双端队列.
 */
public static <E> LinkedBlockingDeque<E> newBlockingDeque(int capacity) {
  return new LinkedBlockingDeque<E>(capacity);
}

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

public MetricsConsumerBolt(String consumerClassName, Object registrationArgument, int maxRetainMetricTuples,
              Predicate<IMetricsConsumer.DataPoint> filterPredicate, DataPointExpander expander) {
  _consumerClassName = consumerClassName;
  _registrationArgument = registrationArgument;
  _maxRetainMetricTuples = maxRetainMetricTuples;
  _filterPredicate = filterPredicate;
  _expander = expander;
  if (_maxRetainMetricTuples > 0) {
    _taskQueue = new LinkedBlockingDeque<>(_maxRetainMetricTuples);
  } else {
    _taskQueue = new LinkedBlockingDeque<>();
  }
}

代码示例来源：origin: google/guava

/**
 * Creates an empty {@code LinkedBlockingDeque} with the given (fixed) capacity.
 *
 * @throws IllegalArgumentException if {@code capacity} is less than 1
 * @since 12.0
 */
@GwtIncompatible // LinkedBlockingDeque
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(int capacity) {
 return new LinkedBlockingDeque<E>(capacity);
}

代码示例来源：origin: google/guava

@Override
 public Queue<String> create(String[] elements) {
  return new LinkedBlockingDeque<>(MinimalCollection.of(elements));
 }
})

代码示例来源：origin: google/guava

/**
 * Creates an empty {@code LinkedBlockingDeque} with a capacity of {@link Integer#MAX_VALUE}.
 *
 * @since 12.0
 */
@GwtIncompatible // LinkedBlockingDeque
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque() {
 return new LinkedBlockingDeque<E>();
}

代码示例来源：origin: netty/netty

/**
 * Returns a new concurrent {@link Deque}.
 */
public static <C> Deque<C> newConcurrentDeque() {
  if (javaVersion() < 7) {
    return new LinkedBlockingDeque<C>();
  } else {
    return new ConcurrentLinkedDeque<C>();
  }
}

代码示例来源：origin: google/guava

/**
 * Creates a {@code LinkedBlockingDeque} with a capacity of {@link Integer#MAX_VALUE}, containing
 * the elements of the specified iterable, in the order they are returned by the iterable's
 * iterator.
 *
 * @since 12.0
 */
@GwtIncompatible // LinkedBlockingDeque
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(Iterable<? extends E> elements) {
 if (elements instanceof Collection) {
  return new LinkedBlockingDeque<E>(Collections2.cast(elements));
 }
 LinkedBlockingDeque<E> deque = new LinkedBlockingDeque<E>();
 Iterables.addAll(deque, elements);
 return deque;
}

代码示例来源：origin: prestodb/presto

/**
 * Creates an empty {@code LinkedBlockingDeque} with a capacity of {@link Integer#MAX_VALUE}.
 *
 * @since 12.0
 */
@GwtIncompatible // LinkedBlockingDeque
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque() {
 return new LinkedBlockingDeque<E>();
}

代码示例来源：origin: prestodb/presto

/**
 * Creates an empty {@code LinkedBlockingDeque} with the given (fixed) capacity.
 *
 * @throws IllegalArgumentException if {@code capacity} is less than 1
 * @since 12.0
 */
@GwtIncompatible // LinkedBlockingDeque
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(int capacity) {
 return new LinkedBlockingDeque<E>(capacity);
}

代码示例来源：origin: redisson/redisson

/**
 * Returns a new concurrent {@link Deque}.
 */
public static <C> Deque<C> newConcurrentDeque() {
  if (javaVersion() < 7) {
    return new LinkedBlockingDeque<C>();
  } else {
    return new ConcurrentLinkedDeque<C>();
  }
}

代码示例来源：origin: google/j2objc

/**
 * Creates an empty {@code LinkedBlockingDeque} with a capacity of {@link Integer#MAX_VALUE}.
 *
 * @since 12.0
 */
@GwtIncompatible // LinkedBlockingDeque
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque() {
 return new LinkedBlockingDeque<E>();
}

代码示例来源：origin: google/j2objc

/**
 * Creates an empty {@code LinkedBlockingDeque} with the given (fixed) capacity.
 *
 * @throws IllegalArgumentException if {@code capacity} is less than 1
 * @since 12.0
 */
@GwtIncompatible // LinkedBlockingDeque
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(int capacity) {
 return new LinkedBlockingDeque<E>(capacity);
}

代码示例来源：origin: alibaba/jstorm

public NettyServerFlowCtrlHandler (Map stormConf, StormChannelGroup allChannels, Set<Integer> localWorkerTasks) {
  this.allChannels = allChannels;
  this.flowCtrlClients = new HashMap<>();
  for (Integer taskId : localWorkerTasks) {
    flowCtrlClients.put(taskId, new HashSet<String>());
  }
  this.highMark = (float) ConfigExtension.getBackpressureWaterMarkHigh(stormConf);
  this.lowMark = (float) ConfigExtension.getBackpressureWaterMarkLow(stormConf);
  LOG.info("backpressureEnable: highMark: {}, lowMark: {}", highMark, lowMark);
  eventQueue = new LinkedBlockingDeque<>();
}

代码示例来源：origin: google/guava

public static List<BlockingQueue<Object>> blockingQueues() {
 return ImmutableList.<BlockingQueue<Object>>of(
   new LinkedBlockingQueue<Object>(),
   new LinkedBlockingQueue<Object>(10),
   new SynchronousQueue<Object>(),
   new ArrayBlockingQueue<Object>(10),
   new LinkedBlockingDeque<Object>(),
   new LinkedBlockingDeque<Object>(10),
   new PriorityBlockingQueue<Object>(10, Ordering.arbitrary()));
}

代码示例来源：origin: prestodb/presto

/**
 * Creates a {@code LinkedBlockingDeque} with a capacity of {@link Integer#MAX_VALUE}, containing
 * the elements of the specified iterable, in the order they are returned by the iterable's
 * iterator.
 *
 * @since 12.0
 */
@GwtIncompatible // LinkedBlockingDeque
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(Iterable<? extends E> elements) {
 if (elements instanceof Collection) {
  return new LinkedBlockingDeque<E>(Collections2.cast(elements));
 }
 LinkedBlockingDeque<E> deque = new LinkedBlockingDeque<E>();
 Iterables.addAll(deque, elements);
 return deque;
}

代码示例来源：origin: alibaba/jstorm

@Override
public void prepare(Map stormConf, TopologyContext context, OutputCollector collector) {
  super.prepare(stormConf, context, collector);
  this.committingQueue = new LinkedBlockingDeque<>(50);
  startAsyncCommitThread();
}

代码示例来源：origin: jankotek/mapdb

/**
 * Offer succeeds if not full; fails if full
 */
public void testOffer() {
  BlockingDeque q = new LinkedBlockingDeque(1);
  assertTrue(q.offer(zero));
  assertFalse(q.offer(one));
}