Thread: NOP in 'C'?

Oh darn, I should have double-checked all examples given earlier.

I think that those of us who are happier to apply the rules and remove the empty if branch are more comfortable with changing our thinking about our problem.
Some people are happier when the way they solve a problem matches their thinking about the problem, but you typically get more optimal code if you change your thinking to fit the problem, as the problem unravels itself in the form of code.
If fact, sometimes when you change your thinking to fit the problem it comes around full circle. You simplify something much furthur, and as a result and come to see it in a new light and realise that you were seeing the problem wrong.
Well those are my experiences at least.

Just don't be afraid to remove the empty if-branch. It's not as difficult to get used to as you might think.

Originally Posted by King Mir

@matsp & Elysia

You don't seem to be applying Demorgan's correctly:
!( (A == 1) && (B == 2) )

is the same as

A!=1 || B!=2

Ehh, you're right. Simple mistake. My mistake >_<

DeMorgans:

The negation of a conjunction is the disjunction of the negations.
The negation of a disjunction is the conjunction of the negations.

I don't see how it's confusing...

If you are not an A or a B:

Code:

!(A || B)

Then you're not an A, and you're not a B:

Code:

!A && !B

Think of it as distributing the negation -- it distributes to the predicates as well as the logical combinators (where the "negation" of OR is AND, and vice versa)

On a side note, this is why I always use straight-forward expressions such as
!A && !B
instead of
!(A || B)
Less room to make mistakes.