Re: a^=(b^=a); ?
- From: "Robert Gamble" <rgamble99@xxxxxxxxx>
- Date: 6 Sep 2006 13:53:07 -0700
Clark S. Cox III wrote:
Thomas J. Gritzan wrote:
Clark S. Cox III schrieb:
Robert Gamble wrote:
Clark S. Cox III wrote:It modifies 'a' and it evaluates a for a reason other than determining
a^=(b^=a)How do you figure that?
is undefined; period.
it's new value in between sequence points.
Wouldn't then with
a = a; and
node = node->next;
be undefined, too?
(with a of type int and node a linked list structure pointer)
After writing a long defense of my position, I come to realize that
a^=(b^=a) might not be undefined.
I agree with ena8t8si that this is well-defined although the meaning of
the clause you cite could be better spelled out in the Standard.
Robert Gamble
.
- References:
- a^=(b^=a); ?
- From: iler . ml
- Re: a^=(b^=a); ?
- From: markpapadakis
- Re: a^=(b^=a); ?
- From: Ben Pfaff
- Re: a^=(b^=a); ?
- From: John Gerrard
- Re: a^=(b^=a); ?
- From: Ben C
- Re: a^=(b^=a); ?
- From: Clark S. Cox III
- Re: a^=(b^=a); ?
- From: Robert Gamble
- Re: a^=(b^=a); ?
- From: Clark S. Cox III
- Re: a^=(b^=a); ?
- From: Thomas J. Gritzan
- Re: a^=(b^=a); ?
- From: Clark S. Cox III
- a^=(b^=a); ?
- Prev by Date: Re: efficiency match.
- Next by Date: Re: Maps, filters and accumulators
- Previous by thread: Re: a^=(b^=a); ?
- Next by thread: Re: a^=(b^=a); ?
- Index(es):
Relevant Pages
|