util/concurrent/PriorityBlockingQueue.java

/*
 * Written by Doug Lea with assistance from members of JCP JSR-166
 * Expert Group and released to the public domain, as explained at
 * http://creativecommons.org/licenses/publicdomain
 */

package java.util.concurrent;

import java.util.concurrent.locks.*;
import java.util.*;

/**
 * An unbounded {@linkplain BlockingQueue blocking queue} that uses
 * the same ordering rules as class {@link PriorityQueue} and supplies
 * blocking retrieval operations.  While this queue is logically
 * unbounded, attempted additions may fail due to resource exhaustion
 * (causing <tt>OutOfMemoryError</tt>). This class does not permit
 * <tt>null</tt> elements.  A priority queue relying on natural
 * ordering also does not permit insertion of non-comparable objects
 * (doing so results in <tt>ClassCastException</tt>).
 *
 * <p>This class and its iterator implement all of the
 * <em>optional</em> methods of the {@link Collection} and {@link
 * Iterator} interfaces.
 * The Iterator provided in method {@link #iterator()} is
 * <em>not</em> guaranteed to traverse the elements of the
 * PriorityBlockingQueue in any particular order. If you need ordered
 * traversal, consider using <tt>Arrays.sort(pq.toArray())</tt>.
 *
 * <p>This class is a member of the
 * <a href="{@docRoot}/../guide/collections/index.html">
 * Java Collections Framework</a>.
 *
 * @since 1.5
 * @author Doug Lea
 * @param <E> the type of elements held in this collection
 */
public class PriorityBlockingQueue<E> extends AbstractQueue<E>
    implements BlockingQueue<E>, java.io.Serializable {
    private static final long serialVersionUID = 5595510919245408276L;

    private final PriorityQueue<E> q;
    private final ReentrantLock lock = new ReentrantLock(true);
    private final Condition notEmpty = lock.newCondition();

    /**
     * Creates a <tt>PriorityBlockingQueue</tt> with the default initial
     * capacity
     * (11) that orders its elements according to their natural
     * ordering (using <tt>Comparable</tt>).
     */
    public PriorityBlockingQueue() {
        q = new PriorityQueue<E>();
    }

    /**
     * Creates a <tt>PriorityBlockingQueue</tt> with the specified initial
     * capacity that orders its elements according to their {@linkplain
     * Comparable natural ordering}.
     *
     * @param initialCapacity the initial capacity for this priority queue.
     * @throws IllegalArgumentException if <tt>initialCapacity</tt> is less
     * than 1
     */
    public PriorityBlockingQueue(int initialCapacity) {
        q = new PriorityQueue<E>(initialCapacity, null);
    }

    /**
     * Creates a <tt>PriorityBlockingQueue</tt> with the specified initial
     * capacity that orders its elements according to the specified
     * comparator.
     *
     * @param initialCapacity the initial capacity for this priority queue.
     * @param comparator the comparator used to order this priority queue.
     * If <tt>null</tt> then the order depends on the elements' natural
     * ordering.
     * @throws IllegalArgumentException if <tt>initialCapacity</tt> is less
     * than 1
     */
    public PriorityBlockingQueue(int initialCapacity,
                                 Comparator<? super E> comparator) {
        q = new PriorityQueue<E>(initialCapacity, comparator);
    }

    /**
     * Creates a <tt>PriorityBlockingQueue</tt> containing the elements
     * in the specified collection.  The priority queue has an initial
     * capacity of 110% of the size of the specified collection.  If
     * the specified collection is a {@link SortedSet} or a {@link
     * PriorityQueue}, this priority queue will be sorted according to
     * the same comparator, or according to the natural ordering of its
     * elements if the collection is sorted according to the natural
     * ordering of its elements.  Otherwise, this priority queue is
     * ordered according to the natural ordering of its elements.
     *
     * @param c the collection whose elements are to be placed
     *        into this priority queue.
     * @throws ClassCastException if elements of the specified collection
     *         cannot be compared to one another according to the priority
     *         queue's ordering.
     * @throws NullPointerException if <tt>c</tt> or any element within it
     * is <tt>null</tt>
     */
    public PriorityBlockingQueue(Collection<? extends E> c) {
        q = new PriorityQueue<E>(c);
    }


    // these first few override just to update doc comments

    /**
     * Adds the specified element to this queue.
     * @param e the element to add
     * @return <tt>true</tt> (as per the general contract of
     * <tt>Collection.add</tt>).
     *
     * @throws NullPointerException if the specified element is <tt>null</tt>.
     * @throws ClassCastException if the specified element cannot be compared
     * with elements currently in the priority queue according
     * to the priority queue's ordering.
     */
    public boolean add(E e) {
        return super.add(e);
    }

    /**
     * Returns the comparator used to order the elements in this queue,
     * or <tt>null</tt> if this queue uses the {@linkplain Comparable
     * natural ordering} of its elements.
     *
     * @return the comparator used to order the elements in this queue,
     *         or <tt>null</tt> if this queue uses the natural
     *         ordering of its elements.
     */
    public Comparator<? super E> comparator() {
        return q.comparator();
    }

    /**
     * Inserts the specified element into this priority queue.
     *
     * @param e the element to add
     * @return <tt>true</tt>
     * @throws ClassCastException if the specified element cannot be compared
     * with elements currently in the priority queue according
     * to the priority queue's ordering.
     * @throws NullPointerException if the specified element is <tt>null</tt>.
     */
    public boolean offer(E e) {
        if (e == null) throw new NullPointerException();
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            boolean ok = q.offer(e);
            assert ok;
            notEmpty.signal();
            return true;
        } finally {
            lock.unlock();
        }
    }

    /**
     * Adds the specified element to this priority queue. As the queue is
     * unbounded this method will never block.
     * @param e the element to add
     * @throws ClassCastException if the element cannot be compared
     * with elements currently in the priority queue according
     * to the priority queue's ordering.
     * @throws NullPointerException if the specified element is <tt>null</tt>.
     */
    public void put(E e) {
        offer(e); // never need to block
    }

    /**
     * Inserts the specified element into this priority queue. As the queue is
     * unbounded this method will never block.
     * @param e the element to add
     * @param timeout This parameter is ignored as the method never blocks
     * @param unit This parameter is ignored as the method never blocks
     * @return <tt>true</tt>
     * @throws ClassCastException if the element cannot be compared
     * with elements currently in the priority queue according
     * to the priority queue's ordering.
     * @throws NullPointerException if the specified element is <tt>null</tt>.
     */
    public boolean offer(E e, long timeout, TimeUnit unit) {
        return offer(e); // never need to block
    }

    public E take() throws InterruptedException {
        final ReentrantLock lock = this.lock;
        lock.lockInterruptibly();
        try {
            try {
                while (q.size() == 0)
                    notEmpty.await();
            } catch (InterruptedException ie) {
                notEmpty.signal(); // propagate to non-interrupted thread
                throw ie;
            }
            E x = q.poll();
            assert x != null;
            return x;
        } finally {
            lock.unlock();
        }
    }


    public E poll() {
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            return q.poll();
        } finally {
            lock.unlock();
        }
    }

    public E poll(long timeout, TimeUnit unit) throws InterruptedException {
        long nanos = unit.toNanos(timeout);
        final ReentrantLock lock = this.lock;
        lock.lockInterruptibly();
        try {
            for (;;) {
                E x = q.poll();
                if (x != null)
                    return x;
                if (nanos <= 0)
                    return null;
                try {
                    nanos = notEmpty.awaitNanos(nanos);
                } catch (InterruptedException ie) {
                    notEmpty.signal(); // propagate to non-interrupted thread
                    throw ie;
                }
            }
        } finally {
            lock.unlock();
        }
    }

    public E peek() {
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            return q.peek();
        } finally {
            lock.unlock();
        }
    }

    public int size() {
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            return q.size();
        } finally {
            lock.unlock();
        }
    }

    /**
     * Always returns <tt>Integer.MAX_VALUE</tt> because
     * a <tt>PriorityBlockingQueue</tt> is not capacity constrained.
     * @return <tt>Integer.MAX_VALUE</tt>
     */
    public int remainingCapacity() {
        return Integer.MAX_VALUE;
    }

    /**
     * Removes a single instance of the specified element from this
     * queue, if it is present.
     */
    public boolean remove(Object o) {
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            return q.remove(o);
        } finally {
            lock.unlock();
        }
    }

    public boolean contains(Object o) {
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            return q.contains(o);
        } finally {
            lock.unlock();
        }
    }

    public Object[] toArray() {
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            return q.toArray();
        } finally {
            lock.unlock();
        }
    }


    public String toString() {
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            return q.toString();
        } finally {
            lock.unlock();
        }
    }

    public int drainTo(Collection<? super E> c) {
        if (c == null)
            throw new NullPointerException();
        if (c == this)
            throw new IllegalArgumentException();
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            int n = 0;
            E e;
            while ( (e = q.poll()) != null) {
                c.add(e);
                ++n;
            }
            return n;
        } finally {
            lock.unlock();
        }
    }

    public int drainTo(Collection<? super E> c, int maxElements) {
        if (c == null)
            throw new NullPointerException();
        if (c == this)
            throw new IllegalArgumentException();
        if (maxElements <= 0)
            return 0;
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            int n = 0;
            E e;
            while (n < maxElements && (e = q.poll()) != null) {
                c.add(e);
                ++n;
            }
            return n;
        } finally {
            lock.unlock();
        }
    }

    /**
     * Atomically removes all of the elements from this queue.
     * The queue will be empty after this call returns.
     */
    public void clear() {
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            q.clear();
        } finally {
            lock.unlock();
        }
    }

    public <T> T[] toArray(T[] a) {
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            return q.toArray(a);
        } finally {
            lock.unlock();
        }
    }

    /**
     * Returns an iterator over the elements in this queue. The
     * iterator does not return the elements in any particular order.
     * The returned iterator is a thread-safe "fast-fail" iterator
     * that will throw {@link ConcurrentModificationException} upon
     * detected interference.
     *
     * @return an iterator over the elements in this queue.
     */
    public Iterator<E> iterator() {
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            return new Itr(q.iterator());
        } finally {
            lock.unlock();
        }
    }

    private class Itr<E> implements Iterator<E> {
        private final Iterator<E> iter;
        Itr(Iterator<E> i) {
            iter = i;
        }

        public boolean hasNext() {
            /*
             * No sync -- we rely on underlying hasNext to be
             * stateless, in which case we can return true by mistake
             * only when next() will subsequently throw
             * ConcurrentModificationException.
             */
            return iter.hasNext();
        }

        public E next() {
            ReentrantLock lock = PriorityBlockingQueue.this.lock;
            lock.lock();
            try {
                return iter.next();
            } finally {
                lock.unlock();
            }
        }

        public void remove() {
            ReentrantLock lock = PriorityBlockingQueue.this.lock;
            lock.lock();
            try {
                iter.remove();
            } finally {
                lock.unlock();
            }
        }
    }

    /**
     * Save the state to a stream (that is, serialize it).  This
     * merely wraps default serialization within lock.  The
     * serialization strategy for items is left to underlying
     * Queue. Note that locking is not needed on deserialization, so
     * readObject is not defined, just relying on default.
     */
    private void writeObject(java.io.ObjectOutputStream s)
        throws java.io.IOException {
        lock.lock();
        try {
            s.defaultWriteObject();
        } finally {
            lock.unlock();
        }
    }

}
Revision:	1.40
Committed:	Mon May 2 08:35:49 2005 UTC (19 years, 1 month ago) by jsr166
Branch:	MAIN
Changes since 1.39:	+13 -13 lines
Log Message:	E o -> E e
#	Content
1	/*
2	* Written by Doug Lea with assistance from members of JCP JSR-166
3	* Expert Group and released to the public domain, as explained at
4	* http://creativecommons.org/licenses/publicdomain
5	*/
6
7	package java.util.concurrent;
8
9	import java.util.concurrent.locks.*;
10	import java.util.*;
11
12	/**
13	* An unbounded {@linkplain BlockingQueue blocking queue} that uses
14	* the same ordering rules as class {@link PriorityQueue} and supplies
15	* blocking retrieval operations. While this queue is logically
16	* unbounded, attempted additions may fail due to resource exhaustion
17	* (causing <tt>OutOfMemoryError</tt>). This class does not permit
18	* <tt>null</tt> elements. A priority queue relying on natural
19	* ordering also does not permit insertion of non-comparable objects
20	* (doing so results in <tt>ClassCastException</tt>).
21	*
22	* <p>This class and its iterator implement all of the
23	* <em>optional</em> methods of the {@link Collection} and {@link
24	* Iterator} interfaces.
25	* The Iterator provided in method {@link #iterator()} is
26	* <em>not</em> guaranteed to traverse the elements of the
27	* PriorityBlockingQueue in any particular order. If you need ordered
28	* traversal, consider using <tt>Arrays.sort(pq.toArray())</tt>.
29	*
30	* <p>This class is a member of the
31	* <a href="{@docRoot}/../guide/collections/index.html">
32	* Java Collections Framework</a>.
33	*
34	* @since 1.5
35	* @author Doug Lea
36	* @param <E> the type of elements held in this collection
37	*/
38	public class PriorityBlockingQueue<E> extends AbstractQueue<E>
39	implements BlockingQueue<E>, java.io.Serializable {
40	private static final long serialVersionUID = 5595510919245408276L;
41
42	private final PriorityQueue<E> q;
43	private final ReentrantLock lock = new ReentrantLock(true);
44	private final Condition notEmpty = lock.newCondition();
45
46	/**
47	* Creates a <tt>PriorityBlockingQueue</tt> with the default initial
48	* capacity
49	* (11) that orders its elements according to their natural
50	* ordering (using <tt>Comparable</tt>).
51	*/
52	public PriorityBlockingQueue() {
53	q = new PriorityQueue<E>();
54	}
55
56	/**
57	* Creates a <tt>PriorityBlockingQueue</tt> with the specified initial
58	* capacity that orders its elements according to their {@linkplain
59	* Comparable natural ordering}.
60	*
61	* @param initialCapacity the initial capacity for this priority queue.
62	* @throws IllegalArgumentException if <tt>initialCapacity</tt> is less
63	* than 1
64	*/
65	public PriorityBlockingQueue(int initialCapacity) {
66	q = new PriorityQueue<E>(initialCapacity, null);
67	}
68
69	/**
70	* Creates a <tt>PriorityBlockingQueue</tt> with the specified initial
71	* capacity that orders its elements according to the specified
72	* comparator.
73	*
74	* @param initialCapacity the initial capacity for this priority queue.
75	* @param comparator the comparator used to order this priority queue.
76	* If <tt>null</tt> then the order depends on the elements' natural
77	* ordering.
78	* @throws IllegalArgumentException if <tt>initialCapacity</tt> is less
79	* than 1
80	*/
81	public PriorityBlockingQueue(int initialCapacity,
82	Comparator<? super E> comparator) {
83	q = new PriorityQueue<E>(initialCapacity, comparator);
84	}
85
86	/**
87	* Creates a <tt>PriorityBlockingQueue</tt> containing the elements
88	* in the specified collection. The priority queue has an initial
89	* capacity of 110% of the size of the specified collection. If
90	* the specified collection is a {@link SortedSet} or a {@link
91	* PriorityQueue}, this priority queue will be sorted according to
92	* the same comparator, or according to the natural ordering of its
93	* elements if the collection is sorted according to the natural
94	* ordering of its elements. Otherwise, this priority queue is
95	* ordered according to the natural ordering of its elements.
96	*
97	* @param c the collection whose elements are to be placed
98	* into this priority queue.
99	* @throws ClassCastException if elements of the specified collection
100	* cannot be compared to one another according to the priority
101	* queue's ordering.
102	* @throws NullPointerException if <tt>c</tt> or any element within it
103	* is <tt>null</tt>
104	*/
105	public PriorityBlockingQueue(Collection<? extends E> c) {
106	q = new PriorityQueue<E>(c);
107	}
108
109
110	// these first few override just to update doc comments
111
112	/**
113	* Adds the specified element to this queue.
114	* @param e the element to add
115	* @return <tt>true</tt> (as per the general contract of
116	* <tt>Collection.add</tt>).
117	*
118	* @throws NullPointerException if the specified element is <tt>null</tt>.
119	* @throws ClassCastException if the specified element cannot be compared
120	* with elements currently in the priority queue according
121	* to the priority queue's ordering.
122	*/
123	public boolean add(E e) {
124	return super.add(e);
125	}
126
127	/**
128	* Returns the comparator used to order the elements in this queue,
129	* or <tt>null</tt> if this queue uses the {@linkplain Comparable
130	* natural ordering} of its elements.
131	*
132	* @return the comparator used to order the elements in this queue,
133	* or <tt>null</tt> if this queue uses the natural
134	* ordering of its elements.
135	*/
136	public Comparator<? super E> comparator() {
137	return q.comparator();
138	}
139
140	/**
141	* Inserts the specified element into this priority queue.
142	*
143	* @param e the element to add
144	* @return <tt>true</tt>
145	* @throws ClassCastException if the specified element cannot be compared
146	* with elements currently in the priority queue according
147	* to the priority queue's ordering.
148	* @throws NullPointerException if the specified element is <tt>null</tt>.
149	*/
150	public boolean offer(E e) {
151	if (e == null) throw new NullPointerException();
152	final ReentrantLock lock = this.lock;
153	lock.lock();
154	try {
155	boolean ok = q.offer(e);
156	assert ok;
157	notEmpty.signal();
158	return true;
159	} finally {
160	lock.unlock();
161	}
162	}
163
164	/**
165	* Adds the specified element to this priority queue. As the queue is
166	* unbounded this method will never block.
167	* @param e the element to add
168	* @throws ClassCastException if the element cannot be compared
169	* with elements currently in the priority queue according
170	* to the priority queue's ordering.
171	* @throws NullPointerException if the specified element is <tt>null</tt>.
172	*/
173	public void put(E e) {
174	offer(e); // never need to block
175	}
176
177	/**
178	* Inserts the specified element into this priority queue. As the queue is
179	* unbounded this method will never block.
180	* @param e the element to add
181	* @param timeout This parameter is ignored as the method never blocks
182	* @param unit This parameter is ignored as the method never blocks
183	* @return <tt>true</tt>
184	* @throws ClassCastException if the element cannot be compared
185	* with elements currently in the priority queue according
186	* to the priority queue's ordering.
187	* @throws NullPointerException if the specified element is <tt>null</tt>.
188	*/
189	public boolean offer(E e, long timeout, TimeUnit unit) {
190	return offer(e); // never need to block
191	}
192
193	public E take() throws InterruptedException {
194	final ReentrantLock lock = this.lock;
195	lock.lockInterruptibly();
196	try {
197	try {
198	while (q.size() == 0)
199	notEmpty.await();
200	} catch (InterruptedException ie) {
201	notEmpty.signal(); // propagate to non-interrupted thread
202	throw ie;
203	}
204	E x = q.poll();
205	assert x != null;
206	return x;
207	} finally {
208	lock.unlock();
209	}
210	}
211
212
213	public E poll() {
214	final ReentrantLock lock = this.lock;
215	lock.lock();
216	try {
217	return q.poll();
218	} finally {
219	lock.unlock();
220	}
221	}
222
223	public E poll(long timeout, TimeUnit unit) throws InterruptedException {
224	long nanos = unit.toNanos(timeout);
225	final ReentrantLock lock = this.lock;
226	lock.lockInterruptibly();
227	try {
228	for (;;) {
229	E x = q.poll();
230	if (x != null)
231	return x;
232	if (nanos <= 0)
233	return null;
234	try {
235	nanos = notEmpty.awaitNanos(nanos);
236	} catch (InterruptedException ie) {
237	notEmpty.signal(); // propagate to non-interrupted thread
238	throw ie;
239	}
240	}
241	} finally {
242	lock.unlock();
243	}
244	}
245
246	public E peek() {
247	final ReentrantLock lock = this.lock;
248	lock.lock();
249	try {
250	return q.peek();
251	} finally {
252	lock.unlock();
253	}
254	}
255
256	public int size() {
257	final ReentrantLock lock = this.lock;
258	lock.lock();
259	try {
260	return q.size();
261	} finally {
262	lock.unlock();
263	}
264	}
265
266	/**
267	* Always returns <tt>Integer.MAX_VALUE</tt> because
268	* a <tt>PriorityBlockingQueue</tt> is not capacity constrained.
269	* @return <tt>Integer.MAX_VALUE</tt>
270	*/
271	public int remainingCapacity() {
272	return Integer.MAX_VALUE;
273	}
274
275	/**
276	* Removes a single instance of the specified element from this
277	* queue, if it is present.
278	*/
279	public boolean remove(Object o) {
280	final ReentrantLock lock = this.lock;
281	lock.lock();
282	try {
283	return q.remove(o);
284	} finally {
285	lock.unlock();
286	}
287	}
288
289	public boolean contains(Object o) {
290	final ReentrantLock lock = this.lock;
291	lock.lock();
292	try {
293	return q.contains(o);
294	} finally {
295	lock.unlock();
296	}
297	}
298
299	public Object[] toArray() {
300	final ReentrantLock lock = this.lock;
301	lock.lock();
302	try {
303	return q.toArray();
304	} finally {
305	lock.unlock();
306	}
307	}
308
309
310	public String toString() {
311	final ReentrantLock lock = this.lock;
312	lock.lock();
313	try {
314	return q.toString();
315	} finally {
316	lock.unlock();
317	}
318	}
319
320	public int drainTo(Collection<? super E> c) {
321	if (c == null)
322	throw new NullPointerException();
323	if (c == this)
324	throw new IllegalArgumentException();
325	final ReentrantLock lock = this.lock;
326	lock.lock();
327	try {
328	int n = 0;
329	E e;
330	while ( (e = q.poll()) != null) {
331	c.add(e);
332	++n;
333	}
334	return n;
335	} finally {
336	lock.unlock();
337	}
338	}
339
340	public int drainTo(Collection<? super E> c, int maxElements) {
341	if (c == null)
342	throw new NullPointerException();
343	if (c == this)
344	throw new IllegalArgumentException();
345	if (maxElements <= 0)
346	return 0;
347	final ReentrantLock lock = this.lock;
348	lock.lock();
349	try {
350	int n = 0;
351	E e;
352	while (n < maxElements && (e = q.poll()) != null) {
353	c.add(e);
354	++n;
355	}
356	return n;
357	} finally {
358	lock.unlock();
359	}
360	}
361
362	/**
363	* Atomically removes all of the elements from this queue.
364	* The queue will be empty after this call returns.
365	*/
366	public void clear() {
367	final ReentrantLock lock = this.lock;
368	lock.lock();
369	try {
370	q.clear();
371	} finally {
372	lock.unlock();
373	}
374	}
375
376	public <T> T[] toArray(T[] a) {
377	final ReentrantLock lock = this.lock;
378	lock.lock();
379	try {
380	return q.toArray(a);
381	} finally {
382	lock.unlock();
383	}
384	}
385
386	/**
387	* Returns an iterator over the elements in this queue. The
388	* iterator does not return the elements in any particular order.
389	* The returned iterator is a thread-safe "fast-fail" iterator
390	* that will throw {@link ConcurrentModificationException} upon
391	* detected interference.
392	*
393	* @return an iterator over the elements in this queue.
394	*/
395	public Iterator<E> iterator() {
396	final ReentrantLock lock = this.lock;
397	lock.lock();
398	try {
399	return new Itr(q.iterator());
400	} finally {
401	lock.unlock();
402	}
403	}
404
405	private class Itr<E> implements Iterator<E> {
406	private final Iterator<E> iter;
407	Itr(Iterator<E> i) {
408	iter = i;
409	}
410
411	public boolean hasNext() {
412	/*
413	* No sync -- we rely on underlying hasNext to be
414	* stateless, in which case we can return true by mistake
415	* only when next() will subsequently throw
416	* ConcurrentModificationException.
417	*/
418	return iter.hasNext();
419	}
420
421	public E next() {
422	ReentrantLock lock = PriorityBlockingQueue.this.lock;
423	lock.lock();
424	try {
425	return iter.next();
426	} finally {
427	lock.unlock();
428	}
429	}
430
431	public void remove() {
432	ReentrantLock lock = PriorityBlockingQueue.this.lock;
433	lock.lock();
434	try {
435	iter.remove();
436	} finally {
437	lock.unlock();
438	}
439	}
440	}
441
442	/**
443	* Save the state to a stream (that is, serialize it). This
444	* merely wraps default serialization within lock. The
445	* serialization strategy for items is left to underlying
446	* Queue. Note that locking is not needed on deserialization, so
447	* readObject is not defined, just relying on default.
448	*/
449	private void writeObject(java.io.ObjectOutputStream s)
450	throws java.io.IOException {
451	lock.lock();
452	try {
453	s.defaultWriteObject();
454	} finally {
455	lock.unlock();
456	}
457	}
458
459	}