Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 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 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 714x 714x 36x 367x 367x 357x 357x 412x 412x 10x 10x 10x 10x 412x 357x 357x 367x 367x 36x 187x 187x 187x 187x 187x 187x 187x 187x 187x 36x 1716x 1716x 36x 186x 186x 182x 186x 186x 186x 186x 186x 182x 182x 186x 186x 186x 186x 186x 301x 404x 404x 404x 404x 404x 301x 186x 7924x 7924x 93202x 93202x 7924x 7924x 186x 152x 152x 152x 152x 3962x 3962x 152x 152x 152x 3962x 3962x 3962x 3962x 3962x 3962x 3962x 3962x 152x 1522x 1522x 152x 3962x 3962x 3962x 61x 61x 3962x 3962x 152x 186x 30x 30x 30x 138x 138x 30x 30x 182x 186x 36x 5x 5x 5x 5x 5x 5x 5x 5x 24x 24x 23x 21x 24x 13x 13x 13x 24x 5x 19x 19x 19x 19x 19x 19x 5x 5x 5x 36x 532x 532x 2199x 1914x 1914x 532x 532x 181x 181x 181x 181x 532x 36x 253x 253x 36x 127x 127x 127x 127x 127x 287x 287x 287x 287x 287x 287x 127x 127x 127x 187x 127x 127x 127x 127x 127x 287x 287x 287x 287x 287x 287x 287x 583x 148x 148x 148x 41x 41x 41x 41x 41x 41x 148x 583x 287x 287x 17x 17x 287x 270x 270x 270x 287x 127x 127x 127x 36x 259x 259x 259x 259x 259x 259x 259x 259x 259x 259x 30x 30x 259x 28x 28x 28x 259x 1890x 1890x 1890x 1890x 1890x 1890x 1890x 1842x 1356x 1356x 1356x 1356x 1842x 407x 407x 1842x 1890x 74x 74x 1890x 146x 146x 1816x 1890x 549x 1890x 26x 1267x 1241x 1241x 1241x 1241x 1241x 1816x 1816x 1816x 1890x 111x 111x 111x 421x 421x 421x 1890x 1705x 1705x 1890x 259x 259x 259x 36x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 3241x 15586x 15586x 15586x 237x 237x 15349x 15349x 15349x 15349x 15586x 286x 95x 95x 286x 286x 15063x 15063x 661x 14402x 674x 13728x 8905x 4823x 4823x 15586x 15586x 15586x 15586x 15586x 14402x 5318x 14396x 5564x 9084x 3520x 3520x 14402x 15586x 661x 167x 72x 167x 72x 72x 661x 77x 8x 8x 77x 8x 8x 8x 77x 661x 661x 15063x 15063x 15063x 14948x 9393x 3583x 17x 15586x 3241x 49944x 49944x 49944x 49944x 49944x 15312x 15312x 15312x 15312x 15312x 15312x 15312x 15586x 15586x 15312x 49944x 3241x 49943x 49943x 49943x 49943x 49943x 6739x 6739x 1x 1x 1x 1x 1x 6739x 6738x 6738x 6738x 7998x 7998x 6659x 6659x 6659x 1339x 1339x 6738x 6739x 49943x 49943x 6722x 6722x 76x 76x 6722x 6722x 6722x 6722x 3496x 3496x 3496x 6722x 6722x 49943x 3224x 3224x 3224x 3224x 3224x 3224x 3224x 3224x 3224x 3241x 36x 1583x 1583x 1583x 1583x 1583x 4005x 4005x 4005x 4005x 4005x 4005x 4005x 1583x 1583x 1583x 1583x 1583x 1583x 2429x 2429x 3704x 3704x 3704x 2431x 2431x 2431x 2431x 2431x 2431x 2431x 2431x 2431x 381x 381x 381x 182x 54x 182x 128x 128x 182x 381x 2377x 2377x 2249x 2431x 2377x 2377x 1273x 1273x 2429x 1583x 4005x 4005x 1583x 36x 214x 214x 214x 8691x 8691x 8691x 8682x 6232x 5581x 4190x 4190x 2529x 785x 694x 8691x 214x 7147x 5765x 6459x 6459x 5765x 6382x 7147x 214x 14x 14x 60x 60x 14x 214x 3079x 3079x 3079x 3079x 3079x 2156x 1366x 1366x 1366x 1350x 1350x 1350x 1350x 1203x 1131x 853x 853x 600x 168x 1350x 932x 932x 1350x 1350x 1366x 1366x 2156x 3079x 1078x 1078x 1078x 1078x 3079x 3079x 214x 14791x 14791x 14791x 14791x 14791x 14791x 14791x 1053x 304x 749x 13738x 5521x 1138x 4383x 8217x 1994x 6223x 214x 214x 4379x 4379x 4379x 4379x 4379x 4379x 4379x 4379x 4379x 4379x 16x 16x 16x 7x 7x 7x 7x 7x 16x 4379x 3079x 3079x 3079x 3079x 3079x 3079x 465x 465x 465x 3079x 415x 415x 415x 415x 3079x 817x 817x 817x 3079x 1282x 1282x 1282x 1282x 1282x 1282x 1282x 1282x 3079x 3079x 59x 59x 54x 54x 59x 59x 77x 77x 59x 59x 59x 9x 9x 9x 59x 59x 59x 59x 2614x 3079x 3079x 3079x 3079x 3079x 3079x 4379x 415x 415x 415x 415x 415x 403x 403x 415x 4379x 214x 214x 36x 36x 975x 975x 36x 85x 85x 36x 53x 53x 36x 39x 39x 36x 9x 9x 36x 1x 1x 1x 36x 363x 363x 363x 170x 170x 170x 363x 363x 363x 372x 363x 363x 363x 363x 15x 15x 15x 142x 142x 15x 15x 15x 130x 130x 130x 130x 130x 130x 31x 31x 31x 31x 9x 9x 9x 31x 130x 15x 363x 62x 62x 62x 6x 78x 78x 78x 78x 78x 78x 78x 78x 78x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 62x 363x 363x 363x 44x 44x 363x 261x 261x 261x 363x 58x 58x 58x 58x 58x 58x 363x 363x 36x 359x 359x 97x 97x 97x 97x 436x 436x 97x 97x 97x 359x 262x 262x 359x 359x 36x 145x 145x 145x 24x 24x 24x 24x 24x 55x 55x 55x 55x 55x 55x 44x 44x 44x 44x 44x 44x 44x 44x 44x 44x 44x 44x 44x 44x 44x 55x 24x 21x 25x 21x 21x 21x 24x 145x 145x 36x 1x 1x | /*
* Paper.js - The Swiss Army Knife of Vector Graphics Scripting.
* http://paperjs.org/
*
* Copyright (c) 2011 - 2020, Jürg Lehni & Jonathan Puckey
* http://juerglehni.com/ & https://puckey.studio/
*
* Distributed under the MIT license. See LICENSE file for details.
*
* All rights reserved.
*/
// TODO: remove eslint-disable comment and deal with errors over time
/* eslint-disable */
import { Base } from '~/straps';
import { Item } from '~/item/Item';
import { CollisionDetection } from '~/util/CollisionDetection';
import { Numerical } from '~/util/Numerical';
import { Curve } from './Curve';
import { CurveLocation } from './CurveLocation';
import { Path } from './Path';
import { PathItem } from './PathItem';
import { Segment } from './Segment';
import { CompoundPath } from './CompoundPath';
/*
* Boolean Geometric Path Operations
*
* Supported
* - Path and CompoundPath items
* - Boolean Union
* - Boolean Intersection
* - Boolean Subtraction
* - Boolean Exclusion
* - Resolving a self-intersecting Path items
* - Boolean operations on self-intersecting Paths items
*
* @author Harikrishnan Gopalakrishnan <hari.exeption@gmail.com>
* @author Jan Boesenberg <jan.boesenberg@gmail.com>
* @author Jürg Lehni <juerg@scratchdisk.com>
*/
PathItem.inject(
// @ts-expect-error = Only a void function can be called with the 'new' keyword
new (function () {
var min = Math.min,
max = Math.max,
abs = Math.abs,
// Set up lookup tables for each operator, to decide if a given segment
// is to be considered a part of the solution, or to be discarded, based
// on its winding contribution, as calculated by propagateWinding().
// Boolean operators return true if a segment with the given winding
// contribution contributes to the final result or not. They are applied
// to for each segment after the paths are split at crossings.
operators = {
unite: { '1': true, '2': true },
intersect: { '2': true },
subtract: { '1': true },
// exclude only needs -1 to support reorientPaths() when there are
// no crossings. The actual boolean code uses unsigned winding.
exclude: { '1': true, '-1': true },
};
function getPaths(path) {
return path._children || [path];
}
/*
* Creates a clone of the path that we can modify freely, with its matrix
* applied to its geometry. Calls #reduce() to simplify compound paths and
* remove empty curves, #resolveCrossings() to resolve self-intersection
* make sure all paths have correct winding direction.
*/
function preparePath(path, resolve) {
var res = path.clone(false).reduce({ simplify: true }).transform(null, true, true);
if (resolve) {
// For correct results, close open paths with straight lines:
var paths = getPaths(res);
for (var i = 0, l = paths.length; i < l; i++) {
var path = paths[i];
if (!path._closed && !path.isEmpty()) {
// Close with epsilon tolerance, to avoid tiny straight
// that would cause issues with intersection detection.
path.closePath(/*#=*/ Numerical.EPSILON);
path.getFirstSegment().setHandleIn(0, 0);
path.getLastSegment().setHandleOut(0, 0);
}
}
res = res.resolveCrossings().reorient(res.getFillRule() === 'nonzero', true);
}
return res;
}
function createResult(paths, simplify, path1, path2, options) {
var result = new CompoundPath(Item.NO_INSERT);
result.addChildren(paths, true);
// See if the item can be reduced to just a simple Path.
result = result.reduce({ simplify: simplify });
if (!(options && options.insert == false)) {
// Insert the resulting path above whichever of the two paths appear
// further up in the stack.
result.insertAbove(path2 && path1.isSibling(path2) && path1.getIndex() < path2.getIndex() ? path2 : path1);
}
// Copy over the input path attributes, excluding matrix and we're done.
result.copyAttributes(path1, true);
return result;
}
function filterIntersection(inter) {
// TODO: Change isCrossing() to also handle overlaps (hasOverlap())
// that are actually involved in a crossing! For this we need proper
// overlap range detection / merging first... But as we call
// #resolveCrossings() first in boolean operations, removing all
// self-touching areas in paths, this works for the known use cases.
// The ideal implementation would deal with it in a way outlined in:
// https://github.com/paperjs/paper.js/issues/874#issuecomment-168332391
return inter.hasOverlap() || inter.isCrossing();
}
function traceBoolean(path1, path2, operation, options) {
// Only support subtract and intersect operations when computing stroke
// based boolean operations (options.split = true).
if (options && (options.trace == false || options.stroke) && /^(subtract|intersect)$/.test(operation))
return splitBoolean(path1, path2, operation);
// We do not modify the operands themselves, but create copies instead,
// fas produced by the calls to preparePath().
// NOTE: The result paths might not belong to the same type i.e.
// subtract(A:Path, B:Path):CompoundPath etc.
var _path1 = preparePath(path1, true),
_path2 = path2 && path1 !== path2 && preparePath(path2, true),
// Retrieve the operator lookup table for winding numbers.
operator = operators[operation];
// Add a simple boolean property to check for a given operation,
// e.g. `if (operator.unite)`
operator[operation] = true;
// Give both paths the same orientation except for subtraction
// and exclusion, where we need them at opposite orientation.
if (_path2 && (operator.subtract || operator.exclude) ^ (_path2.isClockwise() ^ _path1.isClockwise()))
_path2.reverse();
// Split curves at crossings on both paths. Note that for self-
// intersection, path2 is null and getIntersections() handles it.
// @ts-expect-error = Expected 3 arguments, but got 1.
var crossings = divideLocations(CurveLocation.expand(_path1.getIntersections(_path2, filterIntersection))),
paths1 = getPaths(_path1),
paths2 = _path2 && getPaths(_path2),
segments = [],
curves = [],
paths;
function collectPaths(paths) {
for (var i = 0, l = paths.length; i < l; i++) {
var path = paths[i];
Base.push(segments, path._segments);
Base.push(curves, path.getCurves());
// See if all encountered segments in a path are overlaps, to
// be able to separately handle fully overlapping paths.
path._overlapsOnly = true;
}
}
function getCurves(indices) {
var list = [];
for (var i = 0, l = indices && indices.length; i < l; i++) {
list.push(curves[indices[i]]);
}
return list;
}
if (crossings.length) {
// Collect all segments and curves of both involved operands.
collectPaths(paths1);
if (paths2) collectPaths(paths2);
var curvesValues = new Array(curves.length);
for (var i = 0, l = curves.length; i < l; i++) {
curvesValues[i] = curves[i].getValues();
}
var curveCollisions = CollisionDetection.findCurveBoundsCollisions(curvesValues, curvesValues, 0, true);
var curveCollisionsMap = {};
for (var i = 0; i < curves.length; i++) {
var curve = curves[i],
id = curve._path._id,
map = (curveCollisionsMap[id] = curveCollisionsMap[id] || {});
map[curve.getIndex()] = {
hor: getCurves(curveCollisions[i].hor),
ver: getCurves(curveCollisions[i].ver),
};
}
// Propagate the winding contribution. Winding contribution of
// curves does not change between two crossings.
// First, propagate winding contributions for curve chains starting
// in all crossings:
// @ts-expect-error
for (var i = 0, l = crossings.length; i < l; i++) {
propagateWinding(crossings[i]._segment, _path1, _path2, curveCollisionsMap, operator);
}
for (var i = 0, l = segments.length; i < l; i++) {
var segment = segments[i],
inter = segment._intersection;
if (!segment._winding) {
propagateWinding(segment, _path1, _path2, curveCollisionsMap, operator);
}
// See if all encountered segments in a path are overlaps.
if (!(inter && inter._overlap)) segment._path._overlapsOnly = false;
}
paths = tracePaths(segments, operator);
} else {
// When there are no crossings, the result can be determined through
// a much faster call to reorientPaths():
// @ts-expect-error
paths = reorientPaths(
// Make sure reorientPaths() never works on original
// _children arrays by calling paths1.slice()
paths2 ? paths1.concat(paths2) : paths1.slice(),
function (w) {
return !!operator[w];
}
);
}
return createResult(paths, true, path1, path2, options);
}
function splitBoolean(path1, path2, operation) {
// @ts-expect-error
var _path1 = preparePath(path1),
// @ts-expect-error
_path2 = preparePath(path2),
crossings = _path1.getIntersections(_path2, filterIntersection),
subtract = operation === 'subtract',
divide = operation === 'divide',
added = {},
paths = [];
function addPath(path) {
// Simple see if the point halfway across the open path is inside
// path2, and include / exclude the path based on the operator.
if (
!added[path._id] &&
(divide ||
// @ts-expect-error
_path2.contains(path.getPointAt(path.getLength() / 2)) ^ subtract)
) {
paths.unshift(path);
return (added[path._id] = true);
}
}
// Now loop backwards through all crossings, split the path and check
// the new path that was split off for inclusion.
for (var i = crossings.length - 1; i >= 0; i--) {
var path = crossings[i].split();
if (path) {
// See if we can add the path, and if so, clear the first handle
// at the split, because it might have been a curve.
if (addPath(path)) path.getFirstSegment().setHandleIn(0, 0);
// Clear the other side of the split too, which is always the
// end of the remaining _path1.
_path1.getLastSegment().setHandleOut(0, 0);
}
}
// At the end, add what's left from our path after all the splitting.
addPath(_path1);
// @ts-expect-error
return createResult(paths, false, path1, path2);
}
/*
* Creates linked lists between intersections through their _next and _prev
* properties.
*
* @private
*/
function linkIntersections(from, to) {
// Only create the link if it's not already in the existing chain, to
// avoid endless recursions. First walk to the beginning of the chain,
// and abort if we find `to`.
var prev = from;
while (prev) {
if (prev === to) return;
prev = prev._previous;
}
// Now walk to the end of the existing chain to find an empty spot, but
// stop if we find `to`, to avoid adding it again.
while (from._next && from._next !== to) from = from._next;
// If we're reached the end of the list, we can add it.
if (!from._next) {
// Go back to beginning of the other chain, and link the two up.
while (to._previous) to = to._previous;
from._next = to;
to._previous = from;
}
}
function clearCurveHandles(curves) {
// Clear segment handles if they were part of a curve with no handles.
for (var i = curves.length - 1; i >= 0; i--) curves[i].clearHandles();
}
/**
* Reorients the specified paths.
*
* @param {Item[]} paths the paths of which the orientation needs to be
* reoriented
* @param {Function} isInside determines if the inside of a path is filled.
* For non-zero fill rule this function would be implemented as follows:
*
* function isInside(w) {
* return w != 0;
* }
* @param {Boolean} [clockwise] if provided, the orientation of the root
* paths will be set to the orientation specified by `clockwise`,
* otherwise the orientation of the largest root child is used.
* @return {Item[]} the reoriented paths
*/
function reorientPaths(paths, isInside, clockwise) {
var length = paths && paths.length;
if (length) {
var lookup = Base.each(
paths,
function (path, i) {
// Build a lookup table with information for each path's
// original index and winding contribution.
this[path._id] = {
container: null,
winding: path.isClockwise() ? 1 : -1,
index: i,
};
},
{}
),
// Now sort the paths by their areas, from large to small.
sorted = paths.slice().sort(function (a, b) {
return abs(b.getArea()) - abs(a.getArea());
}),
// Get reference to the first, largest path and insert it
// already.
first = sorted[0];
// create lookup containing potentially overlapping path bounds
var collisions = CollisionDetection.findItemBoundsCollisions(sorted, null, Numerical.GEOMETRIC_EPSILON);
if (clockwise == null) clockwise = first.isClockwise();
// Now determine the winding for each path, from large to small.
for (var i = 0; i < length; i++) {
var path1 = sorted[i],
entry1 = lookup[path1._id],
containerWinding = 0,
indices = collisions[i];
if (indices) {
var point = null; // interior point, only get it if required.
for (var j = indices.length - 1; j >= 0; j--) {
if (indices[j] < i) {
point = point || path1.getInteriorPoint();
var path2 = sorted[indices[j]];
// As we run through the paths from largest to
// smallest, for any current path, all potentially
// containing paths have already been processed and
// their orientation fixed. To achieve correct
// orientation of contained paths based on winding,
// find one containing path with different
// "insideness" and set opposite orientation.
if (path2.contains(point)) {
var entry2 = lookup[path2._id];
containerWinding = entry2.winding;
entry1.winding += containerWinding;
entry1.container = entry2.exclude ? entry2.container : path2;
break;
}
}
}
}
// Only keep paths if the "insideness" changes when crossing the
// path, e.g. the inside of the path is filled and the outside
// is not, or vice versa.
if (isInside(entry1.winding) === isInside(containerWinding)) {
entry1.exclude = true;
// No need to delete excluded entries. Setting to null is
// enough, as #setChildren() can handle arrays with gaps.
paths[entry1.index] = null;
} else {
// If the containing path is not excluded, we're done
// searching for the orientation defining path.
var container = entry1.container;
path1.setClockwise(container ? !container.isClockwise() : clockwise);
}
}
}
return paths;
}
/**
* Divides the path-items at the given locations.
*
* @param {CurveLocation[]} locations an array of the locations to split the
* path-item at.
* @param {Function} [include] a function that determines if dividing should
* happen at a given location.
* @return {CurveLocation[]} the locations at which the involved path-items
* were divided
* @private
*/
function divideLocations(locations, include, clearLater) {
var results = include && [],
tMin = /*#=*/ Numerical.CURVETIME_EPSILON,
tMax = 1 - tMin,
clearHandles = false,
clearCurves = clearLater || [],
clearLookup = clearLater && {},
renormalizeLocs,
prevCurve,
prevTime;
// When dealing with overlaps and crossings, divideLocations() is called
// twice. If curve handles of curves that originally didn't have handles
// are cleared after the first call , we loose curve-time consistency
// and CurveLocation#_time values become invalid.
// In those situations, clearLater is passed as a container for all
// curves of which the handles need to be cleared in the end.
// Create a lookup table that allows us to quickly determine if a given
// curve was resulting from an original curve without handles.
function getId(curve) {
return curve._path._id + '.' + curve._segment1._index;
}
for (var i = (clearLater && clearLater.length) - 1; i >= 0; i--) {
var curve = clearLater[i];
if (curve._path) clearLookup[getId(curve)] = true;
}
// Loop backwards through all sorted locations, from right to left, so
// we can assume a predefined sequence for curve-time renormalization.
for (var i = locations.length - 1; i >= 0; i--) {
var loc = locations[i],
// Retrieve curve-time before calling include(), because it may
// be changed to the scaled value after splitting previously.
// See CurveLocation#getCurve(), #resolveCrossings()
time = loc._time,
origTime = time,
exclude = include && !include(loc),
// Retrieve curve after calling include(), because it may cause
// a change in the cached location values, see above.
curve = loc._curve,
segment;
if (curve) {
if (curve !== prevCurve) {
// This is a new curve, update clearHandles setting.
clearHandles = !curve.hasHandles() || (clearLookup && clearLookup[getId(curve)]);
// Keep track of locations for later curve-time
// renormalization within the curve.
renormalizeLocs = [];
prevTime = null;
prevCurve = curve;
} else if (prevTime >= tMin) {
// Rescale curve-time when we are splitting the same curve
// multiple times, if splitting was done previously.
time /= prevTime;
}
}
if (exclude) {
// Store excluded locations for later renormalization, in case
// the same curve is divided to their left.
if (renormalizeLocs) renormalizeLocs.push(loc);
continue;
} else if (include) {
results.unshift(loc);
}
prevTime = origTime;
if (time < tMin) {
segment = curve._segment1;
} else if (time > tMax) {
segment = curve._segment2;
} else {
// Split the curve at time, passing true for _setHandles to
// always set the handles on the sub-curves even if the original
// curve had no handles.
var newCurve = curve.divideAtTime(time, true);
// Keep track of curves without handles, so they can be cleared
// again at the end.
if (clearHandles) clearCurves.push(curve, newCurve);
segment = newCurve._segment1;
// Handle locations that need their curve-time renormalized
// within the same curve after dividing at this location.
for (var j = renormalizeLocs.length - 1; j >= 0; j--) {
var l = renormalizeLocs[j];
l._time = (l._time - time) / (1 - time);
}
}
loc._setSegment(segment);
// Create links from the new segment to the intersection on the
// other curve, as well as from there back. If there are multiple
// intersections on the same segment, we create linked lists between
// the intersections through linkIntersections(), linking both ways.
var inter = segment._intersection,
dest = loc._intersection;
if (inter) {
linkIntersections(inter, dest);
// Each time we add a new link to the linked list, we need to
// add links from all the other entries to the new entry.
var other = inter;
while (other) {
linkIntersections(other._intersection, inter);
other = other._next;
}
} else {
segment._intersection = dest;
}
}
// Clear curve handles right away if we're not storing them for later.
if (!clearLater) clearCurveHandles(clearCurves);
return results || locations;
}
/**
* Returns the winding contribution number of the given point in respect
* to the shapes described by the passed curves.
*
* See #1073#issuecomment-226942348 and #1073#issuecomment-226946965 for a
* detailed description of the approach developed by @iconexperience to
* precisely determine the winding contribution in all known edge cases.
*
* @param {Point} point the location for which to determine the winding
* contribution
* @param {Curve[]} curves The curves that describe the shape against which
* to check, as returned by {@link Path#curves} or
* {@link CompoundPath#curves}.
* @param {Boolean} [dir=false] the direction in which to determine the
* winding contribution, `false`: in x-direction, `true`: in y-direction
* @param {Boolean} [closed=false] determines how areas should be closed
* when a curve is part of an open path, `false`: area is closed with a
* straight line, `true`: area is closed taking the handles of the first
* and last segment into account
* @param {Boolean} [dontFlip=false] controls whether the algorithm is
* allowed to flip direction if it is deemed to produce better results
* @return {Object} an object containing the calculated winding number, as
* well as an indication whether the point was situated on the contour
* @private
*/
function getWinding(point, curves, dir, closed, dontFlip) {
// `curves` can either be an array of curves, or an object containing of
// the form `{ hor: [], ver: [] }` (see `curveCollisionsMap`), with each
// key / value pair holding only those curves that can be crossed by a
// horizontal / vertical line through the point to be checked.
var curvesList = Array.isArray(curves) ? curves : curves[dir ? 'hor' : 'ver'];
// Determine the index of the abscissa and ordinate values in the curve
// values arrays, based on the direction:
var ia = dir ? 1 : 0, // the abscissa index
io = ia ^ 1, // the ordinate index
pv = [point.x, point.y],
pa = pv[ia], // the point's abscissa
po = pv[io], // the point's ordinate
// Use separate epsilons for winding contribution code.
windingEpsilon = 1e-9,
qualityEpsilon = 1e-6,
paL = pa - windingEpsilon,
paR = pa + windingEpsilon,
windingL = 0,
windingR = 0,
pathWindingL = 0,
pathWindingR = 0,
onPath = false,
onAnyPath = false,
quality = 1,
roots = [],
vPrev,
vClose;
function addWinding(v) {
var o0 = v[io + 0],
o3 = v[io + 6];
if (po < min(o0, o3) || po > max(o0, o3)) {
// If the curve is outside the ordinates' range, no intersection
// with the ray is possible.
return;
}
var a0 = v[ia + 0],
a1 = v[ia + 2],
a2 = v[ia + 4],
a3 = v[ia + 6];
if (o0 === o3) {
// A horizontal curve is not necessarily between two non-
// horizontal curves. We have to take cases like these into
// account:
// +-----+
// +----+ |
// +-----+
if ((a0 < paR && a3 > paL) || (a3 < paR && a0 > paL)) {
onPath = true;
}
// If curve does not change in ordinate direction, windings will
// be added by adjacent curves.
// Bail out without updating vPrev at the end of the call.
return;
}
// Determine the curve-time value corresponding to the point.
var t =
po === o0
? 0
: po === o3
? 1
: // If the abscissa is outside the curve, we can use any
// value except 0 (requires special handling). Use 1, as it
// does not require additional calculations for the point.
paL > max(a0, a1, a2, a3) || paR < min(a0, a1, a2, a3)
? 1
: Curve.solveCubic(v, io, po, roots, 0, 1) > 0
? roots[0]
: 1,
a = t === 0 ? a0 : t === 1 ? a3 : Curve.getPoint(v, t)[dir ? 'y' : 'x'],
winding = o0 > o3 ? 1 : -1,
windingPrev = vPrev[io] > vPrev[io + 6] ? 1 : -1,
a3Prev = vPrev[ia + 6];
if (po !== o0) {
// Standard case, curve is not crossed at its starting point.
if (a < paL) {
pathWindingL += winding;
} else if (a > paR) {
pathWindingR += winding;
} else {
onPath = true;
}
// Determine the quality of the winding calculation. Reduce the
// quality with every crossing of the ray very close to the
// path. This means that if the point is on or near multiple
// curves, the quality becomes less than 0.5.
if (a > pa - qualityEpsilon && a < pa + qualityEpsilon) quality /= 2;
} else {
// Curve is crossed at starting point.
if (winding !== windingPrev) {
// Winding changes from previous curve, cancel its winding.
if (a0 < paL) {
pathWindingL += winding;
} else if (a0 > paR) {
pathWindingR += winding;
}
} else if (a0 != a3Prev) {
// Handle a horizontal curve between the current and
// previous non-horizontal curve. See
// #1261#issuecomment-282726147 for a detailed explanation:
if (a3Prev < paR && a > paR) {
// Right winding was not added before, so add it now.
pathWindingR += winding;
onPath = true;
} else if (a3Prev > paL && a < paL) {
// Left winding was not added before, so add it now.
pathWindingL += winding;
onPath = true;
}
}
quality /= 4;
}
vPrev = v;
// If we're on the curve, look at the tangent to decide whether to
// flip direction to better determine a reliable winding number:
// If the tangent is parallel to the direction, call getWinding()
// again with flipped direction and return that result instead.
return (
!dontFlip &&
a > paL &&
a < paR &&
Curve.getTangent(v, t)[dir ? 'x' : 'y'] === 0 &&
getWinding(point, curves, !dir, closed, true)
);
}
function handleCurve(v) {
// Get the ordinates:
var o0 = v[io + 0],
o1 = v[io + 2],
o2 = v[io + 4],
o3 = v[io + 6];
// Only handle curves that can cross the point's ordinate.
if (po <= max(o0, o1, o2, o3) && po >= min(o0, o1, o2, o3)) {
// Get the abscissas:
var a0 = v[ia + 0],
a1 = v[ia + 2],
a2 = v[ia + 4],
a3 = v[ia + 6],
// Get monotone curves. If the curve is outside the point's
// abscissa, it can be treated as a monotone curve:
monoCurves = paL > max(a0, a1, a2, a3) || paR < min(a0, a1, a2, a3) ? [v] : Curve.getMonoCurves(v, dir),
res;
for (var i = 0, l = monoCurves.length; i < l; i++) {
// Calling addWinding() my lead to direction flipping, in
// which case we already have the result and can return it.
if ((res = addWinding(monoCurves[i]))) return res;
}
}
}
for (var i = 0, l = curvesList.length; i < l; i++) {
var curve = curvesList[i],
path = curve._path,
v = curve.getValues(),
res;
if (!i || curvesList[i - 1]._path !== path) {
// We're on a new (sub-)path, so we need to determine values of
// the last non-horizontal curve on this path.
vPrev = null;
// If the path is not closed, connect the first and last segment
// based on the value of `closed`:
// - `false`: Connect with a straight curve, just like how
// filling open paths works.
// - `true`: Connect with a curve that takes the segment handles
// into account, just like how closed paths behave.
if (!path._closed) {
vClose = Curve.getValues(path.getLastCurve().getSegment2(), curve.getSegment1(), null, !closed);
// This closing curve is a potential candidate for the last
// non-horizontal curve.
if (vClose[io] !== vClose[io + 6]) {
vPrev = vClose;
}
}
if (!vPrev) {
// Walk backwards through list of the path's curves until we
// find one that is not horizontal.
// Fall-back to the first curve's values if none is found:
vPrev = v;
var prev = path.getLastCurve();
while (prev && prev !== curve) {
var v2 = prev.getValues();
if (v2[io] !== v2[io + 6]) {
vPrev = v2;
break;
}
prev = prev.getPrevious();
}
}
}
// Calling handleCurve() my lead to direction flipping, in which
// case we already have the result and can return it.
if ((res = handleCurve(v))) return res;
if (i + 1 === l || curvesList[i + 1]._path !== path) {
// We're at the last curve of the current (sub-)path. If a
// closing curve was calculated at the beginning of it, handle
// it now to treat the path as closed:
if (vClose && (res = handleCurve(vClose))) return res;
if (onPath && !pathWindingL && !pathWindingR) {
// If the point is on the path and the windings canceled
// each other, we treat the point as if it was inside the
// path. A point inside a path has a winding of [+1,-1]
// for clockwise and [-1,+1] for counter-clockwise paths.
// If the ray is cast in y direction (dir == true), the
// windings always have opposite sign.
pathWindingL = pathWindingR = path.isClockwise(closed) ^ dir ? 1 : -1;
}
windingL += pathWindingL;
windingR += pathWindingR;
pathWindingL = pathWindingR = 0;
if (onPath) {
onAnyPath = true;
onPath = false;
}
vClose = null;
}
}
// Use the unsigned winding contributions when determining which areas
// are part of the boolean result.
windingL = abs(windingL);
windingR = abs(windingR);
// Return the calculated winding contributions along with a quality
// value indicating how reliable the value really is.
return {
winding: max(windingL, windingR),
windingL: windingL,
windingR: windingR,
quality: quality,
onPath: onAnyPath,
};
}
function propagateWinding(segment, path1, path2, curveCollisionsMap, operator) {
// Here we try to determine the most likely winding number contribution
// for the curve-chain starting with this segment. Once we have enough
// confidence in the winding contribution, we can propagate it until the
// next intersection or end of a curve chain.
var chain = [],
start = segment,
totalLength = 0,
winding;
do {
var curve = segment.getCurve();
// We can encounter paths with only one segment, which would not
// have a curve.
if (curve) {
var length = curve.getLength();
chain.push({ segment: segment, curve: curve, length: length });
totalLength += length;
}
segment = segment.getNext();
} while (segment && !segment._intersection && segment !== start);
// Determine winding at three points in the chain. If a winding with
// sufficient quality is found, use it. Otherwise use the winding with
// the best quality.
var offsets = [0.5, 0.25, 0.75],
// @ts-expect-error
winding = { winding: 0, quality: -1 },
// Don't go too close to segments, to avoid special winding cases:
tMin = 1e-3,
tMax = 1 - tMin;
for (var i = 0; i < offsets.length && winding.quality < 0.5; i++) {
// @ts-expect-error
var length = totalLength * offsets[i];
for (var j = 0, l = chain.length; j < l; j++) {
var entry = chain[j],
curveLength = entry.length;
if (length <= curveLength) {
var curve = entry.curve,
path = curve._path,
parent = path._parent,
operand = parent instanceof CompoundPath ? parent : path,
t = Numerical.clamp(curve.getTimeAt(length), tMin, tMax),
pt = curve.getPointAtTime(t),
// Determine the direction in which to check the winding
// from the point (horizontal or vertical), based on the
// curve's direction at that point. If tangent is less
// than 45°, cast the ray vertically, else horizontally.
dir = abs(curve.getTangentAtTime(t).y) < Math.SQRT1_2;
// While subtracting, we need to omit this curve if it is
// contributing to the second operand and is outside the
// first operand.
var wind = null;
if (operator.subtract && path2) {
// Calculate path winding at point depending on operand.
var otherPath = operand === path1 ? path2 : path1,
pathWinding = otherPath._getWinding(pt, dir, true);
// Check if curve should be omitted.
if ((operand === path1 && pathWinding.winding) || (operand === path2 && !pathWinding.winding)) {
// Check if quality is not good enough...
if (pathWinding.quality < 1) {
// ...and if so, skip this point...
continue;
} else {
// ...otherwise, omit this curve.
wind = { winding: 0, quality: 1 };
}
}
}
wind =
wind ||
// @ts-expect-error
getWinding(pt, curveCollisionsMap[path._id][curve.getIndex()], dir, true);
if (wind.quality > winding.quality) winding = wind;
break;
}
length -= curveLength;
}
}
// Now assign the winding to the entire curve chain.
for (var j = chain.length - 1; j >= 0; j--) {
chain[j].segment._winding = winding;
}
}
/**
* Private method to trace closed paths from a list of segments, according
* to a the their winding number contribution and a custom operator.
*
* @param {Segment[]} segments array of segments to trace closed paths
* @param {Function} operator the operator lookup table that receives as key
* the winding number contribution of a curve and returns a boolean
* value indicating whether the curve should be included in result
* @return {Path[]} the traced closed paths
*/
function tracePaths(segments, operator) {
var paths = [],
starts;
function isValid(seg) {
var winding;
return !!(
seg &&
!seg._visited &&
(!operator ||
(operator[(winding = seg._winding || {}).winding] &&
// Unite operations need special handling of segments
// with a winding contribution of two (part of both
// areas), which are only valid if they are part of the
// result's contour, not contained inside another area.
!(
operator.unite &&
winding.winding === 2 &&
// No contour if both windings are non-zero.
winding.windingL &&
winding.windingR
)))
);
}
function isStart(seg) {
if (seg) {
for (var i = 0, l = starts.length; i < l; i++) {
if (seg === starts[i]) return true;
}
}
return false;
}
function visitPath(path) {
var segments = path._segments;
for (var i = 0, l = segments.length; i < l; i++) {
segments[i]._visited = true;
}
}
// If there are multiple possible intersections, find the ones that's
// either connecting back to start or are not visited yet, and will be
// part of the boolean result:
function getCrossingSegments(segment, collectStarts) {
var inter = segment._intersection,
start = inter,
crossings = [];
if (collectStarts) starts = [segment];
function collect(inter, end) {
while (inter && inter !== end) {
var other = inter._segment,
path = other && other._path;
if (path) {
var next = other.getNext() || path.getFirstSegment(),
nextInter = next._intersection;
// See if this segment and the next are not visited yet,
// or are bringing us back to the start, and are both
// valid, meaning they're part of the boolean result.
if (
other !== segment &&
(isStart(other) ||
isStart(next) ||
(next &&
isValid(other) &&
(isValid(next) ||
// If next segment isn't valid, its intersection
// to which we may switch may be, so check that.
(nextInter && isValid(nextInter._segment)))))
) {
crossings.push(other);
}
if (collectStarts) starts.push(other);
}
inter = inter._next;
}
}
if (inter) {
// @ts-expect-error
collect(inter);
// Find the beginning of the linked intersections and loop all
// the way back to start, to collect all valid intersections.
while (inter && inter._previous) inter = inter._previous;
collect(inter, start);
}
return crossings;
}
// Sort segments to give non-ambiguous segments the preference as
// starting points when tracing: prefer segments with no intersections
// over intersections, and process intersections with overlaps last:
segments.sort(function (seg1, seg2) {
var inter1 = seg1._intersection,
inter2 = seg2._intersection,
over1 = !!(inter1 && inter1._overlap),
over2 = !!(inter2 && inter2._overlap),
path1 = seg1._path,
path2 = seg2._path;
// Use bitwise-or to sort cases where only one segment is an overlap
// or intersection separately, and fall back on natural order within
// the path.
// @ts-expect-error
return over1 ^ over2
? over1
? 1
: -1
: // NOTE: inter1 & 2 are objects, convert to boolean first
// as otherwise toString() is called on them.
// @ts-expect-error
!inter1 ^ !inter2
? inter1
? 1
: -1
: // All other segments, also when comparing two overlaps
// or two intersections, are sorted by their order.
// Sort by path id to group segments on the same path.
path1 !== path2
? path1._id - path2._id
: seg1._index - seg2._index;
});
for (var i = 0, l = segments.length; i < l; i++) {
var seg = segments[i],
valid = isValid(seg),
path = null,
finished = false,
closed = true,
branches = [],
branch,
visited,
handleIn;
// If all encountered segments in a path are overlaps, we may have
// two fully overlapping paths that need special handling.
if (valid && seg._path._overlapsOnly) {
// TODO: Don't we also need to check for multiple overlaps?
var path1 = seg._path,
path2 = seg._intersection._segment._path;
if (path1.compare(path2)) {
// Only add the path to the result if it has an area.
if (path1.getArea()) paths.push(path1.clone(false));
// Now mark all involved segments as visited.
visitPath(path1);
visitPath(path2);
valid = false;
}
}
// Do not start with invalid segments (segments that were already
// visited, or that are not going to be part of the result).
while (valid) {
// For each segment we encounter, see if there are multiple
// crossings, and if so, pick the best one:
var first = !path,
crossings = getCrossingSegments(seg, first),
// Get the other segment of the first found crossing.
other = crossings.shift(),
finished = !first && (isStart(seg) || isStart(other)),
cross = !finished && other;
if (first) {
path = new Path(Item.NO_INSERT);
// Clear branch to start a new one with each new path.
branch = null;
}
if (finished) {
// If we end up on the first or last segment of an operand,
// copy over its closed state, to support mixed open/closed
// scenarios as described in #1036
if (seg.isFirst() || seg.isLast()) closed = seg._path._closed;
seg._visited = true;
break;
}
if (cross && branch) {
// If we're about to cross, start a new branch and add the
// current one to the list of branches.
branches.push(branch);
branch = null;
}
if (!branch) {
// Add the branch's root segment as the last segment to try,
// to see if we get to a solution without crossing.
if (cross) crossings.push(seg);
branch = {
start: path._segments.length,
crossings: crossings,
visited: (visited = []),
handleIn: handleIn,
};
}
if (cross) seg = other;
// If an invalid segment is encountered, go back to the last
// crossing and try other possible crossings, as well as not
// crossing at the branch's root.
if (!isValid(seg)) {
// Remove the already added segments, and mark them as not
// visited so they become available again as options.
path.removeSegments(branch.start);
for (var j = 0, k = visited.length; j < k; j++) {
visited[j]._visited = false;
}
visited.length = 0;
// Go back to the branch's root segment where the crossing
// happened, and try other crossings. Note that this also
// tests the root segment without crossing as it is added to
// the list of crossings when the branch is created above.
do {
seg = branch && branch.crossings.shift();
if (!seg || !seg._path) {
seg = null;
// If there are no segments left, try previous
// branches until we find one that works.
branch = branches.pop();
if (branch) {
visited = branch.visited;
handleIn = branch.handleIn;
}
}
} while (branch && !isValid(seg));
if (!seg) break;
}
// Add the segment to the path, and mark it as visited.
// But first we need to look ahead. If we encounter the end of
// an open path, we need to treat it the same way as the fill of
// an open path would: Connecting the last and first segment
// with a straight line, ignoring the handles.
var next = seg.getNext();
path.add(new Segment(seg._point, handleIn, next && seg._handleOut));
seg._visited = true;
visited.push(seg);
// If this is the end of an open path, go back to its first
// segment but ignore its handleIn (see above for handleOut).
seg = next || seg._path.getFirstSegment();
handleIn = next && next._handleIn;
}
if (finished) {
if (closed) {
// Carry over the last handleIn to the first segment.
path.getFirstSegment().setHandleIn(handleIn);
path.setClosed(closed);
}
// Only add finished paths that cover an area to the result.
if (path.getArea() !== 0) {
paths.push(path);
}
}
}
return paths;
}
return /** @lends PathItem# */ {
/**
* Returns the winding contribution number of the given point in respect
* to this PathItem.
*
* @param {Point} point the location for which to determine the winding
* contribution
* @param {Number} [dir=0] the direction in which to determine the
* winding contribution, `0`: in x-direction, `1`: in y-direction
* @return {Object} an object containing the calculated winding number, as
* well as an indication whether the point was situated on the contour
*/
_getWinding: function (point, dir, closed) {
// @ts-expect-error
return getWinding(point, this.getCurves(), dir, closed);
},
/**
* {@grouptitle Boolean Path Operations}
*
* Unites the geometry of the specified path with this path's geometry
* and returns the result as a new path item.
*
* @option [options.insert=true] {Boolean} whether the resulting item
* should be inserted back into the scene graph, above both paths
* involved in the operation
*
* @param {PathItem} path the path to unite with
* @param {Object} [options] the boolean operation options
* @return {PathItem} the resulting path item
*/
unite: function (path, options) {
return traceBoolean(this, path, 'unite', options);
},
/**
* Intersects the geometry of the specified path with this path's
* geometry and returns the result as a new path item.
*
* @option [options.insert=true] {Boolean} whether the resulting item
* should be inserted back into the scene graph, above both paths
* involved in the operation
* @option [options.trace=true] {Boolean} whether the tracing method is
* used, treating both paths as areas when determining which parts
* of the paths are to be kept in the result, or whether the first
* path is only to be split at intersections, keeping the parts of
* the curves that intersect with the area of the second path.
*
* @param {PathItem} path the path to intersect with
* @param {Object} [options] the boolean operation options
* @return {PathItem} the resulting path item
*/
intersect: function (path, options) {
return traceBoolean(this, path, 'intersect', options);
},
/**
* Subtracts the geometry of the specified path from this path's
* geometry and returns the result as a new path item.
*
* @option [options.insert=true] {Boolean} whether the resulting item
* should be inserted back into the scene graph, above both paths
* involved in the operation
* @option [options.trace=true] {Boolean} whether the tracing method is
* used, treating both paths as areas when determining which parts
* of the paths are to be kept in the result, or whether the first
* path is only to be split at intersections, removing the parts of
* the curves that intersect with the area of the second path.
*
* @param {PathItem} path the path to subtract
* @param {Object} [options] the boolean operation options
* @return {PathItem} the resulting path item
*/
subtract: function (path, options) {
return traceBoolean(this, path, 'subtract', options);
},
/**
* Excludes the intersection of the geometry of the specified path with
* this path's geometry and returns the result as a new path item.
*
* @option [options.insert=true] {Boolean} whether the resulting item
* should be inserted back into the scene graph, above both paths
* involved in the operation
*
* @param {PathItem} path the path to exclude the intersection of
* @param {Object} [options] the boolean operation options
* @return {PathItem} the resulting path item
*/
exclude: function (path, options) {
return traceBoolean(this, path, 'exclude', options);
},
/**
* Splits the geometry of this path along the geometry of the specified
* path returns the result as a new group item. This is equivalent to
* calling {@link #subtract(path)} and {@link #intersect(path)} and
* putting the results into a new group.
*
* @option [options.insert=true] {Boolean} whether the resulting item
* should be inserted back into the scene graph, above both paths
* involved in the operation
* @option [options.trace=true] {Boolean} whether the tracing method is
* used, treating both paths as areas when determining which parts
* of the paths are to be kept in the result, or whether the first
* path is only to be split at intersections.
*
* @param {PathItem} path the path to divide by
* @param {Object} [options] the boolean operation options
* @return {PathItem} the resulting path item
*/
divide: function (path, options) {
return options && (options.trace == false || options.stroke)
? splitBoolean(this, path, 'divide')
: createResult([this.subtract(path, options), this.intersect(path, options)], true, this, path, options);
},
/*
* Resolves all crossings of a path item by splitting the path or
* compound-path in each self-intersection and tracing the result.
* If possible, the existing path / compound-path is modified if the
* amount of resulting paths allows so, otherwise a new path /
* compound-path is created, replacing the current one.
*
* @return {PathItem} the resulting path item
*/
resolveCrossings: function () {
var children = this._children,
// Support both path and compound-path items
paths = children || [this];
function hasOverlap(seg, path) {
var inter = seg && seg._intersection;
return inter && inter._overlap && inter._path === path;
}
// First collect all overlaps and crossings while taking note of the
// existence of both.
var hasOverlaps = false,
hasCrossings = false,
intersections = this.getIntersections(null, function (inter) {
return (inter.hasOverlap() && (hasOverlaps = true)) || (inter.isCrossing() && (hasCrossings = true));
}),
// We only need to keep track of curves that need clearing
// outside of divideLocations() if two calls are necessary.
clearCurves = hasOverlaps && hasCrossings && [];
intersections = CurveLocation.expand(intersections);
if (hasOverlaps) {
// First divide in all overlaps, and then remove the inside of
// the resulting overlap ranges.
var overlaps = divideLocations(
intersections,
function (inter) {
return inter.hasOverlap();
},
clearCurves
);
for (var i = overlaps.length - 1; i >= 0; i--) {
var overlap = overlaps[i],
path = overlap._path,
seg = overlap._segment,
prev = seg.getPrevious(),
next = seg.getNext();
if (hasOverlap(prev, path) && hasOverlap(next, path)) {
seg.remove();
prev._handleOut._set(0, 0);
next._handleIn._set(0, 0);
// If the curve that is left has no length, remove it
// altogether. Check for paths with only one segment
// before removal, since `prev.getCurve() == null`.
if (prev !== seg && !prev.getCurve().hasLength()) {
// Transfer handleIn when removing segment:
next._handleIn.set(prev._handleIn);
prev.remove();
}
}
}
}
if (hasCrossings) {
// Divide any remaining intersections that are still part of
// valid paths after the removal of overlaps.
divideLocations(
intersections,
hasOverlaps &&
function (inter) {
// Check both involved curves to see if they're still valid,
// meaning they are still part of their paths.
var curve1 = inter.getCurve(),
seg1 = inter.getSegment(),
// Do not call getCurve() and getSegment() on the other
// intersection yet, as it too is in the intersections
// array and will be divided later. But check if its
// current curve is valid, as required by some rare edge
// cases, related to intersections on the same curve.
other = inter._intersection,
curve2 = other._curve,
seg2 = other._segment;
if (curve1 && curve2 && curve1._path && curve2._path) return true;
// Remove all intersections that were involved in the
// handling of overlaps, to not confuse tracePaths().
if (seg1) seg1._intersection = null;
if (seg2) seg2._intersection = null;
},
clearCurves
);
if (clearCurves) clearCurveHandles(clearCurves);
// Finally resolve self-intersections through tracePaths()
// @ts-expect-error
paths = tracePaths(
Base.each(
paths,
function (path) {
Base.push(this, path._segments);
},
[]
)
);
}
// Determine how to return the paths: First try to recycle the
// current path / compound-path, if the amount of paths does not
// require a conversion.
var length = paths.length,
item;
if (length > 1 && children) {
if (paths !== children) this.setChildren(paths);
item = this;
} else if (length === 1 && !children) {
if (paths[0] !== this) this.setSegments(paths[0].removeSegments());
item = this;
}
// Otherwise create a new compound-path and see if we can reduce it,
// and attempt to replace this item with it.
if (!item) {
item = new CompoundPath(Item.NO_INSERT);
item.addChildren(paths);
item = item.reduce();
item.copyAttributes(this);
this.replaceWith(item);
}
return item;
},
/**
* Fixes the orientation of the sub-paths of a compound-path, assuming
* that non of its sub-paths intersect, by reorienting them so that they
* are of different winding direction than their containing paths,
* except for disjoint sub-paths, i.e. islands, which are oriented so
* that they have the same winding direction as the the biggest path.
*
* @param {Boolean} [nonZero=false] controls if the non-zero fill-rule
* is to be applied, by counting the winding of each nested path and
* discarding sub-paths that do not contribute to the final result
* @param {Boolean} [clockwise] if provided, the orientation of the root
* paths will be set to the orientation specified by `clockwise`,
* otherwise the orientation of the largest root child is used.
* @return {PathItem} a reference to the item itself, reoriented
*/
reorient: function (nonZero, clockwise) {
var children = this._children;
if (children && children.length) {
this.setChildren(
reorientPaths(
this.removeChildren(),
function (w) {
// Handle both even-odd and non-zero rule.
return !!(nonZero ? w : w & 1);
},
clockwise
)
);
} else if (clockwise !== undefined) {
this.setClockwise(clockwise);
}
return this;
},
/**
* Returns a point that is guaranteed to be inside the path.
*
* @bean
* @type Point
*/
getInteriorPoint: function () {
var bounds = this.getBounds(),
point = bounds.getCenter(true);
if (!this.contains(point)) {
// Since there is no guarantee that a poly-bezier path contains
// the center of its bounding rectangle, we shoot a ray in x
// direction and select a point between the first consecutive
// intersections of the ray on the left.
var curves = this.getCurves(),
y = point.y,
intercepts = [],
roots = [];
// Process all y-monotone curves that intersect the ray at y:
for (var i = 0, l = curves.length; i < l; i++) {
var v = curves[i].getValues(),
o0 = v[1],
o1 = v[3],
o2 = v[5],
o3 = v[7];
if (y >= min(o0, o1, o2, o3) && y <= max(o0, o1, o2, o3)) {
var monoCurves = Curve.getMonoCurves(v);
for (var j = 0, m = monoCurves.length; j < m; j++) {
var mv = monoCurves[j],
mo0 = mv[1],
mo3 = mv[7];
// Only handle curves that are not horizontal and
// that can cross the point's ordinate.
if (mo0 !== mo3 && ((y >= mo0 && y <= mo3) || (y >= mo3 && y <= mo0))) {
var x =
y === mo0
? mv[0]
: y === mo3
? mv[6]
: Curve.solveCubic(mv, 1, y, roots, 0, 1) === 1
? Curve.getPoint(mv, roots[0]).x
: (mv[0] + mv[6]) / 2;
intercepts.push(x);
}
}
}
}
if (intercepts.length > 1) {
intercepts.sort(function (a, b) {
return a - b;
});
point.x = (intercepts[0] + intercepts[1]) / 2;
}
}
return point;
},
};
})()
);
|