Article View: comp.lang.c.moderated
Article #2632Re: Multidimeensional Arrays vs. pointers
From: ct
Date: Sat, 20 Apr 1996 18:35
Date: Sat, 20 Apr 1996 18:35
14 lines
998 bytes
998 bytes
In article <4l5d2q$22v@solutions.solon.com>, Chris Torek <torek@bsdi.com> wrote: >(for instance, an implementation may, but >is not required to, verify that each subscript is in range; Eh? Surely that's impossible at compile time? Computed subscripts cannot be bound checked in general. Just as well implementations aren't required to do it! Or did you mean they do range checking at run-time? A different proposition entirely, and one which imposes nasty overheads all over the place. regards, ct
Technical Details
Message-ID:
<4lbaon$llc@solutions.solon.com>Path:
arc1-ca.pugleaf.net!solon.com!not-for-mailReferences:
<4khlpr$t5g@solutions.solon.com> <4l1ieh$q0q@solutions.solon.com> <4l5d2q$22v@solutions.solon.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!solon.com!not-for-mail From: ct@ecs.ox.ac.uk (ct) Newsgroups: comp.lang.c.moderated Subject: Re: Multidimeensional Arrays vs. pointers Date: 20 Apr 1996 13:35:03 -0500 Organization: Oxford University Sender: clc@solutions.solon.com Approved: clc@solutions.solon.com Message-ID: <4lbaon$llc@solutions.solon.com> References: <4khlpr$t5g@solutions.solon.com> <4l1ieh$q0q@solutions.solon.com> <4l5d2q$22v@solutions.solon.com> NNTP-Posting-Host: solutions.solon.com