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

static intDddmpCuddDdArrayStorePrefixBody (  DdManager *ddMgr      /* IN: Manager */,  int n                 /* IN: Number of output nodes to be dumped */,  DdNode **f            /* IN: Array of output nodes to be dumped */,  char **inputNames     /* IN: Array of input names (or NULL) */,  char **outputNames    /* IN: Array of output names (or NULL) */,  FILE *fp              /* IN: Pointer to the dump file */  ){  st_table *visited = NULL;  int retValue;  int i;  /* Initialize symbol table for visited nodes. */  visited = st_init_table(st_ptrcmp, st_ptrhash);  Dddmp_CheckAndGotoLabel (visited==NULL,    "Error if function st_init_table.", failure);  /* Call the function that really gets the job done. */  for (i = 0; i < n; i++) {    retValue = DddmpCuddDdArrayStorePrefixStep (ddMgr, Cudd_Regular(f[i]),      fp, visited, inputNames);    Dddmp_CheckAndGotoLabel (retValue==0,      "Error if function DddmpCuddDdArrayStorePrefixStep.", failure);  }  /* To account for the possible complement on the root,   ** we put either a buffer or an inverter at the output of   ** the multiplexer representing the top node.   */  for (i=0; i<n; i++) {    if (outputNames == NULL) {      retValue = fprintf (fp,  "(BUF outNode%d ", i);    } else {      retValue = fprintf (fp,  "(BUF %s ", outputNames[i]);    }    Dddmp_CheckAndGotoLabel (retValue==EOF,      "Error during file store.", failure);    if (Cudd_IsComplement(f[i])) {      retValue = fprintf (fp, "(NOT node%" PRIxPTR "))/n",        (ptruint) f[i] / sizeof(DdNode));    } else {      retValue = fprintf (fp, "node%" PRIxPTR ")/n",        (ptruint) f[i] / sizeof(DdNode));    }    Dddmp_CheckAndGotoLabel (retValue==EOF,      "Error during file store.", failure);  }  st_free_table (visited);  return(1);failure:    if (visited != NULL) st_free_table(visited);    return(0);}

static void dealloc(xmlDocPtr doc){  st_table *node_hash;  NOKOGIRI_DEBUG_START(doc);  node_hash  = DOC_UNLINKED_NODE_HASH(doc);  st_foreach(node_hash, dealloc_node_i, (st_data_t)doc);  st_free_table(node_hash);  free(doc->_private);  /* When both Nokogiri and libxml-ruby are loaded, make sure that all nodes   * have their _private pointers cleared. This is to avoid libxml-ruby's   * xmlDeregisterNode callback from accessing VALUE pointers from ruby's GC   * free context, which can result in segfaults.   */  if (xmlDeregisterNodeDefaultValue)    remove_private((xmlNodePtr)doc);  xmlFreeDoc(doc);  NOKOGIRI_DEBUG_END(doc);}

intruby_vm_destruct(void *ptr){    RUBY_FREE_ENTER("vm");    if (ptr) {	rb_vm_t *vm = ptr;	rb_thread_t *th = vm->main_thread;#if defined(ENABLE_VM_OBJSPACE) && ENABLE_VM_OBJSPACE	struct rb_objspace *objspace = vm->objspace;#endif	rb_gc_force_recycle(vm->self);	vm->main_thread = 0;	if (th) {	    thread_free(th);	}	if (vm->living_threads) {	    st_free_table(vm->living_threads);	    vm->living_threads = 0;	}	rb_thread_lock_unlock(&vm->global_vm_lock);	rb_thread_lock_destroy(&vm->global_vm_lock);	ruby_xfree(vm);	ruby_current_vm = 0;#if defined(ENABLE_VM_OBJSPACE) && ENABLE_VM_OBJSPACE	if (objspace) {	    rb_objspace_free(objspace);	}#endif    }    RUBY_FREE_LEAVE("vm");    return 0;}

avro_schema_t avro_schema_union(void){	struct avro_union_schema_t *schema =	    (struct avro_union_schema_t *) avro_new(struct avro_union_schema_t);	if (!schema) {		avro_set_error("Cannot allocate new union schema");		return NULL;	}	schema->branches = st_init_numtable_with_size(DEFAULT_TABLE_SIZE);	if (!schema->branches) {		avro_set_error("Cannot allocate new union schema");		avro_freet(struct avro_union_schema_t, schema);		return NULL;	}	schema->branches_byname =	    st_init_strtable_with_size(DEFAULT_TABLE_SIZE);	if (!schema->branches_byname) {		avro_set_error("Cannot allocate new union schema");		st_free_table(schema->branches);		avro_freet(struct avro_union_schema_t, schema);		return NULL;	}	avro_schema_init(&schema->obj, AVRO_UNION);	return &schema->obj;}

void rabbit_object_free( VALUE value ){	assert( value );	if( !IS_PTR_VALUE(value) ) {		rabbit_bug("(object_free)ポインタ型では
C++ st_init_numtable函数代码示例
C++ st_free函数代码示例