what-the-bank/sources/com/google/common/collect/Queues.java

178 lines
6.3 KiB
Java

package com.google.common.collect;
import com.google.common.base.Preconditions;
import java.util.ArrayDeque;
import java.util.Collection;
import java.util.Deque;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;
import java.util.concurrent.ConcurrentLinkedQueue;
import java.util.concurrent.LinkedBlockingDeque;
import java.util.concurrent.LinkedBlockingQueue;
import java.util.concurrent.PriorityBlockingQueue;
import java.util.concurrent.SynchronousQueue;
import java.util.concurrent.TimeUnit;
/* loaded from: classes2.dex */
public final class Queues {
private Queues() {
}
public static <E> ArrayBlockingQueue<E> newArrayBlockingQueue(int i) {
return new ArrayBlockingQueue<>(i);
}
public static <E> ArrayDeque<E> newArrayDeque() {
return new ArrayDeque<>();
}
public static <E> ArrayDeque<E> newArrayDeque(Iterable<? extends E> iterable) {
if (iterable instanceof Collection) {
return new ArrayDeque<>((Collection) iterable);
}
ArrayDeque<E> arrayDeque = new ArrayDeque<>();
Iterables.addAll(arrayDeque, iterable);
return arrayDeque;
}
public static <E> ConcurrentLinkedQueue<E> newConcurrentLinkedQueue() {
return new ConcurrentLinkedQueue<>();
}
public static <E> ConcurrentLinkedQueue<E> newConcurrentLinkedQueue(Iterable<? extends E> iterable) {
if (iterable instanceof Collection) {
return new ConcurrentLinkedQueue<>((Collection) iterable);
}
ConcurrentLinkedQueue<E> concurrentLinkedQueue = new ConcurrentLinkedQueue<>();
Iterables.addAll(concurrentLinkedQueue, iterable);
return concurrentLinkedQueue;
}
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque() {
return new LinkedBlockingDeque<>();
}
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(int i) {
return new LinkedBlockingDeque<>(i);
}
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(Iterable<? extends E> iterable) {
if (iterable instanceof Collection) {
return new LinkedBlockingDeque<>((Collection) iterable);
}
LinkedBlockingDeque<E> linkedBlockingDeque = new LinkedBlockingDeque<>();
Iterables.addAll(linkedBlockingDeque, iterable);
return linkedBlockingDeque;
}
public static <E> LinkedBlockingQueue<E> newLinkedBlockingQueue() {
return new LinkedBlockingQueue<>();
}
public static <E> LinkedBlockingQueue<E> newLinkedBlockingQueue(int i) {
return new LinkedBlockingQueue<>(i);
}
public static <E> LinkedBlockingQueue<E> newLinkedBlockingQueue(Iterable<? extends E> iterable) {
if (iterable instanceof Collection) {
return new LinkedBlockingQueue<>((Collection) iterable);
}
LinkedBlockingQueue<E> linkedBlockingQueue = new LinkedBlockingQueue<>();
Iterables.addAll(linkedBlockingQueue, iterable);
return linkedBlockingQueue;
}
public static <E extends Comparable> PriorityBlockingQueue<E> newPriorityBlockingQueue() {
return new PriorityBlockingQueue<>();
}
public static <E extends Comparable> PriorityBlockingQueue<E> newPriorityBlockingQueue(Iterable<? extends E> iterable) {
if (iterable instanceof Collection) {
return new PriorityBlockingQueue<>((Collection) iterable);
}
PriorityBlockingQueue<E> priorityBlockingQueue = new PriorityBlockingQueue<>();
Iterables.addAll(priorityBlockingQueue, iterable);
return priorityBlockingQueue;
}
public static <E extends Comparable> PriorityQueue<E> newPriorityQueue() {
return new PriorityQueue<>();
}
public static <E extends Comparable> PriorityQueue<E> newPriorityQueue(Iterable<? extends E> iterable) {
if (iterable instanceof Collection) {
return new PriorityQueue<>((Collection) iterable);
}
PriorityQueue<E> priorityQueue = new PriorityQueue<>();
Iterables.addAll(priorityQueue, iterable);
return priorityQueue;
}
public static <E> SynchronousQueue<E> newSynchronousQueue() {
return new SynchronousQueue<>();
}
public static <E> int drain(BlockingQueue<E> blockingQueue, Collection<? super E> collection, int i, long j, TimeUnit timeUnit) throws InterruptedException {
Preconditions.checkNotNull(collection);
long nanoTime = System.nanoTime();
long nanos = timeUnit.toNanos(j);
int i2 = 0;
while (i2 < i) {
i2 += blockingQueue.drainTo(collection, i - i2);
if (i2 < i) {
E poll = blockingQueue.poll((nanoTime + nanos) - System.nanoTime(), TimeUnit.NANOSECONDS);
if (poll == null) {
break;
}
collection.add(poll);
i2++;
}
}
return i2;
}
public static <E> int drainUninterruptibly(BlockingQueue<E> blockingQueue, Collection<? super E> collection, int i, long j, TimeUnit timeUnit) {
E poll;
Preconditions.checkNotNull(collection);
long nanoTime = System.nanoTime();
long nanos = timeUnit.toNanos(j);
int i2 = 0;
boolean z = false;
while (i2 < i) {
try {
i2 += blockingQueue.drainTo(collection, i - i2);
if (i2 < i) {
while (true) {
try {
poll = blockingQueue.poll((nanoTime + nanos) - System.nanoTime(), TimeUnit.NANOSECONDS);
break;
} catch (InterruptedException unused) {
z = true;
}
}
if (poll == null) {
break;
}
collection.add(poll);
i2++;
}
} finally {
if (z) {
Thread.currentThread().interrupt();
}
}
}
return i2;
}
public static <E> Queue<E> synchronizedQueue(Queue<E> queue) {
return Synchronized.queue(queue, null);
}
public static <E> Deque<E> synchronizedDeque(Deque<E> deque) {
return Synchronized.deque(deque, null);
}
}