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-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,c7fc42d2c6a0eedc X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-04-03 02:13:18 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!news-FFM2.ecrc.net!news.iks-jena.de!not-for-mail From: Lutz Donnerhacke Newsgroups: comp.lang.ada Subject: Re: Ada2005 random Date: Thu, 3 Apr 2003 10:13:17 +0000 (UTC) Organization: IKS GmbH Jena Message-ID: References: NNTP-Posting-Host: taranis.iks-jena.de X-Trace: branwen.iks-jena.de 1049364797 31521 217.17.192.37 (3 Apr 2003 10:13:17 GMT) X-Complaints-To: usenet@iks-jena.de NNTP-Posting-Date: Thu, 3 Apr 2003 10:13:17 +0000 (UTC) User-Agent: slrn/0.9.7.4 (Linux) Xref: archiver1.google.com comp.lang.ada:35903 Date: 2003-04-03T10:13:17+00:00 List-Id: * Peter Hermann wrote: > Lutz and all, >> * Peter Hermann wrote: >>> In an application I need a variable discrete random function. > ^^^^^^^^ > with "variable" I meant the following flexibility, e.g. : > a := random(generator1, 1 , 9); > b := random(generator1, 1 , 8); > c := random(generator1, 3 , 7); procedure random(g : in out Generator; min, max : X; rand : out X) --# derives rand from g, min, max and --# g from g; --# pre max > min; --# post rand in min .. max; is absmax : X; begin absmax := X'Last - (X'Last - X'First) mod (max - min); --# check absmax > X'First; loop random(g, rand); -- ... random (g : in out Generator; r : out X) ... exit when rand <= absmax; end loop; return (rand - X'First) mod (max - min) + min; end random; Ok, it's the C approach ;-)