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
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
|
/*
* tixGrSel.c --
*
* This module handles the sorting of the Grid widget.
*
* Copyright (c) 1996, Expert Interface Technologies
*
* See the file "license.terms" for information on usage and redistribution
* of this file, and for a DISCLAIMER OF ALL WARRANTIES.
*
*/
#include <tixPort.h>
#include <tixInt.h>
#include <tixGrid.h>
/*
* The variables below are used to implement the "lsort" command.
* Unfortunately, this use of static variables prevents "lsort"
* from being thread-safe, but there's no alternative given the
* current implementation of qsort. In a threaded environment
* these variables should be made thread-local if possible, or else
* "lsort" needs internal mutual exclusion.
*/
static Tcl_Interp *sortInterp = NULL; /* Interpreter for "lsort" command.
* NULL means no lsort is active. */
static enum {ASCII, INTEGER, REAL, COMMAND} sortMode;
/* Mode for sorting:compare as strings,
* compare as numbers, or call
* user-defined command for
* comparison. */
static Tcl_DString sortCmd; /* Holds command if mode is COMMAND.
* pre-initialized to hold base of
* command. */
static int sortIncreasing; /* 0 means sort in decreasing order,
* 1 means increasing order. */
static int sortCode; /* Anything other than TCL_OK means a
* problem occurred while sorting; this
* executing a comparison command, so
* the sort was aborted. */
/*
* Forward declarations for procedures defined in this file:
*/
#ifdef BUILD_tix
# undef TCL_STORAGE_CLASS
# define TCL_STORAGE_CLASS DLLEXPORT
#endif
EXTERN TIX_DECLARE_SUBCMD(Tix_GrSort);
static int SortCompareProc _ANSI_ARGS_((CONST VOID *first,
CONST VOID *second));
char * Tix_GrGetCellText _ANSI_ARGS_((WidgetPtr wPtr,
int x, int y));
Tix_GrSortItem * Tix_GrGetSortItems _ANSI_ARGS_((WidgetPtr wPtr,
int axis, int start, int end, int sortKeyIndex));
void Tix_GrFreeSortItems _ANSI_ARGS_((WidgetPtr wPtr,
Tix_GrSortItem * items, int numItems));
/*
*----------------------------------------------------------------------
*
* Tcl_LsortCmd --
*
* This procedure is invoked to process the "lsort" Tcl command.
* See the user documentation for details on what it does.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* See the user documentation.
*
*----------------------------------------------------------------------
*/
/* ARGSUSED */
char *
Tix_GrGetCellText(wPtr, x, y)
WidgetPtr wPtr;
int x;
int y;
{
TixGrEntry* chPtr;
if ((chPtr = (TixGrEntry*) TixGridDataFindEntry(wPtr->dataSet, x, y))) {
switch (Tix_DItemType(chPtr->iPtr)) {
case TIX_DITEM_TEXT:
return chPtr->iPtr->text.text;
case TIX_DITEM_IMAGETEXT:
return chPtr->iPtr->imagetext.text;
default:
return NULL;
}
} else {
return NULL;
}
}
Tix_GrSortItem *
Tix_GrGetSortItems(wPtr, axis, start, end, sortKeyIndex)
WidgetPtr wPtr;
int axis;
int start;
int end;
int sortKeyIndex;
{
int i, k, numItems;
Tix_GrSortItem *items;
if (end <= start) {
/* sanity check: no need to sort */
return (Tix_GrSortItem *) NULL;
}
numItems = end-start+1;
items = (Tix_GrSortItem *)ckalloc(sizeof(Tix_GrSortItem) * numItems);
for (k=0,i=start; i<=end; i++, k++) {
items[k].index = i;
if (axis == 0) {
items[k].data = Tix_GrGetCellText(wPtr, i, sortKeyIndex);
} else {
items[k].data = Tix_GrGetCellText(wPtr, sortKeyIndex, i);
}
}
return items;
}
void
Tix_GrFreeSortItems(wPtr, items, numItems)
WidgetPtr wPtr;
Tix_GrSortItem * items;
int numItems;
{
ckfree((char*)items);
}
int
Tix_GrSort(clientData, interp, argc, argv)
ClientData clientData;
Tcl_Interp *interp; /* Current interpreter. */
int argc; /* Number of arguments. */
char **argv; /* Argument strings. */
{
WidgetPtr wPtr = (WidgetPtr) clientData;
int i, axis, otherAxis, start, end;
size_t len;
Tix_GrSortItem *items = NULL;
int numItems;
char *command = NULL; /* Initialization needed only to
* prevent compiler warning. */
int sortKeyIndex;
int gridSize[2];
/*-------------------------------------------------------------------
* Argument parsing
*-------------------------------------------------------------------
*/
if (sortInterp != NULL) {
interp->result = "can't invoke the tixGrid sort command recursively";
return TCL_ERROR;
}
/* Figure out the sorting dimension
*/
len = strlen(argv[0]);
if (strncmp(argv[0], "rows", len)==0) {
axis = 1;
otherAxis = 0;
} else if (strncmp(argv[0], "column", len)==0) {
axis = 0;
otherAxis = 1;
} else {
Tcl_AppendResult(interp, "wrong dimension \"", argv[0],
"\", should be row or column", (char *) NULL);
return TCL_ERROR;
}
/* get the start and end index
*/
if (axis == 0) {
if (TixGridDataGetIndex(interp, wPtr, argv[1], NULL, &start, NULL)
!=TCL_OK) {
return TCL_ERROR;
}
if (TixGridDataGetIndex(interp, wPtr, argv[2], NULL, &end, NULL)
!=TCL_OK) {
return TCL_ERROR;
}
} else {
if (TixGridDataGetIndex(interp, wPtr, NULL, argv[1], NULL, &start)
!=TCL_OK) {
return TCL_ERROR;
}
if (TixGridDataGetIndex(interp, wPtr, NULL, argv[2], NULL, &end)
!=TCL_OK) {
return TCL_ERROR;
}
}
/* Check the range
*/
TixGridDataGetGridSize(wPtr->dataSet, &gridSize[0], &gridSize[1]);
if (start > end) {
int tmp = start;
start = end;
end = tmp;
}
if (start >= gridSize[axis]) {
/* no need to sort */
return TCL_OK;
}
if (end == start) {
/* no need to sort */
return TCL_OK;
}
/* get the options
*/
if ((argc-3) %2 != 0) {
Tcl_AppendResult(interp, "value for \"", argv[argc-1],
"\" missing", NULL);
return TCL_ERROR;
}
sortInterp = interp;
sortMode = ASCII;
sortIncreasing = 1;
sortCode = TCL_OK;
sortKeyIndex = wPtr->hdrSize[otherAxis]; /* by default, use the first
* scrollable item as the key
*/
for (i=3; i<argc; i+=2) {
len = strlen(argv[i]);
if (strncmp(argv[i], "-type", len) == 0) {
if (strcmp(argv[i+1], "ascii") == 0) {
sortMode = ASCII;
} else if (strcmp(argv[i+1], "integer") == 0) {
sortMode = INTEGER;
} else if (strcmp(argv[i+1], "real") == 0) {
sortMode = REAL;
} else {
Tcl_AppendResult(interp, "wrong type \"", argv[i+1],
"\": must be ascii, integer or real", (char *) NULL);
sortCode = TCL_ERROR;
goto done;
}
}
else if (strncmp(argv[i], "-order", len) == 0) {
if (strcmp(argv[i+1], "increasing") == 0) {
sortIncreasing = 1;
} else if (strcmp(argv[i+1], "decreasing") == 0) {
sortIncreasing = 0;
} else {
Tcl_AppendResult(interp, "wrong order \"", argv[i+1],
"\": must be increasing or decreasing", (char *) NULL);
sortCode = TCL_ERROR;
goto done;
}
}
else if (strncmp(argv[i], "-key", len) == 0) {
if (axis == 0) {
/* sort columns: the key is a column index (1) */
if (TixGridDataGetIndex(interp, wPtr, NULL, argv[i+1], NULL,
&sortKeyIndex) !=TCL_OK) {
sortCode = TCL_ERROR;
goto done;
}
} else {
/* sort rows: the key is a row index (0)*/
if (TixGridDataGetIndex(interp, wPtr, argv[i+1], NULL,
&sortKeyIndex, NULL) !=TCL_OK) {
sortCode = TCL_ERROR;
goto done;
}
}
}
else if (strncmp(argv[i], "-command", len) == 0) {
sortMode = COMMAND;
command = argv[i+1];
}
else {
Tcl_AppendResult(interp, "wrong option \"", argv[i],
"\": must be -command, -key, -order or -type", (char *) NULL);
sortCode = TCL_ERROR;
goto done;
}
}
if (sortMode == COMMAND) {
Tcl_DStringInit(&sortCmd);
Tcl_DStringAppend(&sortCmd, command, -1);
}
/*------------------------------------------------------------------
* SORTING
*------------------------------------------------------------------
*/
/* prepare the array to be sorted */
numItems = end - start + 1;
items = Tix_GrGetSortItems(wPtr, axis, start, end, sortKeyIndex);
if (items != NULL) {
int sizeChanged;
qsort((VOID *)items, (size_t)numItems, sizeof(Tix_GrSortItem),
SortCompareProc);
for (i=0; i<numItems; i++) {
printf("%d\n", items[i].index);
}
sizeChanged = TixGridDataUpdateSort(wPtr->dataSet, axis, start, end,
items);
if (sizeChanged) {
Tix_GrDoWhenIdle(wPtr, TIX_GR_RESIZE);
} else {
wPtr->toResetRB = 1;
Tix_GrDoWhenIdle(wPtr, TIX_GR_REDRAW);
}
Tix_GrFreeSortItems(wPtr, items, numItems);
}
/* Done */
if (sortCode == TCL_OK) {
Tcl_ResetResult(interp);
}
if (sortMode == COMMAND) {
Tcl_DStringFree(&sortCmd);
}
done:
sortInterp = NULL;
return sortCode;
}
/*
*----------------------------------------------------------------------
*
* SortCompareProc --
*
* This procedure is invoked by qsort to determine the proper
* ordering between two elements.
*
* Results:
* < 0 means first is "smaller" than "second", > 0 means "first"
* is larger than "second", and 0 means they should be treated
* as equal.
*
* Side effects:
* None, unless a user-defined comparison command does something
* weird.
*
*----------------------------------------------------------------------
*/
static int
SortCompareProc(first, second)
CONST VOID *first, *second; /* Elements to be compared. */
{
int order;
char *firstString = ((Tix_GrSortItem*)first )->data;
char *secondString = ((Tix_GrSortItem*)second)->data;
order = 0;
if (sortCode != TCL_OK) {
/*
* Once an error has occurred, skip any future comparisons
* so as to preserve the error message in sortInterp->result.
*/
return order;
}
if (firstString == NULL && secondString == NULL) {
/* equal */
return order;
}
if (secondString == NULL) {
/* first larger than second */
order = 1;
goto done;
}
if (firstString == NULL) {
order = -1;
goto done;
}
if (sortMode == ASCII) {
order = strcmp(firstString, secondString);
} else if (sortMode == INTEGER) {
int a, b;
if ((Tcl_GetInt(sortInterp, firstString, &a) != TCL_OK)
|| (Tcl_GetInt(sortInterp, secondString, &b) != TCL_OK)) {
Tcl_AddErrorInfo(sortInterp,
"\n (converting list element from string to integer)");
sortCode = TCL_ERROR;
return order;
}
if (a > b) {
order = 1;
} else if (b > a) {
order = -1;
}
} else if (sortMode == REAL) {
double a, b;
if ((Tcl_GetDouble(sortInterp, firstString, &a) != TCL_OK)
|| (Tcl_GetDouble(sortInterp, secondString, &b) != TCL_OK)) {
Tcl_AddErrorInfo(sortInterp,
"\n (converting list element from string to real)");
sortCode = TCL_ERROR;
return order;
}
if (a > b) {
order = 1;
} else if (b > a) {
order = -1;
}
} else {
int oldLength;
char *end;
/*
* Generate and evaluate a command to determine which string comes
* first.
*/
oldLength = Tcl_DStringLength(&sortCmd);
Tcl_DStringAppendElement(&sortCmd, firstString);
Tcl_DStringAppendElement(&sortCmd, secondString);
sortCode = Tcl_Eval(sortInterp, Tcl_DStringValue(&sortCmd));
Tcl_DStringTrunc(&sortCmd, oldLength);
if (sortCode != TCL_OK) {
Tcl_AddErrorInfo(sortInterp,
"\n (user-defined comparison command)");
return order;
}
/*
* Parse the result of the command.
*/
order = strtol(sortInterp->result, &end, 0);
if ((end == sortInterp->result) || (*end != 0)) {
Tcl_ResetResult(sortInterp);
Tcl_AppendResult(sortInterp,
"comparison command returned non-numeric result",
(char *) NULL);
sortCode = TCL_ERROR;
return order;
}
}
done:
if (!sortIncreasing) {
order = -order;
}
return order;
}
|