guanli.h
来自「C实现的MUD,对大家基本入门网络游戏很有帮助!」· C头文件 代码 · 共 94 行
H
94 行
// create by snowcat.c 2/8/1997#include <command.h>#include <ground.h>void init (){ set("no_fight",1); set("no_magic",1); set("no_quit",1); add_action ("do_look","look");}void write_objects (object room, object who){ mixed *inv = all_inventory (room); int i = sizeof(inv); while (i--) { object ob = inv[i]; if (! who->visible(ob) || ob == who) continue; write (" "+ob->short()+"\n"); }}int do_look (string arg){ object who = this_player(); object room = environment(who); if (arg) return 0; LOOK_CMD->look_room(who,room); room = load_object (__DIR__"ground"); if (! room) return 1; write ("\n -------〖赛场内〗-------\n"); write (room->query("long")); write_objects(room, who); write ("\n -------------------\n"); return 1; }int can_enter (object who){ object ground = load_object (__DIR__"ground"); int step; int mode; mapping teams; if (! ground) return notify_fail ("对不起,您不能进入比赛场地。\n"); step = ground->query("match/step"); mode = ground->query("match/mode"); teams = ground->query("match/teams"); if (step == STEP_PREPARE) return notify_fail ("对不起,比赛尚未开始,您不能进入场地。\n"); if (step == STEP_FINISH) return notify_fail ("对不起,比赛已经结束,您不能进入场地。\n"); if (mode == MODE_SINGLE_SD) { object *inv = all_inventory(ground); int i, j; i = sizeof (inv); j = 0; while (i--) { if (userp(inv[i]) && !wizardp(inv[i])) j++; } if (j >= 2) return notify_fail ("对不起,场上已经有选手比赛,您不能进去。\n"); } else { if (! teams) return notify_fail ("对不起,场上已尚未组队,您不能进去。\n"); if (teams["current_player0_id"] != who->query("id") && teams["current_player1_id"] != who->query("id")) return notify_fail ("对不起,您不是选手,不能进入场地。\n"); } return 1;}
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?