/usr/share/perl5/Math/PlanePath/CellularRule.pm is in libmath-planepath-perl 113-1.
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 | # Copyright 2011, 2012, 2013 Kevin Ryde
# This file is part of Math-PlanePath.
#
# Math-PlanePath is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by the
# Free Software Foundation; either version 3, or (at your option) any later
# version.
#
# Math-PlanePath is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
# or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
# for more details.
#
# You should have received a copy of the GNU General Public License along
# with Math-PlanePath. If not, see <http://www.gnu.org/licenses/>.
# math-image --path=CellularRule --all --scale=10
#
# math-image --path=CellularRule --all --output=numbers --size=80x50
# Maybe:
# @rules = Math::PlanePath::CellularRule->rule_to_list($rule)
# list of equivalents
# $rule = Math::PlanePath::CellularRule->rule_to_first($rule)
# first equivalent
# $bool = Math::PlanePath::CellularRule->rules_are_mirror($rule1,$rule2)
# $rule = Math::PlanePath::CellularRule->rule_to_mirror($rule)
# or undef if no mirror
# $bool = Math::PlanePath::CellularRule->rule_is_symmetric($rule)
package Math::PlanePath::CellularRule;
use 5.004;
use strict;
use Carp;
use vars '$VERSION', '@ISA';
$VERSION = 113;
use Math::PlanePath;
@ISA = ('Math::PlanePath');
use Math::PlanePath::Base::Generic
'is_infinite',
'round_nearest';
use Math::PlanePath::CellularRule54;
*_rect_for_V = \&Math::PlanePath::CellularRule54::_rect_for_V;
# uncomment this to run the ### lines
# use Smart::Comments;
use constant class_y_negative => 0;
use constant n_frac_discontinuity => .5;
use constant 1.02 _default_rule => 30;
use constant parameter_info_array =>
[ { name => 'rule',
display => 'Rule',
type => 'integer',
default => _default_rule(),
minimum => 0,
maximum => 255,
width => 3,
type_hint => 'cellular_rule',
description => 'Rule number 0 to 255, encoding how triplets 111 through 000 turn into 0 or 1 in the next row.',
},
Math::PlanePath::Base::Generic::parameter_info_nstart1(),
];
#------------------------------------------------------------------------------
# x,y range
# rule=1 000->1 goes negative if 001->0 to keep left empty
# so rule&3 == 1
#
# any 001->1, rule&2 goes left initially
sub x_negative {
my ($self) = @_;
return (($self->{'rule'} & 2)
|| ($self->{'rule'} & 3) == 1);
}
sub x_maximum {
my ($self) = @_;
return (($self->{'rule'} & 0x17) == 0 # single cell only
|| ($self->{'rule'} & 0x5F) == 0x0E # left line 2
|| $self->{'rule'}==70 || $self->{'rule'}==198
|| $self->{'rule'}==78
|| $self->{'rule'}==110
|| $self->{'rule'}==230
? 0
: undef);
}
sub y_maximum {
my ($self) = @_;
return (($self->{'rule'} & 0x17) == 0 # single cell only
? 0
: undef);
}
#------------------------------------------------------------------------------
# sumxy,diffxy range
use constant sumxy_minimum => 0; # triangular X>=-Y so X+Y>=0
sub sumxy_maximum {
my ($self) = @_;
if (($self->{'rule'} & 0x5F) == 0x0E) { # left line 2
return 1;
}
return undef;
}
sub diffxy_minimum {
my ($self) = @_;
if (($self->{'rule'} & 0x5F) == 0x54) { # right line 2
return -1;
}
return undef;
}
use constant diffxy_maximum => 0; # triangular X<=Y so X-Y<=0
#------------------------------------------------------------------------------
# dx range
sub dx_minimum {
my ($self) = @_;
return (($self->{'rule'} & 0x17) == 0 # single cell only
|| ($self->{'rule'} & 0x5F) == 0x54 # right line 2
? 0
: ($self->{'rule'} & 0x5F) == 0x0E # left line 2
? -2
: undef);
}
{
# Eg. rule=25 jumps +5
my @dx_maximum = (
undef, 4, undef, 3, undef, 2, undef, 1,
undef, 2, undef, 2, undef, 2, 1, 2,
undef, 3, undef, 2, undef, 1, undef, 1,
undef, 5, undef, 2, 2, 2, undef, 1,
undef, 4, undef, 3, undef, undef, undef, 2,
undef, 3, undef, 2, undef, undef, 1, 2,
undef, 3, undef, 2, undef, 2, undef, 1,
undef, undef, undef, 2, undef, 4, 4, 1,
undef, 2, undef, 5, undef, 2, 2, 2,
undef, undef, undef, undef, undef, 2, 2, 2,
undef, 1, undef, 2, 1, 1, undef, 1,
undef, undef, undef, 4, 2, 2, 2, 1,
undef, 3, undef, undef, undef, undef, undef, 4,
undef, undef, undef, undef, undef, 4, undef, 4,
undef, 1, undef, 2, 1, 1, 4, 1,
undef, undef, undef, 2, undef, 4, undef, 1,
undef, undef, undef, 5, undef, 2, undef, undef,
undef, undef, undef, 3, undef, 2, 1, 3,
undef, 5, undef, 4, undef, undef, undef, undef,
undef, undef, undef, 3, 2, 2, 3, undef,
undef, undef, undef, 3, undef, 2, undef, 2,
undef, undef, undef, 3, undef, 1, 1, 2,
undef, 3, undef, undef, undef, 2, 2, undef,
undef, 2, undef, 2, 2, 1, undef, undef,
undef, undef, undef, undef, undef, 2, 2, 2,
undef, 4, undef, 2, undef, 2, undef, 2,
undef, 3, undef, 3, 1, 3, 3, undef,
undef, 2, undef, 2, undef, 2, undef, undef,
undef, undef, undef, 2, undef, 1, 2, 1,
undef, 2, undef, 2, undef, 1, undef, 1,
undef, 3, undef, 2, 1, 2, undef, undef,
undef, 2, undef, 2, undef, 1,
);
sub dx_maximum {
my ($self) = @_;
return $dx_maximum[$self->{'rule'}];
}
}
#------------------------------------------------------------------------------
# dy range
# 23, 31, 55, 63,87,95, 119, 127
# 0x17,0x1F,0x37,0x3F,..., 0x77,0x7F alts
# is rule & 0x98 = 0x17
# Math::PlanePath::CellularRule::Line handles the dY=+1 always lines,
# everything else has some row with 2 or more (except the single cell only
# patterns).
use constant dy_minimum => 0;
sub dy_maximum {
my ($self) = @_;
# 0x1,0x9,0x
return (($self->{'rule'} & 0x17) == 1 # single cell only
|| $self->{'rule'}==7 || $self->{'rule'}==21 # alternating rows
|| $self->{'rule'}==19 # alternating rows
|| ($self->{'rule'} & 0x97) == 0x17
? 2
: 1);
}
#------------------------------------------------------------------------------
# absdx
# left 2 cell line 14,46,142,174
# 111 -> any, doesn't occur
# 110 -> 0
# 101 -> any, doesn't occur
# 100 -> 0
# 011 -> 1
# 010 -> 1
# 001 -> 1
# 000 -> 0
# so (rule & 0x5F) == 0x0E
#
# left 1,2 cell line 6,38,134,166
# 111 -> any, doesn't occur
# 110 -> 0
# 101 -> any, doesn't occur
# 100 -> 0
# 011 -> 0
# 010 -> 1
# 001 -> 1
# 000 -> 0
# so (rule & 0x5F) == 0x06
#
{
my @absdx_minimum = (
undef, 0, undef, 1, undef, 0, undef, 1,
undef, 0, undef, 1, undef, 0, 1, 1,
undef, 1, undef, 1, undef, 0, 1, 1,
undef, 1, undef, 0, 0, 0, 1, 1,
undef, 0, undef, 1, undef, 0, undef, 1,
undef, 0, undef, 1, undef, 0, 1, 1,
undef, 1, undef, 1, undef, 0, undef, 1,
undef, undef, undef, 1, undef, 0, 1, 1,
undef, 0, undef, 0, undef, 0, 1, 0,
undef, 1, undef, 0, undef, 0, 1, 0,
undef, 0, undef, 1, 0, 0, 1, 1,
undef, 1, undef, 1, 0, 0, 1, 1,
undef, 1, undef, undef, undef, 0, undef, 0,
undef, 1, undef, 0, undef, 0, 1, 0,
undef, 0, undef, 1, 0, 0, 1, 1,
undef, 1, undef, 1, 0, 0, 1, 1,
undef, 0, undef, 1, undef, 0, undef, 1,
undef, 0, undef, 1, undef, 0, 1, 1,
undef, 1, undef, 1, undef, 0, 1, undef,
undef, 1, undef, 1, 0, 0, 1, undef,
undef, 0, undef, 1, undef, 0, undef, 1,
undef, 0, undef, 1, undef, 0, 1, 1,
undef, 1, undef, undef, undef, 0, 1, undef,
undef, 1, undef, 1, 0, 0, undef, undef,
undef, 1, undef, 1, undef, 0, 1, 1,
undef, 1, undef, 1, undef, 0, undef, 1,
undef, 1, undef, 1, 0, 0, 1, undef,
undef, 1, undef, 1, undef, 0, undef, undef,
undef, 1, undef, 1, undef, 0, 1, 1,
undef, 1, undef, 1, undef, 0, undef, 1,
undef, 1, undef, 1, 0, 0, undef, undef,
undef, 1, undef, 1, undef, 0,
);
sub absdx_minimum {
my ($self) = @_;
return $absdx_minimum[$self->{'rule'}];
}
}
#------------------------------------------------------------------------------
# dsumxy
sub dsumxy_minimum {
my ($self) = @_;
return (($self->{'rule'} & 0x5F) == 0x54 # right line 2, const dSum=+1
? 1
: ($self->{'rule'} & 0x5F) == 0x0E # left line 2
? -1
: undef);
}
{
my @dsumxy_maximum = (
undef, 4, undef, 3, undef, 2, undef, 1,
undef, 3, undef, 3, undef, 2, 1, 3,
undef, 3, undef, 2, undef, 1, undef, 1,
undef, 5, undef, 2, 2, 2, undef, 1,
undef, 4, undef, 3, undef, undef, undef, 2,
undef, 4, undef, 3, undef, undef, 1, 3,
undef, 3, undef, 2, undef, 2, undef, 1,
undef, undef, undef, 2, undef, 4, 4, 1,
undef, 3, undef, 5, undef, 2, 2, 2,
undef, undef, undef, undef, undef, 2, 2, 2,
undef, 2, undef, 2, 1, 1, undef, 1,
undef, undef, undef, 4, 2, 2, 2, 1,
undef, 3, undef, undef, undef, undef, undef, 4,
undef, undef, undef, undef, undef, 4, undef, 4,
undef, 2, undef, 2, 1, 1, 4, 1,
undef, undef, undef, 2, undef, 4, undef, 1,
undef, undef, undef, 5, undef, 2, undef, undef,
undef, undef, undef, 3, undef, 2, 1, 3,
undef, 5, undef, 4, undef, undef, undef, undef,
undef, undef, undef, 3, 2, 2, 3, undef,
undef, undef, undef, 3, undef, 2, undef, 2,
undef, undef, undef, 3, undef, 1, 1, 2,
undef, 3, undef, undef, undef, 2, 2, undef,
undef, 2, undef, 2, 2, 1, undef, undef,
undef, undef, undef, undef, undef, 2, 2, 2,
undef, 4, undef, 2, undef, 2, undef, 2,
undef, 3, undef, 3, 1, 3, 3, undef,
undef, 2, undef, 2, undef, 2, undef, undef,
undef, undef, undef, 2, undef, 1, 2, 1,
undef, 2, undef, 2, undef, 1, undef, 1,
undef, 3, undef, 2, 1, 2, undef, undef,
undef, 2, undef, 2, undef, 1,
);
sub dsumxy_maximum {
my ($self) = @_;
return $dsumxy_maximum[$self->{'rule'}];
}
}
# sub dsumxy_maximum {
# my ($self) = @_;
# return (($self->{'rule'} & 0x5F) == 0x54 # right line 2
# ? 1 # is constant dSum=+1
# : ($self->{'rule'} & 0x5F) == 0x0E # left line 2
# ? 1
# : $self->{'rule'}==3 || $self->{'rule'}==35 ? 3
# : $self->{'rule'} == 5 ? 2
# : $self->{'rule'} == 7 ? 1
# : $self->{'rule'} == 9 ? 3
# : $self->{'rule'}==11 || $self->{'rule'}==43 ? 3
# : $self->{'rule'} == 13 ? 2
# : $self->{'rule'} == 15 ? 3
# : $self->{'rule'}==17 || $self->{'rule'}==49 ? 3
# : $self->{'rule'}==19 ? 2
# : $self->{'rule'}==21 ? 1
# : ($self->{'rule'} & 0x97) == 0x17 # 0x17,...,0x7F
# ? 1
# : $self->{'rule'}==27 ? 2
# : $self->{'rule'}==28 || $self->{'rule'}==156 ? 2
# : $self->{'rule'}==29 ? 2
# : $self->{'rule'}==31 ? 1
# : $self->{'rule'}==39 ? 2
# : $self->{'rule'}==47 ? 3
# : $self->{'rule'}==51 ? 2
# : $self->{'rule'}==53 ? 2
# : $self->{'rule'}==59 ? 2
# : $self->{'rule'}==65 ? 3
# : $self->{'rule'}==69 ? 2
# : $self->{'rule'}==70 || $self->{'rule'}==198 ? 2
# : $self->{'rule'}==71 ? 2
# : $self->{'rule'}==77 ? 2
# : $self->{'rule'}==78 ? 2
# : $self->{'rule'}==79 ? 2
# : $self->{'rule'}==81 || $self->{'rule'}==113 ? 2
# : undef);
# }
#------------------------------------------------------------------------------
# ddiffxy range
sub ddiffxy_minimum {
my ($self) = @_;
return (($self->{'rule'} & 0x5F) == 0x54 # right line 2, dDiffXY=-1 or +1
? -1
: ($self->{'rule'} & 0x5F) == 0x0E # left line 2, dDiffXY=-3 or +1
? -3
: undef);
}
{
my @ddiffxy_maximum = (
undef, 4, undef, 3, undef, 2, undef, 1,
undef, 2, undef, 1, undef, 2, 1, 1,
undef, 3, undef, 2, undef, 1, undef, 1,
undef, 5, undef, 2, 2, 2, undef, 1,
undef, 4, undef, 3, undef, undef, undef, 2,
undef, 3, undef, 1, undef, undef, 1, 1,
undef, 3, undef, 2, undef, 2, undef, 1,
undef, undef, undef, 2, undef, 4, 4, 1,
undef, 2, undef, 5, undef, 2, 2, 2,
undef, undef, undef, undef, undef, 2, 2, 2,
undef, 1, undef, 2, 1, 1, undef, 1,
undef, undef, undef, 4, 2, 2, 2, 1,
undef, 3, undef, undef, undef, undef, undef, 4,
undef, undef, undef, undef, undef, 4, undef, 4,
undef, 1, undef, 2, 1, 1, 4, 1,
undef, undef, undef, 2, undef, 4, undef, 1,
undef, undef, undef, 5, undef, 2, undef, undef,
undef, undef, undef, 3, undef, 2, 1, 3,
undef, 5, undef, 4, undef, undef, undef, undef,
undef, undef, undef, 3, 2, 2, 3, undef,
undef, undef, undef, 3, undef, 2, undef, 2,
undef, undef, undef, 3, undef, 1, 1, 2,
undef, 3, undef, undef, undef, 2, 2, undef,
undef, 2, undef, 2, 2, 1, undef, undef,
undef, undef, undef, undef, undef, 2, 2, 2,
undef, 4, undef, 2, undef, 2, undef, 2,
undef, 3, undef, 3, 1, 3, 3, undef,
undef, 2, undef, 2, undef, 2, undef, undef,
undef, undef, undef, 2, undef, 1, 2, 1,
undef, 2, undef, 2, undef, 1, undef, 1,
undef, 3, undef, 2, 1, 2, undef, undef,
undef, 2, undef, 2, undef, 1,
);
sub ddiffxy_maximum {
my ($self) = @_;
return $ddiffxy_maximum[$self->{'rule'}];
}
}
# sub ddiffxy_maximum {
# my ($self) = @_;
# return (($self->{'rule'} & 0x5F) == 0x0E # left line 2
# ? 1
# : $self->{'rule'}==3 || $self->{'rule'}==35 ? 3
# : $self->{'rule'} == 5 ? 2
# : $self->{'rule'} == 7 ? 1
# : $self->{'rule'} == 9 ? 2
# : $self->{'rule'}==11 || $self->{'rule'}==43 ? 1
# : $self->{'rule'} == 13 ? 2
# : $self->{'rule'} == 15 ? 1
# : $self->{'rule'}==17 || $self->{'rule'}==49 ? 3
# : $self->{'rule'}==19 ? 2
# : $self->{'rule'}==21 ? 1
# : ($self->{'rule'} & 0x97) == 0x17 # 0x17=23,...,0x7F
# ? 1
# : $self->{'rule'}==27 ? 2
# : $self->{'rule'}==28 || $self->{'rule'}==156 ? 2
# : $self->{'rule'}==29 ? 2
# : $self->{'rule'}==31 ? 1
# : $self->{'rule'}==39 ? 2
# : $self->{'rule'}==41 ? 3
# : $self->{'rule'}==47 ? 1
# : $self->{'rule'}==51 ? 2
# : $self->{'rule'}==53 ? 2
# : $self->{'rule'}==55 ? 1
# : $self->{'rule'}==59 ? 2
# : $self->{'rule'}==65 ? 2
# : $self->{'rule'}==69 ? 2
# : $self->{'rule'}==70 || $self->{'rule'}==198 ? 2
# : $self->{'rule'}==71 ? 2
# : $self->{'rule'}==77 ? 2
# : $self->{'rule'}==78 ? 2
# : $self->{'rule'}==79 ? 2
# : $self->{'rule'}==81 || $self->{'rule'}==113 ? 1
# : undef);
# }
#------------------------------------------------------------------------------
# dir range
sub dir_maximum_dxdy {
my ($self) = @_;
return (($self->{'rule'} & 0x5F) == 0x54 # right line 2
? (0,1) # north
: ($self->{'rule'} & 0x5F) == 0x0E # left line 2
? (-2,1)
: (-1,0)); # supremum, west and 1 up
}
#------------------------------------------------------------------------------
# cf 60 is right half Sierpinski
# 129 is inverse Sierpinski, except for initial N=1 cell
# 119 etc alternate rows PyramidRows step=4 with 2*Y
# 50 PyramidRows with 2*N
#
my @rule_to_class;
{
my $store = sub {
my ($rule, $aref) = @_;
if ($rule_to_class[$rule] && $rule_to_class[$rule] != $aref) {
die "Oops, already have rule_to_class[] $rule";
}
$rule_to_class[$rule] = $aref;
};
$store->(54, [ 'Math::PlanePath::CellularRule54' ]);
$store->(57, [ 'Math::PlanePath::CellularRule57' ]);
$store->(99, [ 'Math::PlanePath::CellularRule57', mirror => 1 ]);
$store->(190, [ 'Math::PlanePath::CellularRule190' ]);
$store->(246, [ 'Math::PlanePath::CellularRule190', mirror => 1 ]);
{
# ************* whole solid
# ***********
# *********
# *******
# *****
# ***
# *
# 0xDE and 0xFE = 222, 254
# 111 -> 1 solid
# 110 -> 1 right side
# 101 any, doesn't occur
# 100 -> 1 initial
# 011 -> 1 left side
# 010 -> 1 initial
# 001 -> 1 initial
# 000 -> 0 sides blank
#
# -*************- whole solid with full sides
# --***********--
# ---*********---
# ----*******----
# -----*****-----
# ------***------
# *
# and with sides
# 111 -> 1 solid middle
# 110 any, doesn't occur
# 101 any, doesn't occur
# 100 -> 1 initial
# 011 any, doesn't occur
# 010 -> 1 initial
# 001 -> 1 initial
# 000 -> 1 sides blank
my $solid = [ 'Math::PlanePath::PyramidRows', step => 2 ];
$store->(222, $solid);
$store->(254, $solid);
foreach my $i (0 .. 255) {
$store->(($i&0x68)|0x97, $solid);
}
}
{
# ******* right half solid
# ******
# *****
# ****
# ***
# **
# *
# 111 -> 1 solid
# 110 -> 1 to right
# 101 any, doesn't occur
# 100 -> 1 initial
# 011 -> 1 vertical
# 010 -> 1 initial
# 001 -> 0 not to left
# 000 -> 0
my $solid_half = [ 'Math::PlanePath::PyramidRows', step => 1 ];
$store->(220, $solid_half);
$store->(252, $solid_half);
}
{
# * * * * * * * *
# * * * *
# * * * *
# * *
# * * * *
# * *
# * *
# *
# 18,26,82,90,146,154,210,218
# 111 any, doesn't occur
# 110 any, doesn't occur
# 101 -> 0
# 100 -> 1 initial
# 011 any, doesn't occur
# 010 -> 0 initial
# 001 -> 1 initial
# 000 -> 0 for outsides
#
my $sierpinski_triangle = [ 'Math::PlanePath::SierpinskiTriangle',
n_start => 1 ];
foreach my $i (0 .. 255) {
$store->(($i&0xC8)|0x12, $sierpinski_triangle);
}
}
$store->(60, [ 'Math::PlanePath::SierpinskiTriangle',
n_start => 1, align => "right" ]);
$store->(102, [ 'Math::PlanePath::SierpinskiTriangle',
n_start => 1, align => "left" ]);
{
# left negative line, rule=2,10,...
# 111 any, doesn't occur
# 110 any, doesn't occur
# 101 any, doesn't occur
# 100 -> 0 initial
# 011 any, doesn't occur
# 010 -> 0 initial
# 001 -> 1 initial towards left
# 000 -> 0 for outsides
#
my $left_line = [ 'Math::PlanePath::CellularRule::Line',
align => 'left' ];
foreach my $i (0 .. 255) {
$store->(($i&0xE8)|0x02, $left_line);
}
}
{
# right positive line, rule=16,...
# 111 any, doesn't occur
# 110 any, doesn't occur
# 101 any, doesn't occur
# 100 -> 1 initial
# 011 any, doesn't occur
# 010 -> 0 initial
# 001 -> 0 initial towards left
# 000 -> 0 for outsides
#
my $right_line = [ 'Math::PlanePath::CellularRule::Line',
align => 'right' ];
foreach my $i (0 .. 255) {
$store->(($i&0xE8)|0x10, $right_line);
}
}
{
# central vertical line 4,...
# 111 any
# 110 any
# 101 any
# 100 -> 0
# 011 any
# 010 -> 1 initial cell
# 001 -> 0
# 000 -> 0
my $centre_line = [ 'Math::PlanePath::CellularRule::Line',
align => 'centre' ];
foreach my $i (0 .. 255) {
$store->(($i&0xE8)|0x04, $centre_line);
}
}
{
# 1,2 alternating line left rule=6,38,134,166
# 111 any, doesn't occur
# 110 -> 0
# 101 any, doesn't occur
# 100 -> 0 initial
# 011 -> 0
# 010 -> 1 initial
# 001 -> 1 angle towards left
# 000 -> 0 for outsides
#
my $left_onetwo = [ 'Math::PlanePath::CellularRule::OneTwo',
align => 'left' ];
foreach my $i (0 .. 255) {
$store->(($i&0xA0)|0x06, $left_onetwo);
}
}
{
# 1,2 alternating line right rule=20,52,148,180 = 0x14,34,94,B4
# 111 any, doesn't occur
# 110 -> 0
# 101 any, doesn't occur
# 100 -> 1 angle towards right
# 011 -> 0
# 010 -> 1 vertical
# 001 -> 0 not to left
# 000 -> 0 for outsides
# so (rule & 0x5F) == 0x14
#
my $right_onetwo = [ 'Math::PlanePath::CellularRule::OneTwo',
align => 'right' ];
foreach my $i (0 .. 255) {
$store->(($i&0xA0)|0x14, $right_onetwo);
}
}
{
# solid every second cell, 50,58,114,122,178,186,242,250, 179
# http://mathworld.wolfram.com/Rule250.html
# 111 any, doesn't occur
# 110 any, doesn't occur
# 101 -> 1 middle
# 100 -> 1 initial
# 011 any, doesn't occur
# 010 -> 0 initial
# 001 -> 1 initial
# 000 -> 0 outsides
#
my $odd_solid = [ 'Math::PlanePath::CellularRule::OddSolid' ];
foreach my $i (0 .. 255) {
$store->(($i&0xC8)|0x32, $odd_solid);
}
$store->(179, $odd_solid);
}
{
# ******* left half solid 206,238 = 0xCE,0xEE
# ******
# *****
# ****
# ***
# **
# *
# 111 -> 1 middle
# 110 -> 1 vertical
# 101 any, doesn't occur
# 100 -> 0 initial
# 011 -> 1 left
# 010 -> 1 initial
# 001 -> 1 initial
# 000 -> 0 outsides
my $left_solid = [ 'Math::PlanePath::PyramidRows',
step => 1, align => 'left' ];
foreach my $i (0 .. 255) {
$store->(($i&0x20)|0xCE, $left_solid);
}
}
}
### rule_to_class count: do { my @k = grep {defined} @rule_to_class; scalar(@k) }
### rule_to_class: [ map {defined($_) && join(',',@$_)} @rule_to_class ]
# ### zap %rule_to_class for testing ...
# %rule_to_class = ();
sub new {
### CellularRule new() ...
my $self = shift->SUPER::new(@_);
my $rule = $self->{'rule'};
if (! defined $rule) {
$rule = $self->{'rule'} = _default_rule();
}
### $rule
my $n_start = $self->{'n_start'};
if (! defined $n_start) {
$n_start = $self->{'n_start'} = $self->default_n_start;
}
unless ($self->{'use_bitwise'}) { # secret undocumented option
if (my $aref = $rule_to_class[$rule]) {
my ($class, @args) = @$aref;
### $class
### @args
$class->can('new')
or eval "require $class; 1"
or die;
return $class->new (rule => $rule,
n_start => $n_start,
@args);
}
}
$self->{'rows'} = [ "\001" ];
$self->{'row_end_n'} = [ $n_start ];
$self->{'left'} = 0;
$self->{'right'} = 0;
$self->{'rule_table'} = [ map { ($rule >> $_) & 1 } 0 .. 7 ];
### $self
return $self;
}
#
# Y=2 L 0 1 2 3 4 R right=2*Y+2
# Y=1 L 0 1 2 R
# Y=0 L 0 R
sub _extend {
my ($self) = @_;
### _extend()
my $rule_table = $self->{'rule_table'};
my $rows = $self->{'rows'};
my $row = $rows->[-1];
my $newrow = '';
my $rownum = $#$rows;
my $count = 0;
my $bits = $self->{'left'} * 7;
$self->{'left'} = $rule_table->[$bits];
### $row
### $rownum
foreach my $i (0 .. 2*$rownum) {
$bits = (($bits<<1) + vec($row,$i,1)) & 7;
### $i
### $bits
### new: $rule_table->[$bits]
$count +=
(vec($newrow,$i,1) = $rule_table->[$bits]);
}
my $rbit = $self->{'right'};
$self->{'right'} = $rule_table->[7*$rbit];
### $rbit
### new right: $self->{'right'}
# right, second last
$bits = (($bits<<1) + $rbit) & 7;
$count +=
(vec($newrow,2*$rownum+1,1) = $rule_table->[$bits]);
### $bits
### new second last: $rule_table->[$bits]
# right end
$bits = (($bits<<1) + $rbit) & 7;
$count +=
(vec($newrow,2*$rownum+2,1) = $rule_table->[$bits]);
### $bits
### new right end: $rule_table->[$bits]
### $count
### $newrow
push @$rows, $newrow;
my $row_end_n = $self->{'row_end_n'};
push @$row_end_n, $row_end_n->[-1] + $count;
}
sub n_to_xy {
my ($self, $n) = @_;
### CellularRule n_to_xy(): $n
my $int = int($n);
$n -= $int; # now fraction part
if (2*$n >= 1) {
$n -= 1;
$int += 1;
}
# -0.5 <= $n < 0.5 fractional part
### assert: 2*$n >= -1 || $n+1==$n || $n!=$n
### assert: 2*$n < 1 || $n+1==$n || $n!=$n
if ($int < $self->{'n_start'}) {
return;
}
if (is_infinite($int)) { return ($int,$int); }
my $row_end_n = $self->{'row_end_n'};
my $y = 0;
for (;;) {
if (scalar(@$row_end_n) >= 3
&& $row_end_n->[-1] == $row_end_n->[-2]
&& $row_end_n->[-2] == $row_end_n->[-3]) {
### no more cells in three rows means rest is blank ...
return;
}
if ($y > $#$row_end_n) {
_extend($self);
}
if ($int <= $row_end_n->[$y]) {
last;
}
$y++;
}
### $y
### row_end_n: $row_end_n->[$y]
### remainder: $int - $row_end_n->[$y]
$int -= $row_end_n->[$y];
my $row = $self->{'rows'}->[$y];
my $x = 2*$y+1; # for first vec 2*Y
### $row
for ($x = 2*$y+1; $x >= 0; $x--) {
if (vec($row,$x,1)) {
### step bit: "x=$x"
if (++$int > 0) {
last;
}
}
}
### result: ($n + $x - $y).",$y"
return ($n + $x - $y,
$y);
}
sub xy_to_n {
my ($self, $x, $y) = @_;
### CellularRule xy_to_n(): "$x, $y"
$x = round_nearest ($x);
$y = round_nearest ($y);
if (is_infinite($x)) { return $x; }
if (is_infinite($y)) { return $y; }
if ($y < 0 || ! ($x <= $y && ($x+=$y) >= 0)) {
return undef;
}
my $row_end_n = $self->{'row_end_n'};
while ($y > $#$row_end_n) {
if (scalar(@$row_end_n) >= 3
&& $row_end_n->[-1] == $row_end_n->[-2]
&& $row_end_n->[-2] == $row_end_n->[-3]) {
### no more cells in three rows means rest is blank ...
return undef;
}
_extend($self);
}
my $row = $self->{'rows'}->[$y];
if (! vec($row,$x,1)) {
return undef;
}
my $n = $row_end_n->[$y];
foreach my $i ($x+1 .. 2*$y) {
$n -= vec($row,$i,1);
}
return $n;
}
# not exact
sub rect_to_n_range {
my ($self, $x1,$y1, $x2,$y2) = @_;
### CellularRule rect_to_n_range(): "$x1,$y1 $x2,$y2"
($x1,$y1, $x2,$y2) = _rect_for_V ($x1,$y1, $x2,$y2)
or return (1,0); # rect outside pyramid
if (is_infinite($y1)) { return ($self->{'n_start'}, $y1); } # for nan
if (is_infinite($y2)) { return ($self->{'n_start'}, $y2); } # for nan or inf
my $row_end_n = $self->{'row_end_n'};
while ($#$row_end_n < $y2) {
if (scalar(@$row_end_n) >= 3
&& $row_end_n->[-1] == $row_end_n->[-2]
&& $row_end_n->[-2] == $row_end_n->[-3]) {
### rect_to_n_range() no more cells in three rows means rest is blank ...
last;
}
_extend($self);
}
$y1 -= 1; # to be 1 past end of prev row
if ($y1 > $#$row_end_n) { $y1 = $#$row_end_n; }
if ($y2 > $#$row_end_n) { $y2 = $#$row_end_n; }
### y range: "$y1 to $y2"
return ($y1 < 0
? $self->{'n_start'}
: $row_end_n->[$y1] + 1,
$row_end_n->[$y2]);
}
#------------------------------------------------------------------------------
# 000,001,010,100 = 0,1,2,4 used always
# if 000=1 then 111 used
# $bool = Math::PlanePath::CellularRule->rule_is_symmetric($rule)
# sub _NOTWORKING__rule_is_symmetric {
# my ($class, $rule) = @_;
# }
# =item C<$mirror_rule = Math::PlanePath::CellularRule-E<gt>rule_mirror ($rule)>
#
# Return the rule number which is the horizontal mirror image of C<$rule>.
# This is a swap of bits 3E<lt>-E<gt>6 and 1E<lt>-E<gt>4.
# If the pattern is symmetric then the returned C<$mirror_rule> will
# generate the same pattern even though its value is different. This occurs
# if the bits never occur in the pattern and so don't affect the result.
#
sub _NOTWORKING__rule_mirror {
my ($class, $rule) = @_;
# 7,6,5,4,3,2,1,0
# 1 0 1 0 0 1 0 1 = 0xA5
return (($rule & 0xA5)
# swap 1,1,0 -> bit6
# 0,1,1 -> bit3
| (($rule & (1<<6)) >> 3)
| (($rule & (1<<3)) << 3)
# swap 1,0,0 -> bit4
# 0,0,1 -> bit1
| (($rule & (1<<4)) >> 3)
| (($rule & (1<<1)) << 3));
}
#------------------------------------------------------------------------------
{
package Math::PlanePath::CellularRule::Line;
use strict;
use Carp;
use vars '$VERSION', '@ISA';
$VERSION = 113;
use Math::PlanePath;
@ISA = ('Math::PlanePath');
use Math::PlanePath::Base::Generic
'is_infinite',
'round_nearest';
use constant parameter_info_array =>
[ { name => 'align',
display => 'Align',
type => 'enum',
default => 'left',
choices => ['left','centre','right'],
},
Math::PlanePath::Base::Generic::parameter_info_nstart1(),
];
use constant class_y_negative => 0;
use constant n_frac_discontinuity => .5;
use constant sumxy_minimum => 0; # triangular X>=-Y so X+Y>=0
sub sumxy_maximum {
my ($self) = @_;
return ($self->{'align'} eq 'left'
? 0 # left X=-Y so X+Y=0 always
: undef);
}
sub diffxy_minimum {
my ($self) = @_;
return ($self->{'align'} eq 'right'
? 0 # right X=Y so X-Y=0 always
: undef);
}
use constant diffxy_maximum => 0; # triangular X<=Y so X-Y<=0
# always dX=sign,dY=+1 so dSumXY = sign+1
sub dsumxy_minimum {
my ($self) = @_;
return $self->{'sign'}+1;
}
*dsumxy_maximum = \&dsumxy_minimum;
# always dX=sign,dY=+1 so dDiffXY = sign-1
sub ddiffxy_minimum {
my ($self) = @_;
return $self->{'sign'}-1;
}
*ddiffxy_maximum = \&ddiffxy_minimum;
#-----------------------------------------------------------
my %align_to_sign = (left => -1,
centre => 0,
right => 1);
sub new {
my $self = shift->SUPER::new (@_);
if (! defined $self->{'n_start'}) {
$self->{'n_start'} = $self->default_n_start;
}
$self->{'align'} ||= 'left';
$self->{'sign'} = $align_to_sign{$self->{'align'}};
if (! defined $self->{'sign'}) {
croak "Unrecognised align parameter: ",$self->{'align'};
}
return $self;
}
sub x_negative {
my ($self) = @_;
return ($self->{'align'} eq 'left');
}
sub x_maximum {
my ($self) = @_;
return ($self->{'align'} eq 'right'
? undef
: 0);
}
sub absdx_minimum {
my ($self) = @_;
return ($self->{'align'} eq 'centre' ? 0 : 1);
}
use constant absdy_minimum => 1; # dY=1 always
sub dir_minimum_dxdy {
my ($self) = @_;
return ($self->dx_minimum, 1);
}
*dir_maximum_dxdy = \&dir_minimum_dxdy; # same direction always
sub dx_minimum {
my ($self) = @_;
return $self->{'sign'};
}
*dx_maximum = \&dx_minimum; # same step always
use constant dy_minimum => 1;
use constant dy_maximum => 1;
sub n_to_xy {
my ($self, $n) = @_;
### CellularRule-Line n_to_xy(): $n
$n = $n - $self->{'n_start'}; # to N=0 basis
my $int = int($n);
$n -= $int; # now fraction part
if (2*$n >= 1) {
$n -= 1;
$int += 1;
}
# -0.5 <= $n < 0.5 fractional part
### assert: 2*$n >= -1
### assert: 2*$n < 1
### $int
if ($int < 0) {
return;
}
if (is_infinite($int)) { return ($int,$int); }
return ($n + $int*$self->{'sign'},
$int);
}
sub n_to_radius {
my ($self, $n) = @_;
$n = $n - $self->{'n_start'}; # to N=0 start
if ($n < 0) { return undef; }
if ($self->{'align'} ne 'centre') {
$n *= sqrt(2 + $n*0); # inherit bigfloat etc from $n
}
return $n;
}
sub n_to_rsquared {
my ($self, $n) = @_;
$n = $n - $self->{'n_start'}; # to N=0 start
if ($n < 0) { return undef; }
$n *= $n; # squared
if ($self->{'align'} ne 'centre') {
$n *= 2;
}
return $n;
}
sub xy_to_n {
my ($self, $x, $y) = @_;
### CellularRule-Line xy_to_n(): "$x,$y"
$x = round_nearest ($x);
$y = round_nearest ($y);
if (is_infinite($x)) { return $x; }
if ($y >= 0 && $x == $y*$self->{'sign'}) {
return $y + $self->{'n_start'};
} else {
return undef;
}
}
# not exact
sub rect_to_n_range {
my ($self, $x1,$y1, $x2,$y2) = @_;
$x1 = round_nearest ($x1);
$y1 = round_nearest ($y1);
$x2 = round_nearest ($x2);
$y2 = round_nearest ($y2);
if ($y1 > $y2) { ($y1,$y2) = ($y2,$y1); } # swap to y1<=y2
if ($y2 < 0) {
return (1, 0);
}
if ($y1 < 0) { $y1 *= 0; }
return ($y1 + $self->{'n_start'},
$y2 + $self->{'n_start'});
}
}
#------------------------------------------------------------------------------
{
package Math::PlanePath::CellularRule::OddSolid;
use strict;
use vars '$VERSION', '@ISA';
$VERSION = 113;
use Math::PlanePath;
@ISA = ('Math::PlanePath');
use Math::PlanePath::Base::Generic
'is_infinite',
'round_nearest';
use Math::PlanePath::PyramidRows;
use constant parameter_info_array =>
[ Math::PlanePath::Base::Generic::parameter_info_nstart1(),
];
use constant class_y_negative => 0;
use constant n_frac_discontinuity => .5;
use constant sumxy_minimum => 0; # triangular X>=-Y so X+Y>=0
use constant diffxy_maximum => 0; # triangular X<=Y so X-Y<=0
use constant dx_maximum => 2;
use constant dy_minimum => 0;
use constant dy_maximum => 1;
use constant absdx_minimum => 1;
use constant dsumxy_maximum => 2; # straight E dX=+2
use constant ddiffxy_maximum => 2; # straight E dX=+2
use constant dir_maximum_dxdy => (-1,0); # West, supremum
sub new {
my $self = shift->SUPER::new (@_);
if (! defined $self->{'n_start'}) {
$self->{'n_start'} = $self->default_n_start;
}
# delegate to sub-object
$self->{'pyramid'}
= Math::PlanePath::PyramidRows->new (n_start => $self->{'n_start'},
step => 1);
return $self;
}
sub n_to_xy {
my ($self, $n) = @_;
### CellularRule-OddSolid n_to_xy(): $n
my ($x,$y) = $self->{'pyramid'}->n_to_xy($n)
or return;
### pyramid: "$x, $y"
return ($x+round_nearest($x) - $y, $y);
}
sub xy_to_n {
my ($self, $x, $y) = @_;
### CellularRule-OddSolid xy_to_n(): "$x,$y"
$x = round_nearest ($x);
$y = round_nearest ($y);
if (($x+$y)%2) {
return undef;
}
return $self->{'pyramid'}->xy_to_n(($x+$y)/2, $y);
}
# (y2+1)*(y2+2)/2 - 1
# = (y2^2 + 3*y2 + 2 - 2)/2
# = y2*(y2+3)/2
# not exact
sub rect_to_n_range {
my ($self, $x1,$y1, $x2,$y2) = @_;
### OddSolid rect_to_n_range() ...
$y1 = round_nearest ($y1);
$y2 = round_nearest ($y2);
if ($y1 > $y2) { ($y1,$y2) = ($y2,$y1); } # swap to y1<=y2
if ($y1 < 0) { $y1 *= 0; }
return ($y1*($y1+1)/2 + $self->{'n_start'}, # start of row, triangular+1
$y2*($y2+3)/2 + $self->{'n_start'}); # end of row, prev triangular
}
}
#------------------------------------------------------------------------------
{
package Math::PlanePath::CellularRule::OneTwo;
use strict;
use Carp;
use vars '$VERSION', '@ISA';
$VERSION = 113;
use Math::PlanePath;
@ISA = ('Math::PlanePath');
*_divrem_mutate = \&Math::PlanePath::_divrem_mutate;
use Math::PlanePath::Base::Generic
'is_infinite',
'round_nearest';
# rule=6,38,134,166 sign=-1
# **
# *
# **
# *
#
# rule=20,52,148,180 sign=1
# **
# *
# **
# *
#
use constant parameter_info_array =>
[ { name => 'align',
display => 'Align',
type => 'enum',
default => 'left',
choices => ['left','right'],
},
Math::PlanePath::Base::Generic::parameter_info_nstart1(),
];
use constant class_y_negative => 0;
use constant n_frac_discontinuity => .5;
sub x_negative {
my ($self) = @_;
return ($self->{'align'} eq 'left');
}
sub x_maximum {
my ($self) = @_;
return ($self->{'align'} eq 'left'
? 0
: undef);
}
use constant sumxy_minimum => 0; # triangular X>=-Y so X+Y>=0
sub sumxy_maximum {
my ($self) = @_;
return ($self->{'align'} eq 'left'
? 1
: undef);
}
sub diffxy_minimum {
my ($self) = @_;
return ($self->{'align'} eq 'right'
? -1
: undef);
}
use constant diffxy_maximum => 0; # triangular X<=Y so X-Y<=0
sub dx_minimum {
my ($self) = @_;
return ($self->{'align'} eq 'left'
? -2 # -2 or +1
: 0); # 0 or +1
}
use constant dx_maximum => 1;
use constant dy_minimum => 0;
use constant dy_maximum => 1;
sub absdx_minimum {
my ($self) = @_;
return ($self->{'align'} eq 'left'
? 1 # -2 or +1, so minimum abs is 1
: 0); # 0 or +1, so minimum abs is 0
}
sub dsumxy_minimum {
my ($self) = @_;
return ($self->{'sign'} < 0
? -1 # left, ENE
: 1); # right, N, going as a stairstep so always increase
}
sub dsumxy_maximum {
my ($self) = @_;
return ($self->{'sign'} < 0
? 1 # left, East
: 2); # right, NE diagonal
}
sub ddiffxy_minimum {
my ($self) = @_;
return ($self->{'sign'} < 0
? -3 # left, ENE
: -1); # right, N, going as a stairstep so always increase
}
sub ddiffxy_maximum {
my ($self) = @_;
return ($self->{'sign'} < 0
? 1 # left, East
: 1); # right, NE diagonal
}
sub dir_maximum_dxdy {
my ($self) = @_;
return ($self->{'align'} eq 'left'
? (-2,1)
: (0,1)); # North
}
#---------------------------------------------
my %align_to_sign = (left => -1,
right => 1);
sub new {
my $self = shift->SUPER::new (@_);
if (! defined $self->{'n_start'}) {
$self->{'n_start'} = $self->default_n_start;
}
$self->{'align'} ||= 'left';
$self->{'sign'} = $align_to_sign{$self->{'align'}}
|| croak "Unrecognised align parameter: ",$self->{'align'};
return $self;
}
sub n_to_xy {
my ($self, $n) = @_;
### CellularRule-OneTwo n_to_xy(): $n
$n = $n - $self->{'n_start'} + 1; # to N=1 basis, and warn if $n undef
my $int = int($n);
$n -= $int; # $n now fraction part
if (2*$n >= 1) {
$n -= 1;
} else {
$int -= 1; # to N=0 basis
}
# -0.5 <= $n < 0.5 fractional part
### $int
if ($int < 0) {
return;
}
if (is_infinite($int)) { return ($int,$int); }
### assert: 2*$n >= -1 || $n+1==$n || $n!=$n
### assert: 2*$n < 1 || $n+1==$n || $n!=$n
my $x = _divrem_mutate($int,3);
$int *= 2;
if ($x) {
$int += 1;
$x += ($self->{'align'} eq 'left' ? -1 : -2);
}
return ($n + $x + $int*$self->{'sign'},
$int);
}
sub xy_to_n {
my ($self, $x, $y) = @_;
### CellularRule-OneTwo xy_to_n(): "$x,$y"
$x = round_nearest ($x);
$y = round_nearest ($y);
if ($y < 0) { return undef; }
if (is_infinite($y)) { return $y; }
$x -= $y*$self->{'sign'};
if ($y % 2) {
### odd row: "x=$x y=$y"
if ($self->{'sign'} > 0) { $x += 1; }
if ($x < 0 || $x > 1) { return undef; }
return (3*$y-1)/2 + $x + $self->{'n_start'};
} else {
### even row: "x=$x y=$y"
if ($x != 0) { return undef; }
return ($y/2)*3 + $self->{'n_start'};
}
}
# not exact
sub rect_to_n_range {
my ($self, $x1,$y1, $x2,$y2) = @_;
$x1 = round_nearest ($x1);
$y1 = round_nearest ($y1);
$x2 = round_nearest ($x2);
$y2 = round_nearest ($y2);
if ($y1 > $y2) { ($y1,$y2) = ($y2,$y1); } # swap to y1<=y2
if ($y2 < 0) {
return (1, 0);
}
if ($y1 < 0) { $y1 *= 0; }
if (is_infinite($y1)) { return (1, $y1+1); }
if (is_infinite($y2)) { return (1, $y2+1); }
$y1 -= ($y1%2);
$y2 += ($y2%2);
return ($y1/2*3 + $self->{'n_start'},
$y2/2*3 + $self->{'n_start'});
}
}
1;
__END__
# For reference the specifics currently are
#
# 54 CellularRule54
# 57,99 CellularRule57
# 190,246 CellularRule190
# 18,26,82,90,146,154,210,218 SierpinskiTriangle n_start=1
# 151,159,183,191,215,223,247, PyramidRows step=2
# 254,222,255
# 220,252 PyramidRows step=1
# 206,238 PyramidRows step=1 left
# 4,12,36,44,68,76,100,108,132, Rows width=1
# 140,164,172,196,204,228,236 single-cell column
=for stopwords Ryde Math-PlanePath PlanePath ie Xmax-Xmin superclass eg
=head1 NAME
Math::PlanePath::CellularRule -- cellular automaton points of binary rule
=head1 SYNOPSIS
use Math::PlanePath::CellularRule;
my $path = Math::PlanePath::CellularRule->new (rule => 30);
my ($x, $y) = $path->n_to_xy (123);
=head1 DESCRIPTION
X<Wolfram, Stephen>This is the patterns of Stephen Wolfram's bit-rule based
cellular automatons
=over
L<http://mathworld.wolfram.com/ElementaryCellularAutomaton.html>
=back
Points are numbered left to right in rows so for example
rule => 30
51 52 53 54 55 56 57 58 59 60 61 62 9
44 45 46 47 48 49 50 8
32 33 34 35 36 37 38 39 40 41 42 43 7
27 28 29 30 31 6
18 19 20 21 22 23 24 25 26 5
14 15 16 17 4
8 9 10 11 12 13 3
5 6 7 2
2 3 4 1
1 <- Y=0
-9 -8 -7 -6 -5 -4 -3 -2 -1 X=0 1 2 3 4 5 6 7 8 9
The automaton starts from a single point N=1 at the origin and grows into
the rows above. The C<rule> parameter controls how the 3 cells below and
diagonally below produce a new cell,
+-----+
| new | next row, Y+1
+-----+
^ ^ ^
/ | \
/ | \
+-----+ +-----+ +-----+
| A | | B | | C | row Y
+-----+ +-----+ +-----+
There's 8 possible combinations of ABC being each 0 or 1. Each such
combination can become 0 or 1 in the "new" cell. Those 0 or 1 for "new" is
encoded as 8 bits to make a rule number 0 to 255,
ABC cells below new cell bit from rule
1,1,1 -> bit7
1,1,0 -> bit6
1,0,1 -> bit5
...
0,0,1 -> bit1
0,0,0 -> bit0
When cells 0,0,0 become 1, ie. C<rule> bit0 is 1 (an odd number), the "off"
cells either side of the initial N=1 become all "on" infinitely to the
sides. Or if rule bit7 for 1,1,1 is a 0 (ie. S<rule E<lt> 128>) then they
turn on and off alternately in odd and even rows. In both cases only the
pyramid portion part -YE<lt>=XE<lt>=Y is considered for the N points but the
infinite cells to the sides are included in the calculation.
The full set of patterns can be seen at the Math World page above, or can be
printed with the F<examples/cellular-rules.pl> program in the Math-PlanePath
sources. The patterns range from simple to complex. For some the N=1 cell
doesn't grow at all such as rule 0 or rule 8. Some grow to mere straight
lines such as rule 2 or rule 5. Others make columns or patterns with
"quadratic" style stepping of 1 or 2 rows, or self-similar replications such
as the Sierpinski triangle of rule 18 and 60. Some rules have complicated
non-repeating patterns when there's feedback across from one half to the
other, such as rule 30.
For some rules there's specific PlanePath code which this class dispatches
to, such as C<CellularRule54>, C<CellularRule57>, C<CellularRule190> or
C<SierpinskiTriangle> (with C<n_start=1>).
For rules without specific code the current implementation is not
particularly efficient as it builds and holds onto the bit pattern for all
rows through to the highest N or X,Y used. There's no doubt better ways to
iterate an automaton, but this module offers the patterns in PlanePath
style.
=head2 N Start
The default is to number points starting N=1 as shown above. An optional
C<n_start> can give a different start, in the same pattern. For example to
start at 0,
=cut
# math-image --path=CellularRule,rule=62,n_start=0 --all --output=numbers --size=75x6
=pod
n_start => 0, rule => 62
18 19 20 21 22 23 24 25 5
13 14 15 16 17 4
7 8 9 10 11 12 3
4 5 6 2
1 2 3 1
0 <- Y=0
-5 -4 -3 -2 -1 X=0 1 2 3 4 5
=head1 FUNCTIONS
See L<Math::PlanePath/FUNCTIONS> for behaviour common to all path classes.
=over 4
=item C<$path = Math::PlanePath::CellularRule-E<gt>new (rule =E<gt> 123)>
=item C<$path = Math::PlanePath::CellularRule-E<gt>new (rule =E<gt> 123, n_start =E<gt> $n)>
Create and return a new path object. C<rule> should be an integer 0 to 255.
A C<rule> should be given always. There is a default, but it's secret and
likely to change.
If there's specific PlanePath code implementing the pattern then the
returned object is from that class and generally is not
C<isa('Math::PlanePath::CellularRule')>.
=item C<$n = $path-E<gt>xy_to_n ($x,$y)>
Return the point number for coordinates C<$x,$y>. C<$x> and C<$y> are each
rounded to the nearest integer, which has the effect of treating each cell
as a square of side 1. If C<$x,$y> is outside the pyramid or on a skipped
cell the return is C<undef>.
=back
=head1 SEE ALSO
L<Math::PlanePath>,
L<Math::PlanePath::CellularRule54>,
L<Math::PlanePath::CellularRule57>,
L<Math::PlanePath::CellularRule190>,
L<Math::PlanePath::SierpinskiTriangle>,
L<Math::PlanePath::PyramidRows>
L<Cellular::Automata::Wolfram>
L<http://mathworld.wolfram.com/ElementaryCellularAutomaton.html>
L<http://oeis.org/wiki/Index_to_OEIS:_Section_Ce#cell>
=head1 HOME PAGE
L<http://user42.tuxfamily.org/math-planepath/index.html>
=head1 LICENSE
Copyright 2011, 2012, 2013 Kevin Ryde
This file is part of Math-PlanePath.
Math-PlanePath is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the Free
Software Foundation; either version 3, or (at your option) any later
version.
Math-PlanePath is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
more details.
You should have received a copy of the GNU General Public License along with
Math-PlanePath. If not, see <http://www.gnu.org/licenses/>.
=cut
|