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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
|
/*-----------------------------------------------------------------------------------*/
/* INRIA 2006 */
/*-----------------------------------------------------------------------------------*/
static int swapcodeint(char * parmi,char * parmj,int n,int incr)
{
int i = n;
register int *pi = (int *) (parmi);
register int *pj = (int *) (parmj);
register int inc1 = incr/sizeof(int);
do {
register int t = *pi;
*pi = *pj;
*pj = t;
pi += inc1;
pj += inc1;
} while (--i > 0);
return(0);
}
/*-----------------------------------------------------------------------------------*/
static int compareCint(char *i,char *j)
{
if ( *((int *)i) > *((int *)j))
return (1);
if ( *((int *)i) < *((int *)j))
return (-1);
return (0);
}
/*-----------------------------------------------------------------------------------*/
static int compareDint(char *i,char *j)
{
if ( *((int *)i) < *((int *)j))
return (1);
if ( *((int *)i) > *((int *)j))
return (-1);
return (0);
}
/*-----------------------------------------------------------------------------------*/
/******************************************************
* Column sort of a matrix
******************************************************/
void ColSortint(int *a,int *ind,int flag,int n,int p,char dir)
{
int i,j;
if ( flag == 1)
{
for ( j= 0 ; j < p ; j++ )
{
for ( i = 0 ; i < n ; i++)
ind[i+n*j]= i+1;
}
}
for ( j= 0 ; j < p ; j++ )
{
sciqsort((char *) (a+n*j),(char *) (ind+n*j),flag, n,
sizeof(int),sizeof(int),
(dir == 'i' ) ? compareCint : compareDint,
swapcodeint,swapcodeind);
}
}
/*-----------------------------------------------------------------------------------*/
/******************************************************
* Row sort of a matrix
******************************************************/
void RowSortint(int *a,int *ind,int flag,int n,int p,char dir)
{
int i,j;
if ( flag == 1)
{
for ( i = 0 ; i < n ; i++)
{
for ( j= 0 ; j < p ; j++ )
{
ind[i+n*j]= j+1;
}
}
}
for ( i = 0 ; i < n ; i++)
{
sciqsort((char *) (a+i),(char *) (ind+i),flag, p,
n*sizeof(int),n*sizeof(int),
(dir == 'i' ) ? compareCint:compareDint,
swapcodeint,swapcodeind);
}
}
/*-----------------------------------------------------------------------------------*/
/******************************************************
* Global sort of a Matrix
******************************************************/
void GlobalSortint(int *a,int *ind,int flag,int n,int p,char dir)
{
int i;
if ( flag == 1)
{
for ( i = 0 ; i < n*p ; i++)
ind[i]= i+1;
}
sciqsort((char *) (a),(char *) (ind),flag, n*p,
sizeof(int),sizeof(int),
(dir == 'i' ) ? compareCint:compareDint,
swapcodeint,swapcodeind);
}
/*-----------------------------------------------------------------------------------*/
/*******************************************************
* lexicographic order with Rows ind is of size n
* ind gives the permutation of the rows which is applied
* to sort them
******************************************************/
static int lexicolsint =1;
static int lexirowsint =1;
/*-----------------------------------------------------------------------------------*/
static void setLexiSizeint(int n,int p)
{
lexicolsint = p;
lexirowsint = n;
}
static int LexiRowcompareCint(int *i,int *j)
{
int jc;
for ( jc = 0 ; jc < lexicolsint ; jc++)
{
if (*i > *j)
return (1);
if (*i < *j)
return (-1);
i += lexirowsint;
j += lexirowsint;
}
return (0);
}
static int LexiRowcompareDint(int *i, int*j)
{
int jc;
for ( jc = 0 ; jc < lexicolsint ; jc++)
{
if (*i < *j)
return (1);
if (*i > *j)
return (-1);
i += lexirowsint;
j += lexirowsint;
}
return (0);
}
/*-----------------------------------------------------------------------------------*/
static int LexiRowswapcodeint(char *parmi,char * parmj,int n)
{
int i = n,j;
register int *pi = (int *) (parmi);
register int *pj = (int *) (parmj);
/* if ( n!= 1) printf(" swapcode avec n != 1\n"); */
do {
for ( j = 0 ; j < lexicolsint ; j++)
{
register int t = *(pi +lexirowsint*j);
*(pi + lexirowsint*j) = *(pj+lexirowsint*j);
*(pj + lexirowsint*j) = t;
}
pi++;
pj++;
} while (--i > 0);
return(0);
}
/*-----------------------------------------------------------------------------------*/
void LexiRowint(int *a,int *ind,int flag,int n,int p,char dir)
{
int i;
setLexiSizeint(n,p);
if ( flag == 1)
{
for ( i = 0 ; i < n ; i++)
ind[i]= i+1;
}
sciqsort((char *) (a),(char *) (ind),flag, n,
sizeof(int),sizeof(int),
(dir == 'i' ) ? LexiRowcompareCint:LexiRowcompareDint,
LexiRowswapcodeint,swapcodeind);
}
/*-----------------------------------------------------------------------------------*/
/******************************************************
* lexicographic order with Cols ind is of size p
* ind gives the permutation of the column which is applied
* to sort them
******************************************************/
static int LexiColcompareCint(int *i,int *j)
{
int ic;
for ( ic = 0 ; ic < lexirowsint ; ic++)
{
if (*i > *j)
return (1);
if (*i < *j)
return (-1);
i++;
j++;
}
return (0);
}
/*-----------------------------------------------------------------------------------*/
static int LexiColcompareDint(int *i,int *j)
{
int ic;
for ( ic = 0 ; ic < lexirowsint ; ic++)
{
if (*i < *j)
return (1);
if (*i > *j)
return (-1);
i++;
j++;
}
return (0);
}
/*-----------------------------------------------------------------------------------*/
static int LexiColswapcodeint(char *parmi,char* parmj,int n)
{
int i = n,ir;
register int *pi = (int *) (parmi);
register int *pj = (int *) (parmj);
/* if ( n!= 1) printf(" swapcode avec n != 1\n"); */
do {
for ( ir = 0 ; ir < lexirowsint ; ir++)
{
register int t = *(pi +ir);
*(pi +ir) = *(pj+ir);
*(pj +ir) = t;
}
pi += lexirowsint ;
pj += lexirowsint ;
} while (--i > 0);
return(0);
}
/*-----------------------------------------------------------------------------------*/
void LexiColint(int *a,int *ind,int flag,int n,int p,char dir)
{
int i;
setLexiSizeint(n,p);
if ( flag == 1)
{
for ( i = 0 ; i < p ; i++)
ind[i]= i+1;
}
sciqsort((char *) (a),(char *) (ind),flag, p,
n*sizeof(int),sizeof(int),
(dir == 'i' ) ? LexiColcompareCint:LexiColcompareDint,
LexiColswapcodeint,
swapcodeind);
}
/*-----------------------------------------------------------------------------------*/
|
