From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00
	autolearn=unavailable autolearn_force=no version=3.4.4
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!usenet.blueworldhosting.com!feeder01.blueworldhosting.com!peer01.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!post01.iad.highwinds-media.com!fx13.iad.POSTED!not-for-mail
From: Brad Moore <brad.moore@shaw.ca>
User-Agent: Mozilla/5.0 (Windows NT 6.3; WOW64;
 rv:24.0) Gecko/20100101 Thunderbird/24.6.0
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Queue implementation in Ada
References: <8456b674-a10d-411f-bcf6-90d9638b7fc9@googlegroups.com>
In-Reply-To: <8456b674-a10d-411f-bcf6-90d9638b7fc9@googlegroups.com>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Message-ID: <TGM3w.439928$Q61.50462@fx13.iad>
NNTP-Posting-Host: 68.145.219.148
X-Complaints-To: internet.abuse@sjrb.ca
X-Trace: 1414502195 68.145.219.148 (Tue, 28 Oct 2014 13:16:35 UTC)
NNTP-Posting-Date: Tue, 28 Oct 2014 13:16:35 UTC
Date: Tue, 28 Oct 2014 07:16:35 -0600
X-Received-Bytes: 1677
X-Received-Body-CRC: 207892946
Xref: news.eternal-september.org comp.lang.ada:22853
Date: 2014-10-28T07:16:35-06:00
List-Id: <comp.lang.ada>

On 2014-10-27 8:01 PM, compguy45@gmail.com wrote:
> Is there queue fifo implemented in ada? I saw this example but not sure where he is fetting fifo package
> http://rosettacode.org/wiki/Queue/Usage
>

Yet another option:

http://sourceforge.net/projects/dequesterity/

This is a suite of composable queues/deques where you can pick and 
choose features using a generic hierarchy.
eg. Bounded, Unbounded, Streaming, Synchronized (protected or task), 
Ravenscar, multiple readers/writers, Priority Queue, Remote, Streaming, etc.

Depending on your needs though, you might find that the standard library 
containers are sufficient. (Vectors, Doubly_Linked_Lists, or 
Synchronized_Queues) I'd look at those first, then if these are not 
sufficient, have a look at other solutions, such as the ones mentioned 
in this thread.

Brad