blocks|key|2901096|text|您正在寻找实现Queue+interface的任何类，不包括PriorityQueue和PriorityBlockingQueue，它们不使用先进先出算法。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|2901097|可能使用add+(在末尾添加1)和removeFirst+(从前面移除1并返回它)的LinkedList是最容易使用的。|2901098|例如，下面的程序使用LinkedList来排队并检索PI的数字：|2901099|import+java.util.LinkedList;

class+Test+{
++++public+static+void+main(String+args[])+{
++++++++char+arr[]+=+{3,1,4,1,5,9,2,6,5,3,5,8,9};
++++++++LinkedList<Integer>+fifo+=+new+LinkedList<Integer>();

++++++++for+(int+i+=+0;+i+<+arr.length;+i%2B%2B)
++++++++++++fifo.add+(new+Integer+(arr[i]));

++++++++System.out.print+(fifo.removeFirst()+%2B+".");
++++++++while+(!+fifo.isEmpty())
++++++++++++System.out.print+(fifo.removeFirst());
++++++++System.out.println();
++++}
}+|code-block|syntax|javascript|2901100|2901101|或者，如果您知道只想将其视为队列(没有链表的额外功能)，则可以只使用Queue接口本身：|2901102|import+java.util.LinkedList;
import+java.util.Queue;

class+Test+{
++++public+static+void+main(String+args[])+{
++++++++char+arr[]+=+{3,1,4,1,5,9,2,6,5,3,5,8,9};
++++++++Queue<Integer>+fifo+=+new+LinkedList<Integer>();

++++++++for+(int+i+=+0;+i+<+arr.length;+i%2B%2B)
++++++++++++fifo.add+(new+Integer+(arr[i]));

++++++++System.out.print+(fifo.remove()+%2B+".");
++++++++while+(!+fifo.isEmpty())
++++++++++++System.out.print+(fifo.remove());
++++++++System.out.println();
++++}
}|2901103|这样做的好处是，您可以用提供Queue接口的任何类替换底层的具体类，而不必过多地更改代码。|2901104|基本更改是将fifo的类型更改为Queue，并使用remove()而不是removeFirst()，后者对于Queue接口不可用。|2901105|仍然可以调用isEmpty()，因为它属于Collection接口，而Queue是它的派生接口。|2901106|entityMap|0|LINK|mutability|MUTABLE|url|http://docs.oracle.com/javase/6/docs/api/java/util/Queue.html|1|http://docs.oracle.com/javase/6/docs/api/java/util/LinkedList.html^0|U|D|18|L|7|F|0|0|4|3|H|B|16|A|1|0|0|0|0|Y|5|0|0|E|5|0|6|4|G|5|P|8|10|D|1I|5|0|6|9|L|A|Z|5|0^^$0|@$1|2|3|4|5|6|7|19|8|@$9|1A|A|1B|B|C]|$9|1C|A|1D|B|C]]|D|@$9|1E|A|1F|1|1G]]|E|$]]|$1|F|3|G|5|6|7|1H|8|@$9|1I|A|1J|B|C]|$9|1K|A|1L|B|C]]|D|@$9|1M|A|1N|1|1O]]|E|$]]|$1|H|3|I|5|6|7|1P|8|@]|D|@]|E|$]]|$1|J|3|K|5|L|7|1Q|8|@]|D|@]|E|$M|N]]|$1|O|3|-4|5|6|7|1R|8|@]|D|@]|E|$]]|$1|P|3|Q|5|6|7|1S|8|@$9|1T|A|1U|B|C]]|D|@]|E|$]]|$1|R|3|S|5|L|7|1V|8|@]|D|@]|E|$M|N]]|$1|T|3|U|5|6|7|1W|8|@$9|1X|A|1Y|B|C]]|D|@]|E|$]]|$1|V|3|W|5|6|7|1Z|8|@$9|20|A|21|B|C]|$9|22|A|23|B|C]|$9|24|A|25|B|C]|$9|26|A|27|B|C]|$9|28|A|29|B|C]]|D|@]|E|$]]|$1|X|3|Y|5|6|7|2A|8|@$9|2B|A|2C|B|C]|$9|2D|A|2E|B|C]|$9|2F|A|2G|B|C]]|D|@]|E|$]]|$1|Z|3|-4|5|6|7|2H|8|@]|D|@]|E|$]]]|10|$11|$5|12|13|14|E|$15|16]]|17|$5|12|13|14|E|$15|18]]]]

You're looking for any class that implements the <a href="http://docs.oracle.com/javase/6/docs/api/java/util/Queue.html" rel="noreferrer">Queue interface</a>, excluding <code>PriorityQueue</code> and <code>PriorityBlockingQueue</code>, which do not use a FIFO algorithm.

Probably a <a href="http://docs.oracle.com/javase/6/docs/api/java/util/LinkedList.html" rel="noreferrer">LinkedList</a> using <code>add</code> (adds one to the end) and <code>removeFirst</code> (removes one from the front and returns it) is the easiest one to use.

For example, here's a program that uses a LinkedList to queue and retrieve the digits of PI:

<pre><code>import java.util.LinkedList;

class Test {
 public static void main(String args[]) {
 char arr[] = {3,1,4,1,5,9,2,6,5,3,5,8,9};
 LinkedList&lt;Integer&gt; fifo = new LinkedList&lt;Integer&gt;();

 for (int i = 0; i &lt; arr.length; i++)
 fifo.add (new Integer (arr[i]));

 System.out.print (fifo.removeFirst() + ".");
 while (! fifo.isEmpty())
 System.out.print (fifo.removeFirst());
 System.out.println();
 }
} 
</code></pre>

<hr>

Alternatively, if you know you only want to treat it as a queue (without the extra features of a linked list), you can just use the <code>Queue</code> interface itself:

<pre><code>import java.util.LinkedList;
import java.util.Queue;

class Test {
 public static void main(String args[]) {
 char arr[] = {3,1,4,1,5,9,2,6,5,3,5,8,9};
 Queue&lt;Integer&gt; fifo = new LinkedList&lt;Integer&gt;();

 for (int i = 0; i &lt; arr.length; i++)
 fifo.add (new Integer (arr[i]));

 System.out.print (fifo.remove() + ".");
 while (! fifo.isEmpty())
 System.out.print (fifo.remove());
 System.out.println();
 }
}
</code></pre>

This has the advantage of allowing you to replace the underlying concrete class with any class that provides the <code>Queue</code> interface, without having to change the code too much.

The basic changes are to change the type of <code>fifo</code> to a <code>Queue</code> and to use <code>remove()</code> instead of <code>removeFirst()</code>, the latter being unavailable for the <code>Queue</code> interface.

Calling <code>isEmpty()</code> is still okay since that belongs to the <code>Collection</code> interface of which <code>Queue</code> is a derivative.

blocks|key|239014|text|试试ArrayDeque或LinkedList，它们都实现了Queue接口。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|239015|http://docs.oracle.com/javase/6/docs/api/java/util/ArrayDeque.html|239016|entityMap|0|LINK|mutability|MUTABLE|url^0|2|A|D|A|U|5|0|0|1U|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@$9|P|A|Q|B|C]|$9|R|A|S|B|C]|$9|T|A|U|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|V|8|@]|D|@$9|W|A|X|1|Y]]|E|$]]|$1|H|3|-4|5|6|7|Z|8|@]|D|@]|E|$]]]|I|$J|$5|K|L|M|E|$N|G]]]]

Try <code>ArrayDeque</code> or <code>LinkedList</code>, which both implement the <code>Queue</code> interface.

<a href="http://docs.oracle.com/javase/6/docs/api/java/util/ArrayDeque.html">http://docs.oracle.com/javase/6/docs/api/java/util/ArrayDeque.html</a>

blocks|key|2901153|text|Queue是先进先出的结构。您的请求相当模糊，但我猜您只需要队列结构通常附带的基本功能。您可以看看如何在here中实现它。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2901154|关于您丢失的包，很可能是因为您需要按照该教程下载或自己创建包。|2901155|entityMap|0|LINK|mutability|MUTABLE|url|http://docs.oracle.com/javase/6/docs/api/java/util/Queue.html|1|http://docs.oracle.com/javase/tutorial/collections/interfaces/queue.html^0|0|5|0|1G|4|1|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@$A|Q|B|R|1|S]|$A|T|B|U|1|V]]|C|$]]|$1|D|3|E|5|6|7|W|8|@]|9|@]|C|$]]|$1|F|3|-4|5|6|7|X|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]|N|$5|I|J|K|C|$L|O]]]]

<a href="http://docs.oracle.com/javase/6/docs/api/java/util/Queue.html" rel="nofollow">Queue</a>s are First In First Out structures. You request is pretty vague, but I am guessing that you need only the basic functionality which usually comes out with Queue structures. You can take a look at how you can implement it <a href="http://docs.oracle.com/javase/tutorial/collections/interfaces/queue.html" rel="nofollow">here</a>.

With regards to your missing package, it is most likely because you will need to either download or create the package yourself by following that tutorial.

blocks|key|236120|text|您不必实现自己的先进先出队列，只需查看接口java.util.Queue及其实现|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|236121|entityMap|0|LINK|mutability|MUTABLE|url|http://docs.oracle.com/javase/1.5.0/docs/api/java/util/Queue.html^0|L|F|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

You don't have to implement your own FIFO Queue, just look at the interface <a href="http://docs.oracle.com/javase/1.5.0/docs/api/java/util/Queue.html" rel="nofollow">java.util.Queue</a> and its implementations

blocks|key|236136|text|如果希望使用管道来写入/读取数据，则可以使用http://docs.oracle.com/javase/6/docs/api/java/io/PipedWriter.html|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|236137|entityMap|0|LINK|mutability|MUTABLE|url|http://docs.oracle.com/javase/6/docs/api/java/io/PipedWriter.html^0|M|1T|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

if you want to have a pipe to write/read data, you can use the <a href="http://docs.oracle.com/javase/6/docs/api/java/io/PipedWriter.html" rel="nofollow">http://docs.oracle.com/javase/6/docs/api/java/io/PipedWriter.html</a>

blocks|key|3115352|text|您可以使用LinkedBlockingQueue，我在我的项目中使用它。它是标准java和easy+to+use的一部分。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|3115353|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/LinkedBlockingQueue.html|1|http://tutorials.jenkov.com/java-util-concurrent/linkedblockingqueue.html^0|5|J|0|19|B|1|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]|$A|R|B|S|1|T]]|C|$]]|$1|D|3|-4|5|6|7|U|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]|L|$5|G|H|I|C|$J|M]]]]

You can use <a href="https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/LinkedBlockingQueue.html" rel="nofollow">LinkedBlockingQueue</a> I use it in my projects. It's part of standard java and quite <a href="http://tutorials.jenkov.com/java-util-concurrent/linkedblockingqueue.html" rel="nofollow">easy to use</a>

blocks|key|236160|text|不知道这些天你叫什么先进先出，因为队列是费罗的，但当我还是个学生的时候，我们使用Stack<E>，有简单的推送，弹出和偷看……这真的很简单，不需要进一步复杂化队列和任何公认的答案所建议的。|type|unstyled|depth|inlineStyleRanges|offset|length|style|BOLD|CODE|entityRanges|data|236161|entityMap^0|14|8|14|8|0^^$0|@$1|2|3|4|5|6|7|I|8|@$9|J|A|K|B|C]|$9|L|A|M|B|D]]|E|@]|F|$]]|$1|G|3|-4|5|6|7|N|8|@]|E|@]|F|$]]]|H|$]]

Not sure what you call FIFO these days since Queue is FILO, but when I was a student we used the <code>Stack&lt;E&gt;</code> with the simple push, pop, and a peek... It is really that simple, no need for complicating further with Queue and whatever the accepted answer suggests.

I want to implement FIFO through a class in Java.

Does such a class already exist? If not, how can I implement my own?

NOTE

I found a class here <a href="http://www.dcache.org/manuals/cells/docs/api/dmg/util/Fifo.html">http://www.dcache.org/manuals/cells/docs/api/dmg/util/Fifo.html</a>, but it doesn't contain dmg.util.*. I don't know if such a package even exists.

FIFO class in Java

Java

我想通过Java中的一个类来实现FIFO。这样的类已经存在了吗？如果没有，我如何实现我自己的？笔记我在这里找到了一个类，但它没有包含dmg.util.*。我甚至不知道这样的包是否存在。

问Java中的FIFO类
EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Java中的FIFO类EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Java中的FIFO类
EN