Fix cut and paste error
bug 33125, from Chad McHenry git-svn-id: https://svn.apache.org/repos/asf/jakarta/commons/proper/collections/trunk@151270 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
parent
8b7f8f1a5c
commit
dd68558fcd
|
@ -118,11 +118,11 @@ These represent collections that have a well defined removal order.
|
||||||
</p>
|
</p>
|
||||||
<source>
|
<source>
|
||||||
Buffer buffer = new UnboundedFifoBuffer();
|
Buffer buffer = new UnboundedFifoBuffer();
|
||||||
bidi.add("ONE");
|
buffer.add("ONE");
|
||||||
bidi.add("TWO");
|
buffer.add("TWO");
|
||||||
bidi.add("THREE");
|
buffer.add("THREE");
|
||||||
bidi.remove(); // removes and returns the next in order, "ONE" as this is a FIFO
|
buffer.remove(); // removes and returns the next in order, "ONE" as this is a FIFO
|
||||||
bidi.remove(); // removes and returns the next in order, "TWO" as this is a FIFO
|
buffer.remove(); // removes and returns the next in order, "TWO" as this is a FIFO
|
||||||
</source>
|
</source>
|
||||||
<p>
|
<p>
|
||||||
Implementations are provided for FIFO (queue), LIFO (stack) and Priority (removal in comparator order).
|
Implementations are provided for FIFO (queue), LIFO (stack) and Priority (removal in comparator order).
|
||||||
|
|
Loading…
Reference in New Issue