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,WEIRD_QUOTING autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,294c152109d75b4d X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-07-24 08:42:11 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!canoe.uoregon.edu!hammer.uoregon.edu!skates!not-for-mail From: Stephen Leake Newsgroups: comp.lang.ada Subject: Re: Dispatching and generics - language lawyer question Date: 24 Jul 2002 11:37:14 -0400 Organization: NASA Goddard Space Flight Center (skates.gsfc.nasa.gov) Message-ID: References: NNTP-Posting-Host: anarres.gsfc.nasa.gov Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: skates.gsfc.nasa.gov 1027525561 11966 128.183.220.71 (24 Jul 2002 15:46:01 GMT) X-Complaints-To: usenet@news.gsfc.nasa.gov NNTP-Posting-Date: 24 Jul 2002 15:46:01 GMT User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.2 Xref: archiver1.google.com comp.lang.ada:27363 Date: 2002-07-24T15:46:01+00:00 List-Id: Stephen Leake writes: > There is a problem with "reemergence" of predefined operators for > generic formal types, but I don't have an example of when it occurs. I > didn't see a discussion of this in Cohen's "Ada as a Second Language", > either. Nor in the Rationale. But maybe I just didn't look hard > enough. Based on a hint from Christoph Grein, I wrote the following code to demonstrate the "reemergence problem". It occurs for non-tagged types; for tagged types, Ada 95 fixed the problem. with Ada.Text_IO; use Ada.Text_IO; procedure Reemerge is type X is new Integer; function "=" (L, R: X) return Boolean; -- redefine function "=" (L, R: X) return Boolean is begin Put_Line ("in redefined ""="" (X)"); return Integer (L + R) = 0; end "="; begin Type_Compose : declare type Y is record C : X; end record; A : Y := (C => 1); B : Y := (C => 1); begin Put_Line ("Type_Compose"); Put_Line ("A = B => " & Boolean'Image (A = B)); -- Here predefined "=" on component C is used, not the -- equality redefined above New_Line; Put_Line ("A.C = B.C => " & Boolean'Image (A.C = B.C)); -- Here the equality redefined above is used. end Type_Compose; New_Line; Generic_Reemerge: declare generic type T is private; procedure Compare (L, R : in T); -- Print a message with the result of "=" (L, R). procedure Compare (L, R : in T) is begin Put_Line ("L = R => " & Boolean'Image (L = R)); end Compare; procedure Compare_X is new Compare (X); begin Put_Line ("Generic_Reemerge"); Compare_X (1, 1); end Generic_Reemerge; New_Line; Generic_Correct: declare generic type T is private; with function "=" (L, R : in T) return Boolean is <>; procedure Compare (L, R : in T); -- Print a message with the result of "=" (L, R). procedure Compare (L, R : in T) is begin Put_Line ("L = R => " & Boolean'Image (L = R)); end Compare; procedure Compare_X is new Compare (X); begin Put_Line ("Generic_Correct"); Compare_X (1, 1); end Generic_Correct; New_Line; Generic_Tagged: declare package Tagged_Type is type Y is tagged record Z : Integer; end record; function "=" (L, R : in Y) return Boolean; end Tagged_Type; package body Tagged_Type is function "=" (L, R : in Y) return Boolean is begin return L.Z + R.Z = 0; end "="; end Tagged_Type; generic type T is private; procedure Compare (L, R : in T); -- Print a message with the result of "=" (L, R). procedure Compare (L, R : in T) is begin Put_Line ("L = R => " & Boolean'Image (L = R)); end Compare; procedure Compare_Y is new Compare (Tagged_Type.Y); begin Put_Line ("Generic_Tagged"); Compare_Y ((Z => 1), (Z => 1)); end Generic_Tagged; end Reemerge; -- -- Stephe