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,4ff929aa5c2b2834
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!news3.google.com!newsfeed2.dallas1.level3.net!news.level3.com!newsfeed-00.mathworks.com!nntp.TheWorld.com!not-for-mail
From: Robert A Duff <bobduff@shell01.TheWorld.com>
Newsgroups: comp.lang.ada
Subject: Re: Ranges and (non)static constraints
Date: Tue, 21 Nov 2006 16:02:36 -0500
Organization: The World Public Access UNIX, Brookline, MA
Message-ID: <wccbqn0wm1f.fsf@shell01.TheWorld.com>
References: <ejhgfn$jq9$1@cernne03.cern.ch>
 <1pqs0gcno5o2t.1195tm9yap28b.dlg@40tude.net> <uh6ije.uoh.ln@hunter.axlog.fr>
 <g2go52hf14qn.16tb2xiy7ilrf.dlg@40tude.net> <tc3kje.tmr.ln@hunter.axlog.fr>
 <160ziiyah2n7g.5k340gtji747.dlg@40tude.net>
 <wCo7h.283942$1i1.122160@attbi_s72> <wccpsbld3sn.fsf@shell01.TheWorld.com>
 <siP7h.242316$FQ1.162316@attbi_s71> <wcck61rxd7r.fsf@shell01.TheWorld.com>
 <yD98h.152478$aJ.70530@attbi_s21>
NNTP-Posting-Host: shell01.theworld.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
X-Trace: pcls6.std.com 1164142956 22812 192.74.137.71 (21 Nov 2006 21:02:36
 GMT)
X-Complaints-To: abuse@TheWorld.com
NNTP-Posting-Date: Tue, 21 Nov 2006 21:02:36 +0000 (UTC)
User-Agent: Gnus/5.1008 (Gnus v5.10.8) Emacs/21.3 (irix)
Cancel-Lock: sha1:xCtQNZ42h7ukzUkTQzX/eacrFuI=
Xref: g2news2.google.com comp.lang.ada:7628
Date: 2006-11-21T16:02:36-05:00
List-Id: <comp.lang.ada>

"Jeffrey R. Carter" <spam.not.jrcarter@acm.not.spam.org> writes:

>> Instead of Machine_Integer, perhaps we want a way to define a type that
>> can count the number of Mumble objects, given that if we create more
>> than some number of Mumble objects, or an array of them, we can be sure
>> this count will not overflow.  That is, we would have run out of
>> (virtual) memory before that count overflows.
>
> That would have to be a dynamic type, as the actual upper bound could
> not generally be known at compile time.

I don't see why.  It's easy to come up with a static worst-case bound
based on the size of the address space.

- Bob