link-grammar-5.8.0/link-grammar/parse/prune.c
/**
 * The disjunct d (whose left or right pointer points to c) is put
 * into the appropriate hash table
 */
The disjunct d (whose left or right pointer points to c) is put
into the appropriate hash table
The disjunct d ( whose left or right pointer points to c ) is put into the appropriate hash table
static void put_into_power_table(Pool_desc *mp, unsigned int size, C_list **t,
                                 Connector *c)
{
	C_list **e = get_power_table_entry(size, t, c);
	assert(NULL != e, "put_into_power_table: Overflow");
	assert(c->refcount > 0, "refcount %d", c->refcount);
	C_list *m = pool_alloc(mp);
	m->next = *e;
	*e = m;
	m->c = c;
}
static void put_into_power_table ( Pool_desc * mp , unsigned int size , C_list * * t , Connector * c ) { C_list * * e = get_power_table_entry ( size , t , c ) ; assert ( NULL != e , " " ) ; assert ( c -> refcount > 0 , " " , c -> refcount ) ; C_list * m = pool_alloc ( mp ) ; m -> next = * e ; * e = m ; m -> c = c ; }
The disjunct d (whose left or right pointer points to c) is put
 into the appropriate hash table
The disjunct d ( whose left or right pointer points to c ) is put into the appropriate hash table