Ticket #36397: patch-jgraph.c.diff
| File patch-jgraph.c.diff, 2.3 KB (added by stevecheckoway (Stephen Checkoway), 12 years ago) |
|---|
-
jgraph.c
old new 6 6 */ 7 7 8 8 #include <stdio.h> 9 #include <string.h> 9 10 10 11 #ifdef VMS 11 12 #include <redexp.VMS> 12 13 #endif 13 14 14 15 #include "jgraph.h" 16 #include "prio_list.h" 15 17 16 18 int NMARKTYPES = 17; 17 19 int NORMALMARKTYPES = 6; … … Label new_label() 49 51 } 50 52 51 53 52 Curve new_curve(c, num) 53 Curve c; 54 int num; 54 Curve new_curve(Curve c, int num) 55 55 { 56 56 Curve new_c; 57 57 int i; … … int num; 105 105 return new_c; 106 106 } 107 107 108 Curve new_line(c, num) 109 Curve c; 110 int num; 108 Curve new_line(Curve c, int num) 111 109 { 112 110 Curve new_c; 113 111 new_c = new_curve(c, num); … … int num; 117 115 } 118 116 119 117 120 Curve get_curve(c, num) 121 Curve c; 122 int num; 118 Curve get_curve(Curve c, int num) 123 119 { 124 120 Curve new_c; 125 121 for(new_c = last(c); new_c != nil(c) && new_c->num > num; new_c = prev(new_c)); … … int num; 127 123 return new_c; 128 124 } 129 125 130 Axis new_axis(is_x) 131 int is_x; 126 static Axis new_axis(int is_x) 132 127 { 133 128 int i; 134 129 Axis a; … … int is_x; 185 180 return a; 186 181 } 187 182 188 Legend new_legend()183 static Legend new_legend() 189 184 { 190 185 Legend l; 191 186 l = (Legend) malloc (sizeof(struct legend)); … … Legend new_legend() 202 197 return l; 203 198 } 204 199 205 Label new_title()200 static Label new_title() 206 201 { 207 202 Label t; 208 203 … … Label new_title() 216 211 return t; 217 212 } 218 213 219 String new_string(s, num) 220 String s; 221 int num; 214 String new_string(String s, int num) 222 215 { 223 216 String new_s; 224 217 … … int num; 229 222 return new_s; 230 223 } 231 224 232 String get_string(s, num) 233 String s; 234 int num; 225 String get_string(String s, int num) 235 226 { 236 227 String new_s; 237 228 for(new_s = last(s); new_s != nil(s) && new_s->num > num; new_s = prev(new_s)); … … Default new_default() 259 250 } 260 251 */ 261 252 262 Graph new_graph(gs, num) 263 Graph gs; 264 int num; 253 Graph new_graph(Graph gs, int num) 265 254 { 266 255 Graph g; 267 256 … … int num; 286 275 return g; 287 276 } 288 277 289 Graph get_graph(g, num) 290 Graph g; 291 int num; 278 Graph get_graph(Graph g, int num) 292 279 { 293 280 Graph new_g; 294 281 for(new_g = last(g); new_g != nil(g) && new_g->num > num; new_g = prev(new_g)); … … int num; 296 283 return new_g; 297 284 } 298 285 299 new_graphs(gs) 300 Graphs gs; 286 void new_graphs(Graphs gs) 301 287 { 302 288 Graphs newg; 303 289 … … Graphs gs; 315 301 insert(newg, gs); 316 302 } 317 303 318 main(argc, argv) 319 int argc; 320 char **argv; 304 int main(int argc, char *argv[]) 321 305 { 322 306 Graphs gs; 323 307 int i;