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 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409
|
/*
* tkTableCell.c --
*
* This module implements cell oriented functions for table
* widgets.
*
* Copyright (c) 1998-2000 Jeffrey Hobbs
*
* See the file "license.terms" for information on usage and redistribution
* of this file, and for a DISCLAIMER OF ALL WARRANTIES.
*
* RCS: @(#) $Id: tkTableCell.c,v 1.17 2004/02/08 03:09:46 cerney Exp $
*/
#include "tkVMacro.h"
#include "tkTable.h"
static int TableSortCompareProc _ANSI_ARGS_((CONST VOID *first,
CONST VOID *second));
/*
*----------------------------------------------------------------------
*
* TableTrueCell --
* Takes a row,col pair in user coords and returns the true
* cell that it relates to, either dimension bounded, or a
* span cell if it was hidden.
*
* Results:
* The true row, col in user coords are placed in the pointers.
* If the value changed for some reasons, 0 is returned (it was not
* the /true/ cell).
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
int
TableTrueCell(Table *tablePtr, int r, int c, int *row, int *col)
{
*row = r; *col = c;
/*
* We check spans before constraints, because we don't want to
* constrain and then think we ended up in a span
*/
if (tablePtr->spanAffTbl && !(tablePtr->flags & AVOID_SPANS)) {
char buf[INDEX_BUFSIZE];
Tcl_HashEntry *entryPtr;
TableMakeArrayIndex(r, c, buf);
entryPtr = Tcl_FindHashEntry(tablePtr->spanAffTbl, buf);
if ((entryPtr != NULL) &&
((char *)Tcl_GetHashValue(entryPtr) != NULL)) {
/*
* This cell is covered by another spanning cell.
* We need to return the coords for that spanning cell.
*/
TableParseArrayIndex(row, col, (char *)Tcl_GetHashValue(entryPtr));
return 0;
}
}
*row = BETWEEN(r, tablePtr->rowOffset,
tablePtr->rows-1+tablePtr->rowOffset);
*col = BETWEEN(c, tablePtr->colOffset,
tablePtr->cols-1+tablePtr->colOffset);
return ((*row == r) && (*col == c));
}
/*
*----------------------------------------------------------------------
*
* TableCellCoords --
* Takes a row,col pair in real coords and finds it position
* on the virtual screen.
*
* Results:
* The virtual x, y, width, and height of the cell
* are placed in the pointers.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
int
TableCellCoords(Table *tablePtr, int row, int col,
int *x, int *y, int *w, int *h)
{
register int hl = tablePtr->highlightWidth;
int result = CELL_OK;
if (tablePtr->rows <= 0 || tablePtr->cols <= 0) {
*w = *h = *x = *y = 0;
return CELL_BAD;
}
/*
* Real coords required, always should be passed acceptable values,
* but this is a possible seg fault otherwise
*/
CONSTRAIN(row, 0, tablePtr->rows-1);
CONSTRAIN(col, 0, tablePtr->cols-1);
*w = tablePtr->colPixels[col];
*h = tablePtr->rowPixels[row];
/*
* Adjust for sizes of spanning cells
* and ensure that this cell isn't "hidden"
*/
if (tablePtr->spanAffTbl && !(tablePtr->flags & AVOID_SPANS)) {
char buf[INDEX_BUFSIZE];
Tcl_HashEntry *entryPtr;
TableMakeArrayIndex(row+tablePtr->rowOffset,
col+tablePtr->colOffset, buf);
entryPtr = Tcl_FindHashEntry(tablePtr->spanAffTbl, buf);
if (entryPtr != NULL) {
int rs, cs;
char *cell;
cell = (char *) Tcl_GetHashValue(entryPtr);
if (cell != NULL) {
/* This cell is covered by another spanning cell */
/* We need to return the coords for that cell */
TableParseArrayIndex(&rs, &cs, cell);
*w = rs;
*h = cs;
result = CELL_HIDDEN;
goto setxy;
}
/* Get the actual span values out of spanTbl */
entryPtr = Tcl_FindHashEntry(tablePtr->spanTbl, buf);
cell = (char *) Tcl_GetHashValue(entryPtr);
TableParseArrayIndex(&rs, &cs, cell);
if (rs > 0) {
/*
* Make sure we don't overflow our space
*/
if (row < tablePtr->titleRows) {
rs = MIN(tablePtr->titleRows-1, row+rs);
} else {
rs = MIN(tablePtr->rows-1, row+rs);
}
*h = tablePtr->rowStarts[rs+1]-tablePtr->rowStarts[row];
result = CELL_SPAN;
} else if (rs <= 0) {
/* currently negative spans are not supported */
}
if (cs > 0) {
/*
* Make sure we don't overflow our space
*/
if (col < tablePtr->titleCols) {
cs = MIN(tablePtr->titleCols-1, col+cs);
} else {
cs = MIN(tablePtr->cols-1, col+cs);
}
*w = tablePtr->colStarts[cs+1]-tablePtr->colStarts[col];
result = CELL_SPAN;
} else if (cs <= 0) {
/* currently negative spans are not supported */
}
}
}
setxy:
*x = hl + tablePtr->colStarts[col];
if (col >= tablePtr->titleCols) {
*x -= tablePtr->colStarts[tablePtr->leftCol]
- tablePtr->colStarts[tablePtr->titleCols];
}
*y = hl + tablePtr->rowStarts[row];
if (row >= tablePtr->titleRows) {
*y -= tablePtr->rowStarts[tablePtr->topRow]
- tablePtr->rowStarts[tablePtr->titleRows];
}
return result;
}
/*
*----------------------------------------------------------------------
*
* TableCellVCoords --
* Takes a row,col pair in real coords and finds it position
* on the actual screen. The full arg specifies whether
* only 100% visible cells should be considered visible.
*
* Results:
* The x, y, width, and height of the cell are placed in the pointers,
* depending upon visibility of the cell.
* Returns 0 for hidden and 1 for visible cells.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
int
TableCellVCoords(Table *tablePtr, int row, int col,
int *rx, int *ry, int *rw, int *rh, int full)
{
int x, y, w, h, w0, h0, cellType, hl = tablePtr->highlightWidth;
if (tablePtr->tkwin == NULL) return 0;
/*
* Necessary to use separate vars in case dummies are passed in
*/
cellType = TableCellCoords(tablePtr, row, col, &x, &y, &w, &h);
*rx = x; *ry = y; *rw = w; *rh = h;
if (cellType == CELL_OK) {
if ((row < tablePtr->topRow && row >= tablePtr->titleRows) ||
(col < tablePtr->leftCol && col >= tablePtr->titleCols)) {
/*
* A non-spanning cell hiding in "dead" space
* between title areas and visible cells
*/
return 0;
}
} else if (cellType == CELL_SPAN) {
/*
* we might need to treat full better is CELL_SPAN but primary
* cell is visible
*/
int topX = tablePtr->colStarts[tablePtr->titleCols]+hl;
int topY = tablePtr->rowStarts[tablePtr->titleRows]+hl;
if ((col < tablePtr->leftCol) && (col >= tablePtr->titleCols)) {
if (full || (x+w < topX)) {
return 0;
} else {
w -= topX-x;
x = topX;
}
}
if ((row < tablePtr->topRow) && (row >= tablePtr->titleRows)) {
if (full || (y+h < topY)) {
return 0;
} else {
h -= topY-y;
y = topY;
}
}
/*
* re-set these according to changed coords
*/
*rx = x; *ry = y; *rw = w; *rh = h;
} else {
/*
* If it is a hidden cell, then w,h is the row,col in user coords
* of the cell that spans over this one
*/
return 0;
}
/*
* At this point, we know it is on the screen,
* but not if we can see 100% of it (if we care)
*/
if (full) {
w0 = w; h0 = h;
} else {
/*
* if we don't care about seeing the whole thing, then
* make sure we at least see a pixel worth
*/
w0 = h0 = 1;
}
/*
* Is the cell visible?
*/
if ((x < hl) || (y < hl) || ((x+w0) > (Tk_Width(tablePtr->tkwin)-hl))
|| ((y+h0) > (Tk_Height(tablePtr->tkwin)-hl))) {
/* definitely off the screen */
return 0;
} else {
/* if it was full, then w,h are already be properly constrained */
if (!full) {
*rw = MIN(w, Tk_Width(tablePtr->tkwin)-hl-x);
*rh = MIN(h, Tk_Height(tablePtr->tkwin)-hl-y);
}
return 1;
}
}
/*
*----------------------------------------------------------------------
*
* TableWhatCell --
* Takes a x,y screen coordinate and determines what cell contains.
* that point. This will return cells that are beyond the right/bottom
* edge of the viewable screen.
*
* Results:
* The row,col of the cell are placed in the pointers.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
void
TableWhatCell(register Table *tablePtr, int x, int y, int *row, int *col)
{
int i;
x = MAX(0, x); y = MAX(0, y);
/* Adjust for table's global highlightthickness border */
x -= tablePtr->highlightWidth;
y -= tablePtr->highlightWidth;
/* Adjust the x coord if not in the column titles to change display coords
* into internal coords */
x += (x < tablePtr->colStarts[tablePtr->titleCols]) ? 0 :
tablePtr->colStarts[tablePtr->leftCol] -
tablePtr->colStarts[tablePtr->titleCols];
y += (y < tablePtr->rowStarts[tablePtr->titleRows]) ? 0 :
tablePtr->rowStarts[tablePtr->topRow] -
tablePtr->rowStarts[tablePtr->titleRows];
x = MIN(x, tablePtr->maxWidth-1);
y = MIN(y, tablePtr->maxHeight-1);
for (i = 1; x >= tablePtr->colStarts[i]; i++);
*col = i - 1;
for (i = 1; y >= tablePtr->rowStarts[i]; i++);
*row = i - 1;
if (tablePtr->spanAffTbl && !(tablePtr->flags & AVOID_SPANS)) {
char buf[INDEX_BUFSIZE];
Tcl_HashEntry *entryPtr;
/* We now correct the returned cell if this was "hidden" */
TableMakeArrayIndex(*row+tablePtr->rowOffset,
*col+tablePtr->colOffset, buf);
entryPtr = Tcl_FindHashEntry(tablePtr->spanAffTbl, buf);
if ((entryPtr != NULL) &&
/* We have to make sure this was not already hidden
* that's an error */
((char *)Tcl_GetHashValue(entryPtr) != NULL)) {
/* this is a "hidden" cell */
TableParseArrayIndex(row, col, (char *)Tcl_GetHashValue(entryPtr));
*row -= tablePtr->rowOffset;
*col -= tablePtr->colOffset;
}
}
}
/*
*----------------------------------------------------------------------
*
* TableAtBorder --
* Takes a x,y screen coordinate and determines if that point is
* over a border.
*
* Results:
* The left/top row,col corresponding to that point are placed in
* the pointers. The number of borders (+1 for row, +1 for col)
* hit is returned.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
int
TableAtBorder(Table * tablePtr, int x, int y, int *row, int *col)
{
int i, brow, bcol, borders = 2, bd[6];
TableGetTagBorders(&(tablePtr->defaultTag),
&bd[0], &bd[1], &bd[2], &bd[3]);
bd[4] = (bd[0] + bd[1])/2;
bd[5] = (bd[2] + bd[3])/2;
/*
* Constrain x && y appropriately, and adjust x if it is not in the
* column titles to change display coords into internal coords.
*/
x = MAX(0, x); y = MAX(0, y);
x -= tablePtr->highlightWidth; y -= tablePtr->highlightWidth;
x += (x < tablePtr->colStarts[tablePtr->titleCols]) ? 0 :
tablePtr->colStarts[tablePtr->leftCol] -
tablePtr->colStarts[tablePtr->titleCols];
x = MIN(x, tablePtr->maxWidth - 1);
for (i = 1; (i <= tablePtr->cols) &&
(x + (bd[0] + bd[1])) >= tablePtr->colStarts[i]; i++);
if (x > tablePtr->colStarts[--i] + bd[4]) {
borders--;
*col = -1;
bcol = (i < tablePtr->leftCol && i >= tablePtr->titleCols) ?
tablePtr->titleCols-1 : i-1;
} else {
bcol = *col = (i < tablePtr->leftCol && i >= tablePtr->titleCols) ?
tablePtr->titleCols-1 : i-1;
}
y += (y < tablePtr->rowStarts[tablePtr->titleRows]) ? 0 :
tablePtr->rowStarts[tablePtr->topRow] -
tablePtr->rowStarts[tablePtr->titleRows];
y = MIN(y, tablePtr->maxHeight - 1);
for (i = 1; i <= tablePtr->rows &&
(y + (bd[2] + bd[3])) >= tablePtr->rowStarts[i]; i++);
if (y > tablePtr->rowStarts[--i]+bd[5]) {
borders--;
*row = -1;
brow = (i < tablePtr->topRow && i >= tablePtr->titleRows) ?
tablePtr->titleRows-1 : i-1;
} else {
brow = *row = (i < tablePtr->topRow && i >= tablePtr->titleRows) ?
tablePtr->titleRows-1 : i-1;
}
/*
* We have to account for spanning cells, which may hide cells.
* In that case, we have to decrement our border count.
*/
if (tablePtr->spanAffTbl && !(tablePtr->flags & AVOID_SPANS) && borders) {
Tcl_HashEntry *entryPtr1, *entryPtr2 ;
char buf1[INDEX_BUFSIZE], buf2[INDEX_BUFSIZE];
char *val;
if (*row != -1) {
TableMakeArrayIndex(brow+tablePtr->rowOffset,
bcol+tablePtr->colOffset+1, buf1);
TableMakeArrayIndex(brow+tablePtr->rowOffset+1,
bcol+tablePtr->colOffset+1, buf2);
entryPtr1 = Tcl_FindHashEntry(tablePtr->spanAffTbl, buf1);
entryPtr2 = Tcl_FindHashEntry(tablePtr->spanAffTbl, buf2);
if (entryPtr1 != NULL && entryPtr2 != NULL) {
if ((val = (char *) Tcl_GetHashValue(entryPtr1)) != NULL) {
strcpy(buf1, val);
}
if ((val = (char *) Tcl_GetHashValue(entryPtr2)) != NULL) {
strcpy(buf2, val);
}
if (strcmp(buf1, buf2) == 0) {
borders--;
*row = -1;
}
}
}
if (*col != -1) {
TableMakeArrayIndex(brow+tablePtr->rowOffset+1,
bcol+tablePtr->colOffset, buf1);
TableMakeArrayIndex(brow+tablePtr->rowOffset+1,
bcol+tablePtr->colOffset+1, buf2);
entryPtr1 = Tcl_FindHashEntry(tablePtr->spanAffTbl, buf1);
entryPtr2 = Tcl_FindHashEntry(tablePtr->spanAffTbl, buf2);
if (entryPtr1 != NULL && entryPtr2 != NULL) {
if ((val = (char *) Tcl_GetHashValue(entryPtr1)) != NULL) {
strcpy(buf1, val);
}
if ((val = (char *) Tcl_GetHashValue(entryPtr2)) != NULL) {
strcpy(buf2, val);
}
if (strcmp(buf1, buf2) == 0) {
borders--;
*col = -1;
}
}
}
}
return borders;
}
/*
*----------------------------------------------------------------------
*
* TableGetCellValue --
* Takes a row,col pair in user coords and returns the value for
* that cell. This varies depending on what data source the
* user has selected.
*
* Results:
* The value of the cell is returned. The return value is VOLATILE
* (do not free).
*
* Side effects:
* The value will be cached if caching is turned on.
*
*----------------------------------------------------------------------
*/
char *
TableGetCellValue(Table *tablePtr, int r, int c)
{
register Tcl_Interp *interp = tablePtr->interp;
char *result = NULL;
char buf[INDEX_BUFSIZE];
Tcl_HashEntry *entryPtr = NULL;
int new = 1;
TableMakeArrayIndex(r, c, buf);
if (tablePtr->caching) {
/*
* If we are caching, let's see if we have the value cached
*/
entryPtr = Tcl_CreateHashEntry(tablePtr->cache, buf, &new);
if (!new) {
result = (char *) Tcl_GetHashValue(entryPtr);
if (result == NULL) {
result = "";
}
goto VALUE;
}
}
if (tablePtr->command && tablePtr->useCmd) {
if (LangDoCallback(interp, tablePtr->command, 1, 3, "%d %d %d",0,r,c) == TCL_ERROR) {
tablePtr->useCmd = 0;
tablePtr->dataSource &= ~DATA_COMMAND;
if (tablePtr->arrayVar)
tablePtr->dataSource |= DATA_ARRAY;
Tcl_AddErrorInfo(interp, "\n\t(in -command evaled by table)");
Tcl_BackgroundError(interp);
TableInvalidateAll(tablePtr, 0);
} else {
result = (char *) Tcl_GetStringFromObj(Tcl_GetObjResult(interp),NULL);
}
/* Tcl_FreeResult(interp); not support for perl/tk */
} else if (tablePtr->arrayVar) {
result = Tcl_GetString(Tcl_ObjGetVar2(interp, tablePtr->arrayVar, Tcl_NewStringObj(buf,-1),
TCL_GLOBAL_ONLY));
}
if (result == NULL)
result = "";
if (tablePtr->caching && entryPtr != NULL) {
/*
* If we are caching, make sure we cache the returned value
*
* entryPtr will have been set from above, but check to make sure
* someone didn't change caching during -command evaluation.
*/
char *val;
val = (char *)ckalloc(strlen(result)+1);
strcpy(val, result);
Tcl_SetHashValue(entryPtr, val);
}
VALUE:
#ifdef PROCS
if (result != NULL) {
/* Do we have procs, are we showing their value, is this a proc? */
if (tablePtr->hasProcs && !tablePtr->showProcs && *result == '=' &&
!(r-tablePtr->rowOffset == tablePtr->activeRow &&
c-tablePtr->colOffset == tablePtr->activeCol)) {
Tcl_DString script;
/* provides a rough mutex on preventing proc loops */
entryPtr = Tcl_CreateHashEntry(tablePtr->inProc, buf, &new);
if (!new) {
Tcl_SetHashValue(entryPtr, 1);
Tcl_AddErrorInfo(interp, "\n\t(loop hit in proc evaled by table)");
return result;
}
Tcl_SetHashValue(entryPtr, 0);
Tcl_DStringInit(&script);
ExpandPercents(tablePtr, result+1, r, c, result+1, NULL,
0, &script, 0);
if (Tcl_GlobalEval(interp, Tcl_DStringValue(&script)) != TCL_OK ||
Tcl_GetHashValue(entryPtr) == 1) {
Tcl_AddErrorInfo(interp, "\n\tin proc evaled by table:\n");
Tcl_AddErrorInfo(interp, Tcl_DStringValue(&script));
Tcl_BackgroundError(interp);
} else {
result = Tcl_GetResult(interp);
}
/* Tcl_FreeResult(interp); Not Supported for perl/tk */
Tcl_DStringFree(&script);
Tcl_DeleteHashEntry(entryPtr);
}
}
#endif
return (result?result:"");
}
/*
*----------------------------------------------------------------------
*
* TableSetCellValue --
* Takes a row,col pair in user coords and saves the given value for
* that cell. This varies depending on what data source the
* user has selected.
*
* Results:
* Returns TCL_ERROR or TCL_OK, depending on whether an error
* occured during set (ie: during evaluation of -command).
*
* Side effects:
* If the value is NULL (empty string), it will be unset from
* an array rather than set to the empty string.
*
*----------------------------------------------------------------------
*/
int
TableSetCellValue(Table *tablePtr, int r, int c, char *value)
{
register Tcl_Interp *interp = tablePtr->interp;
char buf[INDEX_BUFSIZE];
int code = TCL_OK, flash = 0;
TableMakeArrayIndex(r, c, buf);
if (tablePtr->state == STATE_DISABLED) {
return TCL_OK;
}
if (tablePtr->command && tablePtr->useCmd) {
if (LangDoCallback(interp, tablePtr->command, 1, 4, "%d %d %d %_",1,r,c, LangStringArg(value)) == TCL_ERROR) {
/* An error resulted. Prevent further triggering of the command
* and set up the error message. */
tablePtr->useCmd = 0;
tablePtr->dataSource &= ~DATA_COMMAND;
if (tablePtr->arrayVar)
tablePtr->dataSource |= DATA_ARRAY;
Tcl_AddErrorInfo(interp, "\n\t(in command executed by table)");
Tcl_BackgroundError(interp);
code = TCL_ERROR;
} else {
flash = 1;
}
Tcl_SetResult(interp, NULL, TCL_STATIC);
} else if (tablePtr->arrayVar) {
/* Warning: checking for \0 as the first char could invalidate
* allowing it as a valid first char */
if ((value == NULL || *value == '\0') && tablePtr->sparse) {
/* perltk not supported */
/* Tcl_UnsetVar2(interp, LangString(Tcl_GetVar(interp, tablePtr->arrayVar, TCL_GLOBAL_ONLY)), buf, TCL_GLOBAL_ONLY); */
/* Replaced with This (defined in tkTable.xs) */
tkTableUnsetElement(tablePtr->arrayVar, buf);
} else if (Tcl_ObjSetVar2(interp, tablePtr->arrayVar, Tcl_NewStringObj(buf,-1), Tcl_NewStringObj(value,-1),
TCL_GLOBAL_ONLY|TCL_LEAVE_ERR_MSG) == NULL) {
code = TCL_ERROR;
}
}
if (code == TCL_ERROR) {
return TCL_ERROR;
}
if (tablePtr->caching) {
Tcl_HashEntry *entryPtr;
int new;
char *val;
entryPtr = Tcl_CreateHashEntry(tablePtr->cache, buf, &new);
if (!new) {
val = (char *) Tcl_GetHashValue(entryPtr);
if (val) ckfree(val);
}
val = (char *)ckalloc(strlen(value)+1);
strcpy(val, value);
Tcl_SetHashValue(entryPtr, val);
flash = 1;
}
/* We do this conditionally because the var array already has
* it's own check to flash */
if (flash && tablePtr->flashMode) {
r -= tablePtr->rowOffset;
c -= tablePtr->colOffset;
TableAddFlash(tablePtr, r, c);
TableRefresh(tablePtr, r, c, CELL);
}
return TCL_OK;
}
/*
*----------------------------------------------------------------------
*
* TableMoveCellValue --
* To move cells faster on delete/insert line or col when cache is on
* and variable, command is off.
* To avoid another call to TableMakeArrayIndex(r, c, buf),
* we optionally provide the buffers.
* outOfBounds means we will just set the cell value to ""
*
* Results:
* Returns TCL_ERROR or TCL_OK, depending on whether an error
* occured during set (ie: during evaluation of -command).
*
* Side effects:
* If the value is NULL (empty string), it will be unset from
* an array rather than set to the empty string.
*
*----------------------------------------------------------------------
*/
int
TableMoveCellValue(Table *tablePtr, int fromr, int fromc, char *frombuf,
int tor, int toc, char *tobuf, int outOfBounds)
{
int new;
char *result = NULL;
Tcl_Interp *interp = tablePtr->interp;
if (outOfBounds) {
return TableSetCellValue(tablePtr, tor, toc, "");
}
if (tablePtr->caching && (!(tablePtr->command && tablePtr->useCmd))) {
Tcl_HashEntry *entryPtr;
/*
* if we are caching, let's see if we have the value cached
*/
entryPtr = Tcl_CreateHashEntry(tablePtr->cache, frombuf, &new);
if (!new) {
char *val;
result = (char *) Tcl_GetHashValue(entryPtr);
/*
* we set tho old value to NULL
*/
Tcl_SetHashValue(entryPtr, NULL);
/*
* set the destination to the source pointer without new mallocing!
*/
entryPtr = Tcl_CreateHashEntry(tablePtr->cache, tobuf, &new);
/*
* free old value
*/
if (!new) {
val = (char *) Tcl_GetHashValue(entryPtr);
if (val) ckfree(val);
}
Tcl_SetHashValue(entryPtr, result);
if (tablePtr->arrayVar) {
/*
* first, delete from var.
*/
/* perltk not supported */
/*Tcl_UnsetVar2(interp, tablePtr->arrayVar, frombuf,
TCL_GLOBAL_ONLY);
*/
/* Replaced with This (defined in tkTable.xs) */
tkTableUnsetElement(tablePtr->arrayVar, frombuf);
/*
* Warning: checking for \0 as the first char could invalidate
* allowing it as a valid first char
*/
if (Tcl_ObjSetVar2(interp, tablePtr->arrayVar, Tcl_NewStringObj(tobuf,-1), Tcl_NewStringObj(result, -1),
TCL_GLOBAL_ONLY|TCL_LEAVE_ERR_MSG) == NULL) {
return TCL_ERROR;
}
}
return TCL_OK;
}
}
/*
* We have to do it the old way
*/
return TableSetCellValue(tablePtr, tor, toc,
TableGetCellValue(tablePtr, fromr, fromc));
}
/*
*----------------------------------------------------------------------
*
* TableGetIcursor --
* Parses the argument as an index into the active cell string.
* Recognises 'end', 'insert' or an integer. Constrains it to the
* size of the buffer. This acts like a "SetIcursor" when *posn is NULL.
*
* Results:
* If (posn != NULL), then it gets the cursor position.
*
* Side effects:
* Can move cursor position.
*
*----------------------------------------------------------------------
*/
int
TableGetIcursor(Table *tablePtr, char *arg, int *posn)
{
int tmp, len;
len = strlen(tablePtr->activeBuf);
#ifdef TCL_UTF_MAX
/* Need to base it off strlen to account for \x00 (Unicode null) */
len = Tcl_NumUtfChars(tablePtr->activeBuf, len);
#endif
/* ensure icursor didn't get out of sync */
if (tablePtr->icursor > len) tablePtr->icursor = len;
/* is this end */
if (strcmp(arg, "end") == 0) {
tmp = len;
} else if (strcmp(arg, "insert") == 0) {
tmp = tablePtr->icursor;
} else {
if (Tcl_GetIntFromObj(tablePtr->interp, LangStringArg(arg), &tmp) != TCL_OK) {
return TCL_ERROR;
}
CONSTRAIN(tmp, 0, len);
}
if (posn) {
*posn = tmp;
} else {
tablePtr->icursor = tmp;
}
return TCL_OK;
}
/*
*--------------------------------------------------------------
*
* TableGetIndex --
* Parse an index into a table and return either its value
* or an error.
*
* Results:
* A standard Tcl result. If all went well, then *row,*col is
* filled in with the index corresponding to string. If an
* error occurs then an error message is left in interp result.
* The index returned is in user coords.
*
* Side effects:
* Sets row,col index to an appropriately constrained user index.
*
*--------------------------------------------------------------
*/
int
TableGetIndex(tablePtr, str, row_p, col_p)
register Table *tablePtr; /* Table for which the index is being
* specified. */
char *str; /* Symbolic specification of cell in table. */
int *row_p; /* Where to store converted row. */
int *col_p; /* Where to store converted col. */
{
int r, c, len = strlen(str);
char dummy;
/*
* Note that all of these values will be adjusted by row/ColOffset
*/
if (str[0] == '@') { /* @x,y coordinate */
int x, y;
if (sscanf(str+1, "%d,%d%c", &x, &y, &dummy) != 2) {
/* Make sure it won't work for "2,3extrastuff" */
goto IndexError;
}
TableWhatCell(tablePtr, x, y, &r, &c);
r += tablePtr->rowOffset;
c += tablePtr->colOffset;
} else if (*str == '-' || isdigit(str[0])) {
if (sscanf(str, "%d,%d%c", &r, &c, &dummy) != 2) {
/* Make sure it won't work for "2,3extrastuff" */
goto IndexError;
}
/* ensure appropriate user index */
CONSTRAIN(r, tablePtr->rowOffset,
tablePtr->rows-1+tablePtr->rowOffset);
CONSTRAIN(c, tablePtr->colOffset,
tablePtr->cols-1+tablePtr->colOffset);
} else if (len > 1 && strncmp(str, "active", len) == 0 ) { /* active */
if (tablePtr->flags & HAS_ACTIVE) {
r = tablePtr->activeRow+tablePtr->rowOffset;
c = tablePtr->activeCol+tablePtr->colOffset;
} else {
Tcl_SetStringObj(Tcl_GetObjResult(tablePtr->interp),
"no \"active\" cell in table", -1);
return TCL_ERROR;
}
} else if (len > 1 && strncmp(str, "anchor", len) == 0) { /* anchor */
if (tablePtr->flags & HAS_ANCHOR) {
r = tablePtr->anchorRow+tablePtr->rowOffset;
c = tablePtr->anchorCol+tablePtr->colOffset;
} else {
Tcl_SetStringObj(Tcl_GetObjResult(tablePtr->interp),
"no \"anchor\" cell in table", -1);
return TCL_ERROR;
}
} else if (strncmp(str, "end", len) == 0) { /* end */
r = tablePtr->rows-1+tablePtr->rowOffset;
c = tablePtr->cols-1+tablePtr->colOffset;
} else if (strncmp(str, "origin", len) == 0) { /* origin */
r = tablePtr->titleRows+tablePtr->rowOffset;
c = tablePtr->titleCols+tablePtr->colOffset;
} else if (strncmp(str, "topleft", len) == 0) { /* topleft */
r = tablePtr->topRow+tablePtr->rowOffset;
c = tablePtr->leftCol+tablePtr->colOffset;
} else if (strncmp(str, "bottomright", len) == 0) { /* bottomright */
/*
* FIX: Should this avoid spans, or consider them in the bottomright?
tablePtr->flags |= AVOID_SPANS;
tablePtr->flags &= ~AVOID_SPANS;
*/
TableGetLastCell(tablePtr, &r, &c);
r += tablePtr->rowOffset;
c += tablePtr->colOffset;
} else {
IndexError:
Tcl_AppendStringsToObj(Tcl_GetObjResult(tablePtr->interp),
"bad table index \"", str, "\": must be active, anchor, end, ",
"origin, topleft, bottomright, @x,y, or <row>,<col>",
NULL);
return TCL_ERROR;
}
/* Note: values are expected to be properly constrained
* as a user index by this point */
if (row_p) *row_p = r;
if (col_p) *col_p = c;
return TCL_OK;
}
/*
*--------------------------------------------------------------
*
* Table_SetCmd --
* This procedure is invoked to process the set method
* that corresponds to a widget managed by this module.
* See the user documentation for details on what it does.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* See the user documentation.
*
*--------------------------------------------------------------
*/
int
Table_SetCmd(ClientData clientData, register Tcl_Interp *interp,
int objc, Tcl_Obj *CONST objv[])
{
register Table *tablePtr = (Table *)clientData;
int row, col, len, i, j, max;
char *str;
/* sets any number of tags/indices to a given value */
if (objc < 3) {
CMD_SET_USAGE:
Tcl_WrongNumArgs(interp, 2, objv,
"?row|col? index ?value? ?index value ...?");
return TCL_ERROR;
}
/* make sure there is a data source to accept set */
if (tablePtr->dataSource == DATA_NONE) {
return TCL_OK;
}
str = Tcl_GetStringFromObj(objv[2], &len);
if (strncmp(str, "row", len) == 0 || strncmp(str, "col", len) == 0) {
Tcl_Obj *resultPtr = Tcl_GetObjResult(interp);
/* set row index list ?index list ...? */
if (objc < 4) {
goto CMD_SET_USAGE;
} else if (objc == 4) {
if (TableGetIndexObj(tablePtr, objv[3],
&row, &col) != TCL_OK) {
return TCL_ERROR;
}
if (*str == 'r') {
max = tablePtr->cols+tablePtr->colOffset;
for (i=col; i<max; i++) {
str = TableGetCellValue(tablePtr, row, i);
Tcl_ListObjAppendElement(NULL, resultPtr,
Tcl_NewStringObj(str, -1));
}
} else {
max = tablePtr->rows+tablePtr->rowOffset;
for (i=row; i<max; i++) {
str = TableGetCellValue(tablePtr, i, col);
Tcl_ListObjAppendElement(NULL, resultPtr,
Tcl_NewStringObj(str, -1));
}
}
} else if (tablePtr->state == STATE_NORMAL) {
int listc;
Tcl_Obj **listv;
/* make sure there are an even number of index/list pairs */
if (objc & 0) {
goto CMD_SET_USAGE;
}
for (i = 3; i < objc-1; i += 2) {
if ((TableGetIndexObj(tablePtr, objv[i],
&row, &col) != TCL_OK) ||
(Tcl_ListObjGetElements(interp, objv[i+1],
&listc, &listv) != TCL_OK)) {
return TCL_ERROR;
}
if (*str == 'r') {
max = col+MIN(tablePtr->cols+tablePtr->colOffset-col,
listc);
for (j = col; j < max; j++) {
if (TableSetCellValue(tablePtr, row, j,
Tcl_GetString(listv[j-col]))
!= TCL_OK) {
return TCL_ERROR;
}
if (row-tablePtr->rowOffset == tablePtr->activeRow &&
j-tablePtr->colOffset == tablePtr->activeCol) {
TableGetActiveBuf(tablePtr);
}
TableRefresh(tablePtr, row-tablePtr->rowOffset,
j-tablePtr->colOffset, CELL);
}
} else {
max = row+MIN(tablePtr->rows+tablePtr->rowOffset-row,
listc);
for (j = row; j < max; j++) {
if (TableSetCellValue(tablePtr, j, col,
Tcl_GetString(listv[j-row]))
!= TCL_OK) {
return TCL_ERROR;
}
if (j-tablePtr->rowOffset == tablePtr->activeRow &&
col-tablePtr->colOffset == tablePtr->activeCol) {
TableGetActiveBuf(tablePtr);
}
TableRefresh(tablePtr, j-tablePtr->rowOffset,
col-tablePtr->colOffset, CELL);
}
}
}
}
} else if (objc == 3) {
/* set index */
if (TableGetIndexObj(tablePtr, objv[2], &row, &col) != TCL_OK) {
return TCL_ERROR;
} else {
/*
* Cannot use Tcl_GetObjResult here because TableGetCellValue
* can corrupt the resultPtr.
*/
Tcl_SetObjResult(interp, Tcl_NewStringObj(
TableGetCellValue(tablePtr, row, col),-1));
}
} else {
/* set index val ?index val ...? */
/* make sure there are an even number of index/value pairs */
if (objc & 1) {
goto CMD_SET_USAGE;
}
for (i = 2; i < objc-1; i += 2) {
if ((TableGetIndexObj(tablePtr, objv[i], &row, &col) != TCL_OK) ||
(TableSetCellValue(tablePtr, row, col,
Tcl_GetString(objv[i+1])) != TCL_OK)) {
return TCL_ERROR;
}
row -= tablePtr->rowOffset;
col -= tablePtr->colOffset;
if (row == tablePtr->activeRow && col == tablePtr->activeCol) {
TableGetActiveBuf(tablePtr);
}
TableRefresh(tablePtr, row, col, CELL);
}
}
return TCL_OK;
}
/*
*--------------------------------------------------------------
*
* Table_SpanSet --
* Takes row,col in user coords and sets a span on the
* cell if possible
*
* Results:
* A standard Tcl result
*
* Side effects:
* The span can be constrained
*
*--------------------------------------------------------------
*/
static int
Table_SpanSet(register Table *tablePtr, int urow, int ucol, int rs, int cs)
{
Tcl_Interp *interp = tablePtr->interp;
int i, j, new, ors, ocs, result = TCL_OK;
int row, col;
Tcl_HashEntry *entryPtr;
Tcl_HashSearch search;
char *dbuf, buf[INDEX_BUFSIZE], cell[INDEX_BUFSIZE], span[INDEX_BUFSIZE];
row = urow - tablePtr->rowOffset;
col = ucol - tablePtr->colOffset;
TableMakeArrayIndex(urow, ucol, cell);
if (tablePtr->spanTbl == NULL) {
tablePtr->spanTbl = (Tcl_HashTable *)ckalloc(sizeof(Tcl_HashTable));
Tcl_InitHashTable(tablePtr->spanTbl, TCL_STRING_KEYS);
tablePtr->spanAffTbl = (Tcl_HashTable *)ckalloc(sizeof(Tcl_HashTable));
Tcl_InitHashTable(tablePtr->spanAffTbl, TCL_STRING_KEYS);
}
/* first check in the affected cells table */
if ((entryPtr=Tcl_FindHashEntry(tablePtr->spanAffTbl, cell)) != NULL) {
/* We have to make sure this was not already hidden
* that's an error */
if ((char *)Tcl_GetHashValue(entryPtr) != NULL) {
Tcl_AppendStringsToObj(Tcl_GetObjResult(interp),
"cannot set spanning on hidden cell ",
cell, NULL);
return TCL_ERROR;
}
}
/* do constraints on the spans
* title cells must not expand beyond the titles
* other cells can't expand negatively into title area
*/
if ((row < tablePtr->titleRows) &&
(row + rs >= tablePtr->titleRows)) {
rs = tablePtr->titleRows - row - 1;
}
if ((col < tablePtr->titleCols) &&
(col + cs >= tablePtr->titleCols)) {
cs = tablePtr->titleCols - col - 1;
}
rs = MAX(0, rs);
cs = MAX(0, cs);
/* then work in the span cells table */
if ((entryPtr = Tcl_FindHashEntry(tablePtr->spanTbl, cell)) != NULL) {
/* We have to readjust for what was there first */
TableParseArrayIndex(&ors, &ocs, (char *)Tcl_GetHashValue(entryPtr));
ckfree((char *) Tcl_GetHashValue(entryPtr));
Tcl_DeleteHashEntry(entryPtr);
for (i = urow; i <= urow+ors; i++) {
for (j = ucol; j <= ucol+ocs; j++) {
TableMakeArrayIndex(i, j, buf);
entryPtr = Tcl_FindHashEntry(tablePtr->spanAffTbl, buf);
if (entryPtr != NULL) {
Tcl_DeleteHashEntry(entryPtr);
}
TableRefresh(tablePtr, i-tablePtr->rowOffset,
j-tablePtr->colOffset, CELL);
}
}
} else {
ors = ocs = 0;
}
/* calc to make sure that span is OK */
for (i = urow; i <= urow+rs; i++) {
for (j = ucol; j <= ucol+cs; j++) {
TableMakeArrayIndex(i, j, buf);
entryPtr = Tcl_FindHashEntry(tablePtr->spanAffTbl, buf);
if (entryPtr != NULL) {
/* Something already spans here */
Tcl_AppendStringsToObj(Tcl_GetObjResult(interp),
"cannot overlap already spanned cell ",
buf, NULL);
result = TCL_ERROR;
rs = ors;
cs = ocs;
break;
}
}
if (result == TCL_ERROR)
break;
}
/* 0,0 span means set to unspanned again */
if (rs == 0 && cs == 0) {
entryPtr = Tcl_FindHashEntry(tablePtr->spanTbl, cell);
if (entryPtr != NULL) {
ckfree((char *) Tcl_GetHashValue(entryPtr));
Tcl_DeleteHashEntry(entryPtr);
}
entryPtr = Tcl_FindHashEntry(tablePtr->spanAffTbl, cell);
if (entryPtr != NULL) {
Tcl_DeleteHashEntry(entryPtr);
}
if (Tcl_FirstHashEntry(tablePtr->spanTbl, &search) == NULL) {
/* There are no more spans, so delete tables to improve
* performance of TableCellCoords */
Tcl_DeleteHashTable(tablePtr->spanTbl);
ckfree((char *) (tablePtr->spanTbl));
Tcl_DeleteHashTable(tablePtr->spanAffTbl);
ckfree((char *) (tablePtr->spanAffTbl));
tablePtr->spanTbl = NULL;
tablePtr->spanAffTbl = NULL;
}
return result;
}
/* Make sure there is no extra stuff */
TableMakeArrayIndex(rs, cs, span);
/* Set affected cell table to a NULL value */
entryPtr = Tcl_CreateHashEntry(tablePtr->spanAffTbl, cell, &new);
Tcl_SetHashValue(entryPtr, NULL);
/* set the spanning cells table with span value */
entryPtr = Tcl_CreateHashEntry(tablePtr->spanTbl, cell, &new);
dbuf = (char *)ckalloc(strlen(span)+1);
strcpy(dbuf, span);
Tcl_SetHashValue(entryPtr, dbuf);
dbuf = Tcl_GetHashKey(tablePtr->spanTbl, entryPtr);
/* Set other affected cells */
EmbWinUnmap(tablePtr, row, row + rs, col, col + cs);
for (i = urow; i <= urow+rs; i++) {
for (j = ucol; j <= ucol+cs; j++) {
TableMakeArrayIndex(i, j, buf);
entryPtr = Tcl_CreateHashEntry(tablePtr->spanAffTbl, buf, &new);
if (!(i == urow && j == ucol)) {
Tcl_SetHashValue(entryPtr, (char *) dbuf);
}
}
}
TableRefresh(tablePtr, row, col, CELL);
return result;
}
/*
*--------------------------------------------------------------
*
* Table_SpanCmd --
* This procedure is invoked to process the span method
* that corresponds to a widget managed by this module.
* See the user documentation for details on what it does.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* See the user documentation.
*
*--------------------------------------------------------------
*/
int
Table_SpanCmd(ClientData clientData, register Tcl_Interp *interp,
int objc, Tcl_Obj *CONST objv[])
{
register Table *tablePtr = (Table *) clientData;
int rs, cs, row, col, i;
Tcl_HashEntry *entryPtr;
Tcl_Obj *objPtr, *resultPtr;
if (objc < 2 || (objc > 4 && (objc&1))) {
Tcl_WrongNumArgs(interp, 2, objv,
"?index? ?rows,cols index rows,cols ...?");
return TCL_ERROR;
}
resultPtr = Tcl_GetObjResult(interp);
if (objc == 2) {
if (tablePtr->spanTbl) {
Tcl_HashSearch search;
for (entryPtr = Tcl_FirstHashEntry(tablePtr->spanTbl, &search);
entryPtr != NULL; entryPtr = Tcl_NextHashEntry(&search)) {
objPtr = Tcl_NewStringObj(Tcl_GetHashKey(tablePtr->spanTbl,
entryPtr), -1);
Tcl_ListObjAppendElement(NULL, resultPtr, objPtr);
objPtr = Tcl_NewStringObj((char *) Tcl_GetHashValue(entryPtr),
-1);
Tcl_ListObjAppendElement(NULL, resultPtr, objPtr);
}
}
return TCL_OK;
} else if (objc == 3) {
if (TableGetIndexObj(tablePtr, objv[2], &row, &col) == TCL_ERROR) {
return TCL_ERROR;
}
/* Just return the spanning values of the one cell */
if (tablePtr->spanTbl &&
(entryPtr = Tcl_FindHashEntry(tablePtr->spanTbl,
Tcl_GetString(objv[2]))) != NULL) {
Tcl_SetStringObj(resultPtr,
(char *)Tcl_GetHashValue(entryPtr), -1);
}
return TCL_OK;
} else {
for (i = 2; i < objc-1; i += 2) {
if (TableGetIndexObj(tablePtr, objv[i], &row, &col) == TCL_ERROR ||
(TableParseArrayIndex(&rs, &cs,
Tcl_GetString(objv[i+1])) != 2) ||
Table_SpanSet(tablePtr, row, col, rs, cs) == TCL_ERROR) {
return TCL_ERROR;
}
}
}
return TCL_OK;
}
/*
*--------------------------------------------------------------
*
* Table_HiddenCmd --
* This procedure is invoked to process the hidden method
* that corresponds to a widget managed by this module.
* See the user documentation for details on what it does.
*
* Results:
* A standard Tcl result.
*
* Side effects:
* See the user documentation.
*
*--------------------------------------------------------------
*/
int
Table_HiddenCmd(ClientData clientData, register Tcl_Interp *interp,
int objc, Tcl_Obj *CONST objv[])
{
register Table *tablePtr = (Table *) clientData;
int i, row, col;
Tcl_HashEntry *entryPtr;
char *span;
if (objc < 2) {
Tcl_WrongNumArgs(interp, 2, objv, "?index? ?index ...?");
return TCL_ERROR;
}
if (tablePtr->spanTbl == NULL) {
/* Avoid the whole thing if we have no spans */
if (objc > 3) {
Tcl_SetBooleanObj(Tcl_GetObjResult(interp), 0);
}
return TCL_OK;
}
if (objc == 2) {
/* return all "hidden" cells */
Tcl_DString cells;
Tcl_HashSearch search;
Tcl_DStringInit(&cells);
for (entryPtr = Tcl_FirstHashEntry(tablePtr->spanAffTbl, &search);
entryPtr != NULL; entryPtr = Tcl_NextHashEntry(&search)) {
if ((span = (char *) Tcl_GetHashValue(entryPtr)) == NULL) {
/* this is actually a spanning cell */
continue;
}
Tcl_DStringAppendElement(&cells,
Tcl_GetHashKey(tablePtr->spanAffTbl,
entryPtr));
}
span = Tcl_GetString(TableCellSort(tablePtr, Tcl_DStringValue(&cells)));
if (span != NULL) {
Tcl_SetResult(interp, span, TCL_DYNAMIC);
}
Tcl_DStringFree(&cells);
return TCL_OK;
}
if (objc == 3) {
if (TableGetIndexObj(tablePtr, objv[2], &row, &col) != TCL_OK) {
return TCL_ERROR;
}
/* Just return the spanning values of the one cell */
entryPtr = Tcl_FindHashEntry(tablePtr->spanAffTbl,
Tcl_GetString(objv[2]));
if (entryPtr != NULL &&
(span = (char *)Tcl_GetHashValue(entryPtr)) != NULL) {
/* this is a hidden cell */
Tcl_SetStringObj(Tcl_GetObjResult(interp), span, -1);
}
return TCL_OK;
}
for (i = 2; i < objc; i++) {
if (TableGetIndexObj(tablePtr, objv[i], &row, &col) == TCL_ERROR) {
return TCL_ERROR;
}
entryPtr = Tcl_FindHashEntry(tablePtr->spanAffTbl,
Tcl_GetString(objv[i]));
if (entryPtr != NULL &&
(char *)Tcl_GetHashValue(entryPtr) != NULL) {
/* this is a hidden cell */
continue;
}
/* We only reach here if it doesn't satisfy "hidden" criteria */
Tcl_SetBooleanObj(Tcl_GetObjResult(interp), 0);
return TCL_OK;
}
Tcl_SetBooleanObj(Tcl_GetObjResult(interp), 1);
return TCL_OK;
}
/*
*--------------------------------------------------------------
*
* TableSpanSanCheck --
* This procedure is invoked by TableConfigure to make sure
* that spans are kept sane according to the docs.
* See the user documentation for details on what it does.
*
* Results:
* void.
*
* Side effects:
* Spans in title areas can be reconstrained.
*
*--------------------------------------------------------------
*/
void
TableSpanSanCheck(register Table *tablePtr)
{
int rs, cs, row, col, reset;
Tcl_HashEntry *entryPtr;
Tcl_HashSearch search;
if (tablePtr->spanTbl == NULL) {
return;
}
for (entryPtr = Tcl_FirstHashEntry(tablePtr->spanTbl, &search);
entryPtr != NULL; entryPtr = Tcl_NextHashEntry(&search)) {
reset = 0;
TableParseArrayIndex(&row, &col,
Tcl_GetHashKey(tablePtr->spanTbl, entryPtr));
TableParseArrayIndex(&rs, &cs,
(char *) Tcl_GetHashValue(entryPtr));
if ((row-tablePtr->rowOffset < tablePtr->titleRows) &&
(row-tablePtr->rowOffset+rs >= tablePtr->titleRows)) {
rs = tablePtr->titleRows-(row-tablePtr->rowOffset)-1;
reset = 1;
}
if ((col-tablePtr->colOffset < tablePtr->titleCols) &&
(col-tablePtr->colOffset+cs >= tablePtr->titleCols)) {
cs = tablePtr->titleCols-(col-tablePtr->colOffset)-1;
reset = 1;
}
if (reset) {
Table_SpanSet(tablePtr, row, col, rs, cs);
}
}
}
|