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=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,6f580d48a3449630 X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit From: "Randy Brukardt" Newsgroups: comp.lang.ada Subject: Re: Constraints in extended return Date: Mon, 21 Mar 2011 21:02:32 -0500 Organization: Jacob Sparre Andersen Research & Innovation Message-ID: References: NNTP-Posting-Host: static-69-95-181-76.mad.choiceone.net X-Trace: munin.nbi.dk 1300759356 7136 69.95.181.76 (22 Mar 2011 02:02:36 GMT) X-Complaints-To: news@jacob-sparre.dk NNTP-Posting-Date: Tue, 22 Mar 2011 02:02:36 +0000 (UTC) X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2900.5931 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2900.5931 X-RFC2646: Format=Flowed; Original Path: g2news2.google.com!news4.google.com!proxad.net!feeder1-2.proxad.net!feed.ac-versailles.fr!news.ecp.fr!news.jacob-sparre.dk!pnx.dk!.POSTED!not-for-mail Xref: g2news2.google.com comp.lang.ada:19325 Date: 2011-03-21T21:02:32-05:00 List-Id: "Simon Wright" wrote in message news:m2d3lngzmi.fsf@pushface.org... > This code transposes a matrix: > > function Transpose (M : Complex_Matrix) return Complex_Matrix > is > begin > return Result : Complex_Matrix (M'Range (2), M'Range (1)) do > for J in M'Range (1) loop > for K in M'Range (2) loop > Result (K, J) := M (J, K); > end loop; > end loop; > end return; > end Transpose; > > This is all very well for providing a value where no constraint is > otherwise imposed, for example as an actual in a subprogram call, but > what about the case where there is a prior constraint? > > Input : Complex_Matrix (1 .. 2, 11 .. 12); > Output : Complex_Matrix (1 .. 2, 1 .. 2); > begin > Input := (...); > Output := Transpose (Input); > > Is there any way for the extended return to determine the constraints of > the 'target'? I suspect not, but the language in RM6.5 is deep. Why do we care what the bounds are? Assignments "slide" bounds; all that is required is that the lengths of the array dimensions match. This is true whether this is an extended return or a regular return (at least it had better be; it would be awful to have the semantics change depending on the form of the return statement). For instance, Output := Input; is both a legal assignment and does not raise Constraint_Error (both dimensions have length 2). Now, if you get the lengths wrong, you have a problem, but not the actual bounds. Randy.