From: Brad Moore <brad.moore@shaw.ca>
Subject: Re: Queue implementation in Ada
Date: Tue, 28 Oct 2014 07:16:35 -0600
Date: 2014-10-28T07:16:35-06:00 [thread overview]
Message-ID: <TGM3w.439928$Q61.50462@fx13.iad> (raw)
In-Reply-To: <8456b674-a10d-411f-bcf6-90d9638b7fc9@googlegroups.com>
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
prev parent reply other threads:[~2014-10-28 13:16 UTC|newest]
Thread overview: 10+ messages / expand[flat|nested] mbox.gz Atom feed top
2014-10-28 2:01 Queue implementation in Ada compguy45
2014-10-28 3:30 ` Jeffrey Carter
2014-10-28 10:00 ` Simon Wright
2014-10-28 18:29 ` Jeffrey Carter
2014-10-28 19:25 ` Simon Wright
2014-10-28 20:27 ` Dmitry A. Kazakov
2014-10-28 21:27 ` Simon Wright
2014-10-28 8:29 ` Dmitry A. Kazakov
2014-10-28 9:56 ` Simon Wright
2014-10-28 13:16 ` Brad Moore [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox