void init_socials() {
// create the social table
social_table = newHashtable();
// open up the storage set
STORAGE_SET *set = storage_read(SOCIALS_FILE);
STORAGE_SET_LIST *list = read_list(set, "socials");
STORAGE_SET *social = NULL;
// parse all of the socials
while( (social = storage_list_next(list)) != NULL)
add_social(socialRead(social));
// close the storage set
storage_close(set);
// add all of the socials to the command table
HASH_ITERATOR *hash_i = newHashIterator(social_table);
const char *cmd = NULL;
SOCIAL_DATA *data = NULL;
ITERATE_HASH(cmd, data, hash_i) {
add_cmd(cmd, NULL, cmd_social, "player", FALSE);
if(data->min_pos == POS_SITTING)
add_cmd_check(cmd, chk_conscious);
else if(data->min_pos == POS_STANDING)
add_cmd_check(cmd, chk_can_move);
else if(data->max_pos == POS_STANDING)
add_cmd_check(cmd, chk_grounded);
} deleteHashIterator(hash_i);
const char *raceGetList(bool pc_only) {
static char buf[MAX_BUFFER];
LIST *name_list = newList();
HASH_ITERATOR *race_i = newHashIterator(race_table);
const char *name = NULL;
RACE_DATA *data = NULL;
// collect all of our names
ITERATE_HASH(name, data, race_i) {
if(pc_only && data->pc_ok == FALSE) continue;
listPutWith(name_list, strdup(name), strcmp);
}
deleteHashIterator(race_i);
// print all the names to our buffer
char *new_name = NULL; // gotta use a new name ptr.. can't free const
int i = 0;
while( (new_name = listPop(name_list)) != NULL) {
i += snprintf(buf+i, MAX_BUFFER-i, "%s%s",
new_name, (listSize(name_list) > 0 ? ", " : ""));
free(new_name);
}
// delete our list of names and return the buffer
deleteListWith(name_list, free);
return buf;
}
void
deleteAliasAuxData(ALIAS_AUX_DATA *data) {
if(data->aliases) {
HASH_ITERATOR *hash_i = newHashIterator(data->aliases);
const char *alias = NULL;
char *cmd = NULL;
ITERATE_HASH(alias, cmd, hash_i)
free(cmd);
deleteHashIterator(hash_i);
deleteHashtable(data->aliases);
}
free(data);
}
STORAGE_SET *aliasAuxDataStore(ALIAS_AUX_DATA *data) {
// if we have no hashtable, return an empty set
if(data->aliases == NULL || hashSize(data->aliases) == 0)
return new_storage_set();
STORAGE_SET *set = new_storage_set();
STORAGE_SET_LIST *list = new_storage_list();
HASH_ITERATOR *hash_i = newHashIterator(data->aliases);
const char *name = NULL;
const char *cmd = NULL;
store_list(set, "aliases", list);
ITERATE_HASH(name, cmd, hash_i) {
STORAGE_SET *alias_set = new_storage_set();
store_string(alias_set, "key", name);
store_string(alias_set, "val", hashIteratorCurrentVal(hash_i));
storage_list_put(list, alias_set);
}
//
// save all of the socials to disk
//
void save_socials() {
STORAGE_SET *set = new_storage_set();
LIST *soc_list = newList();
// iterate across the social table and save all of the unique socials
HASH_ITERATOR *hash_i = newHashIterator(social_table);
const char *cmd = NULL;
SOCIAL_DATA *data = NULL;
ITERATE_HASH(cmd, data, hash_i)
listPut(soc_list, data);
deleteHashIterator(hash_i);
store_list(set, "socials", gen_store_list(soc_list, socialStore));
deleteList(soc_list);
// write the set
storage_write(set, SOCIALS_FILE);
// close the set
storage_close(set);
}
