|
Boost : |
Subject: Re: [boost] Proposal/InterestCheck: Boost.Geom
From: Anis Benyelloul (anis.benyelloul_at_[hidden])
Date: 2009-01-28 03:47:36
Phil Endecott <spam_from_boost_dev <at> chezphil.org> writes:
> struct pair {
> short a;
> short b;
> };
>
> int compare_pair(struct pair p1, struct pair p2)
> {
> return p1.a==p2.a && p1.b==p2.b;
> }
> ...
> Is there anything in the language that makes this sort of thing
> difficult for the compiler? I don't think so.
I wasn't not sure, but I initially thought this kind of things might be too far
fetched for a compiler to figure out.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk