Re: Generics vs. O-O?

[Jeffrey Carter <spam.jrcarter.not@spam.not.acm.org>]

On 08/01/2013 01:10 PM, optikos@verizon.net wrote:
>
> Conversely, Ada utilizes a single instance of machine code & static data for
> an Ada generic, regardless of the type parameters passed at compile-time.
> This single instance of machine-code accommodates different type parameters
> by either branching (around different per-type-parameter treatment) or table
> look-up (of the size & structure of entities).  No such branching or
> table-lookup is present in the corresponding combinatorial explosion of C++
> template instantiation.  This conflation by branching or table look-up in Ada
> is precisely why the combinatorial explosion does not occur in Ada generics,
> as it does in C++ templates.

While Ada generics /can/ be implemented this way (see Janus/Ada for an instance 
proof), most Ada compilers do not implement generics this way, but do macro 
expansion (see GNAT for an example).

-- 
Jeff Carter
"I feel as though somebody stepped on my tongue
with muddy feet."
Never Give a Sucker an Even Break
112