1 |
dl |
1.1 |
/* |
2 |
dl |
1.47 |
* Written by Josh Bloch of Google Inc. and released to the public domain, |
3 |
|
|
* as explained at http://creativecommons.org/publicdomain/zero/1.0/. |
4 |
dl |
1.1 |
*/ |
5 |
|
|
|
6 |
|
|
package java.util; |
7 |
jsr166 |
1.61 |
|
8 |
dl |
1.47 |
import java.io.Serializable; |
9 |
|
|
import java.util.function.Consumer; |
10 |
jsr166 |
1.75 |
import java.util.function.Predicate; |
11 |
|
|
import java.util.function.UnaryOperator; |
12 |
dl |
1.1 |
|
13 |
|
|
/** |
14 |
|
|
* Resizable-array implementation of the {@link Deque} interface. Array |
15 |
|
|
* deques have no capacity restrictions; they grow as necessary to support |
16 |
|
|
* usage. They are not thread-safe; in the absence of external |
17 |
|
|
* synchronization, they do not support concurrent access by multiple threads. |
18 |
|
|
* Null elements are prohibited. This class is likely to be faster than |
19 |
dl |
1.2 |
* {@link Stack} when used as a stack, and faster than {@link LinkedList} |
20 |
dl |
1.1 |
* when used as a queue. |
21 |
|
|
* |
22 |
jsr166 |
1.43 |
* <p>Most {@code ArrayDeque} operations run in amortized constant time. |
23 |
jsr166 |
1.51 |
* Exceptions include |
24 |
|
|
* {@link #remove(Object) remove}, |
25 |
|
|
* {@link #removeFirstOccurrence removeFirstOccurrence}, |
26 |
|
|
* {@link #removeLastOccurrence removeLastOccurrence}, |
27 |
|
|
* {@link #contains contains}, |
28 |
|
|
* {@link #iterator iterator.remove()}, |
29 |
|
|
* and the bulk operations, all of which run in linear time. |
30 |
dl |
1.41 |
* |
31 |
jsr166 |
1.51 |
* <p>The iterators returned by this class's {@link #iterator() iterator} |
32 |
|
|
* method are <em>fail-fast</em>: If the deque is modified at any time after |
33 |
|
|
* the iterator is created, in any way except through the iterator's own |
34 |
|
|
* {@code remove} method, the iterator will generally throw a {@link |
35 |
jsr166 |
1.7 |
* ConcurrentModificationException}. Thus, in the face of concurrent |
36 |
|
|
* modification, the iterator fails quickly and cleanly, rather than risking |
37 |
|
|
* arbitrary, non-deterministic behavior at an undetermined time in the |
38 |
|
|
* future. |
39 |
dl |
1.1 |
* |
40 |
|
|
* <p>Note that the fail-fast behavior of an iterator cannot be guaranteed |
41 |
|
|
* as it is, generally speaking, impossible to make any hard guarantees in the |
42 |
|
|
* presence of unsynchronized concurrent modification. Fail-fast iterators |
43 |
jsr166 |
1.43 |
* throw {@code ConcurrentModificationException} on a best-effort basis. |
44 |
dl |
1.1 |
* Therefore, it would be wrong to write a program that depended on this |
45 |
|
|
* exception for its correctness: <i>the fail-fast behavior of iterators |
46 |
|
|
* should be used only to detect bugs.</i> |
47 |
|
|
* |
48 |
|
|
* <p>This class and its iterator implement all of the |
49 |
jsr166 |
1.9 |
* <em>optional</em> methods of the {@link Collection} and {@link |
50 |
|
|
* Iterator} interfaces. |
51 |
|
|
* |
52 |
|
|
* <p>This class is a member of the |
53 |
jsr166 |
1.29 |
* <a href="{@docRoot}/../technotes/guides/collections/index.html"> |
54 |
jsr166 |
1.9 |
* Java Collections Framework</a>. |
55 |
dl |
1.1 |
* |
56 |
|
|
* @author Josh Bloch and Doug Lea |
57 |
jsr166 |
1.74 |
* @param <E> the type of elements held in this deque |
58 |
dl |
1.1 |
* @since 1.6 |
59 |
|
|
*/ |
60 |
|
|
public class ArrayDeque<E> extends AbstractCollection<E> |
61 |
dl |
1.47 |
implements Deque<E>, Cloneable, Serializable |
62 |
dl |
1.1 |
{ |
63 |
jsr166 |
1.106 |
/* |
64 |
|
|
* VMs excel at optimizing simple array loops where indices are |
65 |
|
|
* incrementing or decrementing over a valid slice, e.g. |
66 |
|
|
* |
67 |
|
|
* for (int i = start; i < end; i++) ... elements[i] |
68 |
|
|
* |
69 |
|
|
* Because in a circular array, elements are in general stored in |
70 |
|
|
* two disjoint such slices, we help the VM by writing unusual |
71 |
jsr166 |
1.114 |
* nested loops for all traversals over the elements. Having only |
72 |
|
|
* one hot inner loop body instead of two or three eases human |
73 |
|
|
* maintenance and encourages VM loop inlining into the caller. |
74 |
jsr166 |
1.106 |
*/ |
75 |
|
|
|
76 |
dl |
1.1 |
/** |
77 |
dl |
1.4 |
* The array in which the elements of the deque are stored. |
78 |
jsr166 |
1.114 |
* All array cells not holding deque elements are always null. |
79 |
|
|
* The array always has at least one null slot (at tail). |
80 |
dl |
1.1 |
*/ |
81 |
jsr166 |
1.75 |
transient Object[] elements; |
82 |
dl |
1.1 |
|
83 |
|
|
/** |
84 |
|
|
* The index of the element at the head of the deque (which is the |
85 |
|
|
* element that would be removed by remove() or pop()); or an |
86 |
jsr166 |
1.106 |
* arbitrary number 0 <= head < elements.length equal to tail if |
87 |
|
|
* the deque is empty. |
88 |
dl |
1.1 |
*/ |
89 |
dl |
1.41 |
transient int head; |
90 |
dl |
1.1 |
|
91 |
jsr166 |
1.106 |
/** |
92 |
|
|
* The index at which the next element would be added to the tail |
93 |
jsr166 |
1.114 |
* of the deque (via addLast(E), add(E), or push(E)); |
94 |
|
|
* elements[tail] is always null. |
95 |
jsr166 |
1.106 |
*/ |
96 |
|
|
transient int tail; |
97 |
jsr166 |
1.75 |
|
98 |
dl |
1.1 |
/** |
99 |
jsr166 |
1.75 |
* The maximum size of array to allocate. |
100 |
|
|
* Some VMs reserve some header words in an array. |
101 |
|
|
* Attempts to allocate larger arrays may result in |
102 |
|
|
* OutOfMemoryError: Requested array size exceeds VM limit |
103 |
dl |
1.1 |
*/ |
104 |
jsr166 |
1.75 |
private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8; |
105 |
dl |
1.1 |
|
106 |
|
|
/** |
107 |
jsr166 |
1.75 |
* Increases the capacity of this deque by at least the given amount. |
108 |
|
|
* |
109 |
|
|
* @param needed the required minimum extra capacity; must be positive |
110 |
dl |
1.1 |
*/ |
111 |
jsr166 |
1.106 |
private void grow(int needed) { |
112 |
jsr166 |
1.75 |
// overflow-conscious code |
113 |
jsr166 |
1.91 |
final int oldCapacity = elements.length; |
114 |
jsr166 |
1.75 |
int newCapacity; |
115 |
jsr166 |
1.106 |
// Double capacity if small; else grow by 50% |
116 |
jsr166 |
1.75 |
int jump = (oldCapacity < 64) ? (oldCapacity + 2) : (oldCapacity >> 1); |
117 |
|
|
if (jump < needed |
118 |
|
|
|| (newCapacity = (oldCapacity + jump)) - MAX_ARRAY_SIZE > 0) |
119 |
|
|
newCapacity = newCapacity(needed, jump); |
120 |
jsr166 |
1.125 |
final Object[] es = elements = Arrays.copyOf(elements, newCapacity); |
121 |
jsr166 |
1.106 |
// Exceptionally, here tail == head needs to be disambiguated |
122 |
jsr166 |
1.125 |
if (tail < head || (tail == head && es[head] != null)) { |
123 |
jsr166 |
1.75 |
// wrap around; slide first leg forward to end of array |
124 |
|
|
int newSpace = newCapacity - oldCapacity; |
125 |
jsr166 |
1.125 |
System.arraycopy(es, head, |
126 |
|
|
es, head + newSpace, |
127 |
jsr166 |
1.75 |
oldCapacity - head); |
128 |
jsr166 |
1.125 |
for (int i = head, to = (head += newSpace); i < to; i++) |
129 |
|
|
es[i] = null; |
130 |
jsr166 |
1.75 |
} |
131 |
|
|
// checkInvariants(); |
132 |
|
|
} |
133 |
dl |
1.1 |
|
134 |
jsr166 |
1.75 |
/** Capacity calculation for edge conditions, especially overflow. */ |
135 |
|
|
private int newCapacity(int needed, int jump) { |
136 |
jsr166 |
1.91 |
final int oldCapacity = elements.length, minCapacity; |
137 |
jsr166 |
1.75 |
if ((minCapacity = oldCapacity + needed) - MAX_ARRAY_SIZE > 0) { |
138 |
|
|
if (minCapacity < 0) |
139 |
|
|
throw new IllegalStateException("Sorry, deque too big"); |
140 |
|
|
return Integer.MAX_VALUE; |
141 |
|
|
} |
142 |
|
|
if (needed > jump) |
143 |
|
|
return minCapacity; |
144 |
|
|
return (oldCapacity + jump - MAX_ARRAY_SIZE < 0) |
145 |
|
|
? oldCapacity + jump |
146 |
|
|
: MAX_ARRAY_SIZE; |
147 |
|
|
} |
148 |
dl |
1.1 |
|
149 |
|
|
/** |
150 |
jsr166 |
1.75 |
* Increases the internal storage of this collection, if necessary, |
151 |
|
|
* to ensure that it can hold at least the given number of elements. |
152 |
dl |
1.1 |
* |
153 |
jsr166 |
1.75 |
* @param minCapacity the desired minimum capacity |
154 |
jsr166 |
1.80 |
* @since TBD |
155 |
dl |
1.1 |
*/ |
156 |
jsr166 |
1.80 |
/* public */ void ensureCapacity(int minCapacity) { |
157 |
jsr166 |
1.106 |
int needed; |
158 |
|
|
if ((needed = (minCapacity + 1 - elements.length)) > 0) |
159 |
|
|
grow(needed); |
160 |
jsr166 |
1.75 |
// checkInvariants(); |
161 |
dl |
1.1 |
} |
162 |
|
|
|
163 |
|
|
/** |
164 |
jsr166 |
1.75 |
* Minimizes the internal storage of this collection. |
165 |
jsr166 |
1.80 |
* |
166 |
|
|
* @since TBD |
167 |
dl |
1.1 |
*/ |
168 |
jsr166 |
1.80 |
/* public */ void trimToSize() { |
169 |
jsr166 |
1.106 |
int size; |
170 |
|
|
if ((size = size()) + 1 < elements.length) { |
171 |
|
|
elements = toArray(new Object[size + 1]); |
172 |
jsr166 |
1.75 |
head = 0; |
173 |
jsr166 |
1.106 |
tail = size; |
174 |
jsr166 |
1.75 |
} |
175 |
|
|
// checkInvariants(); |
176 |
dl |
1.1 |
} |
177 |
|
|
|
178 |
|
|
/** |
179 |
dl |
1.4 |
* Constructs an empty array deque with an initial capacity |
180 |
dl |
1.1 |
* sufficient to hold 16 elements. |
181 |
|
|
*/ |
182 |
|
|
public ArrayDeque() { |
183 |
jsr166 |
1.34 |
elements = new Object[16]; |
184 |
dl |
1.1 |
} |
185 |
|
|
|
186 |
|
|
/** |
187 |
|
|
* Constructs an empty array deque with an initial capacity |
188 |
|
|
* sufficient to hold the specified number of elements. |
189 |
|
|
* |
190 |
jsr166 |
1.75 |
* @param numElements lower bound on initial capacity of the deque |
191 |
dl |
1.1 |
*/ |
192 |
|
|
public ArrayDeque(int numElements) { |
193 |
jsr166 |
1.114 |
elements = |
194 |
|
|
new Object[(numElements < 1) ? 1 : |
195 |
|
|
(numElements == Integer.MAX_VALUE) ? Integer.MAX_VALUE : |
196 |
|
|
numElements + 1]; |
197 |
dl |
1.1 |
} |
198 |
|
|
|
199 |
|
|
/** |
200 |
|
|
* Constructs a deque containing the elements of the specified |
201 |
|
|
* collection, in the order they are returned by the collection's |
202 |
|
|
* iterator. (The first element returned by the collection's |
203 |
|
|
* iterator becomes the first element, or <i>front</i> of the |
204 |
|
|
* deque.) |
205 |
|
|
* |
206 |
|
|
* @param c the collection whose elements are to be placed into the deque |
207 |
|
|
* @throws NullPointerException if the specified collection is null |
208 |
|
|
*/ |
209 |
|
|
public ArrayDeque(Collection<? extends E> c) { |
210 |
jsr166 |
1.114 |
this(c.size()); |
211 |
jsr166 |
1.106 |
addAll(c); |
212 |
jsr166 |
1.75 |
} |
213 |
|
|
|
214 |
|
|
/** |
215 |
jsr166 |
1.79 |
* Increments i, mod modulus. |
216 |
|
|
* Precondition and postcondition: 0 <= i < modulus. |
217 |
jsr166 |
1.75 |
*/ |
218 |
jsr166 |
1.79 |
static final int inc(int i, int modulus) { |
219 |
jsr166 |
1.89 |
if (++i >= modulus) i = 0; |
220 |
jsr166 |
1.79 |
return i; |
221 |
jsr166 |
1.75 |
} |
222 |
|
|
|
223 |
|
|
/** |
224 |
jsr166 |
1.79 |
* Decrements i, mod modulus. |
225 |
|
|
* Precondition and postcondition: 0 <= i < modulus. |
226 |
jsr166 |
1.75 |
*/ |
227 |
jsr166 |
1.79 |
static final int dec(int i, int modulus) { |
228 |
jsr166 |
1.89 |
if (--i < 0) i = modulus - 1; |
229 |
jsr166 |
1.75 |
return i; |
230 |
|
|
} |
231 |
|
|
|
232 |
|
|
/** |
233 |
jsr166 |
1.114 |
* Circularly adds the given distance to index i, mod modulus. |
234 |
|
|
* Precondition: 0 <= i < modulus, 0 <= distance <= modulus. |
235 |
|
|
* @return index 0 <= i < modulus |
236 |
jsr166 |
1.75 |
*/ |
237 |
jsr166 |
1.114 |
static final int add(int i, int distance, int modulus) { |
238 |
jsr166 |
1.124 |
if ((i += distance) - modulus >= 0) i -= modulus; |
239 |
jsr166 |
1.75 |
return i; |
240 |
|
|
} |
241 |
|
|
|
242 |
|
|
/** |
243 |
jsr166 |
1.106 |
* Subtracts j from i, mod modulus. |
244 |
jsr166 |
1.114 |
* Index i must be logically ahead of index j. |
245 |
|
|
* Precondition: 0 <= i < modulus, 0 <= j < modulus. |
246 |
|
|
* @return the "circular distance" from j to i; corner case i == j |
247 |
|
|
* is diambiguated to "empty", returning 0. |
248 |
jsr166 |
1.106 |
*/ |
249 |
|
|
static final int sub(int i, int j, int modulus) { |
250 |
|
|
if ((i -= j) < 0) i += modulus; |
251 |
|
|
return i; |
252 |
|
|
} |
253 |
|
|
|
254 |
|
|
/** |
255 |
jsr166 |
1.75 |
* Returns element at array index i. |
256 |
jsr166 |
1.106 |
* This is a slight abuse of generics, accepted by javac. |
257 |
jsr166 |
1.75 |
*/ |
258 |
|
|
@SuppressWarnings("unchecked") |
259 |
jsr166 |
1.106 |
static final <E> E elementAt(Object[] es, int i) { |
260 |
|
|
return (E) es[i]; |
261 |
jsr166 |
1.75 |
} |
262 |
|
|
|
263 |
|
|
/** |
264 |
|
|
* A version of elementAt that checks for null elements. |
265 |
|
|
* This check doesn't catch all possible comodifications, |
266 |
jsr166 |
1.106 |
* but does catch ones that corrupt traversal. |
267 |
jsr166 |
1.75 |
*/ |
268 |
jsr166 |
1.96 |
static final <E> E nonNullElementAt(Object[] es, int i) { |
269 |
|
|
@SuppressWarnings("unchecked") E e = (E) es[i]; |
270 |
jsr166 |
1.75 |
if (e == null) |
271 |
|
|
throw new ConcurrentModificationException(); |
272 |
|
|
return e; |
273 |
dl |
1.1 |
} |
274 |
|
|
|
275 |
|
|
// The main insertion and extraction methods are addFirst, |
276 |
|
|
// addLast, pollFirst, pollLast. The other methods are defined in |
277 |
|
|
// terms of these. |
278 |
|
|
|
279 |
|
|
/** |
280 |
dl |
1.5 |
* Inserts the specified element at the front of this deque. |
281 |
dl |
1.1 |
* |
282 |
jsr166 |
1.9 |
* @param e the element to add |
283 |
|
|
* @throws NullPointerException if the specified element is null |
284 |
dl |
1.1 |
*/ |
285 |
|
|
public void addFirst(E e) { |
286 |
jsr166 |
1.106 |
if (e == null) |
287 |
|
|
throw new NullPointerException(); |
288 |
|
|
final Object[] es = elements; |
289 |
|
|
es[head = dec(head, es.length)] = e; |
290 |
|
|
if (head == tail) |
291 |
|
|
grow(1); |
292 |
jsr166 |
1.83 |
// checkInvariants(); |
293 |
dl |
1.1 |
} |
294 |
|
|
|
295 |
|
|
/** |
296 |
dl |
1.6 |
* Inserts the specified element at the end of this deque. |
297 |
jsr166 |
1.14 |
* |
298 |
|
|
* <p>This method is equivalent to {@link #add}. |
299 |
dl |
1.1 |
* |
300 |
jsr166 |
1.9 |
* @param e the element to add |
301 |
|
|
* @throws NullPointerException if the specified element is null |
302 |
dl |
1.1 |
*/ |
303 |
|
|
public void addLast(E e) { |
304 |
jsr166 |
1.106 |
if (e == null) |
305 |
|
|
throw new NullPointerException(); |
306 |
|
|
final Object[] es = elements; |
307 |
|
|
es[tail] = e; |
308 |
|
|
if (head == (tail = inc(tail, es.length))) |
309 |
|
|
grow(1); |
310 |
jsr166 |
1.83 |
// checkInvariants(); |
311 |
jsr166 |
1.75 |
} |
312 |
|
|
|
313 |
|
|
/** |
314 |
|
|
* Adds all of the elements in the specified collection at the end |
315 |
|
|
* of this deque, as if by calling {@link #addLast} on each one, |
316 |
|
|
* in the order that they are returned by the collection's |
317 |
|
|
* iterator. |
318 |
|
|
* |
319 |
|
|
* @param c the elements to be inserted into this deque |
320 |
|
|
* @return {@code true} if this deque changed as a result of the call |
321 |
|
|
* @throws NullPointerException if the specified collection or any |
322 |
|
|
* of its elements are null |
323 |
|
|
*/ |
324 |
|
|
public boolean addAll(Collection<? extends E> c) { |
325 |
jsr166 |
1.117 |
final int s, needed; |
326 |
|
|
if ((needed = (s = size()) + c.size() + 1 - elements.length) > 0) |
327 |
jsr166 |
1.87 |
grow(needed); |
328 |
jsr166 |
1.116 |
c.forEach(this::addLast); |
329 |
jsr166 |
1.75 |
// checkInvariants(); |
330 |
jsr166 |
1.106 |
return size() > s; |
331 |
dl |
1.1 |
} |
332 |
|
|
|
333 |
|
|
/** |
334 |
dl |
1.5 |
* Inserts the specified element at the front of this deque. |
335 |
dl |
1.1 |
* |
336 |
jsr166 |
1.9 |
* @param e the element to add |
337 |
jsr166 |
1.40 |
* @return {@code true} (as specified by {@link Deque#offerFirst}) |
338 |
jsr166 |
1.9 |
* @throws NullPointerException if the specified element is null |
339 |
dl |
1.1 |
*/ |
340 |
|
|
public boolean offerFirst(E e) { |
341 |
|
|
addFirst(e); |
342 |
|
|
return true; |
343 |
|
|
} |
344 |
|
|
|
345 |
|
|
/** |
346 |
dl |
1.6 |
* Inserts the specified element at the end of this deque. |
347 |
dl |
1.1 |
* |
348 |
jsr166 |
1.9 |
* @param e the element to add |
349 |
jsr166 |
1.40 |
* @return {@code true} (as specified by {@link Deque#offerLast}) |
350 |
jsr166 |
1.9 |
* @throws NullPointerException if the specified element is null |
351 |
dl |
1.1 |
*/ |
352 |
|
|
public boolean offerLast(E e) { |
353 |
|
|
addLast(e); |
354 |
|
|
return true; |
355 |
|
|
} |
356 |
|
|
|
357 |
|
|
/** |
358 |
jsr166 |
1.9 |
* @throws NoSuchElementException {@inheritDoc} |
359 |
dl |
1.1 |
*/ |
360 |
|
|
public E removeFirst() { |
361 |
jsr166 |
1.84 |
E e = pollFirst(); |
362 |
|
|
if (e == null) |
363 |
dl |
1.1 |
throw new NoSuchElementException(); |
364 |
jsr166 |
1.106 |
// checkInvariants(); |
365 |
jsr166 |
1.84 |
return e; |
366 |
dl |
1.1 |
} |
367 |
|
|
|
368 |
|
|
/** |
369 |
jsr166 |
1.9 |
* @throws NoSuchElementException {@inheritDoc} |
370 |
dl |
1.1 |
*/ |
371 |
|
|
public E removeLast() { |
372 |
jsr166 |
1.84 |
E e = pollLast(); |
373 |
|
|
if (e == null) |
374 |
dl |
1.1 |
throw new NoSuchElementException(); |
375 |
jsr166 |
1.106 |
// checkInvariants(); |
376 |
jsr166 |
1.84 |
return e; |
377 |
dl |
1.1 |
} |
378 |
|
|
|
379 |
jsr166 |
1.9 |
public E pollFirst() { |
380 |
jsr166 |
1.106 |
final Object[] es; |
381 |
|
|
final int h; |
382 |
|
|
E e = elementAt(es = elements, h = head); |
383 |
|
|
if (e != null) { |
384 |
|
|
es[h] = null; |
385 |
|
|
head = inc(h, es.length); |
386 |
|
|
} |
387 |
jsr166 |
1.75 |
// checkInvariants(); |
388 |
|
|
return e; |
389 |
dl |
1.1 |
} |
390 |
|
|
|
391 |
jsr166 |
1.9 |
public E pollLast() { |
392 |
jsr166 |
1.106 |
final Object[] es; |
393 |
|
|
final int t; |
394 |
|
|
E e = elementAt(es = elements, t = dec(tail, es.length)); |
395 |
|
|
if (e != null) |
396 |
|
|
es[tail = t] = null; |
397 |
jsr166 |
1.75 |
// checkInvariants(); |
398 |
|
|
return e; |
399 |
dl |
1.1 |
} |
400 |
|
|
|
401 |
|
|
/** |
402 |
jsr166 |
1.9 |
* @throws NoSuchElementException {@inheritDoc} |
403 |
dl |
1.1 |
*/ |
404 |
|
|
public E getFirst() { |
405 |
jsr166 |
1.106 |
E e = elementAt(elements, head); |
406 |
|
|
if (e == null) |
407 |
|
|
throw new NoSuchElementException(); |
408 |
jsr166 |
1.75 |
// checkInvariants(); |
409 |
jsr166 |
1.106 |
return e; |
410 |
dl |
1.1 |
} |
411 |
|
|
|
412 |
|
|
/** |
413 |
jsr166 |
1.9 |
* @throws NoSuchElementException {@inheritDoc} |
414 |
dl |
1.1 |
*/ |
415 |
|
|
public E getLast() { |
416 |
jsr166 |
1.106 |
final Object[] es = elements; |
417 |
|
|
E e = elementAt(es, dec(tail, es.length)); |
418 |
|
|
if (e == null) |
419 |
|
|
throw new NoSuchElementException(); |
420 |
jsr166 |
1.75 |
// checkInvariants(); |
421 |
jsr166 |
1.106 |
return e; |
422 |
dl |
1.1 |
} |
423 |
|
|
|
424 |
jsr166 |
1.9 |
public E peekFirst() { |
425 |
jsr166 |
1.75 |
// checkInvariants(); |
426 |
jsr166 |
1.106 |
return elementAt(elements, head); |
427 |
jsr166 |
1.9 |
} |
428 |
|
|
|
429 |
|
|
public E peekLast() { |
430 |
jsr166 |
1.75 |
// checkInvariants(); |
431 |
jsr166 |
1.106 |
final Object[] es; |
432 |
|
|
return elementAt(es = elements, dec(tail, es.length)); |
433 |
jsr166 |
1.9 |
} |
434 |
|
|
|
435 |
dl |
1.1 |
/** |
436 |
|
|
* Removes the first occurrence of the specified element in this |
437 |
jsr166 |
1.9 |
* deque (when traversing the deque from head to tail). |
438 |
|
|
* If the deque does not contain the element, it is unchanged. |
439 |
jsr166 |
1.40 |
* More formally, removes the first element {@code e} such that |
440 |
|
|
* {@code o.equals(e)} (if such an element exists). |
441 |
|
|
* Returns {@code true} if this deque contained the specified element |
442 |
jsr166 |
1.12 |
* (or equivalently, if this deque changed as a result of the call). |
443 |
dl |
1.1 |
* |
444 |
dl |
1.5 |
* @param o element to be removed from this deque, if present |
445 |
jsr166 |
1.40 |
* @return {@code true} if the deque contained the specified element |
446 |
dl |
1.1 |
*/ |
447 |
dl |
1.5 |
public boolean removeFirstOccurrence(Object o) { |
448 |
jsr166 |
1.58 |
if (o != null) { |
449 |
jsr166 |
1.99 |
final Object[] es = elements; |
450 |
jsr166 |
1.106 |
for (int i = head, end = tail, to = (i <= end) ? end : es.length; |
451 |
|
|
; i = 0, to = end) { |
452 |
jsr166 |
1.92 |
for (; i < to; i++) |
453 |
jsr166 |
1.99 |
if (o.equals(es[i])) { |
454 |
jsr166 |
1.89 |
delete(i); |
455 |
|
|
return true; |
456 |
|
|
} |
457 |
jsr166 |
1.106 |
if (to == end) break; |
458 |
dl |
1.1 |
} |
459 |
|
|
} |
460 |
|
|
return false; |
461 |
|
|
} |
462 |
|
|
|
463 |
|
|
/** |
464 |
|
|
* Removes the last occurrence of the specified element in this |
465 |
jsr166 |
1.9 |
* deque (when traversing the deque from head to tail). |
466 |
|
|
* If the deque does not contain the element, it is unchanged. |
467 |
jsr166 |
1.40 |
* More formally, removes the last element {@code e} such that |
468 |
|
|
* {@code o.equals(e)} (if such an element exists). |
469 |
|
|
* Returns {@code true} if this deque contained the specified element |
470 |
jsr166 |
1.12 |
* (or equivalently, if this deque changed as a result of the call). |
471 |
dl |
1.1 |
* |
472 |
dl |
1.5 |
* @param o element to be removed from this deque, if present |
473 |
jsr166 |
1.40 |
* @return {@code true} if the deque contained the specified element |
474 |
dl |
1.1 |
*/ |
475 |
dl |
1.5 |
public boolean removeLastOccurrence(Object o) { |
476 |
jsr166 |
1.59 |
if (o != null) { |
477 |
jsr166 |
1.99 |
final Object[] es = elements; |
478 |
jsr166 |
1.107 |
for (int i = tail, end = head, to = (i >= end) ? end : 0; |
479 |
|
|
; i = es.length, to = end) { |
480 |
jsr166 |
1.110 |
for (i--; i > to - 1; i--) |
481 |
jsr166 |
1.99 |
if (o.equals(es[i])) { |
482 |
jsr166 |
1.89 |
delete(i); |
483 |
|
|
return true; |
484 |
|
|
} |
485 |
jsr166 |
1.106 |
if (to == end) break; |
486 |
dl |
1.1 |
} |
487 |
|
|
} |
488 |
|
|
return false; |
489 |
|
|
} |
490 |
|
|
|
491 |
|
|
// *** Queue methods *** |
492 |
|
|
|
493 |
|
|
/** |
494 |
dl |
1.6 |
* Inserts the specified element at the end of this deque. |
495 |
dl |
1.1 |
* |
496 |
|
|
* <p>This method is equivalent to {@link #addLast}. |
497 |
|
|
* |
498 |
jsr166 |
1.9 |
* @param e the element to add |
499 |
jsr166 |
1.40 |
* @return {@code true} (as specified by {@link Collection#add}) |
500 |
jsr166 |
1.9 |
* @throws NullPointerException if the specified element is null |
501 |
dl |
1.1 |
*/ |
502 |
|
|
public boolean add(E e) { |
503 |
|
|
addLast(e); |
504 |
|
|
return true; |
505 |
|
|
} |
506 |
|
|
|
507 |
|
|
/** |
508 |
jsr166 |
1.9 |
* Inserts the specified element at the end of this deque. |
509 |
dl |
1.1 |
* |
510 |
jsr166 |
1.9 |
* <p>This method is equivalent to {@link #offerLast}. |
511 |
dl |
1.1 |
* |
512 |
jsr166 |
1.9 |
* @param e the element to add |
513 |
jsr166 |
1.40 |
* @return {@code true} (as specified by {@link Queue#offer}) |
514 |
jsr166 |
1.9 |
* @throws NullPointerException if the specified element is null |
515 |
dl |
1.1 |
*/ |
516 |
jsr166 |
1.9 |
public boolean offer(E e) { |
517 |
|
|
return offerLast(e); |
518 |
dl |
1.1 |
} |
519 |
|
|
|
520 |
|
|
/** |
521 |
|
|
* Retrieves and removes the head of the queue represented by this deque. |
522 |
jsr166 |
1.15 |
* |
523 |
jsr166 |
1.127 |
* This method differs from {@link #poll() poll()} only in that it |
524 |
|
|
* throws an exception if this deque is empty. |
525 |
dl |
1.1 |
* |
526 |
|
|
* <p>This method is equivalent to {@link #removeFirst}. |
527 |
|
|
* |
528 |
|
|
* @return the head of the queue represented by this deque |
529 |
jsr166 |
1.9 |
* @throws NoSuchElementException {@inheritDoc} |
530 |
dl |
1.1 |
*/ |
531 |
|
|
public E remove() { |
532 |
|
|
return removeFirst(); |
533 |
|
|
} |
534 |
|
|
|
535 |
|
|
/** |
536 |
jsr166 |
1.9 |
* Retrieves and removes the head of the queue represented by this deque |
537 |
|
|
* (in other words, the first element of this deque), or returns |
538 |
jsr166 |
1.40 |
* {@code null} if this deque is empty. |
539 |
dl |
1.1 |
* |
540 |
jsr166 |
1.9 |
* <p>This method is equivalent to {@link #pollFirst}. |
541 |
dl |
1.1 |
* |
542 |
|
|
* @return the head of the queue represented by this deque, or |
543 |
jsr166 |
1.40 |
* {@code null} if this deque is empty |
544 |
dl |
1.1 |
*/ |
545 |
jsr166 |
1.9 |
public E poll() { |
546 |
|
|
return pollFirst(); |
547 |
dl |
1.1 |
} |
548 |
|
|
|
549 |
|
|
/** |
550 |
|
|
* Retrieves, but does not remove, the head of the queue represented by |
551 |
jsr166 |
1.15 |
* this deque. This method differs from {@link #peek peek} only in |
552 |
|
|
* that it throws an exception if this deque is empty. |
553 |
dl |
1.1 |
* |
554 |
jsr166 |
1.8 |
* <p>This method is equivalent to {@link #getFirst}. |
555 |
dl |
1.1 |
* |
556 |
|
|
* @return the head of the queue represented by this deque |
557 |
jsr166 |
1.9 |
* @throws NoSuchElementException {@inheritDoc} |
558 |
dl |
1.1 |
*/ |
559 |
|
|
public E element() { |
560 |
|
|
return getFirst(); |
561 |
|
|
} |
562 |
|
|
|
563 |
jsr166 |
1.9 |
/** |
564 |
|
|
* Retrieves, but does not remove, the head of the queue represented by |
565 |
jsr166 |
1.40 |
* this deque, or returns {@code null} if this deque is empty. |
566 |
jsr166 |
1.9 |
* |
567 |
|
|
* <p>This method is equivalent to {@link #peekFirst}. |
568 |
|
|
* |
569 |
|
|
* @return the head of the queue represented by this deque, or |
570 |
jsr166 |
1.40 |
* {@code null} if this deque is empty |
571 |
jsr166 |
1.9 |
*/ |
572 |
|
|
public E peek() { |
573 |
|
|
return peekFirst(); |
574 |
|
|
} |
575 |
|
|
|
576 |
dl |
1.1 |
// *** Stack methods *** |
577 |
|
|
|
578 |
|
|
/** |
579 |
|
|
* Pushes an element onto the stack represented by this deque. In other |
580 |
dl |
1.5 |
* words, inserts the element at the front of this deque. |
581 |
dl |
1.1 |
* |
582 |
|
|
* <p>This method is equivalent to {@link #addFirst}. |
583 |
|
|
* |
584 |
|
|
* @param e the element to push |
585 |
jsr166 |
1.9 |
* @throws NullPointerException if the specified element is null |
586 |
dl |
1.1 |
*/ |
587 |
|
|
public void push(E e) { |
588 |
|
|
addFirst(e); |
589 |
|
|
} |
590 |
|
|
|
591 |
|
|
/** |
592 |
|
|
* Pops an element from the stack represented by this deque. In other |
593 |
dl |
1.2 |
* words, removes and returns the first element of this deque. |
594 |
dl |
1.1 |
* |
595 |
|
|
* <p>This method is equivalent to {@link #removeFirst()}. |
596 |
|
|
* |
597 |
|
|
* @return the element at the front of this deque (which is the top |
598 |
jsr166 |
1.9 |
* of the stack represented by this deque) |
599 |
|
|
* @throws NoSuchElementException {@inheritDoc} |
600 |
dl |
1.1 |
*/ |
601 |
|
|
public E pop() { |
602 |
|
|
return removeFirst(); |
603 |
|
|
} |
604 |
|
|
|
605 |
|
|
/** |
606 |
jsr166 |
1.75 |
* Removes the element at the specified position in the elements array. |
607 |
|
|
* This can result in forward or backwards motion of array elements. |
608 |
|
|
* We optimize for least element motion. |
609 |
dl |
1.1 |
* |
610 |
dl |
1.5 |
* <p>This method is called delete rather than remove to emphasize |
611 |
jsr166 |
1.9 |
* that its semantics differ from those of {@link List#remove(int)}. |
612 |
dl |
1.5 |
* |
613 |
jsr166 |
1.106 |
* @return true if elements near tail moved backwards |
614 |
dl |
1.1 |
*/ |
615 |
jsr166 |
1.71 |
boolean delete(int i) { |
616 |
jsr166 |
1.75 |
// checkInvariants(); |
617 |
jsr166 |
1.99 |
final Object[] es = elements; |
618 |
|
|
final int capacity = es.length; |
619 |
jsr166 |
1.118 |
final int h, t; |
620 |
jsr166 |
1.106 |
// number of elements before to-be-deleted elt |
621 |
jsr166 |
1.118 |
final int front = sub(i, h = head, capacity); |
622 |
|
|
// number of elements after to-be-deleted elt |
623 |
|
|
final int back = sub(t = tail, i, capacity) - 1; |
624 |
jsr166 |
1.30 |
if (front < back) { |
625 |
jsr166 |
1.75 |
// move front elements forwards |
626 |
jsr166 |
1.30 |
if (h <= i) { |
627 |
jsr166 |
1.99 |
System.arraycopy(es, h, es, h + 1, front); |
628 |
jsr166 |
1.30 |
} else { // Wrap around |
629 |
jsr166 |
1.99 |
System.arraycopy(es, 0, es, 1, i); |
630 |
|
|
es[0] = es[capacity - 1]; |
631 |
|
|
System.arraycopy(es, h, es, h + 1, front - (i + 1)); |
632 |
jsr166 |
1.30 |
} |
633 |
jsr166 |
1.99 |
es[h] = null; |
634 |
jsr166 |
1.106 |
head = inc(h, capacity); |
635 |
jsr166 |
1.75 |
// checkInvariants(); |
636 |
jsr166 |
1.30 |
return false; |
637 |
|
|
} else { |
638 |
jsr166 |
1.75 |
// move back elements backwards |
639 |
jsr166 |
1.118 |
tail = dec(t, capacity); |
640 |
jsr166 |
1.75 |
if (i <= tail) { |
641 |
jsr166 |
1.99 |
System.arraycopy(es, i + 1, es, i, back); |
642 |
jsr166 |
1.30 |
} else { // Wrap around |
643 |
jsr166 |
1.118 |
System.arraycopy(es, i + 1, es, i, capacity - (i + 1)); |
644 |
jsr166 |
1.99 |
es[capacity - 1] = es[0]; |
645 |
jsr166 |
1.118 |
System.arraycopy(es, 1, es, 0, t - 1); |
646 |
jsr166 |
1.30 |
} |
647 |
jsr166 |
1.99 |
es[tail] = null; |
648 |
jsr166 |
1.75 |
// checkInvariants(); |
649 |
jsr166 |
1.30 |
return true; |
650 |
|
|
} |
651 |
dl |
1.23 |
} |
652 |
|
|
|
653 |
dl |
1.1 |
// *** Collection Methods *** |
654 |
|
|
|
655 |
|
|
/** |
656 |
|
|
* Returns the number of elements in this deque. |
657 |
|
|
* |
658 |
|
|
* @return the number of elements in this deque |
659 |
|
|
*/ |
660 |
|
|
public int size() { |
661 |
jsr166 |
1.106 |
return sub(tail, head, elements.length); |
662 |
dl |
1.1 |
} |
663 |
|
|
|
664 |
|
|
/** |
665 |
jsr166 |
1.40 |
* Returns {@code true} if this deque contains no elements. |
666 |
dl |
1.1 |
* |
667 |
jsr166 |
1.40 |
* @return {@code true} if this deque contains no elements |
668 |
dl |
1.1 |
*/ |
669 |
|
|
public boolean isEmpty() { |
670 |
jsr166 |
1.106 |
return head == tail; |
671 |
dl |
1.1 |
} |
672 |
|
|
|
673 |
|
|
/** |
674 |
|
|
* Returns an iterator over the elements in this deque. The elements |
675 |
|
|
* will be ordered from first (head) to last (tail). This is the same |
676 |
|
|
* order that elements would be dequeued (via successive calls to |
677 |
|
|
* {@link #remove} or popped (via successive calls to {@link #pop}). |
678 |
dl |
1.5 |
* |
679 |
jsr166 |
1.18 |
* @return an iterator over the elements in this deque |
680 |
dl |
1.1 |
*/ |
681 |
|
|
public Iterator<E> iterator() { |
682 |
|
|
return new DeqIterator(); |
683 |
|
|
} |
684 |
|
|
|
685 |
dl |
1.16 |
public Iterator<E> descendingIterator() { |
686 |
|
|
return new DescendingIterator(); |
687 |
|
|
} |
688 |
|
|
|
689 |
dl |
1.1 |
private class DeqIterator implements Iterator<E> { |
690 |
jsr166 |
1.75 |
/** Index of element to be returned by subsequent call to next. */ |
691 |
|
|
int cursor; |
692 |
dl |
1.1 |
|
693 |
jsr166 |
1.75 |
/** Number of elements yet to be returned. */ |
694 |
jsr166 |
1.106 |
int remaining = size(); |
695 |
dl |
1.1 |
|
696 |
|
|
/** |
697 |
|
|
* Index of element returned by most recent call to next. |
698 |
|
|
* Reset to -1 if element is deleted by a call to remove. |
699 |
|
|
*/ |
700 |
jsr166 |
1.75 |
int lastRet = -1; |
701 |
dl |
1.1 |
|
702 |
jsr166 |
1.75 |
DeqIterator() { cursor = head; } |
703 |
|
|
|
704 |
|
|
public final boolean hasNext() { |
705 |
|
|
return remaining > 0; |
706 |
|
|
} |
707 |
|
|
|
708 |
jsr166 |
1.81 |
public E next() { |
709 |
jsr166 |
1.91 |
if (remaining <= 0) |
710 |
dl |
1.1 |
throw new NoSuchElementException(); |
711 |
jsr166 |
1.99 |
final Object[] es = elements; |
712 |
|
|
E e = nonNullElementAt(es, cursor); |
713 |
jsr166 |
1.122 |
cursor = inc(lastRet = cursor, es.length); |
714 |
jsr166 |
1.75 |
remaining--; |
715 |
|
|
return e; |
716 |
dl |
1.1 |
} |
717 |
|
|
|
718 |
jsr166 |
1.81 |
void postDelete(boolean leftShifted) { |
719 |
|
|
if (leftShifted) |
720 |
jsr166 |
1.106 |
cursor = dec(cursor, elements.length); |
721 |
jsr166 |
1.81 |
} |
722 |
|
|
|
723 |
jsr166 |
1.75 |
public final void remove() { |
724 |
dl |
1.1 |
if (lastRet < 0) |
725 |
|
|
throw new IllegalStateException(); |
726 |
jsr166 |
1.81 |
postDelete(delete(lastRet)); |
727 |
dl |
1.1 |
lastRet = -1; |
728 |
|
|
} |
729 |
jsr166 |
1.68 |
|
730 |
jsr166 |
1.81 |
public void forEachRemaining(Consumer<? super E> action) { |
731 |
jsr166 |
1.98 |
Objects.requireNonNull(action); |
732 |
jsr166 |
1.106 |
int r; |
733 |
|
|
if ((r = remaining) <= 0) |
734 |
|
|
return; |
735 |
|
|
remaining = 0; |
736 |
|
|
final Object[] es = elements; |
737 |
|
|
if (es[cursor] == null || sub(tail, cursor, es.length) != r) |
738 |
|
|
throw new ConcurrentModificationException(); |
739 |
|
|
for (int i = cursor, end = tail, to = (i <= end) ? end : es.length; |
740 |
|
|
; i = 0, to = end) { |
741 |
|
|
for (; i < to; i++) |
742 |
|
|
action.accept(elementAt(es, i)); |
743 |
|
|
if (to == end) { |
744 |
|
|
if (end != tail) |
745 |
|
|
throw new ConcurrentModificationException(); |
746 |
|
|
lastRet = dec(end, es.length); |
747 |
|
|
break; |
748 |
|
|
} |
749 |
jsr166 |
1.89 |
} |
750 |
jsr166 |
1.68 |
} |
751 |
dl |
1.1 |
} |
752 |
|
|
|
753 |
jsr166 |
1.75 |
private class DescendingIterator extends DeqIterator { |
754 |
jsr166 |
1.109 |
DescendingIterator() { cursor = dec(tail, elements.length); } |
755 |
jsr166 |
1.75 |
|
756 |
jsr166 |
1.81 |
public final E next() { |
757 |
jsr166 |
1.91 |
if (remaining <= 0) |
758 |
jsr166 |
1.81 |
throw new NoSuchElementException(); |
759 |
jsr166 |
1.99 |
final Object[] es = elements; |
760 |
|
|
E e = nonNullElementAt(es, cursor); |
761 |
jsr166 |
1.123 |
cursor = dec(lastRet = cursor, es.length); |
762 |
jsr166 |
1.81 |
remaining--; |
763 |
|
|
return e; |
764 |
jsr166 |
1.75 |
} |
765 |
|
|
|
766 |
jsr166 |
1.81 |
void postDelete(boolean leftShifted) { |
767 |
|
|
if (!leftShifted) |
768 |
jsr166 |
1.106 |
cursor = inc(cursor, elements.length); |
769 |
jsr166 |
1.81 |
} |
770 |
|
|
|
771 |
|
|
public final void forEachRemaining(Consumer<? super E> action) { |
772 |
jsr166 |
1.98 |
Objects.requireNonNull(action); |
773 |
jsr166 |
1.106 |
int r; |
774 |
|
|
if ((r = remaining) <= 0) |
775 |
|
|
return; |
776 |
|
|
remaining = 0; |
777 |
|
|
final Object[] es = elements; |
778 |
|
|
if (es[cursor] == null || sub(cursor, head, es.length) + 1 != r) |
779 |
|
|
throw new ConcurrentModificationException(); |
780 |
jsr166 |
1.108 |
for (int i = cursor, end = head, to = (i >= end) ? end : 0; |
781 |
jsr166 |
1.106 |
; i = es.length - 1, to = end) { |
782 |
jsr166 |
1.110 |
// hotspot generates faster code than for: i >= to ! |
783 |
|
|
for (; i > to - 1; i--) |
784 |
jsr166 |
1.106 |
action.accept(elementAt(es, i)); |
785 |
|
|
if (to == end) { |
786 |
jsr166 |
1.108 |
if (end != head) |
787 |
jsr166 |
1.106 |
throw new ConcurrentModificationException(); |
788 |
jsr166 |
1.112 |
lastRet = end; |
789 |
jsr166 |
1.106 |
break; |
790 |
jsr166 |
1.98 |
} |
791 |
jsr166 |
1.89 |
} |
792 |
jsr166 |
1.75 |
} |
793 |
|
|
} |
794 |
|
|
|
795 |
jsr166 |
1.52 |
/** |
796 |
jsr166 |
1.75 |
* Creates a <em><a href="Spliterator.html#binding">late-binding</a></em> |
797 |
|
|
* and <em>fail-fast</em> {@link Spliterator} over the elements in this |
798 |
|
|
* deque. |
799 |
|
|
* |
800 |
|
|
* <p>The {@code Spliterator} reports {@link Spliterator#SIZED}, |
801 |
|
|
* {@link Spliterator#SUBSIZED}, {@link Spliterator#ORDERED}, and |
802 |
|
|
* {@link Spliterator#NONNULL}. Overriding implementations should document |
803 |
|
|
* the reporting of additional characteristic values. |
804 |
|
|
* |
805 |
|
|
* @return a {@code Spliterator} over the elements in this deque |
806 |
|
|
* @since 1.8 |
807 |
jsr166 |
1.52 |
*/ |
808 |
jsr166 |
1.75 |
public Spliterator<E> spliterator() { |
809 |
jsr166 |
1.106 |
return new DeqSpliterator(); |
810 |
jsr166 |
1.75 |
} |
811 |
|
|
|
812 |
jsr166 |
1.106 |
final class DeqSpliterator implements Spliterator<E> { |
813 |
|
|
private int fence; // -1 until first use |
814 |
|
|
private int cursor; // current index, modified on traverse/split |
815 |
jsr166 |
1.75 |
|
816 |
jsr166 |
1.76 |
/** Constructs late-binding spliterator over all elements. */ |
817 |
jsr166 |
1.106 |
DeqSpliterator() { |
818 |
|
|
this.fence = -1; |
819 |
jsr166 |
1.76 |
} |
820 |
|
|
|
821 |
jsr166 |
1.106 |
/** Constructs spliterator over the given range. */ |
822 |
|
|
DeqSpliterator(int origin, int fence) { |
823 |
jsr166 |
1.124 |
// assert 0 <= origin && origin < elements.length; |
824 |
|
|
// assert 0 <= fence && fence < elements.length; |
825 |
jsr166 |
1.106 |
this.cursor = origin; |
826 |
|
|
this.fence = fence; |
827 |
jsr166 |
1.75 |
} |
828 |
|
|
|
829 |
jsr166 |
1.106 |
/** Ensures late-binding initialization; then returns fence. */ |
830 |
|
|
private int getFence() { // force initialization |
831 |
|
|
int t; |
832 |
|
|
if ((t = fence) < 0) { |
833 |
|
|
t = fence = tail; |
834 |
jsr166 |
1.76 |
cursor = head; |
835 |
|
|
} |
836 |
jsr166 |
1.106 |
return t; |
837 |
jsr166 |
1.76 |
} |
838 |
|
|
|
839 |
jsr166 |
1.106 |
public DeqSpliterator trySplit() { |
840 |
|
|
final Object[] es = elements; |
841 |
|
|
final int i, n; |
842 |
|
|
return ((n = sub(getFence(), i = cursor, es.length) >> 1) <= 0) |
843 |
|
|
? null |
844 |
|
|
: new DeqSpliterator(i, cursor = add(i, n, es.length)); |
845 |
jsr166 |
1.75 |
} |
846 |
dl |
1.16 |
|
847 |
jsr166 |
1.75 |
public void forEachRemaining(Consumer<? super E> action) { |
848 |
jsr166 |
1.106 |
if (action == null) |
849 |
|
|
throw new NullPointerException(); |
850 |
|
|
final int end = getFence(), cursor = this.cursor; |
851 |
|
|
final Object[] es = elements; |
852 |
|
|
if (cursor != end) { |
853 |
|
|
this.cursor = end; |
854 |
|
|
// null check at both ends of range is sufficient |
855 |
|
|
if (es[cursor] == null || es[dec(end, es.length)] == null) |
856 |
|
|
throw new ConcurrentModificationException(); |
857 |
|
|
for (int i = cursor, to = (i <= end) ? end : es.length; |
858 |
|
|
; i = 0, to = end) { |
859 |
|
|
for (; i < to; i++) |
860 |
|
|
action.accept(elementAt(es, i)); |
861 |
|
|
if (to == end) break; |
862 |
|
|
} |
863 |
|
|
} |
864 |
dl |
1.16 |
} |
865 |
|
|
|
866 |
jsr166 |
1.75 |
public boolean tryAdvance(Consumer<? super E> action) { |
867 |
jsr166 |
1.121 |
Objects.requireNonNull(action); |
868 |
|
|
final Object[] es = elements; |
869 |
|
|
if (fence < 0) { fence = tail; cursor = head; } // late-binding |
870 |
|
|
final int i; |
871 |
|
|
if ((i = cursor) == fence) |
872 |
jsr166 |
1.75 |
return false; |
873 |
jsr166 |
1.121 |
E e = nonNullElementAt(es, i); |
874 |
jsr166 |
1.106 |
cursor = inc(i, es.length); |
875 |
jsr166 |
1.121 |
action.accept(e); |
876 |
jsr166 |
1.75 |
return true; |
877 |
|
|
} |
878 |
|
|
|
879 |
|
|
public long estimateSize() { |
880 |
jsr166 |
1.106 |
return sub(getFence(), cursor, elements.length); |
881 |
jsr166 |
1.75 |
} |
882 |
|
|
|
883 |
|
|
public int characteristics() { |
884 |
|
|
return Spliterator.NONNULL |
885 |
|
|
| Spliterator.ORDERED |
886 |
|
|
| Spliterator.SIZED |
887 |
|
|
| Spliterator.SUBSIZED; |
888 |
dl |
1.16 |
} |
889 |
jsr166 |
1.75 |
} |
890 |
dl |
1.16 |
|
891 |
jsr166 |
1.126 |
/** |
892 |
|
|
* @throws NullPointerException {@inheritDoc} |
893 |
|
|
*/ |
894 |
jsr166 |
1.75 |
public void forEach(Consumer<? super E> action) { |
895 |
|
|
Objects.requireNonNull(action); |
896 |
jsr166 |
1.99 |
final Object[] es = elements; |
897 |
jsr166 |
1.106 |
for (int i = head, end = tail, to = (i <= end) ? end : es.length; |
898 |
|
|
; i = 0, to = end) { |
899 |
jsr166 |
1.92 |
for (; i < to; i++) |
900 |
jsr166 |
1.106 |
action.accept(elementAt(es, i)); |
901 |
|
|
if (to == end) { |
902 |
|
|
if (end != tail) throw new ConcurrentModificationException(); |
903 |
|
|
break; |
904 |
|
|
} |
905 |
jsr166 |
1.89 |
} |
906 |
jsr166 |
1.75 |
// checkInvariants(); |
907 |
|
|
} |
908 |
|
|
|
909 |
|
|
/** |
910 |
|
|
* Replaces each element of this deque with the result of applying the |
911 |
|
|
* operator to that element, as specified by {@link List#replaceAll}. |
912 |
|
|
* |
913 |
|
|
* @param operator the operator to apply to each element |
914 |
jsr166 |
1.80 |
* @since TBD |
915 |
jsr166 |
1.75 |
*/ |
916 |
jsr166 |
1.80 |
/* public */ void replaceAll(UnaryOperator<E> operator) { |
917 |
jsr166 |
1.75 |
Objects.requireNonNull(operator); |
918 |
jsr166 |
1.99 |
final Object[] es = elements; |
919 |
jsr166 |
1.106 |
for (int i = head, end = tail, to = (i <= end) ? end : es.length; |
920 |
|
|
; i = 0, to = end) { |
921 |
jsr166 |
1.92 |
for (; i < to; i++) |
922 |
jsr166 |
1.106 |
es[i] = operator.apply(elementAt(es, i)); |
923 |
|
|
if (to == end) { |
924 |
|
|
if (end != tail) throw new ConcurrentModificationException(); |
925 |
|
|
break; |
926 |
|
|
} |
927 |
jsr166 |
1.89 |
} |
928 |
jsr166 |
1.75 |
// checkInvariants(); |
929 |
|
|
} |
930 |
|
|
|
931 |
|
|
/** |
932 |
|
|
* @throws NullPointerException {@inheritDoc} |
933 |
|
|
*/ |
934 |
|
|
public boolean removeIf(Predicate<? super E> filter) { |
935 |
|
|
Objects.requireNonNull(filter); |
936 |
|
|
return bulkRemove(filter); |
937 |
|
|
} |
938 |
|
|
|
939 |
|
|
/** |
940 |
|
|
* @throws NullPointerException {@inheritDoc} |
941 |
|
|
*/ |
942 |
|
|
public boolean removeAll(Collection<?> c) { |
943 |
|
|
Objects.requireNonNull(c); |
944 |
|
|
return bulkRemove(e -> c.contains(e)); |
945 |
|
|
} |
946 |
|
|
|
947 |
|
|
/** |
948 |
|
|
* @throws NullPointerException {@inheritDoc} |
949 |
|
|
*/ |
950 |
|
|
public boolean retainAll(Collection<?> c) { |
951 |
|
|
Objects.requireNonNull(c); |
952 |
|
|
return bulkRemove(e -> !c.contains(e)); |
953 |
|
|
} |
954 |
|
|
|
955 |
|
|
/** Implementation of bulk remove methods. */ |
956 |
|
|
private boolean bulkRemove(Predicate<? super E> filter) { |
957 |
|
|
// checkInvariants(); |
958 |
jsr166 |
1.99 |
final Object[] es = elements; |
959 |
jsr166 |
1.106 |
// Optimize for initial run of survivors |
960 |
|
|
for (int i = head, end = tail, to = (i <= end) ? end : es.length; |
961 |
|
|
; i = 0, to = end) { |
962 |
jsr166 |
1.104 |
for (; i < to; i++) |
963 |
jsr166 |
1.106 |
if (filter.test(elementAt(es, i))) |
964 |
jsr166 |
1.113 |
return bulkRemoveModified(filter, i); |
965 |
jsr166 |
1.106 |
if (to == end) { |
966 |
|
|
if (end != tail) throw new ConcurrentModificationException(); |
967 |
|
|
break; |
968 |
|
|
} |
969 |
jsr166 |
1.104 |
} |
970 |
jsr166 |
1.106 |
return false; |
971 |
jsr166 |
1.104 |
} |
972 |
|
|
|
973 |
jsr166 |
1.113 |
// A tiny bit set implementation |
974 |
|
|
|
975 |
|
|
private static long[] nBits(int n) { |
976 |
|
|
return new long[((n - 1) >> 6) + 1]; |
977 |
|
|
} |
978 |
|
|
private static void setBit(long[] bits, int i) { |
979 |
|
|
bits[i >> 6] |= 1L << i; |
980 |
|
|
} |
981 |
|
|
private static boolean isClear(long[] bits, int i) { |
982 |
|
|
return (bits[i >> 6] & (1L << i)) == 0; |
983 |
|
|
} |
984 |
|
|
|
985 |
jsr166 |
1.104 |
/** |
986 |
|
|
* Helper for bulkRemove, in case of at least one deletion. |
987 |
jsr166 |
1.113 |
* Tolerate predicates that reentrantly access the collection for |
988 |
|
|
* read (but writers still get CME), so traverse once to find |
989 |
|
|
* elements to delete, a second pass to physically expunge. |
990 |
|
|
* |
991 |
|
|
* @param beg valid index of first element to be deleted |
992 |
jsr166 |
1.104 |
*/ |
993 |
jsr166 |
1.106 |
private boolean bulkRemoveModified( |
994 |
jsr166 |
1.113 |
Predicate<? super E> filter, final int beg) { |
995 |
jsr166 |
1.104 |
final Object[] es = elements; |
996 |
jsr166 |
1.99 |
final int capacity = es.length; |
997 |
jsr166 |
1.106 |
final int end = tail; |
998 |
jsr166 |
1.113 |
final long[] deathRow = nBits(sub(end, beg, capacity)); |
999 |
|
|
deathRow[0] = 1L; // set bit 0 |
1000 |
|
|
for (int i = beg + 1, to = (i <= end) ? end : es.length, k = beg; |
1001 |
|
|
; i = 0, to = end, k -= capacity) { |
1002 |
|
|
for (; i < to; i++) |
1003 |
|
|
if (filter.test(elementAt(es, i))) |
1004 |
|
|
setBit(deathRow, i - k); |
1005 |
|
|
if (to == end) break; |
1006 |
|
|
} |
1007 |
|
|
// a two-finger traversal, with hare i reading, tortoise w writing |
1008 |
|
|
int w = beg; |
1009 |
|
|
for (int i = beg + 1, to = (i <= end) ? end : es.length, k = beg; |
1010 |
|
|
; w = 0) { // w rejoins i on second leg |
1011 |
|
|
// In this loop, i and w are on the same leg, with i > w |
1012 |
|
|
for (; i < to; i++) |
1013 |
|
|
if (isClear(deathRow, i - k)) |
1014 |
|
|
es[w++] = es[i]; |
1015 |
|
|
if (to == end) break; |
1016 |
|
|
// In this loop, w is on the first leg, i on the second |
1017 |
|
|
for (i = 0, to = end, k -= capacity; i < to && w < capacity; i++) |
1018 |
|
|
if (isClear(deathRow, i - k)) |
1019 |
|
|
es[w++] = es[i]; |
1020 |
|
|
if (i >= to) { |
1021 |
|
|
if (w == capacity) w = 0; // "corner" case |
1022 |
|
|
break; |
1023 |
jsr166 |
1.104 |
} |
1024 |
dl |
1.16 |
} |
1025 |
jsr166 |
1.113 |
if (end != tail) throw new ConcurrentModificationException(); |
1026 |
|
|
circularClear(es, tail = w, end); |
1027 |
|
|
// checkInvariants(); |
1028 |
|
|
return true; |
1029 |
dl |
1.16 |
} |
1030 |
|
|
|
1031 |
dl |
1.1 |
/** |
1032 |
jsr166 |
1.40 |
* Returns {@code true} if this deque contains the specified element. |
1033 |
|
|
* More formally, returns {@code true} if and only if this deque contains |
1034 |
|
|
* at least one element {@code e} such that {@code o.equals(e)}. |
1035 |
dl |
1.1 |
* |
1036 |
|
|
* @param o object to be checked for containment in this deque |
1037 |
jsr166 |
1.40 |
* @return {@code true} if this deque contains the specified element |
1038 |
dl |
1.1 |
*/ |
1039 |
|
|
public boolean contains(Object o) { |
1040 |
jsr166 |
1.58 |
if (o != null) { |
1041 |
jsr166 |
1.99 |
final Object[] es = elements; |
1042 |
jsr166 |
1.106 |
for (int i = head, end = tail, to = (i <= end) ? end : es.length; |
1043 |
|
|
; i = 0, to = end) { |
1044 |
jsr166 |
1.92 |
for (; i < to; i++) |
1045 |
jsr166 |
1.99 |
if (o.equals(es[i])) |
1046 |
jsr166 |
1.89 |
return true; |
1047 |
jsr166 |
1.106 |
if (to == end) break; |
1048 |
jsr166 |
1.89 |
} |
1049 |
dl |
1.1 |
} |
1050 |
|
|
return false; |
1051 |
|
|
} |
1052 |
|
|
|
1053 |
|
|
/** |
1054 |
|
|
* Removes a single instance of the specified element from this deque. |
1055 |
jsr166 |
1.9 |
* If the deque does not contain the element, it is unchanged. |
1056 |
jsr166 |
1.40 |
* More formally, removes the first element {@code e} such that |
1057 |
|
|
* {@code o.equals(e)} (if such an element exists). |
1058 |
|
|
* Returns {@code true} if this deque contained the specified element |
1059 |
jsr166 |
1.12 |
* (or equivalently, if this deque changed as a result of the call). |
1060 |
jsr166 |
1.9 |
* |
1061 |
jsr166 |
1.46 |
* <p>This method is equivalent to {@link #removeFirstOccurrence(Object)}. |
1062 |
dl |
1.1 |
* |
1063 |
jsr166 |
1.9 |
* @param o element to be removed from this deque, if present |
1064 |
jsr166 |
1.40 |
* @return {@code true} if this deque contained the specified element |
1065 |
dl |
1.1 |
*/ |
1066 |
jsr166 |
1.9 |
public boolean remove(Object o) { |
1067 |
|
|
return removeFirstOccurrence(o); |
1068 |
dl |
1.1 |
} |
1069 |
|
|
|
1070 |
|
|
/** |
1071 |
|
|
* Removes all of the elements from this deque. |
1072 |
jsr166 |
1.7 |
* The deque will be empty after this call returns. |
1073 |
dl |
1.1 |
*/ |
1074 |
|
|
public void clear() { |
1075 |
jsr166 |
1.106 |
circularClear(elements, head, tail); |
1076 |
|
|
head = tail = 0; |
1077 |
jsr166 |
1.75 |
// checkInvariants(); |
1078 |
dl |
1.1 |
} |
1079 |
|
|
|
1080 |
|
|
/** |
1081 |
jsr166 |
1.106 |
* Nulls out slots starting at array index i, upto index end. |
1082 |
jsr166 |
1.125 |
* Condition i == end means "empty" - nothing to do. |
1083 |
jsr166 |
1.89 |
*/ |
1084 |
jsr166 |
1.106 |
private static void circularClear(Object[] es, int i, int end) { |
1085 |
jsr166 |
1.125 |
// assert 0 <= i && i < es.length; |
1086 |
|
|
// assert 0 <= end && end < es.length; |
1087 |
jsr166 |
1.106 |
for (int to = (i <= end) ? end : es.length; |
1088 |
|
|
; i = 0, to = end) { |
1089 |
jsr166 |
1.125 |
for (; i < to; i++) es[i] = null; |
1090 |
jsr166 |
1.106 |
if (to == end) break; |
1091 |
jsr166 |
1.99 |
} |
1092 |
jsr166 |
1.89 |
} |
1093 |
|
|
|
1094 |
|
|
/** |
1095 |
dl |
1.5 |
* Returns an array containing all of the elements in this deque |
1096 |
jsr166 |
1.10 |
* in proper sequence (from first to last element). |
1097 |
dl |
1.1 |
* |
1098 |
jsr166 |
1.10 |
* <p>The returned array will be "safe" in that no references to it are |
1099 |
|
|
* maintained by this deque. (In other words, this method must allocate |
1100 |
|
|
* a new array). The caller is thus free to modify the returned array. |
1101 |
jsr166 |
1.13 |
* |
1102 |
jsr166 |
1.11 |
* <p>This method acts as bridge between array-based and collection-based |
1103 |
|
|
* APIs. |
1104 |
|
|
* |
1105 |
dl |
1.5 |
* @return an array containing all of the elements in this deque |
1106 |
dl |
1.1 |
*/ |
1107 |
|
|
public Object[] toArray() { |
1108 |
jsr166 |
1.86 |
return toArray(Object[].class); |
1109 |
|
|
} |
1110 |
|
|
|
1111 |
|
|
private <T> T[] toArray(Class<T[]> klazz) { |
1112 |
jsr166 |
1.99 |
final Object[] es = elements; |
1113 |
jsr166 |
1.86 |
final T[] a; |
1114 |
jsr166 |
1.119 |
final int head = this.head, tail = this.tail, end; |
1115 |
|
|
if ((end = tail + ((head <= tail) ? 0 : es.length)) >= 0) { |
1116 |
jsr166 |
1.120 |
// Uses null extension feature of copyOfRange |
1117 |
jsr166 |
1.99 |
a = Arrays.copyOfRange(es, head, end, klazz); |
1118 |
jsr166 |
1.86 |
} else { |
1119 |
|
|
// integer overflow! |
1120 |
jsr166 |
1.119 |
a = Arrays.copyOfRange(es, 0, end - head, klazz); |
1121 |
|
|
System.arraycopy(es, head, a, 0, es.length - head); |
1122 |
jsr166 |
1.86 |
} |
1123 |
jsr166 |
1.119 |
if (end != tail) |
1124 |
|
|
System.arraycopy(es, 0, a, es.length - head, tail); |
1125 |
jsr166 |
1.50 |
return a; |
1126 |
dl |
1.1 |
} |
1127 |
|
|
|
1128 |
|
|
/** |
1129 |
jsr166 |
1.10 |
* Returns an array containing all of the elements in this deque in |
1130 |
|
|
* proper sequence (from first to last element); the runtime type of the |
1131 |
|
|
* returned array is that of the specified array. If the deque fits in |
1132 |
|
|
* the specified array, it is returned therein. Otherwise, a new array |
1133 |
|
|
* is allocated with the runtime type of the specified array and the |
1134 |
|
|
* size of this deque. |
1135 |
|
|
* |
1136 |
|
|
* <p>If this deque fits in the specified array with room to spare |
1137 |
|
|
* (i.e., the array has more elements than this deque), the element in |
1138 |
|
|
* the array immediately following the end of the deque is set to |
1139 |
jsr166 |
1.40 |
* {@code null}. |
1140 |
jsr166 |
1.10 |
* |
1141 |
|
|
* <p>Like the {@link #toArray()} method, this method acts as bridge between |
1142 |
|
|
* array-based and collection-based APIs. Further, this method allows |
1143 |
|
|
* precise control over the runtime type of the output array, and may, |
1144 |
|
|
* under certain circumstances, be used to save allocation costs. |
1145 |
|
|
* |
1146 |
jsr166 |
1.40 |
* <p>Suppose {@code x} is a deque known to contain only strings. |
1147 |
jsr166 |
1.10 |
* The following code can be used to dump the deque into a newly |
1148 |
jsr166 |
1.40 |
* allocated array of {@code String}: |
1149 |
jsr166 |
1.10 |
* |
1150 |
jsr166 |
1.63 |
* <pre> {@code String[] y = x.toArray(new String[0]);}</pre> |
1151 |
jsr166 |
1.10 |
* |
1152 |
jsr166 |
1.40 |
* Note that {@code toArray(new Object[0])} is identical in function to |
1153 |
|
|
* {@code toArray()}. |
1154 |
dl |
1.1 |
* |
1155 |
|
|
* @param a the array into which the elements of the deque are to |
1156 |
jsr166 |
1.9 |
* be stored, if it is big enough; otherwise, a new array of the |
1157 |
|
|
* same runtime type is allocated for this purpose |
1158 |
jsr166 |
1.10 |
* @return an array containing all of the elements in this deque |
1159 |
|
|
* @throws ArrayStoreException if the runtime type of the specified array |
1160 |
|
|
* is not a supertype of the runtime type of every element in |
1161 |
|
|
* this deque |
1162 |
|
|
* @throws NullPointerException if the specified array is null |
1163 |
dl |
1.1 |
*/ |
1164 |
jsr166 |
1.34 |
@SuppressWarnings("unchecked") |
1165 |
dl |
1.1 |
public <T> T[] toArray(T[] a) { |
1166 |
jsr166 |
1.99 |
final int size; |
1167 |
jsr166 |
1.106 |
if ((size = size()) > a.length) |
1168 |
jsr166 |
1.86 |
return toArray((Class<T[]>) a.getClass()); |
1169 |
jsr166 |
1.99 |
final Object[] es = elements; |
1170 |
jsr166 |
1.106 |
for (int i = head, j = 0, len = Math.min(size, es.length - i); |
1171 |
|
|
; i = 0, len = tail) { |
1172 |
jsr166 |
1.101 |
System.arraycopy(es, i, a, j, len); |
1173 |
jsr166 |
1.106 |
if ((j += len) == size) break; |
1174 |
jsr166 |
1.101 |
} |
1175 |
jsr166 |
1.86 |
if (size < a.length) |
1176 |
|
|
a[size] = null; |
1177 |
dl |
1.1 |
return a; |
1178 |
|
|
} |
1179 |
|
|
|
1180 |
|
|
// *** Object methods *** |
1181 |
|
|
|
1182 |
|
|
/** |
1183 |
|
|
* Returns a copy of this deque. |
1184 |
|
|
* |
1185 |
|
|
* @return a copy of this deque |
1186 |
|
|
*/ |
1187 |
|
|
public ArrayDeque<E> clone() { |
1188 |
dl |
1.5 |
try { |
1189 |
jsr166 |
1.34 |
@SuppressWarnings("unchecked") |
1190 |
dl |
1.1 |
ArrayDeque<E> result = (ArrayDeque<E>) super.clone(); |
1191 |
jsr166 |
1.28 |
result.elements = Arrays.copyOf(elements, elements.length); |
1192 |
dl |
1.1 |
return result; |
1193 |
dl |
1.5 |
} catch (CloneNotSupportedException e) { |
1194 |
dl |
1.1 |
throw new AssertionError(); |
1195 |
|
|
} |
1196 |
|
|
} |
1197 |
|
|
|
1198 |
|
|
private static final long serialVersionUID = 2340985798034038923L; |
1199 |
|
|
|
1200 |
|
|
/** |
1201 |
jsr166 |
1.38 |
* Saves this deque to a stream (that is, serializes it). |
1202 |
dl |
1.1 |
* |
1203 |
jsr166 |
1.56 |
* @param s the stream |
1204 |
jsr166 |
1.57 |
* @throws java.io.IOException if an I/O error occurs |
1205 |
jsr166 |
1.40 |
* @serialData The current size ({@code int}) of the deque, |
1206 |
dl |
1.1 |
* followed by all of its elements (each an object reference) in |
1207 |
|
|
* first-to-last order. |
1208 |
|
|
*/ |
1209 |
jsr166 |
1.32 |
private void writeObject(java.io.ObjectOutputStream s) |
1210 |
|
|
throws java.io.IOException { |
1211 |
dl |
1.1 |
s.defaultWriteObject(); |
1212 |
|
|
|
1213 |
|
|
// Write out size |
1214 |
jsr166 |
1.106 |
s.writeInt(size()); |
1215 |
dl |
1.1 |
|
1216 |
|
|
// Write out elements in order. |
1217 |
jsr166 |
1.99 |
final Object[] es = elements; |
1218 |
jsr166 |
1.106 |
for (int i = head, end = tail, to = (i <= end) ? end : es.length; |
1219 |
|
|
; i = 0, to = end) { |
1220 |
jsr166 |
1.92 |
for (; i < to; i++) |
1221 |
jsr166 |
1.99 |
s.writeObject(es[i]); |
1222 |
jsr166 |
1.106 |
if (to == end) break; |
1223 |
jsr166 |
1.89 |
} |
1224 |
dl |
1.1 |
} |
1225 |
|
|
|
1226 |
|
|
/** |
1227 |
jsr166 |
1.38 |
* Reconstitutes this deque from a stream (that is, deserializes it). |
1228 |
jsr166 |
1.56 |
* @param s the stream |
1229 |
jsr166 |
1.57 |
* @throws ClassNotFoundException if the class of a serialized object |
1230 |
|
|
* could not be found |
1231 |
|
|
* @throws java.io.IOException if an I/O error occurs |
1232 |
dl |
1.1 |
*/ |
1233 |
jsr166 |
1.32 |
private void readObject(java.io.ObjectInputStream s) |
1234 |
|
|
throws java.io.IOException, ClassNotFoundException { |
1235 |
dl |
1.1 |
s.defaultReadObject(); |
1236 |
|
|
|
1237 |
|
|
// Read in size and allocate array |
1238 |
jsr166 |
1.106 |
int size = s.readInt(); |
1239 |
|
|
elements = new Object[size + 1]; |
1240 |
|
|
this.tail = size; |
1241 |
dl |
1.1 |
|
1242 |
|
|
// Read in all elements in the proper order. |
1243 |
|
|
for (int i = 0; i < size; i++) |
1244 |
jsr166 |
1.34 |
elements[i] = s.readObject(); |
1245 |
dl |
1.1 |
} |
1246 |
dl |
1.41 |
|
1247 |
jsr166 |
1.75 |
/** debugging */ |
1248 |
jsr166 |
1.89 |
void checkInvariants() { |
1249 |
jsr166 |
1.114 |
// Use head and tail fields with empty slot at tail strategy. |
1250 |
|
|
// head == tail disambiguates to "empty". |
1251 |
jsr166 |
1.75 |
try { |
1252 |
|
|
int capacity = elements.length; |
1253 |
jsr166 |
1.124 |
// assert 0 <= head && head < capacity; |
1254 |
|
|
// assert 0 <= tail && tail < capacity; |
1255 |
jsr166 |
1.106 |
// assert capacity > 0; |
1256 |
|
|
// assert size() < capacity; |
1257 |
|
|
// assert head == tail || elements[head] != null; |
1258 |
|
|
// assert elements[tail] == null; |
1259 |
|
|
// assert head == tail || elements[dec(tail, capacity)] != null; |
1260 |
jsr166 |
1.75 |
} catch (Throwable t) { |
1261 |
jsr166 |
1.106 |
System.err.printf("head=%d tail=%d capacity=%d%n", |
1262 |
|
|
head, tail, elements.length); |
1263 |
jsr166 |
1.75 |
System.err.printf("elements=%s%n", |
1264 |
|
|
Arrays.toString(elements)); |
1265 |
|
|
throw t; |
1266 |
dl |
1.41 |
} |
1267 |
|
|
} |
1268 |
|
|
|
1269 |
dl |
1.1 |
} |