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");
85 if(argv(0) == "maplist")
87 if(argv(1) == "add" && argc == 3)
89 f = fopen(strcat("maps/", argv(2), ".bsp"), FILE_READ);
93 print("maplist: ERROR: ", argv(2), " does not exist!\n");
96 if(cvar_string("g_maplist") == "")
97 cvar_set("g_maplist", argv(2));
99 cvar_set("g_maplist", strcat(argv(2), " ", cvar_string("g_maplist")));
102 else if(argv(1) == "remove" && argc == 3)
105 n = tokenizebyseparator(cvar_string("g_maplist"), " ");
107 for(i = 0; i < n; ++i)
110 s2 = strcat(s2, " ", argv(i));
112 s2 = substring(s2, 1, strlen(s2) - 1);
113 cvar_set("g_maplist", s2);
116 else if(argv(1) == "shuffle" && argc == 2)
118 s = cvar_string("g_maplist");
119 for(i = 1; i < (n = tokenizebyseparator(s, " ")); ++i)
121 // swap i-th item at a random position from 0 to i
122 // proof for even distribution:
125 // item n+1 gets at any position with chance 1/(n+1)
126 // all others will get their 1/n chance reduced by factor n/(n+1)
127 // to be on place n+1, their chance will be 1/(n+1)
128 // 1/n * n/(n+1) = 1/(n+1)
130 f = floor(random() * (i + 1)); // 0 to i
132 continue; // no change
135 for(j = 0; j < n; ++j)
136 s2 = strcat(s2, " ", argv((j == i) ? f : (j == f) ? i : j));
137 s = substring(s2, 1, strlen(s2) - 1);
139 cvar_set("g_maplist", s);
143 else if(argv(0) == "rpn")
147 rpn_db = db_create();
148 db_put(rpn_db, "stack.pointer", "0");
149 db_put(rpn_db, "stack.pos", "-1");
158 for(rpnpos = 1; rpnpos < argc; ++rpnpos)
160 rpncmd = argv(rpnpos);
163 } else if(stof(substring(rpncmd, 0, 1)) > 0) {
165 } else if(substring(rpncmd, 0, 1) == "0") {
167 } else if(f >= 2 && substring(rpncmd, 0, 1) == "+") {
169 } else if(f >= 2 && substring(rpncmd, 0, 1) == "-") {
171 } else if(f >= 2 && substring(rpncmd, 0, 1) == "/") {
172 rpn_push(substring(rpncmd, 1, strlen(rpncmd) - 1));
173 } else if(rpncmd == "clear") {
175 } else if(rpncmd == "def" || rpncmd == "=") {
179 registercvar(s2, "", 0);
181 registercvar(s2, "");
183 if(!rpn_error) // don't change cvars if a stack error had happened!
185 } else if(rpncmd == "defs" || rpncmd == "@") {
189 while(rpn_sp > 1 && (j || i > 0))
191 s = strcat("/", rpn_pop(), " ", s);
196 registercvar(s2, "", 0);
198 registercvar(s2, "");
200 if(!rpn_error) // don't change cvars if a stack error had happened!
202 } else if(rpncmd == "load") {
203 rpn_set(cvar_string(rpn_get()));
204 } else if(rpncmd == "exch") {
209 } else if(rpncmd == "dup") {
211 } else if(rpncmd == "pop") {
213 } else if(rpncmd == "add" || rpncmd == "+") {
215 rpn_setf(rpn_getf() + f);
216 } else if(rpncmd == "sub" || rpncmd == "-") {
218 rpn_setf(rpn_getf() - f);
219 } else if(rpncmd == "mul" || rpncmd == "*") {
221 rpn_setf(rpn_getf() * f);
222 } else if(rpncmd == "div" || rpncmd == "/") {
224 rpn_setf(rpn_getf() / f);
225 } else if(rpncmd == "mod" || rpncmd == "%") {
228 rpn_setf(f2 - f * floor(f2 / f));
229 } else if(rpncmd == "abs") {
230 rpn_setf(fabs(rpn_getf()));
231 } else if(rpncmd == "sgn") {
239 } else if(rpncmd == "neg" || rpncmd == "~") {
240 rpn_setf(-rpn_getf());
241 } else if(rpncmd == "floor" || rpncmd == "f") {
242 rpn_setf(floor(rpn_getf()));
243 } else if(rpncmd == "ceil" || rpncmd == "c") {
244 rpn_setf(ceil(rpn_getf()));
245 } else if(rpncmd == "max") {
248 rpn_setf(max(f2, f));
249 } else if(rpncmd == "min") {
252 rpn_setf(min(f2, f));
253 } else if(rpncmd == "bound") {
257 rpn_setf(bound(f3, f2, f));
258 } else if(rpncmd == "when") {
266 } else if(rpncmd == ">" || rpncmd == "gt") {
268 rpn_setf(rpn_getf() > f);
269 } else if(rpncmd == "<" || rpncmd == "lt") {
271 rpn_setf(rpn_getf() < f);
272 } else if(rpncmd == "==" || rpncmd == "eq") {
274 rpn_setf(rpn_getf() == f);
275 } else if(rpncmd == ">=" || rpncmd == "ge") {
277 rpn_setf(rpn_getf() >= f);
278 } else if(rpncmd == "<=" || rpncmd == "le") {
280 rpn_setf(rpn_getf() <= f);
281 } else if(rpncmd == "!=" || rpncmd == "ne") {
283 rpn_setf(rpn_getf() != f);
284 } else if(rpncmd == "rand") {
285 rpn_setf(ceil(random() * rpn_getf()) - 1);
286 } else if(rpncmd == "dbpush") {
290 i = stof(db_get(rpn_db, "stack.pointer"));
291 db_put(rpn_db, "stack.pointer", ftos(i+1));
292 db_put(rpn_db, strcat("stack.", ftos(i)), s);
295 db_put(rpn_db, "stack.pos", "0");
296 } else if(rpncmd == "dbpop") {
297 i = stof(db_get(rpn_db, "stack.pointer"));
301 db_put(rpn_db, "stack.pointer", s);
302 rpn_push(db_get(rpn_db, strcat("stack.", s)));
303 j = stof(db_get(rpn_db, "stack.pos"));
305 db_put(rpn_db, "stack.pos", ftos(i-2));
308 print("rpn: database underflow\n");
310 } else if(rpncmd == "dbget") {
312 i = stof(db_get(rpn_db, "stack.pointer"));
315 rpn_push(db_get(rpn_db, strcat("stack.", ftos(i-1))));
318 print("rpn: database empty\n");
320 } else if(rpncmd == "dblen") {
321 rpn_push(db_get(rpn_db, "stack.pointer"));
322 } else if(rpncmd == "dbclr") {
324 rpn_db = db_create();
325 db_put(rpn_db, "stack.pointer", "0");
326 db_put(rpn_db, "stack.pos", "-1");
327 } else if(rpncmd == "dbsave") {
331 } else if(rpncmd == "dbload") {
338 } else if(rpncmd == "dbins") {
343 j = stof(db_get(rpn_db, "stack.pointer"));
344 i = stof(db_get(rpn_db, "stack.pos"));
349 db_put(rpn_db, "stack.pos", "0");
352 db_put(rpn_db, "stack.pointer", ftos(j+1));
353 for(--j; j >= i; --j)
355 db_put(rpn_db, strcat("stack.", ftos(j+1)),
356 db_get(rpn_db, (strcat("stack.", ftos(j))))
359 db_put(rpn_db, strcat("stack.", ftos(i)), s);
361 } else if(rpncmd == "dbext") {
362 j = stof(db_get(rpn_db, "stack.pointer"));
363 i = stof(db_get(rpn_db, "stack.pos"));
367 print("rpn: empty database\n");
370 rpn_push(db_get(rpn_db, strcat("stack.", ftos(i))));
371 db_put(rpn_db, "stack.pointer", ftos(j));
374 db_put(rpn_db, "stack.pos", ftos(j-1));
378 db_put(rpn_db, strcat("stack.", ftos(i)),
379 db_get(rpn_db, (strcat("stack.", ftos(i+1))))
385 } else if(rpncmd == "dbread") {
386 s = db_get(rpn_db, "stack.pos");
389 rpn_push(db_get(rpn_db, strcat("stack.", s)));
392 print("rpn: empty database\n");
394 } else if(rpncmd == "dbat") {
395 rpn_push(db_get(rpn_db, "stack.pos"));
396 } else if(rpncmd == "dbmov") {
397 j = stof(db_get(rpn_db, "stack.pointer"));
398 i = stof(db_get(rpn_db, "stack.pos"));
404 print("rpn: database cursor out of bounds\n");
409 db_put(rpn_db, "stack.pos", ftos(i));
412 } else if(rpncmd == "dbgoto") {
414 j = stof(db_get(rpn_db, "stack.pointer"));
418 print("rpn: empty database, cannot move cursor\n");
423 i = stof(db_get(rpn_db, "stack.pointer"))-1;
429 j = stof(db_get(rpn_db, "stack.pointer"));
432 print("rpn: database cursor destination out of bounds\n");
437 db_put(rpn_db, "stack.pos", ftos(i));
440 } else if(rpncmd == "union") {
444 f = tokenize_sane(s);
445 f2 = tokenize_sane(strcat(s, " ", s2));
446 // tokens 0..(f-1) represent s
447 // tokens f..f2 represent s2
448 // UNION: add all tokens to s that are in s2 but not in s
450 for(i = 0; i < f; ++i)
451 s = strcat(s, " ", argv(i));
452 for(i = f; i < f2; ++i) {
453 for(j = 0; j < f; ++j)
454 if(argv(i) == argv(j))
456 s = strcat(s, " ", argv(i));
459 if(substring(s, 0, 1) == " ")
460 s = substring(s, 1, 99999);
462 tokenize_sane(command);
463 } else if(rpncmd == "intersection") {
467 f = tokenize_sane(s);
468 f2 = tokenize_sane(strcat(s, " ", s2));
469 // tokens 0..(f-1) represent s
470 // tokens f..f2 represent s2
471 // INTERSECTION: keep only the tokens from s that are also in s2
473 for(i = 0; i < f; ++i) {
474 for(j = f; j < f2; ++j)
475 if(argv(i) == argv(j))
477 s = strcat(s, " ", argv(i));
481 if(substring(s, 0, 1) == " ")
482 s = substring(s, 1, 99999);
484 tokenize_sane(command);
485 } else if(rpncmd == "difference") {
489 f = tokenize_sane(s);
490 f2 = tokenize_sane(strcat(s, " ", s2));
491 // tokens 0..(f-1) represent s
492 // tokens f..f2 represent s2
493 // DIFFERENCE: keep only the tokens from s that are not in s2
495 for(i = 0; i < f; ++i) {
496 for(j = f; j < f2; ++j)
497 if(argv(i) == argv(j))
498 goto skip_difference;
499 s = strcat(s, " ", argv(i));
502 if(substring(s, 0, 1) == " ")
503 s = substring(s, 1, 99999);
505 tokenize_sane(command);
506 } else if(rpncmd == "shuffle") {
509 f = tokenize_sane(s);
511 for(i = 0; i < f - 1; ++i) {
512 // move a random item from i..f-1 to position i
514 f2 = floor(random() * (f - i) + i);
515 for(j = 0; j < i; ++j)
516 s = strcat(s, " ", argv(j));
517 s = strcat(s, " ", argv(f2));
518 for(j = i; j < f; ++j)
520 s = strcat(s, " ", argv(j));
521 f = tokenize_sane(s);
524 if(substring(s, 0, 1) == " ")
525 s = substring(s, 1, 99999);
527 tokenize_sane(command);
528 } else if(rpncmd == "fexists_assert") {
532 f = fopen(s, FILE_READ);
536 print("rpn: ERROR: ", s, " does not exist!\n");
541 rpn_push(cvar_string(rpncmd));
549 print("rpn: still on stack: ", s, "\n");
554 } else if(argv(0) == "cp") {
558 for(i = 2; i < argc; ++i)
559 s = strcat(s, " ", argv(i));
560 centerprint(unescape(s));