File: gmtmath_def.h

package info (click to toggle)
gmt 3.3.3-3
  • links: PTS
  • area: main
  • in suites: potato
  • size: 3,288 kB
  • ctags: 2,962
  • sloc: ansic: 50,470; sh: 1,760; makefile: 284; asm: 38
file content (186 lines) | stat: -rw-r--r-- 11,212 bytes parent folder | download
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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
/*--------------------------------------------------------------------
 *
 *   The GMT-system:	gmtmath_def.h [Generated by make_gmtmath.x]
 *
 *	Copyright (c) 1991-1999 by P. Wessel and W. H. F. Smith
 *	See COPYING file for copying and redistribution conditions.
 *
 *	This program is free software; you can redistribute it and/or modify
 *	it under the terms of the GNU General Public License as published by
 *	the Free Software Foundation; version 2 of the License.
 *
 *	This program is distributed in the hope that it will be useful,
 *	but WITHOUT ANY WARRANTY; without even the implied warranty of
 *	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *	GNU General Public License for more details.
 *
 *	Contact info: www.soest.hawaii.edu/gmt
 *--------------------------------------------------------------------*/
/*	gmtmath_def.h is automatically generated by make_gmtmath.x;
 *	Do NOT edit manually!
 *
 * For backward compatibility:
 */

#define ADD	3
#define DIV	19
#define MUL	49
#define RAISE	55	/* (POW) */
#define SUB	67

/* Declare all functions to return int */

void table_ABS(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 00 */
void table_ACOS(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 01 */
void table_ACOSH(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 02 */
void table_ADD(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 03 */
void table_AND(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 04 */
void table_ASIN(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 05 */
void table_ASINH(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 06 */
void table_ATAN(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 07 */
void table_ATAN2(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 08 */
void table_ATANH(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 09 */
void table_BEI(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 10 */
void table_BER(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 11 */
void table_CEIL(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 12 */
void table_COS(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 13 */
void table_COSD(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 14 */
void table_COSH(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 15 */
void table_D2DT2(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 16 */
void table_D2R(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 17 */
void table_DILOG(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 18 */
void table_DIV(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 19 */
void table_DDT(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 20 */
void table_DUP(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 21 */
void table_EXCH(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 22 */
void table_EXP(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 23 */
void table_ERF(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 24 */
void table_ERFC(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 25 */
void table_ERFINV(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 26 */
void table_FLOOR(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 27 */
void table_FMOD(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 28 */
void table_HYPOT(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 29 */
void table_I0(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 30 */
void table_I1(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 31 */
void table_IN(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 32 */
void table_INV(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 33 */
void table_J0(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 34 */
void table_J1(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 35 */
void table_JN(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 36 */
void table_K0(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 37 */
void table_K1(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 38 */
void table_KN(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 39 */
void table_KEI(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 40 */
void table_KER(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 41 */
void table_LOG(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 42 */
void table_LOG10(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 43 */
void table_LOG1P(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 44 */
void table_MAX(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 45 */
void table_MEAN(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 46 */
void table_MED(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 47 */
void table_MIN(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 48 */
void table_MUL(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 49 */
void table_NEG(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 50 */
void table_NRAND(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 51 */
void table_OR(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 52 */
void table_PLM(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 53 */
void table_POP(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 54 */
void table_POW(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 55 */
void table_R2(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 56 */
void table_R2D(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 57 */
void table_RAND(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 58 */
void table_RINT(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 59 */
void table_SIGN(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 60 */
void table_SIN(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 61 */
void table_SIND(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 62 */
void table_SINH(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 63 */
void table_SQRT(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 64 */
void table_STD(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 65 */
void table_STEP(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 66 */
void table_SUB(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 67 */
void table_TAN(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 68 */
void table_TAND(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 69 */
void table_TANH(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 70 */
void table_Y0(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 71 */
void table_Y1(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 72 */
void table_YN(double **stack[], BOOLEAN *constant, double *factor, int last, int start, int n);		/* id = 73 */

/* Declare operator array */

char *operator[N_OPERATORS] = {
	"ABS",		/* id = 00 */
	"ACOS",		/* id = 01 */
	"ACOSH",		/* id = 02 */
	"ADD",		/* id = 03 */
	"AND",		/* id = 04 */
	"ASIN",		/* id = 05 */
	"ASINH",		/* id = 06 */
	"ATAN",		/* id = 07 */
	"ATAN2",		/* id = 08 */
	"ATANH",		/* id = 09 */
	"BEI",		/* id = 10 */
	"BER",		/* id = 11 */
	"CEIL",		/* id = 12 */
	"COS",		/* id = 13 */
	"COSD",		/* id = 14 */
	"COSH",		/* id = 15 */
	"D2DT2",		/* id = 16 */
	"D2R",		/* id = 17 */
	"DILOG",		/* id = 18 */
	"DIV",		/* id = 19 */
	"DDT",		/* id = 20 */
	"DUP",		/* id = 21 */
	"EXCH",		/* id = 22 */
	"EXP",		/* id = 23 */
	"ERF",		/* id = 24 */
	"ERFC",		/* id = 25 */
	"ERFINV",		/* id = 26 */
	"FLOOR",		/* id = 27 */
	"FMOD",		/* id = 28 */
	"HYPOT",		/* id = 29 */
	"I0",		/* id = 30 */
	"I1",		/* id = 31 */
	"IN",		/* id = 32 */
	"INV",		/* id = 33 */
	"J0",		/* id = 34 */
	"J1",		/* id = 35 */
	"JN",		/* id = 36 */
	"K0",		/* id = 37 */
	"K1",		/* id = 38 */
	"KN",		/* id = 39 */
	"KEI",		/* id = 40 */
	"KER",		/* id = 41 */
	"LOG",		/* id = 42 */
	"LOG10",		/* id = 43 */
	"LOG1P",		/* id = 44 */
	"MAX",		/* id = 45 */
	"MEAN",		/* id = 46 */
	"MED",		/* id = 47 */
	"MIN",		/* id = 48 */
	"MUL",		/* id = 49 */
	"NEG",		/* id = 50 */
	"NRAND",		/* id = 51 */
	"OR",		/* id = 52 */
	"PLM",		/* id = 53 */
	"POP",		/* id = 54 */
	"POW",		/* id = 55 */
	"R2",		/* id = 56 */
	"R2D",		/* id = 57 */
	"RAND",		/* id = 58 */
	"RINT",		/* id = 59 */
	"SIGN",		/* id = 60 */
	"SIN",		/* id = 61 */
	"SIND",		/* id = 62 */
	"SINH",		/* id = 63 */
	"SQRT",		/* id = 64 */
	"STD",		/* id = 65 */
	"STEP",		/* id = 66 */
	"SUB",		/* id = 67 */
	"TAN",		/* id = 68 */
	"TAND",		/* id = 69 */
	"TANH",		/* id = 70 */
	"Y0",		/* id = 71 */
	"Y1",		/* id = 72 */
	"YN"		/* id = 73 */
};