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,386228a37afe967f X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-07-21 08:25:28 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!newsfeed.stueberl.de!teaser.fr!enst.fr!beeblebrox!nobody From: Samuel Tardieu Newsgroups: comp.lang.ada Subject: Re: Computer Language Shootout Date: Mon, 21 Jul 2003 17:23:48 +0200 Organization: Avian Carrier & Friends Message-ID: <87k7abj43f.fsf@inf.enst.fr> References: <1ec946d1.0307150715.4ba69f85@posting.google.com> <3F149243.80304@attbi.com> <3F15930C.2070907@attbi.com> <87k7aeqfcf.fsf@inf.enst.fr> <3F19E1BB.5000908@attbi.com> <87n0f9poyc.fsf@inf.enst.fr> <3F1A98F4.3090304@attbi.com> <87r84lt987.fsf@inf.enst.fr> <3F1B1AE9.8040409@attbi.com> <87el0kth5w.fsf@inf.enst.fr> <1058798392.73480@master.nyc.kbcfp.com> NNTP-Posting-Host: beeblebrox.enst.fr Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: avanie.enst.fr 1058801064 18986 137.194.162.67 (21 Jul 2003 15:24:24 GMT) X-Complaints-To: usenet@enst.fr NNTP-Posting-Date: Mon, 21 Jul 2003 15:24:24 +0000 (UTC) Mail-Copies-To: sam@rfc1149.net User-Agent: Gnus/5.090007 (Oort Gnus v0.07) XEmacs/21.5 (cauliflower, i386--freebsd) Cancel-Lock: sha1:rAxEbysXmkewQW9e9dtuavO1ZC8= X-Leafnode-NNTP-Posting-Host: 127.0.0.1 Xref: archiver1.google.com comp.lang.ada:40558 Date: 2003-07-21T17:23:48+02:00 List-Id: >>>>> "Hyman" == Hyman Rosen writes: Sam> Of course. However, I am still waiting to see any implementation of Sam> the proposed function which is neither dangerous (Denial of Service Sam> by feeding a string which is too long) nor inefficient (relying on Sam> stack checks is definitely inefficient), and works without heavy Sam> modifications to compilers (I do not think it is worth adding extra Sam> complexity - and bugs - to the compiler for a convenience function Sam> that can be written easily by the user). Hyman> I don't think I understand your point. You are saying that such Hyman> a function is too dangerous and inefficient for compiler Hyman> implementors to write, but that such a function can be written Hyman> easily by the user? Exactly: if the user is expecting data from the outside, he can write such a loop and do explicit memory allocation from the heap if he wants to. At least, it is explicit. But I still think that in a vast majority of cases, it is a good thing that users ask themselves "what is the biggest line length I will ever get?" and write such a function only if they really need to. Sam -- Samuel Tardieu -- sam@rfc1149.net -- http://www.rfc1149.net/sam