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
|
///////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2009, Rob Eden All Rights Reserved.
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
///////////////////////////////////////////////////////////////////////////////
package gnu.trove.queue;
import gnu.trove.T#E#Collection;
import java.io.Serializable;
/**
* Interface for Trove queue implementations.
*
* @see java.util.Queue
*/
public interface T#E#Queue extends T#E#Collection {
/**
* Retrieves and removes the head of this queue. This method differs from
* {@link #poll} only in that it throws an exception if this queue is empty.
*/
public #e# element();
/**
* Inserts the specified element into this queue if it is possible to do so
* immediately without violating capacity restrictions. When using a
* capacity-restricted queue, this method is generally preferable to
* {@link #add}, which can fail to insert an element only by throwing an exception.
*
* @param e The element to add.
*
* @return <tt>true</tt> if the element was added to this queue, else <tt>false</tt>
*/
public boolean offer( #e# e );
/**
* Retrieves, but does not remove, the head of this queue, or returns
* {@link #getNoEntryValue} if this queue is empty.
*
* @return the head of this queue, or {@link #getNoEntryValue} if this queue is empty
*/
public #e# peek();
/**
* Retrieves and removes the head of this queue, or returns {@link #getNoEntryValue}
* if this queue is empty.
*
* @return the head of this queue, or {@link #getNoEntryValue} if this queue is empty
*/
public #e# poll();
}
|
