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=-0.8 required=5.0 tests=BAYES_00,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4c86cf2332cbe682
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1995-01-21 21:10:53 PST
Path: 
 pad-thai.cam.ov.com!bloom-beacon.mit.edu!apollo.hp.com!lf.hp.com!hpscit.sc.hp.com!news.dtc.hp.com!col.hp.com!csn!ncar!gatech!swrinde!pipex!uunet!panix!cmcl2!thecourier.cims.nyu.edu!thecourier.cims.nyu.edu!nobody
From: dewar@cs.nyu.edu (Robert Dewar)
Newsgroups: comp.lang.ada
Subject: Re: Ada.strings.bounded problems?
Date: 20 Jan 1995 00:12:16 -0500
Organization: Courant Institute of Mathematical Sciences
Message-ID: <3fngng$4ju@gnat.cs.nyu.edu>
References: <TARJEIJ.95Jan11183331@ulrik.uio.no> <D29L78.J9@nntpa.cb.att.com>
 <3f49ps$kgl@gnat.cs.nyu.edu> <D2D8DC.JvM@nntpa.cb.att.com>
 <3fja22$fab@source.asset.com>
Date: 1995-01-20T00:12:16-05:00
List-Id: <comp.lang.ada>

"The traditional response is that a good optimizing compiler will remove
the discriminant"

Not likely, this is a VERY hard optimization, and not one that I have seen
any Ada compiler do except in VERY specific cases.