Re: Where to find Ravenscar compatible ADT Containers (List, Vector, stack)

[Jere <jhb.chat@gmail.com>]

On Tuesday, August 28, 2018 at 8:24:23 PM UTC-4, Randy Brukardt wrote:
> "Daniel Norber" wrote in message 
> >
> > The standard ADA.Containers library is not prepared for Ravenscar use.
> > Even bounded versions, like Bounded_double_Linked_List have several 
> > violations
> >of Ravenscar, like Implicit_Heap_Allocation when i try to instantiate it, 
> >and bind it.
> 
> The bounded versions aren't supposed to have any heap allocation, see for 
> instance A.18.19(16/3). I'd expect that to be a requirement for a compiler 
> supporting Ravenscar.
> 
> The other versions aren't intended to be used in safety-critical 
> environments where heap use has to be constrained.
> 
> I'd suggest that this is a compiler bug that ought to be reported to your 
> vendor. (And Simon suggests that it might have been an old bug already fixed 
> in the current versions.)
> 
>                                             Randy.

I have a question about this as it has always bothered me.  The
section that specifies that is under Implementation Advice, which
doesn't sound binding.  That sounds more like it is a suggestion
to the vendor rather than a requirement.  Is Implementation
Advice such that a conforming Ada compiler must follow it
(so not really advice at that point)?  I've intentionally avoided
bounded containers in situations where I want portability for
some of my embedded targets that don't use heap because it 
doesn't sound guaranteed that it will not use heap, even
if my current compiler implements it that way now.