Decide if a number is negative or positive?

[Johs]

I need to make some special action if 'a' and 'b' are both positive or
both negative. Is there some inbuilt function to check this?

Johs

[Richard Heathfield]

Johs said:

I need to make some special action if 'a' and 'b' are both positive or
both negative. Is there some inbuilt function to check this?

How about zero, which is neither positive or negative?

With that caveat, consider this:

#define SAME_SIGN(a, b) ((((a)<0)==((b)<0))&&(((a)>0)==((b)>0)))

--
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/1999
http://www.cpax.org.uk
email: rjh at the above domain, - www.

[Richard Tobin]

In article <Yc******************************@bt.com>,
Richard Heathfield <rj*@see.sig.invalidwrote:

>I need to make some special action if 'a' and 'b' are both positive or
both negative. Is there some inbuilt function to check this?

>How about zero, which is neither positive or negative?

And if either of the values may be a floating-point number, you need
to consider how you want -0 (which is distinct from +0 in some
floating point systems) to behave.

-- Richard
--
"Consideration shall be given to the need for as many as 32 characters
in some alphabets" - X3.4, 1963.

[Taran]

Johs wrote:

I need to make some special action if 'a' and 'b' are both positive or
both negative. Is there some inbuilt function to check this?

Johs

I am not really sure if there is an inbuilt function or not. AFAIK it
would take less time to code it than to find that special function if
it was available.

Anyways here's the code, not tested though:

/* product of two positive or two negative numbers is always positive
* and equality with zero takes care of the special case 0.
*/
if ( (a* b) >= 0 )
{
/* the numbers are either both positive or both negative
*/
}

This will also remove the the conflict between +0 and -0, which ever
type of signed 0 it is, they both must be of the same sign.

Sometimes we have to live with non-sense like +0 or -0.

HTH
--

Regards
Taran

[Chris Dollin]

Taran wrote:

Johs wrote:

>I need to make some special action if 'a' and 'b' are both positive or
both negative. Is there some inbuilt function to check this?

Johs

I am not really sure if there is an inbuilt function or not. AFAIK it
would take less time to code it than to find that special function if
it was available.

Anyways here's the code, not tested though:

/* product of two positive or two negative numbers is always positive
* and equality with zero takes care of the special case 0.
*/
if ( (a* b) >= 0 )
{
/* the numbers are either both positive or both negative

Or the product can't be represented as a value of the appropriate
kind. This is a Very Bad Way to try and solve the problem.

I don't see why

if (a 0 && b 0 || a < 0 && b < 0) ... co-signed ...

(fiddle with >=, <= to taste) isn't good enough. Or

if (a < 0 == b < 0) ... co-signed ...

--
Chris "hopefully not Pyecroft" Dollin
"The path to the web becomes deeper and wider" - October Project

[CBFalconer]

Richard Tobin wrote:

Richard Heathfield <rj*@see.sig.invalidwrote:

>>I need to make some special action if 'a' and 'b' are both
positive or both negative. Is there some inbuilt function to
check this?

>How about zero, which is neither positive or negative?

And if either of the values may be a floating-point number, you
need to consider how you want -0 (which is distinct from +0 in
some floating point systems) to behave.

I believe the standards commitee has found that there are no
implementations extant where insistance on all bits zero will fail
to simulate 0.0, and thus plan to allow that in the future. NULL
is another matter, but usually works. Document any such usage as
non-portable.

--
Chuck F (cbfalconer at maineline dot net)
Available for consulting/temporary embedded and systems.
<http://cbfalconer.home.att.net>

[osmium]

"Johs" writes:

>I need to make some special action if 'a' and 'b' are both positive or both
negative. Is there some inbuilt function to check this?

No, there is no built in function to do this. The best way, in general, to
answer this kind of thing in the future is to take a good reference, such as
the appendix in K&R, and make some personal notes on the various headers.
This will force you to actually read, rather than skim, the contents. Most
everything will fit into some kind of category, but you really need to
study <stdlib.hbecause it is a catch all for the residue of what didn't
fit in some neat niche. And <math.hshould be studied as well.

IMO the people that wrote the standard were pretty careful not to innundate
the thing with drivel. I consider something as pointless when it is trivial
and obvious to do it with the basic language. But everyone has their own
personal "trivial" of course. The "pointless" functions along the lines of
what you asked that comes to mind is abs() and fabs(). Some of the stuff
may be trivial but not obvious, ceil() and floor() in <math.h>come to mind.

But in a practical sense this still leaves the question, OK, it is not
standard but "Does *my* compiler have such a function?" For example, there
might be something special to convert "endinadness". I don't have any
particularly helpful hints on that problem. Study and practice, practice,
practice AFAIK.

[David T. Ashley]

"Johs" <sd*@sdf.comwrote in message news:en**********@news.net.uni-c.dk...

>I need to make some special action if 'a' and 'b' are both positive or both
negative. Is there some inbuilt function to check this?

Johs

If they are both signed integers of the same size, the easiest way to test
for both positive or both negative is probably something like:

(a ^ b) >= 0

I'm naturally making the assumption of standard 2's complement
representation (and I haven't seen a machine that doesn't support this, but
I don't know what standards apply).

This assumes that the machine hardware economically fetches an integer in
one instruction. If not, one needs only to test the upper byte or word of
each.

[Richard Tobin]

In article <45***************@yahoo.com>,
CBFalconer <cb********@maineline.netwrote:

>>>I need to make some special action if 'a' and 'b' are both
positive or both negative. Is there some inbuilt function to
check this?

>>How about zero, which is neither positive or negative?

>And if either of the values may be a floating-point number, you
need to consider how you want -0 (which is distinct from +0 in
some floating point systems) to behave.

>I believe the standards commitee has found that there are no
implementations extant where insistance on all bits zero will fail
to simulate 0.0, and thus plan to allow that in the future.

I don't see the relevance of this to the question. I was pointing out
that the OP must decide whether he wants to consider -0 and +0 as
having the same sign or not; this has nothing to do with the
representation.

-- Richard
--
"Consideration shall be given to the need for as many as 32 characters
in some alphabets" - X3.4, 1963.

[Kenneth Brody]

Johs wrote:

>
I need to make some special action if 'a' and 'b' are both positive or
both negative. Is there some inbuilt function to check this?

If by "positive" you really mean "non-negative" (ie: including zero),
then this (*untested*) should work:

#define SAME_SIGN(a,b) ( ((a)<0) == ((b)<0) )

--
+-------------------------+--------------------+-----------------------+
| Kenneth J. Brody | www.hvcomputer.com | #include |
| kenbrody/at\spamcop.net | www.fptech.com | <std_disclaimer.h|
+-------------------------+--------------------+-----------------------+
Don't e-mail me at: <mailto:Th*************@gmail.com>

[Keith Thompson]

CBFalconer <cb********@yahoo.comwrites:

Richard Tobin wrote:

>Richard Heathfield <rj*@see.sig.invalidwrote:

>>>I need to make some special action if 'a' and 'b' are both
positive or both negative. Is there some inbuilt function to
check this?

>>How about zero, which is neither positive or negative?

And if either of the values may be a floating-point number, you
need to consider how you want -0 (which is distinct from +0 in
some floating point systems) to behave.

I believe the standards commitee has found that there are no
implementations extant where insistance on all bits zero will fail
to simulate 0.0, and thus plan to allow that in the future. NULL
is another matter, but usually works. Document any such usage as
non-portable.

Apart from not being, as far as I can see, relevant to the point, I
haven't heard anything about all-bits-zero being universally a
representation for 0.0. It wasn't until relatively recently
(post-C99) that the committee decided that all-bits-zero is always a
representation of 0 for integer types; could that be what you're
thinking of?

--
Keith Thompson (The_Other_Keith) ks***@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <* <http://users.sdsc.edu/~kst>
We must do something. This is something. Therefore, we must do this.

[Keith Thompson]

"David T. Ashley" <dt*@e3ft.comwrites:

"Johs" <sd*@sdf.comwrote in message news:en**********@news.net.uni-c.dk...

>>I need to make some special action if 'a' and 'b' are both positive or both
negative. Is there some inbuilt function to check this?

Johs

If they are both signed integers of the same size, the easiest way to test
for both positive or both negative is probably something like:

(a ^ b) >= 0

I'm naturally making the assumption of standard 2's complement
representation (and I haven't seen a machine that doesn't support this, but
I don't know what standards apply).

This assumes that the machine hardware economically fetches an integer in
one instruction. If not, one needs only to test the upper byte or word of
each.

This is an obscure way to go about it. The standard doesn't require a
2's complement representation for signed integers, though it's almost
universal these days. The fact that you talk about testing only the
upper byte or word of each operand tells me you're thinking in terms
of micro-optimization, which is usually a bad idea *unless* you've
confirmed that the code in question is a significant performance
bottleneck.

(Personally, I wouldn't try to use bitwise operations on signed
integers; I've never bothered to learn how they behave. If I ever
need to know, I'll look it up.)

Also, the OP didn't say he's working with integers.

Just write the code as clearly as possible, such as:

(a >= 0 && b >= 0) || (a < 0 && b < 0)

or even

(a >= 0) == (b >= 0)

--
Keith Thompson (The_Other_Keith) ks***@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <* <http://users.sdsc.edu/~kst>
We must do something. This is something. Therefore, we must do this.

[Joe Wright]

Keith Thompson wrote:

"David T. Ashley" <dt*@e3ft.comwrites:

>"Johs" <sd*@sdf.comwrote in message news:en**********@news.net.uni-c.dk...

>>I need to make some special action if 'a' and 'b' are both positive or both
negative. Is there some inbuilt function to check this?

Johs

If they are both signed integers of the same size, the easiest way to test
for both positive or both negative is probably something like:

(a ^ b) >= 0

I'm naturally making the assumption of standard 2's complement
representation (and I haven't seen a machine that doesn't support this, but
I don't know what standards apply).

This assumes that the machine hardware economically fetches an integer in
one instruction. If not, one needs only to test the upper byte or word of
each.

This is an obscure way to go about it. The standard doesn't require a
2's complement representation for signed integers, though it's almost
universal these days. The fact that you talk about testing only the
upper byte or word of each operand tells me you're thinking in terms
of micro-optimization, which is usually a bad idea *unless* you've
confirmed that the code in question is a significant performance
bottleneck.

(Personally, I wouldn't try to use bitwise operations on signed
integers; I've never bothered to learn how they behave. If I ever
need to know, I'll look it up.)

Also, the OP didn't say he's working with integers.

Just write the code as clearly as possible, such as:

(a >= 0 && b >= 0) || (a < 0 && b < 0)

or even

(a >= 0) == (b >= 0)

or even

!(a < 0) ^ !(b < 0)

--
Joe Wright
"Everything should be made as simple as possible, but not simpler."
--- Albert Einstein ---

[pete]

Joe Wright wrote:

>
Keith Thompson wrote:

Just write the code as clearly as possible, such as:

(a >= 0 && b >= 0) || (a < 0 && b < 0)

or even

(a >= 0) == (b >= 0)

or even

!(a < 0) ^ !(b < 0)

Not even.
He said "as clearly as possible" for a reason.

/* BEGIN new.c */

#include <stdio.h>

int main(void)
{
int a, b;

puts("/* BEGIN new.c output */\n");
for (a = -1; a != 2; ++a) {
for (b = -1; b != 2; ++b) {
printf("a is %d\nb is %d\n", a, b);
printf("(a >= 0 && b >= 0) || (a < 0 && b < 0) is %d\n",
(a >= 0 && b >= 0) || (a < 0 && b < 0));
printf("(a >= 0) == (b >= 0) is %d\n",
(a >= 0) == (b >= 0));
printf("!(a < 0) ^ !(b < 0) is %d\n",
!(a < 0) ^ !(b < 0));
putchar('\n');
}
}
puts("/* END new.c output */");
return 0;
}

/* END new.c */
--
pete

[Spiros Bousbouras]

Joe Wright wrote:

Keith Thompson wrote:

Just write the code as clearly as possible, such as:

(a >= 0 && b >= 0) || (a < 0 && b < 0)

or even

(a >= 0) == (b >= 0)

or even

!(a < 0) ^ !(b < 0)

Do you mean !( !(a < 0) ^ !(b < 0) ) ?

[pete]

Spiros Bousbouras wrote:

>
Joe Wright wrote:

Keith Thompson wrote:

Just write the code as clearly as possible, such as:
>
(a >= 0 && b >= 0) || (a < 0 && b < 0)
>
or even
>
(a >= 0) == (b >= 0)
>

or even

!(a < 0) ^ !(b < 0)

Do you mean !( !(a < 0) ^ !(b < 0) ) ?

!(a < 0) ^ (b < 0) would work, but
(a >= 0) == (b >= 0) is really a better way to write it.

--
pete

[David T. Ashley]

"Keith Thompson" <ks***@mib.orgwrote in message
news:ln************@nuthaus.mib.org...

"David T. Ashley" <dt*@e3ft.comwrites:

>"Johs" <sd*@sdf.comwrote in message
news:en**********@news.net.uni-c.dk...

>>>I need to make some special action if 'a' and 'b' are both positive or
both
negative. Is there some inbuilt function to check this?

Johs

If they are both signed integers of the same size, the easiest way to
test
for both positive or both negative is probably something like:

(a ^ b) >= 0

I'm naturally making the assumption of standard 2's complement
representation (and I haven't seen a machine that doesn't support this,
but
I don't know what standards apply).

This assumes that the machine hardware economically fetches an integer in
one instruction. If not, one needs only to test the upper byte or word
of
each.

This is an obscure way to go about it. The standard doesn't require a
2's complement representation for signed integers, though it's almost
universal these days. The fact that you talk about testing only the
upper byte or word of each operand tells me you're thinking in terms
of micro-optimization, which is usually a bad idea *unless* you've
confirmed that the code in question is a significant performance
bottleneck.

(Personally, I wouldn't try to use bitwise operations on signed
integers; I've never bothered to learn how they behave. If I ever
need to know, I'll look it up.)

Also, the OP didn't say he's working with integers.

Just write the code as clearly as possible, such as:

(a >= 0 && b >= 0) || (a < 0 && b < 0)

or even

(a >= 0) == (b >= 0)

I agree with everything you wrote about obscurity. I'll just make the
observation that compilers are notoriously bad at certain types of
comparisons.

A plain vanilla comparison (a < b) is generally done well.

However, with bitfields in particular, I've seen some really bad code. For
example, on the compiler I'm using presently (with bitfields of size 1), the
comparison:

(x.bf1 == x.bf2)

results in a huge bulk of code as the bitfields are converted into integers
and then compared.

I've actually found it is cheaper to write:

((x.bf1 && x.bf2) || (!x.bf1 && !x.bf2))

I do agree with you in principle about micro-optimization. You are right.

[CBFalconer]

Keith Thompson wrote:

>

.... snip ...

>
Apart from not being, as far as I can see, relevant to the point,
I haven't heard anything about all-bits-zero being universally a
representation for 0.0. It wasn't until relatively recently
(post-C99) that the committee decided that all-bits-zero is
always a representation of 0 for integer types; could that be
what you're thinking of?

Probably.

--
Chuck F (cbfalconer at maineline dot net)
Available for consulting/temporary embedded and systems.
<http://cbfalconer.home.att.net>

[Gordon Burditt]

>And if either of the values may be a floating-point number, you

>need to consider how you want -0 (which is distinct from +0 in
some floating point systems) to behave.

I believe the standards commitee has found that there are no
implementations extant where insistance on all bits zero will fail
to simulate 0.0, and thus plan to allow that in the future. NULL
is another matter, but usually works. Document any such usage as
non-portable.

On the other hand, many implementations (including all the IEEE
floating-point ones) have at least two distinct representations of
zero, at least one of which isn't all-bits-zero (although the other
one probably is all-bits-zero).

[Old Wolf]

Taran wrote:

Johs wrote:

I need to make some special action if 'a' and 'b' are both positive or
both negative. Is there some inbuilt function to check this?

Anyways here's the code, not tested though:

if ( (a* b) >= 0 )

Will cause trouble if a*b overflows.