blob: 729158eda38b0457db1de891205991f1aa6c1c99 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
/*
* Copyright 1996-2002 - Karl R. Hakimian and David Fries
*
* This file is part of datalink.
*
* Datalink is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* Datalink is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with datalink (see COPYING); if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include <stdlib.h>
#include "datalink.h"
int dl_sort(ListPtr list, int (*cmp_proc) ())
{
ListPtr nl;
ItemPtr ip;
ItemPtr ni;
ItemPtr si;
ItemPtr pi;
if ((nl = dl_new_list()) == NULL)
return ((*dl_error_proc) ("List alloc error."));
for (ip = list->first; ip; ip = ni)
{
ni = ip->next;
for (pi = NULL, si = nl->first; si; si = si->next)
{
if ((*cmp_proc) (ip, si) >= 0)
{
pi = si;
continue;
}
if (pi)
{
ip->next = pi->next;
pi->next = ip;
} else
{
ip->next = nl->first;
nl->first = ip;
}
nl->count++;
if (!nl->last)
{
nl->last = ip;
ip->next = NULL;
}
break;
}
if (!si)
{
dl_add_to_list(nl, ip);
ip->next = NULL;
}
}
list->first = nl->first;
list->last = nl->last;
free(nl);
return 0;
}
|
