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

LinkedBlockingQueue.enqueue介绍

[英]Links node at end of queue.
[中]链接队列末尾的节点。

代码示例

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

/**
 * Creates a {@code LinkedBlockingQueue} with a capacity of
 * {@link Integer#MAX_VALUE}, initially containing the elements of the
 * given collection,
 * added in traversal order of the collection's iterator.
 *
 * @param c the collection of elements to initially contain
 * @throws NullPointerException if the specified collection or any
 *         of its elements are null
 */
public LinkedBlockingQueue(Collection<? extends E> c) {
  this(Integer.MAX_VALUE);
  final ReentrantLock putLock = this.putLock;
  putLock.lock(); // Never contended, but necessary for visibility
  try {
    int n = 0;
    for (E e : c) {
      if (e == null)
        throw new NullPointerException();
      if (n == capacity)
        throw new IllegalStateException("Queue full");
      enqueue(new Node<E>(e));
      ++n;
    }
    count.set(n);
  } finally {
    putLock.unlock();
  }
}

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

nanos = notFull.awaitNanos(nanos);
enqueue(new Node<E>(e));
c = count.getAndIncrement();
if (c + 1 < capacity)

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

notFull.await();
enqueue(node);
c = count.getAndIncrement();
if (c + 1 < capacity)

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

try {
  if (count.get() < capacity) {
    enqueue(node);
    c = count.getAndIncrement();
    if (c + 1 < capacity)

代码示例来源：origin: ibinti/bugvm

/**
 * Creates a {@code LinkedBlockingQueue} with a capacity of
 * {@link Integer#MAX_VALUE}, initially containing the elements of the
 * given collection,
 * added in traversal order of the collection's iterator.
 *
 * @param c the collection of elements to initially contain
 * @throws NullPointerException if the specified collection or any
 *         of its elements are null
 */
public LinkedBlockingQueue(Collection<? extends E> c) {
  this(Integer.MAX_VALUE);
  final ReentrantLock putLock = this.putLock;
  putLock.lock(); // Never contended, but necessary for visibility
  try {
    int n = 0;
    for (E e : c) {
      if (e == null)
        throw new NullPointerException();
      if (n == capacity)
        throw new IllegalStateException("Queue full");
      enqueue(new Node<E>(e));
      ++n;
    }
    count.set(n);
  } finally {
    putLock.unlock();
  }
}

代码示例来源：origin: jtulach/bck2brwsr

/**
 * Creates a {@code LinkedBlockingQueue} with a capacity of
 * {@link Integer#MAX_VALUE}, initially containing the elements of the
 * given collection,
 * added in traversal order of the collection's iterator.
 *
 * @param c the collection of elements to initially contain
 * @throws NullPointerException if the specified collection or any
 *         of its elements are null
 */
public LinkedBlockingQueue(Collection<? extends E> c) {
  this(Integer.MAX_VALUE);
  final ReentrantLock putLock = this.putLock;
  putLock.lock(); // Never contended, but necessary for visibility
  try {
    int n = 0;
    for (E e : c) {
      if (e == null)
        throw new NullPointerException();
      if (n == capacity)
        throw new IllegalStateException("Queue full");
      enqueue(new Node<E>(e));
      ++n;
    }
    count.set(n);
  } finally {
    putLock.unlock();
  }
}

代码示例来源：origin: org.apidesign.bck2brwsr/emul

/**
 * Creates a {@code LinkedBlockingQueue} with a capacity of
 * {@link Integer#MAX_VALUE}, initially containing the elements of the
 * given collection,
 * added in traversal order of the collection's iterator.
 *
 * @param c the collection of elements to initially contain
 * @throws NullPointerException if the specified collection or any
 *         of its elements are null
 */
public LinkedBlockingQueue(Collection<? extends E> c) {
  this(Integer.MAX_VALUE);
  final ReentrantLock putLock = this.putLock;
  putLock.lock(); // Never contended, but necessary for visibility
  try {
    int n = 0;
    for (E e : c) {
      if (e == null)
        throw new NullPointerException();
      if (n == capacity)
        throw new IllegalStateException("Queue full");
      enqueue(new Node<E>(e));
      ++n;
    }
    count.set(n);
  } finally {
    putLock.unlock();
  }
}

代码示例来源：origin: com.bugvm/bugvm-rt

/**
 * Creates a {@code LinkedBlockingQueue} with a capacity of
 * {@link Integer#MAX_VALUE}, initially containing the elements of the
 * given collection,
 * added in traversal order of the collection's iterator.
 *
 * @param c the collection of elements to initially contain
 * @throws NullPointerException if the specified collection or any
 *         of its elements are null
 */
public LinkedBlockingQueue(Collection<? extends E> c) {
  this(Integer.MAX_VALUE);
  final ReentrantLock putLock = this.putLock;
  putLock.lock(); // Never contended, but necessary for visibility
  try {
    int n = 0;
    for (E e : c) {
      if (e == null)
        throw new NullPointerException();
      if (n == capacity)
        throw new IllegalStateException("Queue full");
      enqueue(new Node<E>(e));
      ++n;
    }
    count.set(n);
  } finally {
    putLock.unlock();
  }
}

代码示例来源：origin: com.gluonhq/robovm-rt

/**
 * Creates a {@code LinkedBlockingQueue} with a capacity of
 * {@link Integer#MAX_VALUE}, initially containing the elements of the
 * given collection,
 * added in traversal order of the collection's iterator.
 *
 * @param c the collection of elements to initially contain
 * @throws NullPointerException if the specified collection or any
 *         of its elements are null
 */
public LinkedBlockingQueue(Collection<? extends E> c) {
  this(Integer.MAX_VALUE);
  final ReentrantLock putLock = this.putLock;
  putLock.lock(); // Never contended, but necessary for visibility
  try {
    int n = 0;
    for (E e : c) {
      if (e == null)
        throw new NullPointerException();
      if (n == capacity)
        throw new IllegalStateException("Queue full");
      enqueue(new Node<E>(e));
      ++n;
    }
    count.set(n);
  } finally {
    putLock.unlock();
  }
}

代码示例来源：origin: com.mobidevelop.robovm/robovm-rt

/**
 * Creates a {@code LinkedBlockingQueue} with a capacity of
 * {@link Integer#MAX_VALUE}, initially containing the elements of the
 * given collection,
 * added in traversal order of the collection's iterator.
 *
 * @param c the collection of elements to initially contain
 * @throws NullPointerException if the specified collection or any
 *         of its elements are null
 */
public LinkedBlockingQueue(Collection<? extends E> c) {
  this(Integer.MAX_VALUE);
  final ReentrantLock putLock = this.putLock;
  putLock.lock(); // Never contended, but necessary for visibility
  try {
    int n = 0;
    for (E e : c) {
      if (e == null)
        throw new NullPointerException();
      if (n == capacity)
        throw new IllegalStateException("Queue full");
      enqueue(new Node<E>(e));
      ++n;
    }
    count.set(n);
  } finally {
    putLock.unlock();
  }
}

代码示例来源：origin: org.codehaus.jsr166-mirror/jsr166

/**
 * Creates a {@code LinkedBlockingQueue} with a capacity of
 * {@link Integer#MAX_VALUE}, initially containing the elements of the
 * given collection,
 * added in traversal order of the collection's iterator.
 *
 * @param c the collection of elements to initially contain
 * @throws NullPointerException if the specified collection or any
 *         of its elements are null
 */
public LinkedBlockingQueue(Collection<? extends E> c) {
  this(Integer.MAX_VALUE);
  final ReentrantLock putLock = this.putLock;
  putLock.lock(); // Never contended, but necessary for visibility
  try {
    int n = 0;
    for (E e : c) {
      if (e == null)
        throw new NullPointerException();
      if (n == capacity)
        throw new IllegalStateException("Queue full");
      enqueue(new Node<E>(e));
      ++n;
    }
    count.set(n);
  } finally {
    putLock.unlock();
  }
}

代码示例来源：origin: MobiVM/robovm

/**
 * Creates a {@code LinkedBlockingQueue} with a capacity of
 * {@link Integer#MAX_VALUE}, initially containing the elements of the
 * given collection,
 * added in traversal order of the collection's iterator.
 *
 * @param c the collection of elements to initially contain
 * @throws NullPointerException if the specified collection or any
 *         of its elements are null
 */
public LinkedBlockingQueue(Collection<? extends E> c) {
  this(Integer.MAX_VALUE);
  final ReentrantLock putLock = this.putLock;
  putLock.lock(); // Never contended, but necessary for visibility
  try {
    int n = 0;
    for (E e : c) {
      if (e == null)
        throw new NullPointerException();
      if (n == capacity)
        throw new IllegalStateException("Queue full");
      enqueue(new Node<E>(e));
      ++n;
    }
    count.set(n);
  } finally {
    putLock.unlock();
  }
}

代码示例来源：origin: FlexoVM/flexovm

/**
 * Creates a {@code LinkedBlockingQueue} with a capacity of
 * {@link Integer#MAX_VALUE}, initially containing the elements of the
 * given collection,
 * added in traversal order of the collection's iterator.
 *
 * @param c the collection of elements to initially contain
 * @throws NullPointerException if the specified collection or any
 *         of its elements are null
 */
public LinkedBlockingQueue(Collection<? extends E> c) {
  this(Integer.MAX_VALUE);
  final ReentrantLock putLock = this.putLock;
  putLock.lock(); // Never contended, but necessary for visibility
  try {
    int n = 0;
    for (E e : c) {
      if (e == null)
        throw new NullPointerException();
      if (n == capacity)
        throw new IllegalStateException("Queue full");
      enqueue(new Node<E>(e));
      ++n;
    }
    count.set(n);
  } finally {
    putLock.unlock();
  }
}

代码示例来源：origin: com.mobidevelop.robovm/robovm-rt

try {
  if (count.get() < capacity) {
    enqueue(node);
    c = count.getAndIncrement();
    if (c + 1 < capacity)

代码示例来源：origin: ibinti/bugvm

try {
  if (count.get() < capacity) {
    enqueue(node);
    c = count.getAndIncrement();
    if (c + 1 < capacity)

代码示例来源：origin: com.bugvm/bugvm-rt

nanos = notFull.awaitNanos(nanos);
enqueue(new Node<E>(e));
c = count.getAndIncrement();
if (c + 1 < capacity)

代码示例来源：origin: com.mobidevelop.robovm/robovm-rt

nanos = notFull.awaitNanos(nanos);
enqueue(new Node<E>(e));
c = count.getAndIncrement();
if (c + 1 < capacity)

代码示例来源：origin: com.gluonhq/robovm-rt

try {
  if (count.get() < capacity) {
    enqueue(node);
    c = count.getAndIncrement();
    if (c + 1 < capacity)

代码示例来源：origin: org.codehaus.jsr166-mirror/jsr166

nanos = notFull.awaitNanos(nanos);
enqueue(new Node<E>(e));
c = count.getAndIncrement();
if (c + 1 < capacity)

代码示例来源：origin: org.codehaus.jsr166-mirror/jsr166

try {
  if (count.get() < capacity) {
    enqueue(node);
    c = count.getAndIncrement();
    if (c + 1 < capacity)