void TextResource_setParameter(TextResource tr, const char* key, const char* value) {
bstring val = ght_remove(tr->parameters,strlen(key),key);
if (val) bdestroy(val);
val = bfromcstr(value);
ght_insert(tr->parameters,val,strlen(key),key);
}
void logfile_remove_error(logfile *log, logerror *err) {
if (log->filter == NULL || (*log->filter)(err, log->filter_data) == FILTER_PASS) {
log->errors = errorlist_remove_error(log->errors, err);
} else {
log->filtered_errors = errorlist_remove_error(log->filtered_errors, err);
log->filtered_entries--;
}
ght_remove(log->errortypes, err->keylength, err->key);
logerror_destroy(err);
}
int
expireevent()
{
struct event *e;
int *count;
time_t now_t = time(NULL);
while (eventhead) {
e = eventhead;
if (e->t > now_t - 600)
break;
eventhead = e->next;
count = ght_get(passerrtable, sizeof (e->from), &e->from);
(*count)--;
if (!*count) {
ght_remove(passerrtable, sizeof (e->from), &e->from);
free(count);
}
free(e);
}
if (!eventhead)
eventtail = NULL;
return 0;
}
void* remove(const T & key) { return m_ht ? ght_remove(m_ht, sizeof(key), &key) : nullptr; }
/*!
* \em Remove the \em Data Pointer at \p key of size \p key_data.
* \return a pointer to the removed entry or nullptr if the entry
* could be found.
*/
void* remove(unsigned int key_size, const void *key_data) { return m_ht ? ght_remove(m_ht, key_size, key_data) : nullptr; }
int main(int argc,char *argv[])
{
int
rc;
char
*k,
*v,
*line,
buf[BUFSIZ];
ght_hash_table_t
*p_table=NULL;
/* create hash table of size 256 */
p_table=ght_create(256);
if (p_table == NULL)
{
print_it("Error: Could not create hash table\n");
return(1);
}
print_menu();
for (;;)
{
print_prompt();
line=fgets(buf,sizeof(buf)-1,stdin);
if (line == NULL)
break;
switch(*line)
{
case 'i':
{
k=read_data("Enter key: ");
v=read_data("Enter value: ");
if (k && v)
{
/* insert to hash table */
rc=ght_insert(p_table,
v,
strlen(k),
k);
if (rc == 0)
{
print_it("Inserted: Key=%s, Value=%s\n",
k,v);
free(k);
}
else
{
print_it("Error: ght_insert() failed\n");
(void) free((char *) k);
(void) free((char *) v);
}
}
else
{
if (k)
(void) free((char *) k);
if (v)
(void) free((char *) v);
}
break;
}
case 'r': /* replace */
{
k=read_data("Enter key: ");
v=read_data("Enter new value: ");
if (k && v)
{
char *
old_val;
/* Replace a key in the hash table */
old_val = (char*)ght_replace(p_table,
v,
strlen(k),
k);
if (old_val != NULL)
{
print_it("Replaced: Key=%s, Old Value=%s, Value=%s\n",
k,old_val, v);
free(old_val);
free(k);
}
else
{
print_it("Error: ght_replace() failed\n");
(void) free((char *) k);
(void) free((char *) v);
}
}
else
{
if (k)
(void) free((char *) k);
if (v)
(void) free((char *) v);
}
break;
}
case 'h':
{
print_menu();
break;
}
case 'n': /* number of elements */
{
print_it("Number elements in hash table: %d\n",
ght_size(p_table));
break;
}
case 's': /* size of hash table */
{
print_it("Hash table size: %d\n",
ght_table_size(p_table));
break;
}
case 't': /* dump */
{
const void
*pk,
*pv;
ght_iterator_t
iterator;
for (pv=(char *) ght_first(p_table,&iterator, &pk);
pv;
pv=(char *) ght_next(p_table,&iterator, &pk))
{
print_it("%s => %s\n",(char *) pk,(char *) pv);
}
break;
}
case 'd':
{
k=read_data("Enter key to delete: ");
if (k)
{
v=ght_remove(p_table,
strlen(k),
k);
if (v)
{
print_it("Removed %s => %s",k,v);
(void) free((char *) v);
}
else
{
print_it("Error: could not find data for key %s\n",
k);
}
(void) free((char *) k);
}
break;
}
case 'l':
{
k=read_data("Enter key: ");
if (k)
{
v=(char *) ght_get(p_table,strlen(k),k);
if (v)
{
print_it("Found: %s => %s\n",k,v);
}
else
{
print_it("No data found for key: %s\n",k);
}
(void) free((char *) k);
}
break;
}
case 'q':
{
if (p_table)
{
const void
*pv,
*pk;
ght_iterator_t
iterator;
for (pv=(char *) ght_first(p_table,&iterator, &pk);
pv;
pv=(char *) ght_next(p_table,&iterator, &pk))
{
(void) free((char *) pv);
}
ght_finalize(p_table);
}
return(0);
break;
}
default:
{
print_it("Unknown option\n");
break;
}
}
}
return(0);
}
