Article View: comp.std.c
Article #340Re: struct comparison
From: Henry Spencer
Date: Tue, 18 Jul 1989 02:04
Date: Tue, 18 Jul 1989 02:04
17 lines
1372 bytes
1372 bytes
In article <167@ssp1.idca.tds.philips.nl> roelof@idca.tds.PHILIPS.nl (R. Vuurboom) writes: >>It's also not a particularly good idea: suppose I change to a polar >>form, where the representation of a given >>complex number is not unique? > >Henry, this is cheating :-). If somebody comes along and changes the >representation of an int while I'm not looking nobody expects the >two values (old representation vs new representation) to compare equal. Not quite what I was getting at. The point of polar representation is that member-by-member comparison does not dependably get the right answer! Equality comparison on polar representation requires range reduction on the angle first. This leads again to the need for C++, where you can define the comparison operation to be arbitrarily complex. -- $10 million equals 18 PM | Henry Spencer at U of Toronto Zoology (Pentagon-Minutes). -Tom Neff | uunet!attcan!utzoo!henry henry@zoo.toronto.edu
Technical Details
Message-ID:
<1989Jul18.020424.2392@utzoo.uucp>Path:
arc1-ca.pugleaf.net!utzoo!henryReferences:
<2874@solo3.cs.vu.nl> <1989Jul14.155312.2063@utzoo.uucp> <2878@kappl.cs.vu.nl> <1989Jul15.210821.7950@utzoo.uucp> <167@ssp1.idca.tds.philips.nl>Show Full Headers
Complete Article Headers
Newsgroups: comp.std.c Path: arc1-ca.pugleaf.net!utzoo!henry From: henry@utzoo.uucp (Henry Spencer) Subject: Re: struct comparison Message-ID: <1989Jul18.020424.2392@utzoo.uucp> Organization: U of Toronto Zoology References: <2874@solo3.cs.vu.nl> <1989Jul14.155312.2063@utzoo.uucp> <2878@kappl.cs.vu.nl> <1989Jul15.210821.7950@utzoo.uucp> <167@ssp1.idca.tds.philips.nl> Date: Tue, 18 Jul 89 02:04:24 GMT