1 #define MAX_RPN_STACK 16
5 string rpn_stack[MAX_RPN_STACK];
9 return rpn_stack[rpn_sp];
11 print("rpn: stack underflow\n");
16 void rpn_push(string s) {
17 if(rpn_sp < MAX_RPN_STACK) {
18 rpn_stack[rpn_sp] = s;
21 print("rpn: stack overflow\n");
27 return rpn_stack[rpn_sp - 1];
29 print("rpn: empty stack\n");
34 void rpn_set(string s) {
36 rpn_stack[rpn_sp - 1] = s;
38 print("rpn: empty stack\n");
42 float rpn_getf() { return stof(rpn_get()); }
43 float rpn_popf() { return stof(rpn_pop()); }
44 void rpn_pushf(float f) { return rpn_push(ftos(f)); }
45 void rpn_setf(float f) { return rpn_set(ftos(f)); }
47 float GameCommand_Generic(string command)
52 argc = tokenize(command);
55 print(" rpn EXPRESSION... - a RPN calculator.\n");
56 print(" Operator description (x: string, s: set, f: float):\n");
57 print(" x pop -----------------------------> : removes the top\n");
58 print(" x dup -----------------------------> x x : duplicates the top\n");
59 print(" x x exch --------------------------> x x : swap the top two\n");
60 print(" /cvarname load --------------------> x : loads a cvar\n");
61 print(" /cvarname x def -------------------> : writes to a cvar\n");
62 print(" f f add|sub|mul|div|mod|max|min ---> f : adds/... two numbers\n");
63 print(" f f eq|ne|gt|ge|lt|le -------------> f : compares two numbers\n");
64 print(" f neg|abs|sgn|rand|floor|ceil------> f : negates/... a number\n");
65 print(" f f f bound -----------------------> f : bounds the middle number\n");
66 print(" f1 f2 b when ----------------------> f : f1 if b, f2 otherwise\n");
67 print(" s s union|intersection|difference -> s : set operations\n");
68 print(" s shuffle -------------------------> s : randomly arrange elements\n");
69 print(" x dbpush --------------------------> : pushes the top onto the database\n");
70 print(" dbpop|dbget -----------------------> x : removes/reads DB's top\n");
71 print(" dblen|dbat ------------------------> f : gets the DB's size/cursor pos\n");
72 print(" x dbins ---------------------------> : moves the top into the DB\n");
73 print(" dbext|dbread ----------------------> x : extract/get from the DB's cursor\n");
74 print(" f dbmov|dbgoto --------------------> : move or set the DB's cursor\n");
75 print(" Set operations operate on 'such''strings'.\n");
76 print(" Unknown tokens insert their cvar value.\n");
77 print(" maplist add map\n");
78 print(" maplist remove map\n");
79 print(" maplist shuffle\n");
83 if(argv(0) == "maplist")
85 if(argv(1) == "add" && argc == 3)
88 f = fopen(strcat("maps/", argv(2), ".bsp"), FILE_READ);
92 print("maplist: ERROR: ", argv(2), " does not exist!\n");
95 if(cvar_string("g_maplist") == "")
96 cvar_set("g_maplist", argv(2));
98 cvar_set("g_maplist", strcat(argv(2), " ", cvar_string("g_maplist")));
100 f = fopen(strcat("maps/", argv(2), ".mapcfg"), FILE_READ);
104 print("maplist: ERROR: ", argv(2), " does not exist!\n");
107 cvar_set("g_maplist", strcat("'", argv(2), "'", cvar_string("g_maplist")));
111 else if(argv(1) == "remove" && argc == 3)
115 n = tokenizebyseparator(cvar_string("g_maplist"), " ");
117 n = tokenize(cvar_string("g_maplist"));
120 for(i = 0; i < n; ++i)
124 s2 = strcat(s2, " ", argv(i));
126 s2 = strcat(s2, "'", argv(i), "'");
130 s2 = substring(s2, 1, strlen(s2) - 1);
132 cvar_set("g_maplist", s2);
135 else if(argv(1) == "shuffle" && argc == 2)
137 s = cvar_string("g_maplist");
139 for(i = 1; i < (n = tokenizebyseparator(s, " ")); ++i)
141 for(i = 1; i < (n = tokenize(s)); ++i)
144 // swap i-th item at a random position from 0 to i
145 // proof for even distribution:
148 // item n+1 gets at any position with chance 1/(n+1)
149 // all others will get their 1/n chance reduced by factor n/(n+1)
150 // to be on place n+1, their chance will be 1/(n+1)
151 // 1/n * n/(n+1) = 1/(n+1)
153 f = ceil(random() * (i + 1)) - 1; // 0 to i
155 continue; // no change
158 for(j = 0; j < n; ++j)
160 s2 = strcat(s2, " ", argv((j == i) ? f : (j == f) ? i : j));
161 s = substring(s2, 1, strlen(s2) - 1);
163 s2 = strcat(s2, "'", argv((j == i) ? f : (j == f) ? i : j), "'");
167 cvar_set("g_maplist", s);
171 else if(argv(0) == "rpn")
175 rpn_db = db_create();
176 db_put(rpn_db, "stack.pointer", "0");
177 db_put(rpn_db, "stack.pos", "-1");
186 for(rpnpos = 1; rpnpos < argc; ++rpnpos)
188 rpncmd = argv(rpnpos);
191 } else if(stof(substring(rpncmd, 0, 1)) > 0) {
193 } else if(substring(rpncmd, 0, 1) == "0") {
195 } else if(f >= 2 && substring(rpncmd, 0, 1) == "+") {
197 } else if(f >= 2 && substring(rpncmd, 0, 1) == "-") {
199 } else if(f >= 2 && substring(rpncmd, 0, 1) == "/") {
200 rpn_push(substring(rpncmd, 1, strlen(rpncmd) - 1));
201 } else if(rpncmd == "clear") {
203 } else if(rpncmd == "def" || rpncmd == "=") {
207 registercvar(s2, "", 0);
209 registercvar(s2, "");
211 if(!rpn_error) // don't change cvars if a stack error had happened!
213 } else if(rpncmd == "defs" || rpncmd == "@") {
217 while(rpn_sp > 1 && (j || i > 0))
219 s = strcat("/", rpn_pop(), " ", s);
224 registercvar(s2, "", 0);
226 registercvar(s2, "");
228 if(!rpn_error) // don't change cvars if a stack error had happened!
230 } else if(rpncmd == "load") {
231 rpn_set(cvar_string(rpn_get()));
232 } else if(rpncmd == "exch") {
237 } else if(rpncmd == "dup") {
239 } else if(rpncmd == "pop") {
241 } else if(rpncmd == "add" || rpncmd == "+") {
243 rpn_setf(rpn_getf() + f);
244 } else if(rpncmd == "sub" || rpncmd == "-") {
246 rpn_setf(rpn_getf() - f);
247 } else if(rpncmd == "mul" || rpncmd == "*") {
249 rpn_setf(rpn_getf() * f);
250 } else if(rpncmd == "div" || rpncmd == "/") {
252 rpn_setf(rpn_getf() / f);
253 } else if(rpncmd == "mod" || rpncmd == "%") {
256 rpn_setf(f2 - f * floor(f2 / f));
257 } else if(rpncmd == "abs") {
258 rpn_setf(fabs(rpn_getf()));
259 } else if(rpncmd == "sgn") {
267 } else if(rpncmd == "neg" || rpncmd == "~") {
268 rpn_setf(-rpn_getf());
269 } else if(rpncmd == "floor" || rpncmd == "f") {
270 rpn_setf(floor(rpn_getf()));
271 } else if(rpncmd == "ceil" || rpncmd == "c") {
272 rpn_setf(ceil(rpn_getf()));
273 } else if(rpncmd == "max") {
276 rpn_setf(max(f2, f));
277 } else if(rpncmd == "min") {
280 rpn_setf(min(f2, f));
281 } else if(rpncmd == "bound") {
285 rpn_setf(bound(f3, f2, f));
286 } else if(rpncmd == "when") {
294 } else if(rpncmd == ">" || rpncmd == "gt") {
296 rpn_setf(rpn_getf() > f);
297 } else if(rpncmd == "<" || rpncmd == "lt") {
299 rpn_setf(rpn_getf() < f);
300 } else if(rpncmd == "==" || rpncmd == "eq") {
302 rpn_setf(rpn_getf() == f);
303 } else if(rpncmd == ">=" || rpncmd == "ge") {
305 rpn_setf(rpn_getf() >= f);
306 } else if(rpncmd == "<=" || rpncmd == "le") {
308 rpn_setf(rpn_getf() <= f);
309 } else if(rpncmd == "!=" || rpncmd == "ne") {
311 rpn_setf(rpn_getf() != f);
312 } else if(rpncmd == "rand") {
313 rpn_setf(ceil(random() * rpn_getf()) - 1);
314 } else if(rpncmd == "dbpush") {
318 i = stof(db_get(rpn_db, "stack.pointer"));
319 db_put(rpn_db, "stack.pointer", ftos(i+1));
320 db_put(rpn_db, strcat("stack.", ftos(i)), s);
323 db_put(rpn_db, "stack.pos", "0");
324 } else if(rpncmd == "dbpop") {
325 i = stof(db_get(rpn_db, "stack.pointer"));
329 db_put(rpn_db, "stack.pointer", s);
330 rpn_push(db_get(rpn_db, strcat("stack.", s)));
331 j = stof(db_get(rpn_db, "stack.pos"));
333 db_put(rpn_db, "stack.pos", ftos(i-2));
336 print("rpn: database underflow\n");
338 } else if(rpncmd == "dbget") {
340 i = stof(db_get(rpn_db, "stack.pointer"));
343 rpn_push(db_get(rpn_db, strcat("stack.", ftos(i-1))));
346 print("rpn: database empty\n");
348 } else if(rpncmd == "dblen") {
349 rpn_push(db_get(rpn_db, "stack.pointer"));
350 } else if(rpncmd == "dbins") {
355 j = stof(db_get(rpn_db, "stack.pointer"));
356 i = stof(db_get(rpn_db, "stack.pos"));
361 db_put(rpn_db, "stack.pos", "0");
364 db_put(rpn_db, "stack.pointer", ftos(j+1));
365 for(--j; j >= i; --j)
367 db_put(rpn_db, strcat("stack.", ftos(j+1)),
368 db_get(rpn_db, (strcat("stack.", ftos(j))))
371 db_put(rpn_db, strcat("stack.", ftos(i)), s);
373 } else if(rpncmd == "dbext") {
374 j = stof(db_get(rpn_db, "stack.pointer"));
375 i = stof(db_get(rpn_db, "stack.pos"));
379 print("rpn: empty database\n");
382 rpn_push(db_get(rpn_db, strcat("stack.", ftos(i))));
383 db_put(rpn_db, "stack.pointer", ftos(j));
386 db_put(rpn_db, "stack.pos", ftos(j-1));
390 db_put(rpn_db, strcat("stack.", ftos(i)),
391 db_get(rpn_db, (strcat("stack.", ftos(i+1))))
397 } else if(rpncmd == "dbread") {
398 s = db_get(rpn_db, "stack.pos");
401 rpn_push(db_get(rpn_db, strcat("stack.", s)));
404 print("rpn: empty database\n");
406 } else if(rpncmd == "dbat") {
407 rpn_push(db_get(rpn_db, "stack.pos"));
408 } else if(rpncmd == "dbmov") {
409 j = stof(db_get(rpn_db, "stack.pointer"));
410 i = stof(db_get(rpn_db, "stack.pos"));
416 print("rpn: database cursor out of bounds\n");
421 db_put(rpn_db, "stack.pos", ftos(i));
424 } else if(rpncmd == "dbgoto") {
426 j = stof(db_get(rpn_db, "stack.pointer"));
430 print("rpn: empty database, cannot move cursor\n");
435 i = stof(db_get(rpn_db, "stack.pointer"))-1;
441 j = stof(db_get(rpn_db, "stack.pointer"));
444 print("rpn: database cursor destination out of bounds\n");
449 db_put(rpn_db, "stack.pos", ftos(i));
452 } else if(rpncmd == "union") {
457 f2 = tokenize(strcat(s, " ", s2));
458 // tokens 0..(f-1) represent s
459 // tokens f..f2 represent s2
460 // UNION: add all tokens to s that are in s2 but not in s
462 for(i = 0; i < f; ++i)
463 s = strcat(s, " ", argv(i));
464 for(i = f; i < f2; ++i) {
465 for(j = 0; j < f; ++j)
466 if(argv(i) == argv(j))
468 s = strcat(s, " ", argv(i));
471 if(substring(s, 0, 1) == " ")
472 s = substring(s, 1, 99999);
475 } else if(rpncmd == "intersection") {
480 f2 = tokenize(strcat(s, " ", s2));
481 // tokens 0..(f-1) represent s
482 // tokens f..f2 represent s2
483 // INTERSECTION: keep only the tokens from s that are also in s2
485 for(i = 0; i < f; ++i) {
486 for(j = f; j < f2; ++j)
487 if(argv(i) == argv(j))
489 s = strcat(s, " ", argv(i));
493 if(substring(s, 0, 1) == " ")
494 s = substring(s, 1, 99999);
497 } else if(rpncmd == "difference") {
502 f2 = tokenize(strcat(s, " ", s2));
503 // tokens 0..(f-1) represent s
504 // tokens f..f2 represent s2
505 // DIFFERENCE: keep only the tokens from s that are not in s2
507 for(i = 0; i < f; ++i) {
508 for(j = f; j < f2; ++j)
509 if(argv(i) == argv(j))
510 goto skip_difference;
511 s = strcat(s, " ", argv(i));
514 if(substring(s, 0, 1) == " ")
515 s = substring(s, 1, 99999);
518 } else if(rpncmd == "shuffle") {
523 for(i = 0; i < f - 1; ++i) {
524 // move a random item from i..f-1 to position i
526 f2 = ceil(random() * (f - i) + i) - 1;
527 for(j = 0; j < i; ++j)
528 s = strcat(s, " ", argv(j));
529 s = strcat(s, " ", argv(f2));
530 for(j = i; j < f; ++j)
532 s = strcat(s, " ", argv(j));
536 if(substring(s, 0, 1) == " ")
537 s = substring(s, 1, 99999);
540 } else if(rpncmd == "fexists_assert") {
544 f = fopen(s, FILE_READ);
548 print("rpn: ERROR: ", s, " does not exist!\n");
553 rpn_push(cvar_string(rpncmd));
561 print("rpn: still on stack: ", s, "\n");