Attachment #307 for ticket #336




}

void
list_sort (List l, ListCmpF f)
{
    ListIterator it;


           tail->next = NULL;
           if(nmerges <= 1) {
              l->head = head;
              l->tail = &tail->next;
              for (it=l->iNext; it; it=it->iNext) {
                  assert(it->magic == LIST_MAGIC);
                  it->pos = it->list->head;

}

void
list_sort2 (List l, ListCmpF f)
{
/*  Note: Time complexity O(n^2).
 */

Return to ticket 336

Lines 530-536 list_flush (List l) Link Here

(-)a/src/common/list.c (-3 / +3 lines)
530	}	530	}
531		531
532	void	532	void
533	list_sort2 (List l, ListCmpF f)	533	list_sort (List l, ListCmpF f)
534	{	534	{
535	ListIterator it;	535	ListIterator it;
536		536
Lines 594-600 list_sort2 (List l, ListCmpF f) Link Here
594	tail->next = NULL;	594	tail->next = NULL;
595	if(nmerges <= 1) {	595	if(nmerges <= 1) {
596	l->head = head;	596	l->head = head;
597	l->tail = &tail;	597	l->tail = &tail->next;
598	for (it=l->iNext; it; it=it->iNext) {	598	for (it=l->iNext; it; it=it->iNext) {
599	assert(it->magic == LIST_MAGIC);	599	assert(it->magic == LIST_MAGIC);
600	it->pos = it->list->head;	600	it->pos = it->list->head;
Lines 613-619 list_sort2 (List l, ListCmpF f) Link Here
613	}	613	}
614		614
615	void	615	void
616	list_sort (List l, ListCmpF f)	616	list_sort2 (List l, ListCmpF f)
617	{	617	{
618	/* Note: Time complexity O(n^2).	618	/* Note: Time complexity O(n^2).
619	*/	619	*/