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_sane(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(" dbclr -----------------------------> : clear the DB\n");
73 print(" s dbsave|dbload--------------------> : save/load the DB to/from a file\n");
74 print(" x dbins ---------------------------> : moves the top into the DB\n");
75 print(" dbext|dbread ----------------------> x : extract/get from the DB's cursor\n");
76 print(" f dbmov|dbgoto --------------------> : move or set the DB's cursor\n");
77 print(" Set operations operate on 'such''strings'.\n");
78 print(" Unknown tokens insert their cvar value.\n");
79 print(" maplist add map\n");
80 print(" maplist remove map\n");
81 print(" maplist shuffle\n");
82 print(" suggestmap map\n");
86 if(argv(0) == "maplist")
88 if(argv(1) == "add" && argc == 3)
90 f = fopen(strcat("maps/", argv(2), ".bsp"), FILE_READ);
94 print("maplist: ERROR: ", argv(2), " does not exist!\n");
97 if(cvar_string("g_maplist") == "")
98 cvar_set("g_maplist", argv(2));
100 cvar_set("g_maplist", strcat(argv(2), " ", cvar_string("g_maplist")));
103 else if(argv(1) == "remove" && argc == 3)
106 n = tokenizebyseparator(cvar_string("g_maplist"), " ");
108 for(i = 0; i < n; ++i)
111 s2 = strcat(s2, " ", argv(i));
113 s2 = substring(s2, 1, strlen(s2) - 1);
114 cvar_set("g_maplist", s2);
117 else if(argv(1) == "shuffle" && argc == 2)
119 s = cvar_string("g_maplist");
120 for(i = 1; i < (n = tokenizebyseparator(s, " ")); ++i)
122 // swap i-th item at a random position from 0 to i
123 // proof for even distribution:
126 // item n+1 gets at any position with chance 1/(n+1)
127 // all others will get their 1/n chance reduced by factor n/(n+1)
128 // to be on place n+1, their chance will be 1/(n+1)
129 // 1/n * n/(n+1) = 1/(n+1)
131 f = floor(random() * (i + 1)); // 0 to i
133 continue; // no change
136 for(j = 0; j < n; ++j)
137 s2 = strcat(s2, " ", argv((j == i) ? f : (j == f) ? i : j));
138 s = substring(s2, 1, strlen(s2) - 1);
140 cvar_set("g_maplist", s);
144 else if(argv(0) == "rpn")
148 rpn_db = db_create();
149 db_put(rpn_db, "stack.pointer", "0");
150 db_put(rpn_db, "stack.pos", "-1");
159 for(rpnpos = 1; rpnpos < argc; ++rpnpos)
161 rpncmd = argv(rpnpos);
164 } else if(stof(substring(rpncmd, 0, 1)) > 0) {
166 } else if(substring(rpncmd, 0, 1) == "0") {
168 } else if(f >= 2 && substring(rpncmd, 0, 1) == "+") {
170 } else if(f >= 2 && substring(rpncmd, 0, 1) == "-") {
172 } else if(f >= 2 && substring(rpncmd, 0, 1) == "/") {
173 rpn_push(substring(rpncmd, 1, strlen(rpncmd) - 1));
174 } else if(rpncmd == "clear") {
176 } else if(rpncmd == "def" || rpncmd == "=") {
180 registercvar(s2, "", 0);
182 registercvar(s2, "");
184 if(!rpn_error) // don't change cvars if a stack error had happened!
186 } else if(rpncmd == "defs" || rpncmd == "@") {
190 while(rpn_sp > 1 && (j || i > 0))
192 s = strcat("/", rpn_pop(), " ", s);
197 registercvar(s2, "", 0);
199 registercvar(s2, "");
201 if(!rpn_error) // don't change cvars if a stack error had happened!
203 } else if(rpncmd == "load") {
204 rpn_set(cvar_string(rpn_get()));
205 } else if(rpncmd == "exch") {
210 } else if(rpncmd == "dup") {
212 } else if(rpncmd == "pop") {
214 } else if(rpncmd == "add" || rpncmd == "+") {
216 rpn_setf(rpn_getf() + f);
217 } else if(rpncmd == "sub" || rpncmd == "-") {
219 rpn_setf(rpn_getf() - f);
220 } else if(rpncmd == "mul" || rpncmd == "*") {
222 rpn_setf(rpn_getf() * f);
223 } else if(rpncmd == "div" || rpncmd == "/") {
225 rpn_setf(rpn_getf() / f);
226 } else if(rpncmd == "mod" || rpncmd == "%") {
229 rpn_setf(f2 - f * floor(f2 / f));
230 } else if(rpncmd == "abs") {
231 rpn_setf(fabs(rpn_getf()));
232 } else if(rpncmd == "sgn") {
240 } else if(rpncmd == "neg" || rpncmd == "~") {
241 rpn_setf(-rpn_getf());
242 } else if(rpncmd == "floor" || rpncmd == "f") {
243 rpn_setf(floor(rpn_getf()));
244 } else if(rpncmd == "ceil" || rpncmd == "c") {
245 rpn_setf(ceil(rpn_getf()));
246 } else if(rpncmd == "max") {
249 rpn_setf(max(f2, f));
250 } else if(rpncmd == "min") {
253 rpn_setf(min(f2, f));
254 } else if(rpncmd == "bound") {
258 rpn_setf(bound(f3, f2, f));
259 } else if(rpncmd == "when") {
267 } else if(rpncmd == ">" || rpncmd == "gt") {
269 rpn_setf(rpn_getf() > f);
270 } else if(rpncmd == "<" || rpncmd == "lt") {
272 rpn_setf(rpn_getf() < f);
273 } else if(rpncmd == "==" || rpncmd == "eq") {
275 rpn_setf(rpn_getf() == f);
276 } else if(rpncmd == ">=" || rpncmd == "ge") {
278 rpn_setf(rpn_getf() >= f);
279 } else if(rpncmd == "<=" || rpncmd == "le") {
281 rpn_setf(rpn_getf() <= f);
282 } else if(rpncmd == "!=" || rpncmd == "ne") {
284 rpn_setf(rpn_getf() != f);
285 } else if(rpncmd == "rand") {
286 rpn_setf(ceil(random() * rpn_getf()) - 1);
287 } else if(rpncmd == "dbpush") {
291 i = stof(db_get(rpn_db, "stack.pointer"));
292 db_put(rpn_db, "stack.pointer", ftos(i+1));
293 db_put(rpn_db, strcat("stack.", ftos(i)), s);
296 db_put(rpn_db, "stack.pos", "0");
297 } else if(rpncmd == "dbpop") {
298 i = stof(db_get(rpn_db, "stack.pointer"));
302 db_put(rpn_db, "stack.pointer", s);
303 rpn_push(db_get(rpn_db, strcat("stack.", s)));
304 j = stof(db_get(rpn_db, "stack.pos"));
306 db_put(rpn_db, "stack.pos", ftos(i-2));
309 print("rpn: database underflow\n");
311 } else if(rpncmd == "dbget") {
313 i = stof(db_get(rpn_db, "stack.pointer"));
316 rpn_push(db_get(rpn_db, strcat("stack.", ftos(i-1))));
319 print("rpn: database empty\n");
321 } else if(rpncmd == "dblen") {
322 rpn_push(db_get(rpn_db, "stack.pointer"));
323 } else if(rpncmd == "dbclr") {
325 rpn_db = db_create();
326 db_put(rpn_db, "stack.pointer", "0");
327 db_put(rpn_db, "stack.pos", "-1");
328 } else if(rpncmd == "dbsave") {
332 } else if(rpncmd == "dbload") {
339 } else if(rpncmd == "dbins") {
344 j = stof(db_get(rpn_db, "stack.pointer"));
345 i = stof(db_get(rpn_db, "stack.pos"));
350 db_put(rpn_db, "stack.pos", "0");
353 db_put(rpn_db, "stack.pointer", ftos(j+1));
354 for(--j; j >= i; --j)
356 db_put(rpn_db, strcat("stack.", ftos(j+1)),
357 db_get(rpn_db, (strcat("stack.", ftos(j))))
360 db_put(rpn_db, strcat("stack.", ftos(i)), s);
362 } else if(rpncmd == "dbext") {
363 j = stof(db_get(rpn_db, "stack.pointer"));
364 i = stof(db_get(rpn_db, "stack.pos"));
368 print("rpn: empty database\n");
371 rpn_push(db_get(rpn_db, strcat("stack.", ftos(i))));
372 db_put(rpn_db, "stack.pointer", ftos(j));
375 db_put(rpn_db, "stack.pos", ftos(j-1));
379 db_put(rpn_db, strcat("stack.", ftos(i)),
380 db_get(rpn_db, (strcat("stack.", ftos(i+1))))
386 } else if(rpncmd == "dbread") {
387 s = db_get(rpn_db, "stack.pos");
390 rpn_push(db_get(rpn_db, strcat("stack.", s)));
393 print("rpn: empty database\n");
395 } else if(rpncmd == "dbat") {
396 rpn_push(db_get(rpn_db, "stack.pos"));
397 } else if(rpncmd == "dbmov") {
398 j = stof(db_get(rpn_db, "stack.pointer"));
399 i = stof(db_get(rpn_db, "stack.pos"));
405 print("rpn: database cursor out of bounds\n");
410 db_put(rpn_db, "stack.pos", ftos(i));
413 } else if(rpncmd == "dbgoto") {
415 j = stof(db_get(rpn_db, "stack.pointer"));
419 print("rpn: empty database, cannot move cursor\n");
424 i = stof(db_get(rpn_db, "stack.pointer"))-1;
430 j = stof(db_get(rpn_db, "stack.pointer"));
433 print("rpn: database cursor destination out of bounds\n");
438 db_put(rpn_db, "stack.pos", ftos(i));
441 } else if(rpncmd == "union") {
445 f = tokenize_sane(s);
446 f2 = tokenize_sane(strcat(s, " ", s2));
447 // tokens 0..(f-1) represent s
448 // tokens f..f2 represent s2
449 // UNION: add all tokens to s that are in s2 but not in s
451 for(i = 0; i < f; ++i)
452 s = strcat(s, " ", argv(i));
453 for(i = f; i < f2; ++i) {
454 for(j = 0; j < f; ++j)
455 if(argv(i) == argv(j))
457 s = strcat(s, " ", argv(i));
460 if(substring(s, 0, 1) == " ")
461 s = substring(s, 1, 99999);
463 tokenize_sane(command);
464 } else if(rpncmd == "intersection") {
468 f = tokenize_sane(s);
469 f2 = tokenize_sane(strcat(s, " ", s2));
470 // tokens 0..(f-1) represent s
471 // tokens f..f2 represent s2
472 // INTERSECTION: keep only the tokens from s that are also in s2
474 for(i = 0; i < f; ++i) {
475 for(j = f; j < f2; ++j)
476 if(argv(i) == argv(j))
478 s = strcat(s, " ", argv(i));
482 if(substring(s, 0, 1) == " ")
483 s = substring(s, 1, 99999);
485 tokenize_sane(command);
486 } else if(rpncmd == "difference") {
490 f = tokenize_sane(s);
491 f2 = tokenize_sane(strcat(s, " ", s2));
492 // tokens 0..(f-1) represent s
493 // tokens f..f2 represent s2
494 // DIFFERENCE: keep only the tokens from s that are not in s2
496 for(i = 0; i < f; ++i) {
497 for(j = f; j < f2; ++j)
498 if(argv(i) == argv(j))
499 goto skip_difference;
500 s = strcat(s, " ", argv(i));
503 if(substring(s, 0, 1) == " ")
504 s = substring(s, 1, 99999);
506 tokenize_sane(command);
507 } else if(rpncmd == "shuffle") {
510 f = tokenize_sane(s);
512 for(i = 0; i < f - 1; ++i) {
513 // move a random item from i..f-1 to position i
515 f2 = floor(random() * (f - i) + i);
516 for(j = 0; j < i; ++j)
517 s = strcat(s, " ", argv(j));
518 s = strcat(s, " ", argv(f2));
519 for(j = i; j < f; ++j)
521 s = strcat(s, " ", argv(j));
522 f = tokenize_sane(s);
525 if(substring(s, 0, 1) == " ")
526 s = substring(s, 1, 99999);
528 tokenize_sane(command);
529 } else if(rpncmd == "fexists_assert") {
533 f = fopen(s, FILE_READ);
537 print("rpn: ERROR: ", s, " does not exist!\n");
542 rpn_push(cvar_string(rpncmd));
550 print("rpn: still on stack: ", s, "\n");
555 } else if(argv(0) == "cp") {
559 for(i = 2; i < argc; ++i)
560 s = strcat(s, " ", argv(i));
561 centerprint(unescape(s));
565 } else if(argv(0) == "suggestmap") {
566 sprint(self, strcat(MapVote_Suggest(argv(1)), "\n"));