isunordered(3m)

1isunordered(3M)         Mathematical Library Functions         isunordered(3M)
2
3
4

NAME

6       isunordered - test if arguments are unordered
7

SYNOPSIS

9       c99 [ flag... ] file... -lm [ library... ]
10       #include <math.h>
11
12       int isunordered(real-floating x, real-floating y);
13
14

DESCRIPTION

16       The isunordered() macro determines whether its arguments are unordered.
17

RETURN VALUES

19       Upon  successful  completion,  the isunordered() macro returns 1 if its
20       arguments are unordered and 0 otherwise.
21

ERRORS

23       No errors are defined.
24

USAGE

26       The relational and equality operators support  the  usual  mathematical
27       relationships  between  numeric values. For any ordered pair of numeric
28       values, exactly one of the relationships (less, greater, and equal)  is
29       true.  Relational operators can raise the invalid floating-point excep‐
30       tion when argument values are NaNs. For a NaN and a numeric  value,  or
31       for  two NaNs, just the unordered relationship is true. This macro is a
32       quiet (non-floating-point exception raising) version  of  a  relational
33       operator. It facilitates writing efficient code that accounts for quiet
34       NaNs without suffering the invalid  floating-point  exception.  In  the
35       SYNOPSIS section, real-floating indicates that the argument shall be an
36       expression of real-floating type.
37

ATTRIBUTES

39       See attributes(5) for descriptions of the following attributes:
40
41
42
43
44       ┌─────────────────────────────┬─────────────────────────────┐
45       │      ATTRIBUTE TYPE         │      ATTRIBUTE VALUE        │
46       ├─────────────────────────────┼─────────────────────────────┤
47       │Interface Stability          │Standard                     │
48       ├─────────────────────────────┼─────────────────────────────┤
49       │MT-Level                     │MT-Safe                      │
50       └─────────────────────────────┴─────────────────────────────┘
51