link-grammar-5.8.0/link-grammar/parse/fast-match.c
/**
 * Add the match nodes at sbin to the table entry of their shallow connector.
 */
Add the match nodes at sbin to the table entry of their shallow connector.
Add the match nodes at sbin to the table entry of their shallow connector .
static void add_to_table_entry(unsigned int tsize, Match_node **table,
                               int dir, sortbin *sbin)
{
	Match_node *m_next;
	for (Match_node *m = sbin->head; NULL != m; m = m_next)
	{
		Connector *c = (0 == dir) ? m->d->left : m->d->right;
		assert(NULL != c);
		Match_node **xl = get_match_table_entry(tsize, table, c, dir);
		assert(&match_list_not_found != xl, "get_match_table_entry: Overflow");
		m_next = m->next; 
		m->next = *xl;
		*xl = m;
	}
}
static void add_to_table_entry ( unsigned int tsize , Match_node * * table , int dir , sortbin * sbin ) { Match_node * m_next ; for ( Match_node * m = sbin -> head ; NULL != m ; m = m_next ) { Connector * c = ( 0 == dir ) ? m -> d -> left : m -> d -> right ; assert ( NULL != c ) ; Match_node * * xl = get_match_table_entry ( tsize , table , c , dir ) ; assert ( & match_list_not_found != xl , " " ) ; m_next = m -> next ; m -> next = * xl ; * xl = m ; } }
Add the match nodes at sbin to the table entry of their shallow connector.
Add the match nodes at sbin to the table entry of their shallow connector .
/* Remember before overwriting. */ /* Insert m at head of list */