Path: utzoo!mnetor!uunet!husc6!cmcl2!brl-adm!adm!MAILER%ALASKA.BITNET@CUNYVM.CUNY.EDU From: MAILER%ALASKA.BITNET@CUNYVM.CUNY.EDU Newsgroups: comp.lang.c Subject: Undelivered mail Message-ID: <12314@brl-adm.ARPA> Date: 12 Mar 88 20:30:22 GMT Sender: news@brl-adm.ARPA Lines: 32 Subject: Re: Pascal --> C question [Non-Deliverable: User does not exist or has never logged on] Reply-To: Info-C@BRL.ARPA Received: From UWAVM(MAILER) by ALASKA with Jnet id 8056 for SXJVK@ALASKA; Sat, 12 Mar 88 10:52 AST Received: by UWAVM (Mailer X1.25) id 5439; Sat, 12 Mar 88 11:50:45 PST Date: Fri, 11 Mar 88 23:57:37 GMT Reply-To: Info-C@BRL.ARPA Sender: Info-C List From: 00704a-Liber Subject: Re: Pascal --> C question Comments: To: info-c@BRL-SMOKE.arpa To: Vic Kapella In article <3352@psuvax1.psu.edu> schwartz@gondor.cs.psu.edu (Scott Schwartz) writes: >Except that the useful ones are never that easy. One of my favorites: > bitstring: packed array[0..1023] of boolean; >In C you have to do bit-fiddling by hand to get the same effect. Yes, but in C you are guaranteed that bits are actually used. Not many implementations of Pascal bother to implement packed arrays any differently than non-packed arrays, so what you get is an array of 1024 words (where the sizeof(word) is implementation-dependent). -- _ __ NEVIN J. LIBER ..!ihnp4!ihlpf!nevin1 (312) 510-6194 ' ) ) "The secret compartment of my ring I fill / / _ , __o ____ with an Underdog super-energy pill." / (_