自学教程：C++ HASH_DEL函数代码示例

void FreePunc(FcitxPuncState* puncState){    puncState->curPunc = NULL;    FcitxPunc* cur;    while (puncState->puncSet) {        cur = puncState->puncSet;        HASH_DEL(puncState->puncSet, cur);        free(cur->langCode);        free(cur->curPunc);        free(cur);    }}

void delete_file_descriptor_table(int pid) {	struct file_descriptor_table * table;	table = get_file_descriptor_table(pid);	if (table) {		HASH_DEL(file_descriptor_tables, table);		free(table->entries);		free(table);	}}

bool consolidate_gsub_single(caryll_font *font, table_otl *table, otl_subtable *_subtable,                             sds lookupName) {	subtable_gsub_single *subtable = &(_subtable->gsub_single);	consolidate_coverage(font, subtable->from, lookupName);	consolidate_coverage(font, subtable->to, lookupName);	uint16_t len =	    (subtable->from->numGlyphs < subtable->to->numGlyphs ? subtable->from->numGlyphs	                                                         : subtable->from->numGlyphs);	gsub_single_map_hash *h = NULL;	for (uint16_t k = 0; k < len; k++) {		if (subtable->from->glyphs[k].name && subtable->to->glyphs[k].name) {			gsub_single_map_hash *s;			int fromid = subtable->from->glyphs[k].gid;			HASH_FIND_INT(h, &fromid, s);			if (s) {				fprintf(stderr, "[Consolidate] Double-mapping a glyph in a "				                "single substitution /%s./n",				        subtable->from->glyphs[k].name);			} else {				NEW(s);				s->fromid = subtable->from->glyphs[k].gid;				s->toid = subtable->to->glyphs[k].gid;				s->fromname = subtable->from->glyphs[k].name;				s->toname = subtable->to->glyphs[k].name;				HASH_ADD_INT(h, fromid, s);			}		}	}	HASH_SORT(h, by_from_id);	if (HASH_COUNT(h) != subtable->from->numGlyphs || HASH_COUNT(h) != subtable->to->numGlyphs) {		fprintf(stderr, "[Consolidate] In single subsitution lookup %s, some "		                "mappings are ignored./n",		        lookupName);	}	subtable->from->numGlyphs = HASH_COUNT(h);	subtable->to->numGlyphs = HASH_COUNT(h);	FREE(subtable->from->glyphs);	FREE(subtable->to->glyphs);	NEW_N(subtable->from->glyphs, subtable->from->numGlyphs);	NEW_N(subtable->to->glyphs, subtable->to->numGlyphs);	{		gsub_single_map_hash *s, *tmp;		uint16_t j = 0;		HASH_ITER(hh, h, s, tmp) {			subtable->from->glyphs[j].gid = s->fromid;			subtable->from->glyphs[j].name = s->fromname;			subtable->to->glyphs[j].gid = s->toid;			subtable->to->glyphs[j].name = s->toname;			j++;			HASH_DEL(h, s);			free(s);		}	}

/* when an object is deleted */void cache_destroy(struct giga_directory *dir){    assert(dir->refcount > 1);    /* once to release from the caller */    __sync_fetch_and_sub(&dir->refcount, 1);    HASH_DEL(dircache, dir);    if (__sync_sub_and_fetch(&dir->refcount, 1) == 0)        free(dir);}

void augroup_remove(char *key){  log_msg("HOOK", "GROUP REMOVE");  Augroup *find;  HASH_FIND_STR(aug_tbl, key, find);  if (!find)    return;  HASH_DEL(aug_tbl, find);  free(find->key);  free(find);}

void UnloadSingleImage(FcitxSkin* sc, const char* name){    SkinImage *image;    HASH_FIND_STR(sc->imageTable, name, image);    if (image != NULL) {        SkinImage* curimage = image;        HASH_DEL(sc->imageTable, image);        free(curimage->name);        cairo_surface_destroy(curimage->image);        free(curimage);    }}

voiddelete_all (){  User *current_user;  while (users)    {      current_user = users;	/* grab pointer to first item */      HASH_DEL (users, current_user);	/* delete it (users advances to next) */      free (current_user);	/* free it */    }}

void rel_delete(rel_hash *r){    printf("/n<-- delete a rel node -->/n");	if(r)	{        pthread_mutex_lock(&rq->node[r->loc].mutex);		rq->node[r->loc].isDelete = 1;        pthread_mutex_unlock(&rq->node[r->loc].mutex);		HASH_DEL(rhs, r);        free(r);	}}

void delete_proc_hash(mem_proc_t *mem_proc){		//HASH_CLEAR(hh, mem_proc);				mem_proc_t *tmp_mem, *cur_mem;		HASH_ITER(hh, mem_proc, cur_mem, tmp_mem) {				if(mem_proc != cur_mem) 						HASH_DEL(mem_proc, cur_mem); 				if(cur_mem) free(cur_mem);  		}		//if(mem_proc) free(mem_proc);}

/* Delete specify queue by queue name from hash table */void hash_del_queue(const char* qname){    mq_queue_list_t* tmp_queue = NULL;    HASH_FIND_STR(g_mq_qlist, qname, tmp_queue);    if (tmp_queue != NULL)    {        log_debug("Del queue [%s]/n", tmp_queue->qname);        HASH_DEL(g_mq_qlist, tmp_queue); /* user: pointer to deletee */        free(tmp_queue);                     /* optional; it
C++ HASH_DataIn函数代码示例
C++ HASH_COUNT函数代码示例