Queues.java
6.83 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
package com.google.common.collect;
import com.google.common.annotations.Beta;
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;
import qf.f;
import qf.p;
public final class Queues
{
@Beta
public static <E> int drain(BlockingQueue<E> paramBlockingQueue, Collection<? super E> paramCollection, int paramInt, long paramLong, TimeUnit paramTimeUnit)
throws InterruptedException
{
Preconditions.checkNotNull(paramCollection);
long l = System.nanoTime();
paramLong = paramTimeUnit.toNanos(paramLong);
int i = 0;
int k;
for (;;)
{
k = i;
if (i >= paramInt) {
break;
}
int j = i + paramBlockingQueue.drainTo(paramCollection, paramInt - i);
i = j;
if (j < paramInt)
{
paramTimeUnit = paramBlockingQueue.poll(paramLong + l - System.nanoTime(), TimeUnit.NANOSECONDS);
k = j;
if (paramTimeUnit == null) {
break;
}
paramCollection.add(paramTimeUnit);
i = j + 1;
}
}
return k;
}
@Beta
public static <E> int drainUninterruptibly(BlockingQueue<E> paramBlockingQueue, Collection<? super E> paramCollection, int paramInt, long paramLong, TimeUnit paramTimeUnit)
{
int j = 0;
Preconditions.checkNotNull(paramCollection);
long l = System.nanoTime();
paramLong = paramTimeUnit.toNanos(paramLong);
int i = 0;
for (;;)
{
int m = i;
int n = j;
if (i < paramInt) {
m = j;
}
try
{
int k = paramBlockingQueue.drainTo(paramCollection, paramInt - i);
k = i + k;
i = k;
if (k >= paramInt) {
continue;
}
for (;;)
{
m = j;
try
{
paramTimeUnit = paramBlockingQueue.poll(l + paramLong - System.nanoTime(), TimeUnit.NANOSECONDS);
m = k;
n = j;
if (paramTimeUnit == null) {
break label137;
}
m = j;
paramCollection.add(paramTimeUnit);
i = k + 1;
}
catch (InterruptedException paramTimeUnit)
{
j = 1;
}
}
label137:
return m;
}
finally
{
if (m != 0) {
Thread.currentThread().interrupt();
}
}
}
}
public static <E> ArrayBlockingQueue<E> newArrayBlockingQueue(int paramInt)
{
return new ArrayBlockingQueue(paramInt);
}
public static <E> ArrayDeque<E> newArrayDeque()
{
return new ArrayDeque();
}
public static <E> ArrayDeque<E> newArrayDeque(Iterable<? extends E> paramIterable)
{
if ((paramIterable instanceof Collection)) {
return new ArrayDeque(Collections2.a(paramIterable));
}
ArrayDeque localArrayDeque = new ArrayDeque();
Iterables.addAll(localArrayDeque, paramIterable);
return localArrayDeque;
}
public static <E> ConcurrentLinkedQueue<E> newConcurrentLinkedQueue()
{
return new ConcurrentLinkedQueue();
}
public static <E> ConcurrentLinkedQueue<E> newConcurrentLinkedQueue(Iterable<? extends E> paramIterable)
{
if ((paramIterable instanceof Collection)) {
return new ConcurrentLinkedQueue(Collections2.a(paramIterable));
}
ConcurrentLinkedQueue localConcurrentLinkedQueue = new ConcurrentLinkedQueue();
Iterables.addAll(localConcurrentLinkedQueue, paramIterable);
return localConcurrentLinkedQueue;
}
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque()
{
return new LinkedBlockingDeque();
}
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(int paramInt)
{
return new LinkedBlockingDeque(paramInt);
}
public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(Iterable<? extends E> paramIterable)
{
if ((paramIterable instanceof Collection)) {
return new LinkedBlockingDeque(Collections2.a(paramIterable));
}
LinkedBlockingDeque localLinkedBlockingDeque = new LinkedBlockingDeque();
Iterables.addAll(localLinkedBlockingDeque, paramIterable);
return localLinkedBlockingDeque;
}
public static <E> LinkedBlockingQueue<E> newLinkedBlockingQueue()
{
return new LinkedBlockingQueue();
}
public static <E> LinkedBlockingQueue<E> newLinkedBlockingQueue(int paramInt)
{
return new LinkedBlockingQueue(paramInt);
}
public static <E> LinkedBlockingQueue<E> newLinkedBlockingQueue(Iterable<? extends E> paramIterable)
{
if ((paramIterable instanceof Collection)) {
return new LinkedBlockingQueue(Collections2.a(paramIterable));
}
LinkedBlockingQueue localLinkedBlockingQueue = new LinkedBlockingQueue();
Iterables.addAll(localLinkedBlockingQueue, paramIterable);
return localLinkedBlockingQueue;
}
public static <E extends Comparable> PriorityBlockingQueue<E> newPriorityBlockingQueue()
{
return new PriorityBlockingQueue();
}
public static <E extends Comparable> PriorityBlockingQueue<E> newPriorityBlockingQueue(Iterable<? extends E> paramIterable)
{
if ((paramIterable instanceof Collection)) {
return new PriorityBlockingQueue(Collections2.a(paramIterable));
}
PriorityBlockingQueue localPriorityBlockingQueue = new PriorityBlockingQueue();
Iterables.addAll(localPriorityBlockingQueue, paramIterable);
return localPriorityBlockingQueue;
}
public static <E extends Comparable> PriorityQueue<E> newPriorityQueue()
{
return new PriorityQueue();
}
public static <E extends Comparable> PriorityQueue<E> newPriorityQueue(Iterable<? extends E> paramIterable)
{
if ((paramIterable instanceof Collection)) {
return new PriorityQueue(Collections2.a(paramIterable));
}
PriorityQueue localPriorityQueue = new PriorityQueue();
Iterables.addAll(localPriorityQueue, paramIterable);
return localPriorityQueue;
}
public static <E> SynchronousQueue<E> newSynchronousQueue()
{
return new SynchronousQueue();
}
public static <E> Deque<E> synchronizedDeque(Deque<E> paramDeque)
{
return new qf.f(paramDeque);
}
public static <E> Queue<E> synchronizedQueue(Queue<E> paramQueue)
{
if ((paramQueue instanceof qf.p)) {
return paramQueue;
}
return new qf.p(paramQueue);
}
}
/* Location: /home/merong/decompile/hackery-dex2jar.jar!/com/google/common/collect/Queues.class
* Java compiler version: 6 (50.0)
* JD-Core Version: 0.7.1
*/