/*************************************************************************** * Original Diku Mud copyright (C) 1990, 1991 by Sebastian Hammer, * * Michael Seifert, Hans Henrik St{rfeldt, Tom Madsen, and Katja Nyboe. * * * * Merc Diku Mud improvments copyright (C) 1992, 1993 by Michael * * Chastain, Michael Quan, and Mitchell Tse. * * * * In order to use any part of this Merc Diku Mud, you must comply with * * both the original Diku license in 'license.doc' as well the Merc * * license in 'license.txt'. In particular, you may not remove either of * * these copyright notices. * * * * Much time and thought has gone into this software and you are * * benefitting. We hope that you share your changes too. What goes * * around, comes around. * ***************************************************************************/ /*************************************************************************** * ROM 2.4 is copyright 1993-1996 Russ Taylor * * ROM has been brought to you by the ROM consortium * * Russ Taylor (rtaylor@pacinfo.com) * * Gabrielle Taylor (gtaylor@pacinfo.com) * * Brian Moore (rom@rom.efn.org) * * By using this code, you have agreed to follow the terms of the * * ROM license, in the file Tartarus/doc/rom.license * ***************************************************************************/ /*************************************************************************** * Tartarus code is copyright (C) 1997-1998 by Daniel Graham * * In using this code you agree to comply with the Tartarus license * * found in the file /Tartarus/doc/tartarus.doc * ***************************************************************************/ #include "include.h" int flag_lookup (const char *name, const struct flag_type *flag_table) { int flag; for (flag = 0; flag_table[flag].name != NULL; flag++) { if (LOWER(name[0]) == LOWER(flag_table[flag].name[0]) && !str_prefix(name,flag_table[flag].name)) return flag_table[flag].bit; } return 0; } int cabal_lookup(const char *name) { int cabal; for (cabal = 0; cabal < MAX_CABAL; cabal++) { if (LOWER(name[0]) == LOWER(cabal_table[cabal].name[0]) && !str_prefix(name,cabal_table[cabal].name)) return cabal; } return 0; } int position_lookup (const char *name) { int pos; for (pos = 0; position_table[pos].name != NULL; pos++) { if (LOWER(name[0]) == LOWER(position_table[pos].name[0]) && !str_prefix(name,position_table[pos].name)) return pos; } return -1; } int sex_lookup (const char *name) { int sex; for (sex = 0; sex_table[sex].name != NULL; sex++) { if (LOWER(name[0]) == LOWER(sex_table[sex].name[0]) && !str_prefix(name,sex_table[sex].name)) return sex; } return -1; } int size_lookup (const char *name) { int size; for ( size = 0; size_table[size].name != NULL; size++) { if (LOWER(name[0]) == LOWER(size_table[size].name[0]) && !str_prefix( name,size_table[size].name)) return size; } return -1; } int empire_lookup(const char *name) { int empire; for (empire = 0; empire < MAX_EMPIRE; empire++) { if (LOWER(name[0]) == LOWER(empire_table[empire].name[0]) && !str_prefix(name,empire_table[empire].name)) return empire-1; } return -2; } int god_lookup(const char *god_name) { int god; for (god = 0; god < MAX_GOD; god++) { if (LOWER(god_name[0]) == LOWER(god_table[god].god_name[0]) && !str_prefix(god_name,god_table[god].god_name)) return god; } return 0; } HELP_DATA *help_lookup (char *keyword) { HELP_DATA *pHelp; char temp[MIL], argall[MIL]; argall[0] = '\0'; while (keyword[0] != '\0') { keyword = one_argument (keyword, temp); if (argall[0] != '\0') strcat (argall, " "); strcat (argall, temp); } for (pHelp = help_first; pHelp != NULL; pHelp = pHelp->next) if (is_name (argall, pHelp->keyword)) return pHelp; return NULL; } HELP_AREA *had_lookup (char *arg) { HELP_AREA *temp; extern HELP_AREA *had_list; for (temp = had_list; temp; temp = temp->next) if (!str_cmp (arg, temp->filename)) return temp; return NULL; }