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 | 26x 26x 3969x 8325x 3969x 588x 3969x 1066x 3969x 3969x 3969x 3969x 26x 2x 26x 2610x 2x 2608x 2608x 1672x 1672x 2608x 2608x 2608x 26x 6x 2x 4x 4x 3x 3x 4x 4x 4x 26x 11x 2x 26x 558x 1427x 26x 2x 3x 26x 550x 550x 2x 548x 548x 548x 540x 540x 540x 540x 548x 342x 342x 548x 548x 26x 76x 76x 1x 75x 75x 75x 67x 67x 67x 67x 75x 25x 25x 75x 75x 26x 1005x 808x 197x 26x 5971x 5033x 938x 26x 3x 5x 2x 1x 26x 3x 5x 5x 2x 1x 26x 53x 49x 46x 7x 26x 3x 5x 5x 2x 1x 1274x 7x 564x 564x 563x 428x 428x 428x 26x 225x 225x 225x 225x 26x 697x 697x 697x 26x 3x 3x 3x 26x 26x 10x 10x 10x 26x 136x 136x 136x 26x 39x 39x 39x 39x 26x 29x 29x 29x 29x 26x 10x 10x 10x 10x 26x 15x 15x 15x 15x 26x 16x 16x 16x 16x 26x 3x 3x 3x 3x 26x 25x 25x 25x 25x 26x 5x 5x 5x 5x 26x 4x 4x 4x 4x 26x 5x 5x 5x 5x 26x 4x 4x 4x 4x 26x 1x 1x 1x 1x 26x 25x 25x 25x 25x 26x 2x 2x 2x 2x 26x 3x 3x 3x 3x 26x 1x 1x 1x 1x 26x 7x 7x 7x 7x 26x 8x 8x 8x 8x 26x 26x 1x 1x 1x 1x 26x 26x 46x 85x 26x 59x 12x 12x 1x 19x 26x 750x 2189x 52x 2189x 572x 750x 26x 44x 18x 26x 623x 40x 26x 164x 164x 480x 479x 163x 26x 5x 26x 9x 9x 9x 563x 1138x 381x 26x 5x 5x 9x 3x 6x 2x 26x 18x 18x 33x 15x 18x 3x 26x 4x 4x 3x 2x 1x 2x 26x 2x 2x 3x 2x 1x 26x 78x 78x 78x 603x 239x 364x 254x 110x 11x 99x 78x 21x 3x 18x 18x 78x 239x 239x 239x 239x 239x 105x 239x 11x 228x 228x 228x 228x 228x 254x 254x 254x 11x 11x 11x 11x 11x 3x 3x 3x 18x 18x 18x 18x 18x 18x 309x 525x 393x 265x 105x 140x 140x 140x 140x 140x 136x 136x 136x 136x 136x 239x 26x 26x 5x 11x 4x 7x 7x 7x 1x | import {
Node,
NodeWithChildren,
DocumentNode,
TagNode,
TextNode,
CommentNode,
CDATANode,
ProcessingInstructionNode,
MFragmentNode,
MSlotNode,
MContentNode,
MVarNode,
MScopeNode,
MIfNode,
MForOfNode,
MForInNode,
MElseNode,
MElseIfNode,
MDataNode,
UncompiledStyleNode,
InternalStyleNode,
ExternalStyleNode,
UncompiledScriptNode,
InternalScriptNode,
ExternalScriptNode,
MImportNode,
UncompiledAnchorNode,
CompiledAnchorNode,
MWhitespaceNode
} from './node';
/**
* Detach node and its children from the DOM.
* @param node Node to detach
*/
export function detachNode(node: Node): void {
if (node.parentNode != null) {
node.parentNode.childNodes = node.parentNode.childNodes.filter((childNode: Node) => childNode !== node);
}
if (node.prevSibling != null) {
node.prevSibling.nextSibling = node.nextSibling;
}
if (node.nextSibling != null) {
node.nextSibling.prevSibling = node.prevSibling;
}
node.prevSibling = null;
node.nextSibling = null;
node.parentNode = null;
Object.setPrototypeOf(node.nodeData, null);
}
/**
* Check if one node is the child of another
* @param parent Parent node
* @param child Possible child node
*/
export function hasChild(parent: NodeWithChildren, child: Node): boolean {
return parent.childNodes.includes(child);
}
/**
* Appends one node to another as a child.
* Node will be inserted at the end of the parent's child nodes list.
*
* @param parent Parent node
* @param child New child node
*/
export function appendChild(parent: NodeWithChildren, child: Node): void {
if (DocumentNode.isDocumentNode(child)) {
throw new Error(`Cannot insert a DocumentNode as child`);
}
detachNode(child);
if (parent.lastChild) {
parent.lastChild.nextSibling = child;
child.prevSibling = parent.lastChild;
}
parent.childNodes.push(child);
child.parentNode = parent;
Object.setPrototypeOf(child.nodeData, parent.nodeData);
}
/**
* Appends one node to another as a child.
* Node will be inserted at the start of the parent's child nodes list.
*
* @param parent Parent node
* @param child New child node
*/
export function prependChild(parent: NodeWithChildren, child: Node): void {
if (DocumentNode.isDocumentNode(child)) {
throw new Error(`Cannot insert a DocumentNode as child`);
}
detachNode(child);
if (parent.firstChild) {
parent.firstChild.prevSibling = child;
child.nextSibling = parent.firstChild;
}
parent.childNodes.splice(0, 0, child);
child.parentNode = parent;
Object.setPrototypeOf(child.nodeData, parent.nodeData);
}
/**
* Removes all children from a node
* @param parent Parent to remove nodes from
*/
export function clear(parent: NodeWithChildren): void {
for (const child of Array.from(parent.childNodes)) {
detachNode(child);
}
}
/**
* Appends a list of nodes to a parent
* @param parent Parent node
* @param childNodes New child nodes
*/
export function appendChildNodes(parent: NodeWithChildren, childNodes: Node[]): void {
for (const childNode of childNodes) {
appendChild(parent, childNode);
}
}
/**
* Prepends a list of nodes to a parent
* @param parent Parent node
* @param childNodes New child nodes
*/
export function prependChildNodes(parent: NodeWithChildren, childNodes: Node[]): void {
// iterate in reverse to preserve order
for (let i = childNodes.length - 1; i >= 0; i--) {
prependChild(parent, childNodes[i]);
}
}
/**
* Places a node immediately after another as a sibling.
* @param node Node to insert
* @param after Existing node
* @throws Throws if after is a DocumentNode
*/
export function appendSibling(node: Node, after: Node): void {
Iif (DocumentNode.isDocumentNode(after)) {
throw new Error(`Attempting to append ${ node.nodeType } after DocumentNode`);
}
if (DocumentNode.isDocumentNode(node)) {
throw new Error(`Cannot insert a DocumentNode as child`);
}
detachNode(node);
const parent = after.parentNode;
if (parent != null) {
node.parentNode = parent;
Object.setPrototypeOf(node.nodeData, parent.nodeData);
const afterIndex = parent.childNodes.indexOf(after);
parent.childNodes.splice(afterIndex + 1, 0, node);
}
if (after.nextSibling != null) {
node.nextSibling = after.nextSibling;
after.nextSibling.prevSibling = node;
}
after.nextSibling = node;
node.prevSibling = after;
}
/**
* Places a node immediately before another as a sibling.
* @param node Node to insert
* @param before Existing node
* @throws Throws if after is a DocumentNode
*/
export function prependSibling(node: Node, before: Node): void {
Iif (DocumentNode.isDocumentNode(before)) {
throw new Error(`Attempting to prepend ${ node.nodeType } before DocumentNode`);
}
if (DocumentNode.isDocumentNode(node)) {
throw new Error(`Cannot insert a DocumentNode as child`);
}
detachNode(node);
const parent = before.parentNode;
if (parent != null) {
node.parentNode = parent;
Object.setPrototypeOf(node.nodeData, parent.nodeData);
const beforeIndex = parent.childNodes.indexOf(before);
parent.childNodes.splice(beforeIndex, 0, node);
}
if (before.prevSibling != null) {
node.prevSibling = before.prevSibling;
before.prevSibling.nextSibling = node;
}
before.prevSibling = node;
node.nextSibling = before;
}
/**
* Gets the first child from a list of nodes
* @param nodes Return the first node from a list, or null if the list is empty
*/
export function getFirstNode(nodes: Node[]): Node | null {
if (nodes.length > 0) {
return nodes[0];
} else {
return null;
}
}
/**
* Gets the last child from a list of nodes
* @param nodes Return the last node from a list, or null if the list is empty
*/
export function getLastNode(nodes: Node[]): Node | null {
if (nodes.length > 0) {
return nodes[nodes.length - 1];
} else {
return null;
}
}
/**
* Gets the first child that is a TagNode from a list of nodes
* @param nodes Return the first TagNode from a list, or null if none exist
*/
export function getFirstTag(nodes: Node[]): TagNode | null {
for (const node of nodes) {
if (TagNode.isTagNode(node)) {
return node;
}
}
return null;
}
/**
* Gets the last child that is a TagNode from a list of nodes
* @param nodes Return the last TagNode from a list, or null if none exist
*/
export function getLastTag(nodes: Node[]): TagNode | null {
for (let i = nodes.length - 1; i >= 0; i--) {
const currNode = nodes[i];
if (TagNode.isTagNode(currNode)) {
return currNode;
}
}
return null;
}
/**
* Gets the first child that is a TextNode from a list of nodes
* @param nodes Return the first TextNode from a list, or null if none exist
*/
export function getFirstText(nodes: Node[]): TextNode | null {
for (const node of nodes) {
if (TextNode.isTextNode(node)) {
return node;
}
}
return null;
}
/**
* Gets the last child that is a TextNode from a list of nodes
* @param nodes Return the last TextNode from a list, or null if none exist
*/
export function getLastText(nodes: Node[]): TextNode | null {
for (let i = nodes.length - 1; i >= 0; i--) {
const currNode = nodes[i];
if (TextNode.isTextNode(currNode)) {
return currNode;
}
}
return null;
}
// not exported
function processClonedNode<T extends Node>(oldNode: T, newNode: T, callback?: (oldNode: Node, newNode: Node) => void): void {
if (callback !== undefined) {
callback(oldNode, newNode);
}
}
// not exported
function processClonedParentNode<T extends NodeWithChildren>(oldNode: T, newNode: T, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): void {
processClonedNode(oldNode, newNode, callback);
if (deep) {
cloneChildNodes(newNode, oldNode.childNodes, callback);
}
}
// not exported
function cloneAttributes(node: TagNode): Map<string, unknown> {
const oldAttrs = node.getAttributes();
const attrEntries = oldAttrs.entries();
return new Map(attrEntries);
}
/**
* Clones a tag node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneTagNode(node: TagNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): TagNode {
const newAttrs = cloneAttributes(node);
const newNode: TagNode = new TagNode(node.tagName, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones a text node
* @param node Node to clone
* @param callback Optional callback after node is cloned
*/
export function cloneTextNode(node: TextNode, callback?: (oldNode: Node, newNode: Node) => void): TextNode {
const newNode: TextNode = new TextNode(node.text, node.isWhitespaceSensitive);
processClonedNode(node, newNode, callback);
return newNode;
}
/**
* Clones a comment node
* @param node Node to clone
* @param callback Optional callback after node is cloned
*/
export function cloneCommentNode(node: CommentNode, callback?: (oldNode: Node, newNode: Node) => void): CommentNode {
const newNode: CommentNode = new CommentNode(node.text, node.isWhitespaceSensitive);
processClonedNode(node, newNode, callback);
return newNode;
}
/**
* Clones a CDATA node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneCDATANode(node: CDATANode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): CDATANode {
const newNode: CDATANode = new CDATANode();
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones a processing instruction node
* @param node Node to clone
* @param callback Optional callback after node is cloned
*/
export function cloneProcessingInstructionNode(node: ProcessingInstructionNode, callback?: (oldNode: Node, newNode: Node) => void): ProcessingInstructionNode {
const newNode: ProcessingInstructionNode = new ProcessingInstructionNode(node.name, node.data);
processClonedNode(node, newNode, callback);
return newNode;
}
/**
* Clones a document node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneDocumentNode(node: DocumentNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): DocumentNode {
const newNode: DocumentNode = new DocumentNode();
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an m-fragment node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneMFragmentNode(node: MFragmentNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): MFragmentNode {
const newAttrs = cloneAttributes(node);
const newNode: MFragmentNode = new MFragmentNode(node.src, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an m-slot node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneMSlotNode(node: MSlotNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): MSlotNode {
const newAttrs = cloneAttributes(node);
const newNode: MSlotNode = new MSlotNode(node.slot, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an m-content node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneMContentNode(node: MContentNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): MContentNode {
const newAttrs = cloneAttributes(node);
const newNode: MContentNode = new MContentNode(node.slot, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an m-var node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneMVarNode(node: MVarNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): MVarNode {
const newAttrs = cloneAttributes(node);
const newNode: MVarNode = new MVarNode(newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an m-scope node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneMScopeNode(node: MScopeNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): MScopeNode {
const newAttrs = cloneAttributes(node);
const newNode = new MScopeNode(newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an m-import node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneMImportNode(node: MImportNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): MImportNode {
const newAttrs = cloneAttributes(node);
const newNode = new MImportNode(node.src, node.as, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an m-if node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneMIfNode(node: MIfNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): MIfNode {
const newAttrs = cloneAttributes(node);
const newNode = new MIfNode(node.condition, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an m-else-if node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneMElseIfNode(node: MElseIfNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): MElseIfNode {
const newAttrs = cloneAttributes(node);
const newNode = new MElseIfNode(node.condition, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an m-else node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneMElseNode(node: MElseNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): MElseNode {
const newAttrs = cloneAttributes(node);
const newNode = new MElseNode(newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an MForOf node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneMForOfNode(node: MForOfNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): MForOfNode {
const newAttrs = cloneAttributes(node);
const newNode = new MForOfNode(node.expression, node.varName, node.indexName, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an MForIn node
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneMForInNode(node: MForInNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): MForInNode {
const newAttrs = cloneAttributes(node);
const newNode = new MForInNode(node.expression, node.varName, node.indexName, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an MDataNode
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneMDataNode(node: MDataNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): MDataNode {
const newAttrs = cloneAttributes(node);
const newNode = new MDataNode(node.type, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an UncompiledStyleNode
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneUncompiledStyleNode(node: UncompiledStyleNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): UncompiledStyleNode {
const newAttrs = cloneAttributes(node);
const newNode = new UncompiledStyleNode(node.lang, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an InternalStyleNode
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneInternalStyleNode(node: InternalStyleNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): InternalStyleNode {
const newAttrs = cloneAttributes(node);
const newNode = new InternalStyleNode(node.bind, node.skipFormat, node.lang, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an ExternalStyleNode
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneExternalStyleNode(node: ExternalStyleNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): ExternalStyleNode {
const newAttrs = cloneAttributes(node);
const newNode = new ExternalStyleNode(node.src, node.bind, node.skipFormat, node.lang, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an UncompiledScriptNode
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneUncompiledScriptNode(node: UncompiledScriptNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): UncompiledScriptNode {
const newAttrs = cloneAttributes(node);
const newNode = new UncompiledScriptNode(newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an InternalScriptNode
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneInternalScriptNode(node: InternalScriptNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): InternalScriptNode {
const newAttrs = cloneAttributes(node);
const newNode = new InternalScriptNode(newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an ExternalScriptNode
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneExternalScriptNode(node: ExternalScriptNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): ExternalScriptNode {
const newAttrs = cloneAttributes(node);
const newNode = new ExternalScriptNode(node.src, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an UncompiledAnchorNode
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneUncompiledAnchorNode(node: UncompiledAnchorNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): UncompiledAnchorNode {
const newAttrs = cloneAttributes(node);
const newNode = new UncompiledAnchorNode(newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an CompiledAnchorNode
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneCompiledAnchorNode(node: CompiledAnchorNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): CompiledAnchorNode {
const newAttrs = cloneAttributes(node);
const newNode = new CompiledAnchorNode(node.href, node.resolve, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Clones an cloneMWhitespaceNode
* @param node Node to clone
* @param deep If true, children will be cloned
* @param callback Optional callback after node is cloned
*/
export function cloneMWhitespaceNode(node: MWhitespaceNode, deep: boolean, callback?: (oldNode: Node, newNode: Node) => void): MWhitespaceNode {
const newAttrs = cloneAttributes(node);
const newNode = new MWhitespaceNode(node.mode, newAttrs);
processClonedParentNode(node, newNode, deep, callback);
return newNode;
}
/**
* Finds the first child node that matches a matcher
* @param parent Parent node
* @param matcher Matcher to check nodes
* @param deep If true, child nodes will be recursively searched
*/
export function findChildNode(parent: NodeWithChildren, matcher: (node: Node) => boolean, deep: boolean): Node | null {
for (const childNode of parent.childNodes) {
if (matcher(childNode)) {
return childNode;
}
if (deep && NodeWithChildren.isNodeWithChildren(childNode)) {
const childMatch = findChildNode(childNode, matcher, true);
if (childMatch != null) {
return childMatch;
}
}
}
return null;
}
/**
* Finds all child nodes that match a matcher
* @param parent Parent node
* @param matcher Matcher to check nodes
* @param deep If true, child nodes will be recursively searched
* @param matches Existing list of nodes to append to, if desired
*/
export function findChildNodes(parent: NodeWithChildren, matcher: (node: Node) => boolean, deep: boolean, matches: Node[] = []): Node[] {
for (const childNode of parent.childNodes) {
if (matcher(childNode)) {
matches.push(childNode);
}
if (deep && NodeWithChildren.isNodeWithChildren(childNode)) {
findChildNodes(childNode, matcher, true, matches);
}
}
return matches;
}
/**
* Finds the first child tag that matches a matcher
* @param parent Parent node
* @param matcher Matcher to check tags
* @param deep If true, child tags will be recursively searched
*/
export function findChildTag(parent: NodeWithChildren, matcher: (tag: TagNode) => boolean, deep: boolean): TagNode | null {
const newMatcher = (node: Node): boolean => TagNode.isTagNode(node) && matcher(node);
return findChildNode(parent, newMatcher, deep) as TagNode;
}
/**
* Finds all child tags that match a matcher
* @param parent Parent node
* @param matcher Matcher to check tags
* @param deep If true, child tags will be recursively searched
*/
export function findChildTags(parent: NodeWithChildren, matcher: (tag: TagNode) => boolean, deep: boolean): TagNode[] {
const newMatcher = (node: Node): boolean => TagNode.isTagNode(node) && matcher(node);
return findChildNodes(parent, newMatcher, deep) as TagNode[];
}
/**
* Replace a node in the DOM with one or more replacements.
* Child nodes will be deleted.
*
* @param remove Node to remove
* @param replacements Replacement nodes
*/
export function replaceNode(remove: Node, replacements: Node[]): void {
let prevNode: Node = remove;
for (const newNode of replacements) {
prevNode.appendSibling(newNode);
prevNode = newNode;
}
detachNode(remove);
}
/**
* Gets all child tags from a parent node
* @param parent Parent node
*/
export function getChildTags(parent: NodeWithChildren): TagNode[] {
return parent.childNodes.filter((node: Node) => TagNode.isTagNode(node)) as TagNode[];
}
/**
* Removes all children from a parent node and creates a DocumentNode containing them
*
* @param parent Parent node
*/
export function createDomFromChildren(parent: NodeWithChildren): DocumentNode {
// create dom
const dom: DocumentNode = new DocumentNode();
// transfer children
dom.appendChildren(parent.childNodes);
return dom;
}
// not exported
function cloneChildNodes(parent: NodeWithChildren, childNodes: Node[], callback?: (oldNode: Node, newNode: Node) => void): void {
if (childNodes.length > 0) {
const newChildren = childNodes.map(node => node.clone(true, callback));
appendChildNodes(parent, newChildren);
}
}
/**
* Gets the closest previous sibling that is a TagNode
* @param node Node to search from
*/
export function getPreviousTag(node: Node): TagNode | null {
let currentNode: Node | null = node.prevSibling;
while (currentNode != null) {
if (TagNode.isTagNode(currentNode)) {
return currentNode;
}
currentNode = currentNode.prevSibling;
}
return null;
}
/**
* Gets the closest following sibling that is a TagNode
* @param node Node to search from
*/
export function getNextTag(node: Node): TagNode | null {
let currentNode: Node | null = node.nextSibling;
while (currentNode != null) {
if (TagNode.isTagNode(currentNode)) {
return currentNode;
}
currentNode = currentNode.nextSibling;
}
return null;
}
/**
* Gets the closest previous sibling that is a TextNode
* @param node Node to search from
*/
export function getPreviousText(node: Node): TextNode | null {
let currentNode: Node | null = node.prevSibling;
while (currentNode != null) {
if (TextNode.isTextNode(currentNode)) {
return currentNode;
}
currentNode = currentNode.prevSibling;
}
return null;
}
/**
* Gets the closest following sibling that is a TextNode
* @param node Node to search from
*/
export function getNextText(node: Node): TextNode | null {
let currentNode: Node | null = node.nextSibling;
while (currentNode != null) {
if (TextNode.isTextNode(currentNode)) {
return currentNode;
}
currentNode = currentNode.nextSibling;
}
return null;
}
/**
* Serialize a DOM tree into HTML text.
* Does not apply any formatting or transformations.
*
* @param node Root node
* @returns a string containing serialized HTML.
*/
export function serializeNode(node: Node): string {
const html: string[] = [];
serializeNodeAt(node, html);
return html.join('');
}
function serializeNodeAt(node: Node, html: string[]): void {
if (TagNode.isTagNode(node)) {
serializeTag(node, html);
} else if (TextNode.isTextNode(node)) {
serializeText(node, html);
} else if (CommentNode.isCommentNode(node)) {
serializeComment(node, html);
} else if (DocumentNode.isDocumentNode(node)) {
serializeDocument(node, html);
} else if (CDATANode.isCDATANode(node)) {
serializeCDATA(node, html);
} else Eif (ProcessingInstructionNode.isProcessingInstructionNode(node)) {
serializeProcessingInstruction(node, html);
} else {
throw new Error(`Unknown nodeType: ${ node.nodeType }`);
}
}
function serializeDocument(dom: DocumentNode, html: string[]): void {
serializeChildNodes(dom, html);
}
function serializeTag(tag: TagNode, html: string[]): void {
const rawTagName = tag.tagName.toLowerCase();
const escapedTagName = escapeNonTextContent(rawTagName);
html.push('<');
html.push(escapedTagName);
if (tag.getAttributes().size > 0) {
appendAttributeList(tag.getAttributes(), html);
}
if (isSelfClosingTag(escapedTagName)) {
html.push(' />');
} else {
html.push('>');
serializeChildNodes(tag, html);
html.push('</');
html.push(escapedTagName);
html.push('>');
}
}
function serializeText(text: TextNode, html: string[]): void {
const textContent: string = escapeTextContent(text.text);
Eif (textContent.length > 0) {
html.push(textContent);
}
}
function serializeComment(comment: CommentNode, html: string[]): void {
html.push('<!--');
const textContent: string = escapeTextContent(comment.text);
Eif (textContent.length > 0) {
html.push(textContent);
}
html.push('-->');
}
function serializeCDATA(cdata: CDATANode, html: string[]): void {
html.push('<![CDATA[');
serializeChildNodes(cdata, html);
html.push(']]>');
}
// this implementation is probably not accurate, but its good enough for <!DOCTYPE html>
function serializeProcessingInstruction(pi: ProcessingInstructionNode, html: string[]): void {
Eif (pi.name === '!doctype') {
serializeDoctypePI(pi, html);
} else {
throw new Error(`Unimplemented processing instruction: ${ pi.name }`);
}
}
function serializeDoctypePI(pi: ProcessingInstructionNode, html: string[]): void {
const dataText = escapeNonTextContent(pi.data);
html.push('<');
html.push(dataText);
html.push('>');
}
function serializeChildNodes(parent: NodeWithChildren, html: string[]): void {
for (const childNode of parent.childNodes) {
serializeNodeAt(childNode, html);
}
}
function escapeNonTextContent(textContent: string): string {
return textContent
.replace(/&/g, '&')
.replace(/</g, '<')
.replace(/>/g, '>')
.replace(/"/g, '"');
}
function escapeTextContent(textContent: string): string {
return textContent.replace(/</g, '<');
}
function appendAttributeList(attributeMap: ReadonlyMap<string, unknown>, html: string[]): void {
for (const entry of attributeMap.entries()) {
const key = entry[0];
const value = entry[1];
html.push(' ');
html.push(key);
if (value != null) {
// convert to string, since it could be any type
const rawValue = String(value);
const escapedValue = escapeNonTextContent(rawValue);
html.push('="');
html.push(escapedValue);
html.push('"');
}
}
}
function isSelfClosingTag(tagName: string): boolean {
return selfClosingTags.includes(tagName);
}
// From https://stackoverflow.com/a/34838936/1857993
// contextual self-closing tags are not supported
const selfClosingTags: readonly string[] = [
'area',
'base',
'br',
'col',
'embed',
'hr',
'img',
'input',
'keygen',
'link',
'menuitem',
'meta',
'param',
'source',
'track',
'wbr'
];
/**
* Finds the next node that matches a callback.
* The next node is defined as the first matching child, sibling, or sibling's child node starting from {@link root}.
* This only checks child and sibling nodes, it will not move further up the DOM tree.
* To check only sibling nodes, set node to false.
* @param root Node to search from
* @param matcher Callback to test nodes
* @param deep If true or not specified, then child nodes will be checked
* @return The first matching node, or null if none found.
*/
export function findNextNode(root: Node, matcher: (node: Node) => boolean, deep: boolean): Node | null {
// loop through all siblings at top level
for (let currentNode: Node | null = root; currentNode != null; currentNode = currentNode.nextSibling) {
// if this is not the first node (which can't be the match) then check it
if (currentNode !== root && matcher(currentNode)) {
return currentNode;
}
// if we are deep checking and this is a parent node, then check children
Eif (deep && NodeWithChildren.isNodeWithChildren(currentNode)) {
const childMatch = findChildNode(currentNode, matcher, true);
Iif (childMatch != null) {
return childMatch;
}
}
}
// return null if we didn't match
return null;
} |