lib/librecsort/rslist.c

109 	reg int		n_list;  local
118 	for(p = 0, n_list = 0; p < n; ++p)
125 		n_list = uninsert(ulist,n_list,uarray+p);
129 	while(n_list > 0)
130 	{	un = ulist[n_list -= 1];
131 		if(n_list == 0 && !un->equi)	/* last unmerged list */
140 					n_list = uninsert(ulist,n_list,un);
158 			if(n_list == 0)
162 		{	o = ulist[p = n_list-1]->obj;
177 				{	ulist[n_list] = ulist[p];
179 					{	n_list = 2;
183 						ulist[p] = ulist[n_list];
184 					else	n_list += 1;
219 	if((list = (*rs->meth->listf)(rs)) && rs->n_list > 0)
221 				    rs->list, (rs->n_list+1)*sizeof(Rsobj_t*),
225 		rs->list[rs->n_list] = list;
226 		rs->n_list += 1;
229 	if(rs->n_list > 0)
230 	{	list = rs->n_list > 1 ? unionize(rs->list,rs->n_list) : rs->list[0];
234 		rs->n_list = 0;