From: "Steve" <nospam_steved94@comcast.net>
Subject: Re: Variant vs. Tagged Type
Date: Wed, 05 Nov 2003 14:50:39 GMT
Date: 2003-11-05T14:50:39+00:00 [thread overview]
Message-ID: <378qb.112530$Tr4.314502@attbi_s03> (raw)
In-Reply-To: oprx5zpwdbz12uz9@news.onlinehome.de
"Frank Piron" <nospam@konad.net> wrote in message
news:oprx5zpwdbz12uz9@news.onlinehome.de...
> Hi,
> is it possible to make some general statements
> concerning the alternative variant vs. tagged
> type with respect to runtime performance?
Only for a specific Ada compiler.
Actual implementation of any feature within different compilers may differ
radically. The only way to compare performance is through testing with a
specific compiler. In certain cases you may find order-of-magnitude
differences in performance between implementations.
Steve
(The Duck)
> For example:
> if we have an array A 1) of type access to a variant
> 2) of type access <TYPE>'Class
> what can be said about the runtime performance
> of the expression
> A(I).<component>?
> Thanks in Advance,
> Frank
>
next prev parent reply other threads:[~2003-11-05 14:50 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
2003-11-05 12:30 Variant vs. Tagged Type Frank Piron
2003-11-05 12:49 ` Marin David Condic
2003-11-05 14:50 ` Steve [this message]
2003-11-05 17:40 ` Jeffrey Carter
2003-11-06 7:22 ` Frank Piron
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox