/
sgn.cpp
120 lines (96 loc) · 1.39 KB
/
sgn.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
//-----------------------------------------------------------------------------
//
// Author : philippe.billet@noos.fr
//
// sgn sign function
//
//
//-----------------------------------------------------------------------------
#include "stdafx.h"
#include "defs.h"
void
eval_sgn(void)
{
push(cadr(p1));
eval();
sgn();
}
void
sgn(void)
{
save();
yysgn();
restore();
}
#define X p1
void
yysgn(void)
{
X = pop();
if (isdouble(p1)) {
if (p1->u.d > 0)
{push_integer(1);
return;}
else
if (p1->u.d == 0)
{push_integer(1);
return;}
else
{push_integer(-1);
return;}
}
if (isrational(p1)) {
if (MSIGN(mmul(p1->u.q.a,p1->u.q.b)) == -1)
{push_integer(-1);
return;}
else
if (MZERO(mmul(p1->u.q.a,p1->u.q.b)))
{push_integer(0);
return;}
else
{push_integer(1);
return;}
}
if (iscomplexnumber(X)){
push_integer(-1);
push(X);
absval();
power();
push(X);
multiply();
return;
}
if (isnegativeterm(X)) {
push_symbol(SGN);
push(X);
negate();
list(2);
push_integer(-1);
multiply();
return;
}
/* push_integer(2);
push(X);
heaviside();
multiply();
push_integer(-1);
add(); */
push_symbol(SGN);
push(X);
list(2);
}
#if SELFTEST
static char *s[] = {
"sgn(-3)",
"-1",
"sgn(0)",
"0",
"sgn(3)",
"1",
};
void
test_sgn(void)
{
test(__FILE__, s, sizeof s / sizeof (char *));
}
#endif