/usr/share/tcltk/tcllib1.16/struct/matrix1.tcl is in tcllib 1.16-dfsg-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 | # matrix.tcl --
#
# Implementation of a matrix data structure for Tcl.
#
# Copyright (c) 2001 by Andreas Kupries <andreas_kupries@users.sourceforge.net>
#
# Heapsort code Copyright (c) 2003 by Edwin A. Suominen <ed@eepatents.com>,
# based on concepts in "Introduction to Algorithms" by Thomas H. Cormen et al.
#
# See the file "license.terms" for information on usage and redistribution
# of this file, and for a DISCLAIMER OF ALL WARRANTIES.
#
# RCS: @(#) $Id: matrix1.tcl,v 1.3 2005/09/28 04:51:24 andreas_kupries Exp $
package require Tcl 8.2
namespace eval ::struct {}
namespace eval ::struct::matrix {
# Data storage in the matrix module
# -------------------------------
#
# One namespace per object, containing
#
# - Two scalar variables containing the current number of rows and columns.
# - Four array variables containing the array data, the caches for
# rowheights and columnwidths and the information about linked arrays.
#
# The variables are
# - columns #columns in data
# - rows #rows in data
# - data cell contents
# - colw cache of columnwidths
# - rowh cache of rowheights
# - link information about linked arrays
# - lock boolean flag to disable MatTraceIn while in MatTraceOut [#532783]
# - unset string used to convey information about 'unset' traces from MatTraceIn to MatTraceOut.
# counter is used to give a unique name for unnamed matrices
variable counter 0
# Only export one command, the one used to instantiate a new matrix
namespace export matrix
}
# ::struct::matrix::matrix --
#
# Create a new matrix with a given name; if no name is given, use
# matrixX, where X is a number.
#
# Arguments:
# name Optional name of the matrix; if null or not given, generate one.
#
# Results:
# name Name of the matrix created
proc ::struct::matrix::matrix {{name ""}} {
variable counter
if { [llength [info level 0]] == 1 } {
incr counter
set name "matrix${counter}"
}
# FIRST, qualify the name.
if {![string match "::*" $name]} {
# Get caller's namespace; append :: if not global namespace.
set ns [uplevel 1 namespace current]
if {"::" != $ns} {
append ns "::"
}
set name "$ns$name"
}
if { [llength [info commands $name]] } {
return -code error "command \"$name\" already exists, unable to create matrix"
}
# Set up the namespace
namespace eval $name {
variable columns 0
variable rows 0
variable data
variable colw
variable rowh
variable link
variable lock
variable unset
array set data {}
array set colw {}
array set rowh {}
array set link {}
set lock 0
set unset {}
}
# Create the command to manipulate the matrix
interp alias {} $name {} ::struct::matrix::MatrixProc $name
return $name
}
##########################
# Private functions follow
# ::struct::matrix::MatrixProc --
#
# Command that processes all matrix object commands.
#
# Arguments:
# name Name of the matrix object to manipulate.
# cmd Subcommand to invoke.
# args Arguments for subcommand.
#
# Results:
# Varies based on command to perform
proc ::struct::matrix::MatrixProc {name {cmd ""} args} {
# Do minimal args checks here
if { [llength [info level 0]] == 2 } {
return -code error "wrong # args: should be \"$name option ?arg arg ...?\""
}
# Split the args into command and args components
set sub _$cmd
if {[llength [info commands ::struct::matrix::$sub]] == 0} {
set optlist [lsort [info commands ::struct::matrix::_*]]
set xlist {}
foreach p $optlist {
set p [namespace tail $p]
if {[string match __* $p]} {continue}
lappend xlist [string range $p 1 end]
}
set optlist [linsert [join $xlist ", "] "end-1" "or"]
return -code error \
"bad option \"$cmd\": must be $optlist"
}
uplevel 1 [linsert $args 0 ::struct::matrix::$sub $name]
}
# ::struct::matrix::_add --
#
# Command that processes all 'add' subcommands.
#
# Arguments:
# name Name of the matrix object to manipulate.
# cmd Subcommand of 'add' to invoke.
# args Arguments for subcommand of 'add'.
#
# Results:
# Varies based on command to perform
proc ::struct::matrix::_add {name {cmd ""} args} {
# Do minimal args checks here
if { [llength [info level 0]] == 2 } {
return -code error "wrong # args: should be \"$name add option ?arg arg ...?\""
}
# Split the args into command and args components
set sub __add_$cmd
if { [llength [info commands ::struct::matrix::$sub]] == 0 } {
set optlist [lsort [info commands ::struct::matrix::__add_*]]
set xlist {}
foreach p $optlist {
set p [namespace tail $p]
lappend xlist [string range $p 6 end]
}
set optlist [linsert [join $xlist ", "] "end-1" "or"]
return -code error \
"bad option \"$cmd\": must be $optlist"
}
uplevel 1 [linsert $args 0 ::struct::matrix::$sub $name]
}
# ::struct::matrix::_delete --
#
# Command that processes all 'delete' subcommands.
#
# Arguments:
# name Name of the matrix object to manipulate.
# cmd Subcommand of 'delete' to invoke.
# args Arguments for subcommand of 'delete'.
#
# Results:
# Varies based on command to perform
proc ::struct::matrix::_delete {name {cmd ""} args} {
# Do minimal args checks here
if { [llength [info level 0]] == 2 } {
return -code error "wrong # args: should be \"$name delete option ?arg arg ...?\""
}
# Split the args into command and args components
set sub __delete_$cmd
if { [llength [info commands ::struct::matrix::$sub]] == 0 } {
set optlist [lsort [info commands ::struct::matrix::__delete_*]]
set xlist {}
foreach p $optlist {
set p [namespace tail $p]
lappend xlist [string range $p 9 end]
}
set optlist [linsert [join $xlist ", "] "end-1" "or"]
return -code error \
"bad option \"$cmd\": must be $optlist"
}
uplevel 1 [linsert $args 0 ::struct::matrix::$sub $name]
}
# ::struct::matrix::_format --
#
# Command that processes all 'format' subcommands.
#
# Arguments:
# name Name of the matrix object to manipulate.
# cmd Subcommand of 'format' to invoke.
# args Arguments for subcommand of 'format'.
#
# Results:
# Varies based on command to perform
proc ::struct::matrix::_format {name {cmd ""} args} {
# Do minimal args checks here
if { [llength [info level 0]] == 2 } {
return -code error "wrong # args: should be \"$name format option ?arg arg ...?\""
}
# Split the args into command and args components
set sub __format_$cmd
if { [llength [info commands ::struct::matrix::$sub]] == 0 } {
set optlist [lsort [info commands ::struct::matrix::__format_*]]
set xlist {}
foreach p $optlist {
set p [namespace tail $p]
lappend xlist [string range $p 9 end]
}
set optlist [linsert [join $xlist ", "] "end-1" "or"]
return -code error \
"bad option \"$cmd\": must be $optlist"
}
uplevel 1 [linsert $args 0 ::struct::matrix::$sub $name]
}
# ::struct::matrix::_get --
#
# Command that processes all 'get' subcommands.
#
# Arguments:
# name Name of the matrix object to manipulate.
# cmd Subcommand of 'get' to invoke.
# args Arguments for subcommand of 'get'.
#
# Results:
# Varies based on command to perform
proc ::struct::matrix::_get {name {cmd ""} args} {
# Do minimal args checks here
if { [llength [info level 0]] == 2 } {
return -code error "wrong # args: should be \"$name get option ?arg arg ...?\""
}
# Split the args into command and args components
set sub __get_$cmd
if { [llength [info commands ::struct::matrix::$sub]] == 0 } {
set optlist [lsort [info commands ::struct::matrix::__get_*]]
set xlist {}
foreach p $optlist {
set p [namespace tail $p]
lappend xlist [string range $p 6 end]
}
set optlist [linsert [join $xlist ", "] "end-1" "or"]
return -code error \
"bad option \"$cmd\": must be $optlist"
}
uplevel 1 [linsert $args 0 ::struct::matrix::$sub $name]
}
# ::struct::matrix::_insert --
#
# Command that processes all 'insert' subcommands.
#
# Arguments:
# name Name of the matrix object to manipulate.
# cmd Subcommand of 'insert' to invoke.
# args Arguments for subcommand of 'insert'.
#
# Results:
# Varies based on command to perform
proc ::struct::matrix::_insert {name {cmd ""} args} {
# Do minimal args checks here
if { [llength [info level 0]] == 2 } {
return -code error "wrong # args: should be \"$name insert option ?arg arg ...?\""
}
# Split the args into command and args components
set sub __insert_$cmd
if { [llength [info commands ::struct::matrix::$sub]] == 0 } {
set optlist [lsort [info commands ::struct::matrix::__insert_*]]
set xlist {}
foreach p $optlist {
set p [namespace tail $p]
lappend xlist [string range $p 9 end]
}
set optlist [linsert [join $xlist ", "] "end-1" "or"]
return -code error \
"bad option \"$cmd\": must be $optlist"
}
uplevel 1 [linsert $args 0 ::struct::matrix::$sub $name]
}
# ::struct::matrix::_search --
#
# Command that processes all 'search' subcommands.
#
# Arguments:
# name Name of the matrix object to manipulate.
# args Arguments for search.
#
# Results:
# Varies based on command to perform
proc ::struct::matrix::_search {name args} {
set mode exact
set nocase 0
while {1} {
switch -glob -- [lindex $args 0] {
-exact - -glob - -regexp {
set mode [string range [lindex $args 0] 1 end]
set args [lrange $args 1 end]
}
-nocase {
set nocase 1
}
-* {
return -code error \
"invalid option \"[lindex $args 0]\":\
should be -nocase, -exact, -glob, or -regexp"
}
default {
break
}
}
}
# Possible argument signatures after option processing
#
# \ | args
# --+--------------------------------------------------------
# 2 | all pattern
# 3 | row row pattern, column col pattern
# 6 | rect ctl rtl cbr rbr pattern
#
# All range specifications are internally converted into a
# rectangle.
switch -exact -- [llength $args] {
2 - 3 - 6 {}
default {
return -code error \
"wrong # args: should be\
\"$name search ?option...? (all|row row|column col|rect c r c r) pattern\""
}
}
set range [lindex $args 0]
set pattern [lindex $args end]
set args [lrange $args 1 end-1]
variable ${name}::data
variable ${name}::columns
variable ${name}::rows
switch -exact -- $range {
all {
set ctl 0 ; set cbr $columns ; incr cbr -1
set rtl 0 ; set rbr $rows ; incr rbr -1
}
column {
set ctl [ChkColumnIndex $name [lindex $args 0]]
set cbr $ctl
set rtl 0 ; set rbr $rows ; incr rbr -1
}
row {
set rtl [ChkRowIndex $name [lindex $args 0]]
set ctl 0 ; set cbr $columns ; incr cbr -1
set rbr $rtl
}
rect {
foreach {ctl rtl cbr rbr} $args break
set ctl [ChkColumnIndex $name $ctl]
set rtl [ChkRowIndex $name $rtl]
set cbr [ChkColumnIndex $name $cbr]
set rbr [ChkRowIndex $name $rbr]
if {($ctl > $cbr) || ($rtl > $rbr)} {
return -code error "Invalid cell indices, wrong ordering"
}
}
default {
return -code error "invalid range spec \"$range\": should be all, column, row, or rect"
}
}
if {$nocase} {
set pattern [string tolower $pattern]
}
set matches [list]
for {set r $rtl} {$r <= $rbr} {incr r} {
for {set c $ctl} {$c <= $cbr} {incr c} {
set v $data($c,$r)
if {$nocase} {
set v [string tolower $v]
}
switch -exact -- $mode {
exact {set matched [string equal $pattern $v]}
glob {set matched [string match $pattern $v]}
regexp {set matched [regexp -- $pattern $v]}
}
if {$matched} {
lappend matches [list $c $r]
}
}
}
return $matches
}
# ::struct::matrix::_set --
#
# Command that processes all 'set' subcommands.
#
# Arguments:
# name Name of the matrix object to manipulate.
# cmd Subcommand of 'set' to invoke.
# args Arguments for subcommand of 'set'.
#
# Results:
# Varies based on command to perform
proc ::struct::matrix::_set {name {cmd ""} args} {
# Do minimal args checks here
if { [llength [info level 0]] == 2 } {
return -code error "wrong # args: should be \"$name set option ?arg arg ...?\""
}
# Split the args into command and args components
set sub __set_$cmd
if { [llength [info commands ::struct::matrix::$sub]] == 0 } {
set optlist [lsort [info commands ::struct::matrix::__set_*]]
set xlist {}
foreach p $optlist {
set p [namespace tail $p]
lappend xlist [string range $p 6 end]
}
set optlist [linsert [join $xlist ", "] "end-1" "or"]
return -code error \
"bad option \"$cmd\": must be $optlist"
}
uplevel 1 [linsert $args 0 ::struct::matrix::$sub $name]
}
# ::struct::matrix::_sort --
#
# Command that processes all 'sort' subcommands.
#
# Arguments:
# name Name of the matrix object to manipulate.
# cmd Subcommand of 'sort' to invoke.
# args Arguments for subcommand of 'sort'.
#
# Results:
# Varies based on command to perform
proc ::struct::matrix::_sort {name cmd args} {
# Do minimal args checks here
if { [llength [info level 0]] == 2 } {
return -code error "wrong # args: should be \"$name sort option ?arg arg ...?\""
}
if {[string equal $cmd "rows"]} {
set code r
set byrows 1
} elseif {[string equal $cmd "columns"]} {
set code c
set byrows 0
} else {
return -code error \
"bad option \"$cmd\": must be columns, or rows"
}
set revers 0 ;# Default: -increasing
while {1} {
switch -glob -- [lindex $args 0] {
-increasing {set revers 0}
-decreasing {set revers 1}
default {
if {[llength $args] > 1} {
return -code error \
"invalid option \"[lindex $args 0]\":\
should be -increasing, or -decreasing"
}
break
}
}
set args [lrange $args 1 end]
}
# ASSERT: [llength $args] == 1
if {[llength $args] != 1} {
return -code error "wrong # args: should be \"$name sort option ?arg arg ...?\""
}
set key [lindex $args 0]
if {$byrows} {
set key [ChkColumnIndex $name $key]
variable ${name}::rows
# Adapted by EAS from BUILD-MAX-HEAP(A) of CRLS 6.3
set heapSize $rows
} else {
set key [ChkRowIndex $name $key]
variable ${name}::columns
# Adapted by EAS from BUILD-MAX-HEAP(A) of CRLS 6.3
set heapSize $columns
}
for {set i [expr {int($heapSize/2)-1}]} {$i>=0} {incr i -1} {
SortMaxHeapify $name $i $key $code $heapSize $revers
}
# Adapted by EAS from remainder of HEAPSORT(A) of CRLS 6.4
for {set i [expr {$heapSize-1}]} {$i>=1} {incr i -1} {
if {$byrows} {
SwapRows $name 0 $i
} else {
SwapColumns $name 0 $i
}
incr heapSize -1
SortMaxHeapify $name 0 $key $code $heapSize $revers
}
return
}
# ::struct::matrix::_swap --
#
# Command that processes all 'swap' subcommands.
#
# Arguments:
# name Name of the matrix object to manipulate.
# cmd Subcommand of 'swap' to invoke.
# args Arguments for subcommand of 'swap'.
#
# Results:
# Varies based on command to perform
proc ::struct::matrix::_swap {name {cmd ""} args} {
# Do minimal args checks here
if { [llength [info level 0]] == 2 } {
return -code error "wrong # args: should be \"$name swap option ?arg arg ...?\""
}
# Split the args into command and args components
set sub __swap_$cmd
if { [llength [info commands ::struct::matrix::$sub]] == 0 } {
set optlist [lsort [info commands ::struct::matrix::__swap_*]]
set xlist {}
foreach p $optlist {
set p [namespace tail $p]
lappend xlist [string range $p 7 end]
}
set optlist [linsert [join $xlist ", "] "end-1" "or"]
return -code error \
"bad option \"$cmd\": must be $optlist"
}
uplevel 1 [linsert $args 0 ::struct::matrix::$sub $name]
}
# ::struct::matrix::__add_column --
#
# Extends the matrix by one column and then acts like
# "setcolumn" (see below) on this new column if there were
# "values" supplied. Without "values" the new cells will be set
# to the empty string. The new column is appended immediately
# behind the last existing column.
#
# Arguments:
# name Name of the matrix object.
# values Optional values to set into the new row.
#
# Results:
# None.
proc ::struct::matrix::__add_column {name {values {}}} {
variable ${name}::data
variable ${name}::columns
variable ${name}::rows
variable ${name}::rowh
if {[set l [llength $values]] < $rows} {
# Missing values. Fill up with empty strings
for {} {$l < $rows} {incr l} {
lappend values {}
}
} elseif {[llength $values] > $rows} {
# To many values. Remove the superfluous items
set values [lrange $values 0 [expr {$rows - 1}]]
}
# "values" now contains the information to set into the array.
# Regarding the width and height caches:
# - The new column is not added to the width cache, the other
# columns are not touched, the cache therefore unchanged.
# - The rows are either removed from the height cache or left
# unchanged, depending on the contents set into the cell.
set r 0
foreach v $values {
if {$v != {}} {
# Data changed unpredictably, invalidate cache
catch {unset rowh($r)}
} ; # {else leave the row unchanged}
set data($columns,$r) $v
incr r
}
incr columns
return
}
# ::struct::matrix::__add_row --
#
# Extends the matrix by one row and then acts like "setrow" (see
# below) on this new row if there were "values"
# supplied. Without "values" the new cells will be set to the
# empty string. The new row is appended immediately behind the
# last existing row.
#
# Arguments:
# name Name of the matrix object.
# values Optional values to set into the new row.
#
# Results:
# None.
proc ::struct::matrix::__add_row {name {values {}}} {
variable ${name}::data
variable ${name}::columns
variable ${name}::rows
variable ${name}::colw
if {[set l [llength $values]] < $columns} {
# Missing values. Fill up with empty strings
for {} {$l < $columns} {incr l} {
lappend values {}
}
} elseif {[llength $values] > $columns} {
# To many values. Remove the superfluous items
set values [lrange $values 0 [expr {$columns - 1}]]
}
# "values" now contains the information to set into the array.
# Regarding the width and height caches:
# - The new row is not added to the height cache, the other
# rows are not touched, the cache therefore unchanged.
# - The columns are either removed from the width cache or left
# unchanged, depending on the contents set into the cell.
set c 0
foreach v $values {
if {$v != {}} {
# Data changed unpredictably, invalidate cache
catch {unset colw($c)}
} ; # {else leave the row unchanged}
set data($c,$rows) $v
incr c
}
incr rows
return
}
# ::struct::matrix::__add_columns --
#
# Extends the matrix by "n" columns. The new cells will be set
# to the empty string. The new columns are appended immediately
# behind the last existing column. A value of "n" equal to or
# smaller than 0 is not allowed.
#
# Arguments:
# name Name of the matrix object.
# n The number of new columns to create.
#
# Results:
# None.
proc ::struct::matrix::__add_columns {name n} {
if {$n <= 0} {
return -code error "A value of n <= 0 is not allowed"
}
variable ${name}::data
variable ${name}::columns
variable ${name}::rows
# The new values set into the cell is always the empty
# string. These have a length and height of 0, i.e. the don't
# influence cached widths and heights as they are at least that
# big. IOW there is no need to touch and change the width and
# height caches.
while {$n > 0} {
for {set r 0} {$r < $rows} {incr r} {
set data($columns,$r) ""
}
incr columns
incr n -1
}
return
}
# ::struct::matrix::__add_rows --
#
# Extends the matrix by "n" rows. The new cells will be set to
# the empty string. The new rows are appended immediately behind
# the last existing row. A value of "n" equal to or smaller than
# 0 is not allowed.
#
# Arguments:
# name Name of the matrix object.
# n The number of new rows to create.
#
# Results:
# None.
proc ::struct::matrix::__add_rows {name n} {
if {$n <= 0} {
return -code error "A value of n <= 0 is not allowed"
}
variable ${name}::data
variable ${name}::columns
variable ${name}::rows
# The new values set into the cell is always the empty
# string. These have a length and height of 0, i.e. the don't
# influence cached widths and heights as they are at least that
# big. IOW there is no need to touch and change the width and
# height caches.
while {$n > 0} {
for {set c 0} {$c < $columns} {incr c} {
set data($c,$rows) ""
}
incr rows
incr n -1
}
return
}
# ::struct::matrix::_cells --
#
# Returns the number of cells currently managed by the
# matrix. This is the product of "rows" and "columns".
#
# Arguments:
# name Name of the matrix object.
#
# Results:
# The number of cells in the matrix.
proc ::struct::matrix::_cells {name} {
variable ${name}::rows
variable ${name}::columns
return [expr {$rows * $columns}]
}
# ::struct::matrix::_cellsize --
#
# Returns the length of the string representation of the value
# currently contained in the addressed cell.
#
# Arguments:
# name Name of the matrix object.
# column Column index of the cell to query
# row Row index of the cell to query
#
# Results:
# The number of cells in the matrix.
proc ::struct::matrix::_cellsize {name column row} {
set column [ChkColumnIndex $name $column]
set row [ChkRowIndex $name $row]
variable ${name}::data
return [string length $data($column,$row)]
}
# ::struct::matrix::_columns --
#
# Returns the number of columns currently managed by the
# matrix.
#
# Arguments:
# name Name of the matrix object.
#
# Results:
# The number of columns in the matrix.
proc ::struct::matrix::_columns {name} {
variable ${name}::columns
return $columns
}
# ::struct::matrix::_columnwidth --
#
# Returns the length of the longest string representation of all
# the values currently contained in the cells of the addressed
# column if these are all spanning only one line. For cell
# values spanning multiple lines the length of their longest
# line goes into the computation.
#
# Arguments:
# name Name of the matrix object.
# column The index of the column whose width is asked for.
#
# Results:
# See description.
proc ::struct::matrix::_columnwidth {name column} {
set column [ChkColumnIndex $name $column]
variable ${name}::colw
if {![info exists colw($column)]} {
variable ${name}::rows
variable ${name}::data
set width 0
for {set r 0} {$r < $rows} {incr r} {
foreach line [split $data($column,$r) \n] {
set len [string length $line]
if {$len > $width} {
set width $len
}
}
}
set colw($column) $width
}
return $colw($column)
}
# ::struct::matrix::__delete_column --
#
# Deletes the specified column from the matrix and shifts all
# columns with higher indices one index down.
#
# Arguments:
# name Name of the matrix.
# column The index of the column to delete.
#
# Results:
# None.
proc ::struct::matrix::__delete_column {name column} {
set column [ChkColumnIndex $name $column]
variable ${name}::data
variable ${name}::rows
variable ${name}::columns
variable ${name}::colw
variable ${name}::rowh
# Move all data from the higher columns down and then delete the
# superfluous data in the old last column. Move the data in the
# width cache too, take partial fill into account there too.
# Invalidate the height cache for all rows.
for {set r 0} {$r < $rows} {incr r} {
for {set c $column; set cn [expr {$c + 1}]} {$cn < $columns} {incr c ; incr cn} {
set data($c,$r) $data($cn,$r)
if {[info exists colw($cn)]} {
set colw($c) $colw($cn)
unset colw($cn)
}
}
unset data($c,$r)
catch {unset rowh($r)}
}
incr columns -1
return
}
# ::struct::matrix::__delete_row --
#
# Deletes the specified row from the matrix and shifts all
# row with higher indices one index down.
#
# Arguments:
# name Name of the matrix.
# row The index of the row to delete.
#
# Results:
# None.
proc ::struct::matrix::__delete_row {name row} {
set row [ChkRowIndex $name $row]
variable ${name}::data
variable ${name}::rows
variable ${name}::columns
variable ${name}::colw
variable ${name}::rowh
# Move all data from the higher rows down and then delete the
# superfluous data in the old last row. Move the data in the
# height cache too, take partial fill into account there too.
# Invalidate the width cache for all columns.
for {set c 0} {$c < $columns} {incr c} {
for {set r $row; set rn [expr {$r + 1}]} {$rn < $rows} {incr r ; incr rn} {
set data($c,$r) $data($c,$rn)
if {[info exists rowh($rn)]} {
set rowh($r) $rowh($rn)
unset rowh($rn)
}
}
unset data($c,$r)
catch {unset colw($c)}
}
incr rows -1
return
}
# ::struct::matrix::_destroy --
#
# Destroy a matrix, including its associated command and data storage.
#
# Arguments:
# name Name of the matrix to destroy.
#
# Results:
# None.
proc ::struct::matrix::_destroy {name} {
variable ${name}::link
# Unlink all existing arrays before destroying the object so that
# we don't leave dangling references / traces.
foreach avar [array names link] {
_unlink $name $avar
}
namespace delete $name
interp alias {} $name {}
}
# ::struct::matrix::__format_2string --
#
# Formats the matrix using the specified report object and
# returns the string containing the result of this
# operation. The report has to support the "printmatrix" method.
#
# Arguments:
# name Name of the matrix.
# report Name of the report object specifying the formatting.
#
# Results:
# A string containing the formatting result.
proc ::struct::matrix::__format_2string {name {report {}}} {
if {$report == {}} {
# Use an internal hardwired simple report to format the matrix.
# 1. Go through all columns and compute the column widths.
# 2. Then iterate through all rows and dump then into a
# string, formatted to the number of characters per columns
array set cw {}
set cols [_columns $name]
for {set c 0} {$c < $cols} {incr c} {
set cw($c) [_columnwidth $name $c]
}
set result [list]
set n [_rows $name]
for {set r 0} {$r < $n} {incr r} {
set rh [_rowheight $name $r]
if {$rh < 2} {
# Simple row.
set line [list]
for {set c 0} {$c < $cols} {incr c} {
set val [__get_cell $name $c $r]
lappend line "$val[string repeat " " [expr {$cw($c)-[string length $val]}]]"
}
lappend result [join $line " "]
} else {
# Complex row, multiple passes
for {set h 0} {$h < $rh} {incr h} {
set line [list]
for {set c 0} {$c < $cols} {incr c} {
set val [lindex [split [__get_cell $name $c $r] \n] $h]
lappend line "$val[string repeat " " [expr {$cw($c)-[string length $val]}]]"
}
lappend result [join $line " "]
}
}
}
return [join $result \n]
} else {
return [$report printmatrix $name]
}
}
# ::struct::matrix::__format_2chan --
#
# Formats the matrix using the specified report object and
# writes the string containing the result of this operation into
# the channel. The report has to support the
# "printmatrix2channel" method.
#
# Arguments:
# name Name of the matrix.
# report Name of the report object specifying the formatting.
# chan Handle of the channel to write to.
#
# Results:
# None.
proc ::struct::matrix::__format_2chan {name {report {}} {chan stdout}} {
if {$report == {}} {
# Use an internal hardwired simple report to format the matrix.
# We delegate this to the string formatter and print its result.
puts -nonewline [__format_2string $name]
} else {
$report printmatrix2channel $name $chan
}
return
}
# ::struct::matrix::__get_cell --
#
# Returns the value currently contained in the cell identified
# by row and column index.
#
# Arguments:
# name Name of the matrix.
# column Column index of the addressed cell.
# row Row index of the addressed cell.
#
# Results:
# value Value currently stored in the addressed cell.
proc ::struct::matrix::__get_cell {name column row} {
set column [ChkColumnIndex $name $column]
set row [ChkRowIndex $name $row]
variable ${name}::data
return $data($column,$row)
}
# ::struct::matrix::__get_column --
#
# Returns a list containing the values from all cells in the
# column identified by the index. The contents of the cell in
# row 0 are stored as the first element of this list.
#
# Arguments:
# name Name of the matrix.
# column Column index of the addressed cell.
#
# Results:
# List of values stored in the addressed row.
proc ::struct::matrix::__get_column {name column} {
set column [ChkColumnIndex $name $column]
return [GetColumn $name $column]
}
proc ::struct::matrix::GetColumn {name column} {
variable ${name}::data
variable ${name}::rows
set result [list]
for {set r 0} {$r < $rows} {incr r} {
lappend result $data($column,$r)
}
return $result
}
# ::struct::matrix::__get_rect --
#
# Returns a list of lists of cell values. The values stored in
# the result come from the submatrix whose top-left and
# bottom-right cells are specified by "column_tl", "row_tl" and
# "column_br", "row_br" resp. Note that the following equations
# have to be true: column_tl <= column_br and row_tl <= row_br.
# The result is organized as follows: The outer list is the list
# of rows, its elements are lists representing a single row. The
# row with the smallest index is the first element of the outer
# list. The elements of the row lists represent the selected
# cell values. The cell with the smallest index is the first
# element in each row list.
#
# Arguments:
# name Name of the matrix.
# column_tl Column index of the top-left cell of the area.
# row_tl Row index of the top-left cell of the the area
# column_br Column index of the bottom-right cell of the area.
# row_br Row index of the bottom-right cell of the the area
#
# Results:
# List of a list of values stored in the addressed area.
proc ::struct::matrix::__get_rect {name column_tl row_tl column_br row_br} {
set column_tl [ChkColumnIndex $name $column_tl]
set row_tl [ChkRowIndex $name $row_tl]
set column_br [ChkColumnIndex $name $column_br]
set row_br [ChkRowIndex $name $row_br]
if {
($column_tl > $column_br) ||
($row_tl > $row_br)
} {
return -code error "Invalid cell indices, wrong ordering"
}
variable ${name}::data
set result [list]
for {set r $row_tl} {$r <= $row_br} {incr r} {
set row [list]
for {set c $column_tl} {$c <= $column_br} {incr c} {
lappend row $data($c,$r)
}
lappend result $row
}
return $result
}
# ::struct::matrix::__get_row --
#
# Returns a list containing the values from all cells in the
# row identified by the index. The contents of the cell in
# column 0 are stored as the first element of this list.
#
# Arguments:
# name Name of the matrix.
# row Row index of the addressed cell.
#
# Results:
# List of values stored in the addressed row.
proc ::struct::matrix::__get_row {name row} {
set row [ChkRowIndex $name $row]
return [GetRow $name $row]
}
proc ::struct::matrix::GetRow {name row} {
variable ${name}::data
variable ${name}::columns
set result [list]
for {set c 0} {$c < $columns} {incr c} {
lappend result $data($c,$row)
}
return $result
}
# ::struct::matrix::__insert_column --
#
# Extends the matrix by one column and then acts like
# "setcolumn" (see below) on this new column if there were
# "values" supplied. Without "values" the new cells will be set
# to the empty string. The new column is inserted just before
# the column specified by the given index. This means, if
# "column" is less than or equal to zero, then the new column is
# inserted at the beginning of the matrix, before the first
# column. If "column" has the value "Bend", or if it is greater
# than or equal to the number of columns in the matrix, then the
# new column is appended to the matrix, behind the last
# column. The old column at the chosen index and all columns
# with higher indices are shifted one index upward.
#
# Arguments:
# name Name of the matrix.
# column Index of the column where to insert.
# values Optional values to set the cells to.
#
# Results:
# None.
proc ::struct::matrix::__insert_column {name column {values {}}} {
# Allow both negative and too big indices.
set column [ChkColumnIndexAll $name $column]
variable ${name}::columns
if {$column > $columns} {
# Same as 'addcolumn'
__add_column $name $values
return
}
variable ${name}::data
variable ${name}::rows
variable ${name}::rowh
variable ${name}::colw
set firstcol $column
if {$firstcol < 0} {
set firstcol 0
}
if {[set l [llength $values]] < $rows} {
# Missing values. Fill up with empty strings
for {} {$l < $rows} {incr l} {
lappend values {}
}
} elseif {[llength $values] > $rows} {
# To many values. Remove the superfluous items
set values [lrange $values 0 [expr {$rows - 1}]]
}
# "values" now contains the information to set into the array.
# Regarding the width and height caches:
# Invalidate all rows, move all columns
# Move all data from the higher columns one up and then insert the
# new data into the freed space. Move the data in the
# width cache too, take partial fill into account there too.
# Invalidate the height cache for all rows.
for {set r 0} {$r < $rows} {incr r} {
for {set cn $columns ; set c [expr {$cn - 1}]} {$c >= $firstcol} {incr c -1 ; incr cn -1} {
set data($cn,$r) $data($c,$r)
if {[info exists colw($c)]} {
set colw($cn) $colw($c)
unset colw($c)
}
}
set data($firstcol,$r) [lindex $values $r]
catch {unset rowh($r)}
}
incr columns
return
}
# ::struct::matrix::__insert_row --
#
# Extends the matrix by one row and then acts like "setrow" (see
# below) on this new row if there were "values"
# supplied. Without "values" the new cells will be set to the
# empty string. The new row is inserted just before the row
# specified by the given index. This means, if "row" is less
# than or equal to zero, then the new row is inserted at the
# beginning of the matrix, before the first row. If "row" has
# the value "end", or if it is greater than or equal to the
# number of rows in the matrix, then the new row is appended to
# the matrix, behind the last row. The old row at that index and
# all rows with higher indices are shifted one index upward.
#
# Arguments:
# name Name of the matrix.
# row Index of the row where to insert.
# values Optional values to set the cells to.
#
# Results:
# None.
proc ::struct::matrix::__insert_row {name row {values {}}} {
# Allow both negative and too big indices.
set row [ChkRowIndexAll $name $row]
variable ${name}::rows
if {$row > $rows} {
# Same as 'addrow'
__add_row $name $values
return
}
variable ${name}::data
variable ${name}::columns
variable ${name}::rowh
variable ${name}::colw
set firstrow $row
if {$firstrow < 0} {
set firstrow 0
}
if {[set l [llength $values]] < $columns} {
# Missing values. Fill up with empty strings
for {} {$l < $columns} {incr l} {
lappend values {}
}
} elseif {[llength $values] > $columns} {
# To many values. Remove the superfluous items
set values [lrange $values 0 [expr {$columns - 1}]]
}
# "values" now contains the information to set into the array.
# Regarding the width and height caches:
# Invalidate all columns, move all rows
# Move all data from the higher rows one up and then insert the
# new data into the freed space. Move the data in the
# height cache too, take partial fill into account there too.
# Invalidate the width cache for all columns.
for {set c 0} {$c < $columns} {incr c} {
for {set rn $rows ; set r [expr {$rn - 1}]} {$r >= $firstrow} {incr r -1 ; incr rn -1} {
set data($c,$rn) $data($c,$r)
if {[info exists rowh($r)]} {
set rowh($rn) $rowh($r)
unset rowh($r)
}
}
set data($c,$firstrow) [lindex $values $c]
catch {unset colw($c)}
}
incr rows
return
}
# ::struct::matrix::_link --
#
# Links the matrix to the specified array variable. This means
# that the contents of all cells in the matrix is stored in the
# array too, with all changes to the matrix propagated there
# too. The contents of the cell "(column,row)" is stored in the
# array using the key "column,row". If the option "-transpose"
# is specified the key "row,column" will be used instead. It is
# possible to link the matrix to more than one array. Note that
# the link is bidirectional, i.e. changes to the array are
# mirrored in the matrix too.
#
# Arguments:
# name Name of the matrix object.
# option Either empty of '-transpose'.
# avar Name of the variable to link to
#
# Results:
# None
proc ::struct::matrix::_link {name args} {
switch -exact -- [llength $args] {
0 {
return -code error "$name: wrong # args: link ?-transpose? arrayvariable"
}
1 {
set transpose 0
set variable [lindex $args 0]
}
2 {
foreach {t variable} $args break
if {[string compare $t -transpose]} {
return -code error "$name: illegal syntax: link ?-transpose? arrayvariable"
}
set transpose 1
}
default {
return -code error "$name: wrong # args: link ?-transpose? arrayvariable"
}
}
variable ${name}::link
if {[info exists link($variable)]} {
return -code error "$name link: Variable \"$variable\" already linked to matrix"
}
# Ok, a new variable we are linked to. Record this information,
# dump our current contents into the array, at last generate the
# traces actually performing the link.
set link($variable) $transpose
upvar #0 $variable array
variable ${name}::data
foreach key [array names data] {
foreach {c r} [split $key ,] break
if {$transpose} {
set array($r,$c) $data($key)
} else {
set array($c,$r) $data($key)
}
}
trace variable array wu [list ::struct::matrix::MatTraceIn $variable $name]
trace variable data w [list ::struct::matrix::MatTraceOut $variable $name]
return
}
# ::struct::matrix::_links --
#
# Retrieves the names of all array variable the matrix is
# officialy linked to.
#
# Arguments:
# name Name of the matrix object.
#
# Results:
# List of variables the matrix is linked to.
proc ::struct::matrix::_links {name} {
variable ${name}::link
return [array names link]
}
# ::struct::matrix::_rowheight --
#
# Returns the height of the specified row in lines. This is the
# highest number of lines spanned by a cell over all cells in
# the row.
#
# Arguments:
# name Name of the matrix
# row Index of the row queried for its height
#
# Results:
# The height of the specified row in lines.
proc ::struct::matrix::_rowheight {name row} {
set row [ChkRowIndex $name $row]
variable ${name}::rowh
if {![info exists rowh($row)]} {
variable ${name}::columns
variable ${name}::data
set height 1
for {set c 0} {$c < $columns} {incr c} {
set cheight [llength [split $data($c,$row) \n]]
if {$cheight > $height} {
set height $cheight
}
}
set rowh($row) $height
}
return $rowh($row)
}
# ::struct::matrix::_rows --
#
# Returns the number of rows currently managed by the matrix.
#
# Arguments:
# name Name of the matrix object.
#
# Results:
# The number of rows in the matrix.
proc ::struct::matrix::_rows {name} {
variable ${name}::rows
return $rows
}
# ::struct::matrix::__set_cell --
#
# Sets the value in the cell identified by row and column index
# to the data in the third argument.
#
# Arguments:
# name Name of the matrix object.
# column Column index of the cell to set.
# row Row index of the cell to set.
# value THe new value of the cell.
#
# Results:
# None.
proc ::struct::matrix::__set_cell {name column row value} {
set column [ChkColumnIndex $name $column]
set row [ChkRowIndex $name $row]
variable ${name}::data
if {![string compare $value $data($column,$row)]} {
# No change, ignore call!
return
}
set data($column,$row) $value
if {$value != {}} {
variable ${name}::colw
variable ${name}::rowh
catch {unset colw($column)}
catch {unset rowh($row)}
}
return
}
# ::struct::matrix::__set_column --
#
# Sets the values in the cells identified by the column index to
# the elements of the list provided as the third argument. Each
# element of the list is assigned to one cell, with the first
# element going into the cell in row 0 and then upward. If there
# are less values in the list than there are rows the remaining
# rows are set to the empty string. If there are more values in
# the list than there are rows the superfluous elements are
# ignored. The matrix is not extended by this operation.
#
# Arguments:
# name Name of the matrix.
# column Index of the column to set.
# values Values to set into the column.
#
# Results:
# None.
proc ::struct::matrix::__set_column {name column values} {
set column [ChkColumnIndex $name $column]
variable ${name}::data
variable ${name}::columns
variable ${name}::rows
variable ${name}::rowh
variable ${name}::colw
if {[set l [llength $values]] < $rows} {
# Missing values. Fill up with empty strings
for {} {$l < $rows} {incr l} {
lappend values {}
}
} elseif {[llength $values] > $rows} {
# To many values. Remove the superfluous items
set values [lrange $values 0 [expr {$rows - 1}]]
}
# "values" now contains the information to set into the array.
# Regarding the width and height caches:
# - Invalidate the column in the width cache.
# - The rows are either removed from the height cache or left
# unchanged, depending on the contents set into the cell.
set r 0
foreach v $values {
if {$v != {}} {
# Data changed unpredictably, invalidate cache
catch {unset rowh($r)}
} ; # {else leave the row unchanged}
set data($column,$r) $v
incr r
}
catch {unset colw($column)}
return
}
# ::struct::matrix::__set_rect --
#
# Takes a list of lists of cell values and writes them into the
# submatrix whose top-left cell is specified by the two
# indices. If the sublists of the outerlist are not of equal
# length the shorter sublists will be filled with empty strings
# to the length of the longest sublist. If the submatrix
# specified by the top-left cell and the number of rows and
# columns in the "values" extends beyond the matrix we are
# modifying the over-extending parts of the values are ignored,
# i.e. essentially cut off. This subcommand expects its input in
# the format as returned by "getrect".
#
# Arguments:
# name Name of the matrix object.
# column Column index of the topleft cell to set.
# row Row index of the topleft cell to set.
# values Values to set.
#
# Results:
# None.
proc ::struct::matrix::__set_rect {name column row values} {
# Allow negative indices!
set column [ChkColumnIndexNeg $name $column]
set row [ChkRowIndexNeg $name $row]
variable ${name}::data
variable ${name}::columns
variable ${name}::rows
variable ${name}::colw
variable ${name}::rowh
if {$row < 0} {
# Remove rows from the head of values to restrict it to the
# overlapping area.
set values [lrange $values [expr {0 - $row}] end]
set row 0
}
# Restrict it at the end too.
if {($row + [llength $values]) > $rows} {
set values [lrange $values 0 [expr {$rows - $row - 1}]]
}
# Same for columns, but store it in some vars as this is required
# in a loop.
set firstcol 0
if {$column < 0} {
set firstcol [expr {0 - $column}]
set column 0
}
# Now pan through values and area and copy the external data into
# the matrix.
set r $row
foreach line $values {
set line [lrange $line $firstcol end]
set l [expr {$column + [llength $line]}]
if {$l > $columns} {
set line [lrange $line 0 [expr {$columns - $column - 1}]]
} elseif {$l < [expr {$columns - $firstcol}]} {
# We have to take the offset into the line into account
# or we add fillers we don't need, overwriting part of the
# data array we shouldn't.
for {} {$l < [expr {$columns - $firstcol}]} {incr l} {
lappend line {}
}
}
set c $column
foreach cell $line {
if {$cell != {}} {
catch {unset rowh($r)}
catch {unset colw($c)}
}
set data($c,$r) $cell
incr c
}
incr r
}
return
}
# ::struct::matrix::__set_row --
#
# Sets the values in the cells identified by the row index to
# the elements of the list provided as the third argument. Each
# element of the list is assigned to one cell, with the first
# element going into the cell in column 0 and then upward. If
# there are less values in the list than there are columns the
# remaining columns are set to the empty string. If there are
# more values in the list than there are columns the superfluous
# elements are ignored. The matrix is not extended by this
# operation.
#
# Arguments:
# name Name of the matrix.
# row Index of the row to set.
# values Values to set into the row.
#
# Results:
# None.
proc ::struct::matrix::__set_row {name row values} {
set row [ChkRowIndex $name $row]
variable ${name}::data
variable ${name}::columns
variable ${name}::rows
variable ${name}::colw
variable ${name}::rowh
if {[set l [llength $values]] < $columns} {
# Missing values. Fill up with empty strings
for {} {$l < $columns} {incr l} {
lappend values {}
}
} elseif {[llength $values] > $columns} {
# To many values. Remove the superfluous items
set values [lrange $values 0 [expr {$columns - 1}]]
}
# "values" now contains the information to set into the array.
# Regarding the width and height caches:
# - Invalidate the row in the height cache.
# - The columns are either removed from the width cache or left
# unchanged, depending on the contents set into the cell.
set c 0
foreach v $values {
if {$v != {}} {
# Data changed unpredictably, invalidate cache
catch {unset colw($c)}
} ; # {else leave the row unchanged}
set data($c,$row) $v
incr c
}
catch {unset rowh($row)}
return
}
# ::struct::matrix::__swap_columns --
#
# Swaps the contents of the two specified columns.
#
# Arguments:
# name Name of the matrix.
# column_a Index of the first column to swap
# column_b Index of the second column to swap
#
# Results:
# None.
proc ::struct::matrix::__swap_columns {name column_a column_b} {
set column_a [ChkColumnIndex $name $column_a]
set column_b [ChkColumnIndex $name $column_b]
return [SwapColumns $name $column_a $column_b]
}
proc ::struct::matrix::SwapColumns {name column_a column_b} {
variable ${name}::data
variable ${name}::rows
variable ${name}::colw
# Note: This operation does not influence the height cache for all
# rows and the width cache only insofar as its contents has to be
# swapped too for the two columns we are touching. Note that the
# cache might be partially filled or not at all, so we don't have
# to "swap" in some situations.
for {set r 0} {$r < $rows} {incr r} {
set tmp $data($column_a,$r)
set data($column_a,$r) $data($column_b,$r)
set data($column_b,$r) $tmp
}
set cwa [info exists colw($column_a)]
set cwb [info exists colw($column_b)]
if {$cwa && $cwb} {
set tmp $colw($column_a)
set colw($column_a) $colw($column_b)
set colw($column_b) $tmp
} elseif {$cwa} {
# Move contents, don't swap.
set colw($column_b) $colw($column_a)
unset colw($column_a)
} elseif {$cwb} {
# Move contents, don't swap.
set colw($column_a) $colw($column_b)
unset colw($column_b)
} ; # else {nothing to do at all}
return
}
# ::struct::matrix::__swap_rows --
#
# Swaps the contents of the two specified rows.
#
# Arguments:
# name Name of the matrix.
# row_a Index of the first row to swap
# row_b Index of the second row to swap
#
# Results:
# None.
proc ::struct::matrix::__swap_rows {name row_a row_b} {
set row_a [ChkRowIndex $name $row_a]
set row_b [ChkRowIndex $name $row_b]
return [SwapRows $name $row_a $row_b]
}
proc ::struct::matrix::SwapRows {name row_a row_b} {
variable ${name}::data
variable ${name}::columns
variable ${name}::rowh
# Note: This operation does not influence the width cache for all
# columns and the height cache only insofar as its contents has to be
# swapped too for the two rows we are touching. Note that the
# cache might be partially filled or not at all, so we don't have
# to "swap" in some situations.
for {set c 0} {$c < $columns} {incr c} {
set tmp $data($c,$row_a)
set data($c,$row_a) $data($c,$row_b)
set data($c,$row_b) $tmp
}
set rha [info exists rowh($row_a)]
set rhb [info exists rowh($row_b)]
if {$rha && $rhb} {
set tmp $rowh($row_a)
set rowh($row_a) $rowh($row_b)
set rowh($row_b) $tmp
} elseif {$rha} {
# Move contents, don't swap.
set rowh($row_b) $rowh($row_a)
unset rowh($row_a)
} elseif {$rhb} {
# Move contents, don't swap.
set rowh($row_a) $rowh($row_b)
unset rowh($row_b)
} ; # else {nothing to do at all}
return
}
# ::struct::matrix::_unlink --
#
# Removes the link between the matrix and the specified
# arrayvariable, if there is one.
#
# Arguments:
# name Name of the matrix.
# avar Name of the linked array.
#
# Results:
# None.
proc ::struct::matrix::_unlink {name avar} {
variable ${name}::link
if {![info exists link($avar)]} {
# Ignore unlinking of unkown variables.
return
}
# Delete the traces first, then remove the link management
# information from the object.
upvar #0 $avar array
variable ${name}::data
trace vdelete array wu [list ::struct::matrix::MatTraceIn $avar $name]
trace vdelete date w [list ::struct::matrix::MatTraceOut $avar $name]
unset link($avar)
return
}
# ::struct::matrix::ChkColumnIndex --
#
# Helper to check and transform column indices. Returns the
# absolute index number belonging to the specified
# index. Rejects indices out of the valid range of columns.
#
# Arguments:
# matrix Matrix to look at
# column The incoming index to check and transform
#
# Results:
# The absolute index to the column
proc ::struct::matrix::ChkColumnIndex {name column} {
variable ${name}::columns
switch -regex -- $column {
{end-[0-9]+} {
set column [string map {end- ""} $column]
set cc [expr {$columns - 1 - $column}]
if {($cc < 0) || ($cc >= $columns)} {
return -code error "bad column index end-$column, column does not exist"
}
return $cc
}
end {
if {$columns <= 0} {
return -code error "bad column index $column, column does not exist"
}
return [expr {$columns - 1}]
}
{[0-9]+} {
if {($column < 0) || ($column >= $columns)} {
return -code error "bad column index $column, column does not exist"
}
return $column
}
default {
return -code error "bad column index \"$column\", syntax error"
}
}
# Will not come to this place
}
# ::struct::matrix::ChkRowIndex --
#
# Helper to check and transform row indices. Returns the
# absolute index number belonging to the specified
# index. Rejects indices out of the valid range of rows.
#
# Arguments:
# matrix Matrix to look at
# row The incoming index to check and transform
#
# Results:
# The absolute index to the row
proc ::struct::matrix::ChkRowIndex {name row} {
variable ${name}::rows
switch -regex -- $row {
{end-[0-9]+} {
set row [string map {end- ""} $row]
set rr [expr {$rows - 1 - $row}]
if {($rr < 0) || ($rr >= $rows)} {
return -code error "bad row index end-$row, row does not exist"
}
return $rr
}
end {
if {$rows <= 0} {
return -code error "bad row index $row, row does not exist"
}
return [expr {$rows - 1}]
}
{[0-9]+} {
if {($row < 0) || ($row >= $rows)} {
return -code error "bad row index $row, row does not exist"
}
return $row
}
default {
return -code error "bad row index \"$row\", syntax error"
}
}
# Will not come to this place
}
# ::struct::matrix::ChkColumnIndexNeg --
#
# Helper to check and transform column indices. Returns the
# absolute index number belonging to the specified
# index. Rejects indices out of the valid range of columns
# (Accepts negative indices).
#
# Arguments:
# matrix Matrix to look at
# column The incoming index to check and transform
#
# Results:
# The absolute index to the column
proc ::struct::matrix::ChkColumnIndexNeg {name column} {
variable ${name}::columns
switch -regex -- $column {
{end-[0-9]+} {
set column [string map {end- ""} $column]
set cc [expr {$columns - 1 - $column}]
if {$cc >= $columns} {
return -code error "bad column index end-$column, column does not exist"
}
return $cc
}
end {
return [expr {$columns - 1}]
}
{[0-9]+} {
if {$column >= $columns} {
return -code error "bad column index $column, column does not exist"
}
return $column
}
default {
return -code error "bad column index \"$column\", syntax error"
}
}
# Will not come to this place
}
# ::struct::matrix::ChkRowIndexNeg --
#
# Helper to check and transform row indices. Returns the
# absolute index number belonging to the specified
# index. Rejects indices out of the valid range of rows
# (Accepts negative indices).
#
# Arguments:
# matrix Matrix to look at
# row The incoming index to check and transform
#
# Results:
# The absolute index to the row
proc ::struct::matrix::ChkRowIndexNeg {name row} {
variable ${name}::rows
switch -regex -- $row {
{end-[0-9]+} {
set row [string map {end- ""} $row]
set rr [expr {$rows - 1 - $row}]
if {$rr >= $rows} {
return -code error "bad row index end-$row, row does not exist"
}
return $rr
}
end {
return [expr {$rows - 1}]
}
{[0-9]+} {
if {$row >= $rows} {
return -code error "bad row index $row, row does not exist"
}
return $row
}
default {
return -code error "bad row index \"$row\", syntax error"
}
}
# Will not come to this place
}
# ::struct::matrix::ChkColumnIndexAll --
#
# Helper to transform column indices. Returns the
# absolute index number belonging to the specified
# index.
#
# Arguments:
# matrix Matrix to look at
# column The incoming index to check and transform
#
# Results:
# The absolute index to the column
proc ::struct::matrix::ChkColumnIndexAll {name column} {
variable ${name}::columns
switch -regex -- $column {
{end-[0-9]+} {
set column [string map {end- ""} $column]
set cc [expr {$columns - 1 - $column}]
return $cc
}
end {
return $columns
}
{[0-9]+} {
return $column
}
default {
return -code error "bad column index \"$column\", syntax error"
}
}
# Will not come to this place
}
# ::struct::matrix::ChkRowIndexAll --
#
# Helper to transform row indices. Returns the
# absolute index number belonging to the specified
# index.
#
# Arguments:
# matrix Matrix to look at
# row The incoming index to check and transform
#
# Results:
# The absolute index to the row
proc ::struct::matrix::ChkRowIndexAll {name row} {
variable ${name}::rows
switch -regex -- $row {
{end-[0-9]+} {
set row [string map {end- ""} $row]
set rr [expr {$rows - 1 - $row}]
return $rr
}
end {
return $rows
}
{[0-9]+} {
return $row
}
default {
return -code error "bad row index \"$row\", syntax error"
}
}
# Will not come to this place
}
# ::struct::matrix::MatTraceIn --
#
# Helper propagating changes made to an array
# into the matrix the array is linked to.
#
# Arguments:
# avar Name of the array which was changed.
# name Matrix to write the changes to.
# var,idx,op Standard trace arguments
#
# Results:
# None.
proc ::struct::matrix::MatTraceIn {avar name var idx op} {
# Propagate changes in the linked array back into the matrix.
variable ${name}::lock
if {$lock} {return}
# We have to cover two possibilities when encountering an "unset" operation ...
# 1. The external array was destroyed: perform automatic unlink.
# 2. An individual element was unset: Set the corresponding cell to the empty string.
# See SF Tcllib Bug #532791.
if {(![string compare $op u]) && ($idx == {})} {
# Possibility 1: Array was destroyed
$name unlink $avar
return
}
upvar #0 $avar array
variable ${name}::data
variable ${name}::link
set transpose $link($avar)
if {$transpose} {
foreach {r c} [split $idx ,] break
} else {
foreach {c r} [split $idx ,] break
}
# Use standard method to propagate the change.
# => Get automatically index checks, cache updates, ...
if {![string compare $op u]} {
# Unset possibility 2: Element was unset.
# Note: Setting the cell to the empty string will
# invoke MatTraceOut for this array and thus try
# to recreate the destroyed element of the array.
# We don't want this. But we do want to propagate
# the change to other arrays, as "unset". To do
# all of this we use another state variable to
# signal this situation.
variable ${name}::unset
set unset $avar
$name set cell $c $r ""
set unset {}
return
}
$name set cell $c $r $array($idx)
return
}
# ::struct::matrix::MatTraceOut --
#
# Helper propagating changes made to the matrix into the linked arrays.
#
# Arguments:
# avar Name of the array to write the changes to.
# name Matrix which was changed.
# var,idx,op Standard trace arguments
#
# Results:
# None.
proc ::struct::matrix::MatTraceOut {avar name var idx op} {
# Propagate changes in the matrix data array into the linked array.
variable ${name}::unset
if {![string compare $avar $unset]} {
# Do not change the variable currently unsetting
# one of its elements.
return
}
variable ${name}::lock
set lock 1 ; # Disable MatTraceIn [#532783]
upvar #0 $avar array
variable ${name}::data
variable ${name}::link
set transpose $link($avar)
if {$transpose} {
foreach {r c} [split $idx ,] break
} else {
foreach {c r} [split $idx ,] break
}
if {$unset != {}} {
# We are currently propagating the unset of an
# element in a different linked array to this
# array. We make sure that this is an unset too.
unset array($c,$r)
} else {
set array($c,$r) $data($idx)
}
set lock 0
return
}
# ::struct::matrix::SortMaxHeapify --
#
# Helper for the 'sort' method. Performs the central algorithm
# which converts the matrix into a heap, easily sortable.
#
# Arguments:
# name Matrix object which is sorted.
# i Index of the row/column currently being sorted.
# key Index of the column/row to sort the rows/columns by.
# rowCol Indicator if we are sorting rows ('r'), or columns ('c').
# heapSize Number of rows/columns to sort.
# rev Boolean flag, set if sorting is done revers (-decreasing).
#
# Sideeffects:
# Transforms the matrix into a heap of rows/columns,
# swapping them around.
#
# Results:
# None.
proc ::struct::matrix::SortMaxHeapify {name i key rowCol heapSize {rev 0}} {
# MAX-HEAPIFY, adapted by EAS from CLRS 6.2
switch $rowCol {
r { set A [GetColumn $name $key] }
c { set A [GetRow $name $key] }
}
# Weird expressions below for clarity, as CLRS uses A[1...n]
# format and TCL uses A[0...n-1]
set left [expr {int(2*($i+1) -1)}]
set right [expr {int(2*($i+1)+1 -1)}]
# left, right are tested as < rather than <= because they are
# in A[0...n-1]
if {
$left < $heapSize &&
( !$rev && [lindex $A $left] > [lindex $A $i] ||
$rev && [lindex $A $left] < [lindex $A $i] )
} {
set largest $left
} else {
set largest $i
}
if {
$right < $heapSize &&
( !$rev && [lindex $A $right] > [lindex $A $largest] ||
$rev && [lindex $A $right] < [lindex $A $largest] )
} {
set largest $right
}
if { $largest != $i } {
switch $rowCol {
r { SwapRows $name $i $largest }
c { SwapColumns $name $i $largest }
}
SortMaxHeapify $name $largest $key $rowCol $heapSize $rev
}
return
}
# ### ### ### ######### ######### #########
## Ready
namespace eval ::struct {
# Get 'matrix::matrix' into the general structure namespace.
namespace import -force matrix::matrix
namespace export matrix
}
package provide struct::matrix 1.2.1
|