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 | 1x 1x 1x 4261x 4260x 2101x 2093x 2087x 6x 1x 8x 8x 2x 2x 6x 6x 8x 1x 8x 8x 8x 1x 2087x 1032x 1032x 1032x 1055x 1053x 1053x 2x 1x 21x 21x 5x 1x 21x 1x 21x 21x 1x 21x 21x 5x 1x 1137x 1137x 1x 2173x 1120x 2173x 2173x 2173x 2163x 1x 2173x 8x 8x 2x 1x 1x 6x 4x 2x 1x 1x 2x 1x 1x 2173x 21x 15x 15x 4x 2x 2x 11x 5x 6x 1x 2173x 4x 4x 1x 3x 2x 2173x 11x 8x 1x 2163x 1x 2163x 2163x 13x 2150x 3127x 1x 1112x 6x 1106x 1x 1105x 1x 1112x 1112x 1112x 1112x 1x 9x 9x 9x 1x 1x 8x 8x 1x 1x 1x 2159x 1060x 1060x 1099x 1099x 1x 13x 13x 13x 13x 13x 1046x 9x 1037x 1037x 1037x 1037x 1037x 3x 3x 3x 3x 1034x 4x 4x 7x 4x 4x 1030x 1007x 23x 3x 20x 7x 7x 7x 7x 13x 1x 1x 1x 12x 2x 2x 2x 2x 10x 10x 10x 28x 3x 3x 3x 25x 10x 3x 3x 3x 3x 7x 7x 7x 7x 7x 1x 7x 7x 7x 1x 7x 7x 7x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 2x 2x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 2x 2x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 4x 2x 2x 2x 2x 2x 2x 2x 2x 100x 100x 52x 2x 1x 2x 2x 2x 10x 10x 108x 2x 1x 25x 25x 25x 8x 6x 6x 2x 25x 1x 23x 23x 2x 1x 1x 21x 21x 2x 21x 21x 23x 8x 8x 8x 8x 8x 8x 15x 3x 3x 3x 15x 1x 6x 1x 4x 2x 2x 2x 2x 6x 1x 51x 24x 1x 1x 23x 1x 1x 27x 1x 1x 27x 1x 1x 27x 27x 27x 15x 15x 4x 4x 4x 4x 1x 1x 11x 4x 2x 2x 7x 4x 1x 1x 3x 1x 1x 1x 2x 1x 1x 27x 27x 14x 14x 2x 1x 1x 12x 1x 1x 27x 26x 51x 1x 25x 25x 25x 25x 26x 26x 26x 2x 2x 24x 20x 1x 1x 19x 16x 3x 3x 4x 4x 2x 2x 17x 1x 3x 3x 3x 3x 1x 3x 3x 3x 3x 1x 1x 1x | /* account for node.js running tests, or a browser / wasm environment */ module = typeof module === 'undefined' ? {} : module; /* module export pattern */ module['exports'] = (function () { /* virtual-dom diffing algorithm, applies patches as detected */ var diff = function (currentObj, newObj, parent) { if (!currentObj && !newObj) return; else if (!currentObj && newObj) create(newObj, parent); else if (!newObj) destroy(currentObj, parent); else { if (currentObj['type'] === newObj['type']) { diffNodes(currentObj, newObj, parent); } else { replace(currentObj, newObj, parent); } } }; // replace everything function var replace = function (c, n, parent) { // step1 : prepare to delete, unmount things callBeforeDestroyedRecursive(c); // ^ this will unmount sub components before we replace the child // and will recursively call hooks on nodes // step2 : create new things, replace old things with new things if (n['type'] === 'vtext') { n['domRef'] = document.createTextNode(n['text']); parent.replaceChild(n['domRef'], c['domRef']); } else { createElement(n, function (ref) { parent.replaceChild(ref, c['domRef']); }); } // step 3: call destroyed hooks, call created hooks callDestroyedRecursive(c); }; // destroy vtext, vnode, vcomp var destroy = function (obj, parent) { // step 1: invoke destroy pre-hooks on vnode and vcomp callBeforeDestroyedRecursive(obj); // step 2: destroy parent.removeChild(obj['domRef']); // step 3: invoke post-hooks for vnode and vcomp callDestroyedRecursive(obj); }; var diffNodes = function (c, n, parent) { // bail out on easy vtext case if (c['type'] === 'vtext') { if (c['text'] !== n['text']) c['domRef'].textContent = n['text']; n['domRef'] = c['domRef']; return; } // check children if ( c['tag'] === n['tag'] && n['key'] === c['key'] && n['data-component-id'] === c['data-component-id'] ) { n['domRef'] = c['domRef']; // dmj: we will diff properties on 'vcomp' as well populate(c, n); } else { // dmj: we replace when things just don't line up during the diff replace(c, n, parent); } }; // ** recursive calls to hooks var callDestroyedRecursive = function (obj) { callDestroyed(obj); for (var i in obj.children) { callDestroyedRecursive(obj.children[i]); } }; var callDestroyed = function (obj) { if (obj['onDestroyed']) obj['onDestroyed'](); }; var callBeforeDestroyed = function (obj) { if (obj['onBeforeDestroyed']) obj['onBeforeDestroyed'](); if (obj['type'] === 'vcomp') obj['unmount'](obj['domRef']); }; var callBeforeDestroyedRecursive = function (obj) { callBeforeDestroyed(obj); for (var i in obj.children) { callBeforeDestroyedRecursive(obj.children[i]); } }; // ** </> recursive calls to hooks var callCreated = function (obj) { if (obj['onCreated']) obj['onCreated'](); if (obj['type'] === 'vcomp') mountComponent(obj); }; var populate = function (c, n) { if (!c) { c = { props: null, css: null, children: [], }; } diffProps(c['props'], n['props'], n['domRef'], n['ns'] === 'svg'); diffCss(c['css'], n['css'], n['domRef']); if (n['type'] === 'vcomp') return; // dmj: don't diff vcomp children diffChildren(c['children'], n['children'], n['domRef']); }; var diffProps = function (cProps, nProps, node, isSvg) { var newProp; /* Is current prop in new prop list? */ for (var c in cProps) { newProp = nProps[c]; /* If current property no longer exists, remove it */ if (newProp === undefined) { /* current key is not in node, remove it from DOM, if SVG, remove attribute */ if (isSvg || !(c in node)) { node.removeAttribute(c, cProps[c]); } else { node[c] = ''; } } else { /* Already on DOM from previous diff, continue */ if (newProp === cProps[c] && c !== 'checked' && c !== 'value') continue; if (isSvg) { if (c === 'href') { node.setAttributeNS( 'http://www.w3.org/1999/xlink', 'href', newProp, ); } else { node.setAttribute(c, newProp); } } else if (c in node && !(c === 'list' || c === 'form')) { node[c] = newProp; } else { node.setAttribute(c, newProp); } } } /* add remaining */ for (var n in nProps) { if (cProps && cProps[n]) continue; newProp = nProps[n]; /* Only add new properties, skip (continue) if they already exist in current property map */ if (isSvg) { if (n === 'href') { node.setAttributeNS('http://www.w3.org/1999/xlink', 'href', newProp); } else { node.setAttribute(n, newProp); } } else if (n in node && !(n === 'list' || n === 'form')) { node[n] = nProps[n]; } else { node.setAttribute(n, newProp); } } }; var diffCss = function (cCss, nCss, node) { var result; /* is current attribute in new attribute list? */ for (var c in cCss) { result = nCss[c]; if (!result) { /* current key is not in node */ node.style[c] = null; } else if (result !== cCss[c]) { node.style[c] = result; } } /* add remaining */ for (var n in nCss) { if (cCss && cCss[n]) continue; node.style[n] = nCss[n]; } }; var hasKeys = function (ns, cs) { return ( ns.length > 0 && cs.length > 0 && ns[0]['key'] != null && cs[0]['key'] != null ); }; var diffChildren = function (cs, ns, parent) { var longest = ns.length > cs.length ? ns.length : cs.length; if (hasKeys(ns, cs)) { syncChildren(cs, ns, parent); } else { for (var i = 0; i < longest; i++) { diff(cs[i], ns[i], parent); } } }; var populateDomRef = function (obj) { if (obj['ns'] === 'svg') { obj['domRef'] = document.createElementNS( 'http://www.w3.org/2000/svg', obj['tag'], ); } else if (obj['ns'] === 'mathml') { obj['domRef'] = document.createElementNS( 'http://www.w3.org/1998/Math/MathML', obj['tag'], ); } else { obj['domRef'] = document.createElement(obj['tag']); } }; // dmj: refactor this, the callback function feels meh var createElement = function (obj, cb) { populateDomRef(obj); cb(obj['domRef']); populate(null, obj); callCreated(obj); }; // mounts vcomp by calling into Haskell side. // unmount is handled with pre-destroy recursive hooks var mountComponent = function (obj) { var componentId = obj['data-component-id'], nodeList = document.querySelectorAll( "[data-component-id='" + componentId + "']", ); // dmj: bail out if duplicate mounting detected if (nodeList.length > 0) { console.error( 'AlreadyMountedException: Component "' + componentId + "' is already mounted", ); return; } // dmj, the component placeholder div[id=name] is already on the dom and vdom // Now we gen the component and append it to the vdom and real dom obj['domRef'].setAttribute('data-component-id', componentId); // ^ we have to set this before 'mount()' is called, since `diff` requires it. obj['mount'](function (component) { // mount() gives us the VTree from the Haskell side, so we just attach it here // to tie the knot (attach to both vdom and real dom). obj.children.push(component); obj['domRef'].appendChild(component['domRef']); }); }; // creates nodes on virtual and dom (vtext, vcomp, vnode) var create = function (obj, parent) { if (obj.type === 'vtext') { obj['domRef'] = document.createTextNode(obj['text']); parent.appendChild(obj['domRef']); } else { createElement(obj, function (ref) { parent.appendChild(ref); }); } }; /* Child reconciliation algorithm, inspired by kivi and Bobril */ var syncChildren = function (os, ns, parent) { var oldFirstIndex = 0, newFirstIndex = 0, oldLastIndex = os.length - 1, newLastIndex = ns.length - 1, nFirst, nLast, oLast, oFirst, tmp, found, node; for (;;) { /* check base case, first > last for both new and old [ ] -- old children empty (fully-swapped) [ ] -- new children empty (fully-swapped) */ if (newFirstIndex > newLastIndex && oldFirstIndex > oldLastIndex) { break; } /* Initialize */ nFirst = ns[newFirstIndex]; nLast = ns[newLastIndex]; oFirst = os[oldFirstIndex]; oLast = os[oldLastIndex]; /* No more old nodes, create and insert all remaining nodes -> [ ] <- old children -> [ a b c ] <- new children */ if (oldFirstIndex > oldLastIndex) { diff(null, nFirst, parent); /* insertBefore's semantics will append a node if the second argument provided is `null` or `undefined`. Otherwise, it will insert node['domRef'] before oLast['domRef']. */ parent.insertBefore(nFirst['domRef'], oFirst ? oFirst['domRef'] : null); os.splice(newFirstIndex, 0, nFirst); newFirstIndex++; } /* No more new nodes, delete all remaining nodes in old list -> [ a b c ] <- old children -> [ ] <- new children */ else if (newFirstIndex > newLastIndex) { tmp = oldLastIndex; while (oldLastIndex >= oldFirstIndex) { parent.removeChild(os[oldLastIndex--]['domRef']); } os.splice(oldFirstIndex, tmp - oldFirstIndex + 1); break; } /* happy path, everything aligns, we continue -> oldFirstIndex -> [ a b c ] <- oldLastIndex -> newFirstIndex -> [ a b c ] <- newLastIndex check if nFirst and oFirst align, if so, check nLast and oLast */ else if (oFirst['key'] === nFirst['key']) { diff(os[oldFirstIndex++], ns[newFirstIndex++], parent); } else if (oLast['key'] === nLast['key']) { diff(os[oldLastIndex--], ns[newLastIndex--], parent); } /* flip-flop case, nodes have been swapped, in some way or another both could have been swapped. -> [ a b c ] <- old children -> [ c b a ] <- new children */ else if ( oFirst['key'] === nLast['key'] && nFirst['key'] === oLast['key'] ) { swapDomRefs(node, oLast['domRef'], oFirst['domRef'], parent); swap(os, oldFirstIndex, oldLastIndex); diff(os[oldFirstIndex++], ns[newFirstIndex++], parent); diff(os[oldLastIndex--], ns[newLastIndex--], parent); } /* Or just one could be swapped (d's align here) This is top left and bottom right match case. We move d to end of list, mutate old vdom to reflect the change We then continue without affecting indexes, hoping to land in a better case -> [ d a b ] <- old children -> [ a b d ] <- new children becomes -> [ a b d ] <- old children -> [ a b d ] <- new children and now we happy path */ else if (oFirst['key'] === nLast['key']) { /* insertAfter */ parent.insertBefore(oFirst['domRef'], oLast['domRef'].nextSibling); /* swap positions in old vdom */ os.splice(oldLastIndex, 0, os.splice(oldFirstIndex, 1)[0]); diff(os[oldLastIndex--], ns[newLastIndex--], parent); } /* This is top right and bottom lefts match case. We move d to end of list, mutate old vdom to reflect the change -> [ b a d ] <- old children -> [ d b a ] <- new children becomes -> [ d b a ] <- old children -> [ d b a ] <- new children and now we happy path */ else if (oLast['key'] === nFirst['key']) { /* insertAfter */ parent.insertBefore(oLast['domRef'], oFirst['domRef']); /* swap positions in old vdom */ os.splice(oldFirstIndex, 0, os.splice(oldLastIndex, 1)[0]); diff(os[oldFirstIndex++], nFirst, parent); newFirstIndex++; } /* The 'you're screwed' case, nothing aligns, pull the ripcord, do something more fancy This can happen when the list is sorted, for example. -> [ a e c ] <- old children -> [ b e d ] <- new children */ else { /* final case, perform linear search to check if new key exists in old map, decide what to do from there */ found = false; tmp = oldFirstIndex; while (tmp <= oldLastIndex) { if (os[tmp]['key'] === nFirst['key']) { found = true; node = os[tmp]; break; } tmp++; } /* If new key was found in old map this means it was moved, hypothetically as below -> [ a e b c ] <- old children -> [ b e a j ] <- new children ^ In the above case 'b' has been moved, so we need to insert 'b' before 'a' in both vDOM and DOM We also increase oldFirstIndex and newFirstIndex. This results in new list below w/ updated index position -> [ b a e c ] <- old children -> [ b e a j ] <- new children ^ */ if (found) { /* Move item to correct position */ os.splice(oldFirstIndex, 0, os.splice(tmp, 1)[0]); /* optionally perform `diff` here */ diff(os[oldFirstIndex++], nFirst, parent); /* Swap DOM references */ parent.insertBefore(node['domRef'], os[oldFirstIndex]['domRef']); /* increment counters */ newFirstIndex++; } /* If new key was *not* found in the old map this means it must now be created, example below -> [ a e d c ] <- old children -> [ b e a j ] <- new children ^ In the above case 'b' does not exist in the old map, so we create a new element and DOM reference. We then insertBefore in both vDOM and DOM. -> [ b a e d c ] <- old children -> [ b e a j ] <- new children ^ */ else { createElement(nFirst, function (ref) { parent.insertBefore(ref, oFirst['domRef']); }); os.splice(oldFirstIndex++, 0, nFirst); newFirstIndex++; oldLastIndex++; } } } }; var swapDomRefs = function (tmp, a, b, p) { tmp = a.nextSibling; p.insertBefore(a, b); p.insertBefore(b, tmp); }; var swap = function (os, l, r) { var k = os[l]; os[l] = os[r]; os[r] = k; }; /* event delegation algorithm */ var delegate = function (mount, events, getVTree, debug) { for (var event in events) { mount.addEventListener( events[event][0], function (e) { listener(e, mount, getVTree, debug); }, events[event][1], ); } }; /* the event listener shared by both delegator and undelegator */ var listener = function (e, mount, getVTree, debug) { getVTree(function (obj) { Eif (e.target) { delegateEvent(e, obj, buildTargetToElement(mount, e.target), [], debug); } }); }; /* event undelegation */ var undelegate = function (mount, events, getVTree, debug) { for (var event in events) { mount.removeEventListener( events[event][0], function (e) { listener(e, mount, getVTree, debug); }, events[event][1], ); } }; /* Finds event in virtual dom via pointer equality Accumulate parent stack as well for propagation up the vtree */ var delegateEvent = function (event, obj, stack, parentStack, debug) { /* base case, not found */ Iif (!stack.length) { if (debug) { console.warn( 'Event "' + event.type + '" did not find an event handler to dispatch on', obj, event, ); } return; } /* stack not length 1, recurse */ else if (stack.length > 1) { parentStack.unshift(obj); for (var o = 0; o < obj.children.length; o++) { Iif (obj['type'] === 'vcomp') continue; Eif (obj.children[o]['domRef'] === stack[1]) { delegateEvent( event, obj.children[o], stack.slice(1), parentStack, debug, ); break; } } } /* stack.length == 1 */ else { var eventObj = obj['events'][event.type]; if (eventObj) { var options = eventObj['options']; Eif (options['preventDefault']) { event.preventDefault(); } eventObj['runEvent'](event); Eif (!options['stopPropagation']) { propagateWhileAble(parentStack, event); } } else E{ /* still propagate to parent handlers even if event not defined */ propagateWhileAble(parentStack, event); } } }; /* Create a stack of ancestors used to index into the virtual DOM */ var buildTargetToElement = function (element, target) { var stack = []; while (element !== target) { stack.unshift(target); target = target.parentNode; } return stack; }; /* Propagate the event up the chain, invoking other event handlers as encountered */ var propagateWhileAble = function (parentStack, event) { for (var i = 0; i < parentStack.length; i++) { Eif (parentStack[i]['events'][event.type]) { var eventObj = parentStack[i]['events'][event.type], options = eventObj['options']; Eif (options['preventDefault']) event.preventDefault(); eventObj['runEvent'](event); Iif (options['stopPropagation']) { event.stopPropagation(); break; } } } }; /* Walks down obj following the path described by `at`, then filters primitive values (string, numbers and booleans). Sort of like JSON.stringify(), but on an Event that is stripped of impure references. */ var eventJSON = function (at, obj) { /* If at is of type [[MisoString]] */ if (typeof at[0] == 'object') { var ret = []; for (var i = 0; i < at.length; i++) { ret.push(eventJSON(at[i], obj)); } return ret; } for (i in at) obj = obj[at[i]]; /* If obj is a list-like object */ var newObj; Iif ( obj instanceof Array || ('length' in obj && obj['localName'] !== 'select') ) { newObj = []; for (i = 0; i < obj.length; i++) { newObj.push(eventJSON([], obj[i])); } return newObj; } /* If obj is a non-list-like object */ newObj = {}; for (i in getAllPropertyNames(obj)) { /* bug in safari, throws TypeError if the following fields are referenced on a checkbox */ /* https://stackoverflow.com/a/25569117/453261 */ /* https://html.spec.whatwg.org/multipage/input.html#do-not-apply */ Iif ( obj['localName'] === 'input' && (i === 'selectionDirection' || i === 'selectionStart' || i === 'selectionEnd') ) { continue; } if ( typeof obj[i] == 'string' || typeof obj[i] == 'number' || typeof obj[i] == 'boolean' ) { newObj[i] = obj[i]; } } return newObj; }; /* get static and dynamic properties */ var getAllPropertyNames = function (obj) { var props = {}, i = 0; do { var names = Object.getOwnPropertyNames(obj); for (i = 0; i < names.length; i++) { props[names[i]] = null; } } while ((obj = Object.getPrototypeOf(obj))); return props; }; /* prerendering / hydration / isomorphic support */ var collapseSiblingTextNodes = function (vs) { var ax = 0, adjusted = vs.length > 0 ? [vs[0]] : []; for (var ix = 1; ix < vs.length; ix++) { if (adjusted[ax]['type'] === 'vtext' && vs[ix]['type'] === 'vtext') { adjusted[ax]['text'] += vs[ix]['text']; continue; } adjusted[++ax] = vs[ix]; } return adjusted; }; var hydrate = function (logLevel, mountPoint, vtree) { var mountChildIdx = 0, node; // If script tags are rendered first in body, skip them. if (!mountPoint) { if (document.body.childNodes.length > 0) { node = document.body.firstChild; } else { node = document.body.appendChild(document.createElement('div')); } } else Iif (mountPoint.childNodes.length === 0) { node = mountPoint.appendChild(document.createElement('div')); } else { while ( mountPoint.childNodes[mountChildIdx] && (mountPoint.childNodes[mountChildIdx].nodeType === 3 || mountPoint.childNodes[mountChildIdx].localName === 'script') ) { mountChildIdx++; } Iif (!mountPoint.childNodes[mountChildIdx]) { node = document.body.appendChild(document.createElement('div')); } else { node = mountPoint.childNodes[mountChildIdx]; } } if (!walk(logLevel, vtree, node)) { Eif (logLevel) { console.warn( 'Could not copy DOM into virtual DOM, falling back to diff', ); } // Remove all children before rebuilding DOM while (node.firstChild) node.removeChild(node.lastChild); vtree['domRef'] = node; populate(null, vtree); return false; } else { if (logLevel) { var result = integrityCheck(true, vtree); Iif (!result) { console.warn('Integrity check completed with errors'); } else { console.info('Successfully prerendered page'); } } } return true; }; var diagnoseError = function (logLevel, vtree, node) { Eif (logLevel) console.warn('VTree differed from node', vtree, node); }; // https://stackoverflow.com/questions/11068240/what-is-the-most-efficient-way-to-parse-a-css-color-in-javascript var parseColor = function (input) { if (input.substr(0, 1) == '#') { var collen = (input.length - 1) / 3; var fact = [17, 1, 0.062272][collen - 1]; return [ Math.round(parseInt(input.substr(1, collen), 16) * fact), Math.round(parseInt(input.substr(1 + collen, collen), 16) * fact), Math.round(parseInt(input.substr(1 + 2 * collen, collen), 16) * fact), ]; } else return input .split('(')[1] .split(')')[0] .split(',') .map((x) => { return +x; }); }; // dmj: Does deep equivalence check, spine and leaves of virtual DOM to DOM. var integrityCheck = function (result, vtree) { // text nodes must be the same if (vtree['type'] == 'vtext') { if (vtree['domRef'].nodeType !== 3) { console.warn('VText domRef not a TEXT_NODE', vtree); result = false; } else if (vtree['text'] !== vtree['domRef'].textContent) { console.warn('VText node content differs', vtree); result = false; } } // if vnode / vcomp, must be the same else { // tags must be identical if (vtree['tag'].toUpperCase() !== vtree['domRef'].tagName) { console.warn( 'Integrity check failed, tags differ', vtree['tag'].toUpperCase(), vtree['domRef'].tagName, ); result = false; } // Child lengths must be identical if ( 'children' in vtree && vtree['children'].length !== vtree['domRef'].childNodes.length ) { console.warn( 'Integrity check failed, children lengths differ', vtree, vtree.children, vtree['domRef'].childNodes, ); result = false; } // properties must be identical var keyLength = Object.keys(vtree['props']).length, key = null; for (var i = 0; i < keyLength; i++) { key = Object.keys(vtree['props'])[i]; if (key === 'href') { var absolute = window.location.origin + '/' + vtree['props'][key], url = vtree['domRef'][key], relative = vtree['props'][key]; if ( absolute !== url && relative !== url && relative + '/' !== url && absolute + '/' !== url ) { console.warn( 'Property ' + key + ' differs', vtree['props'][key], vtree['domRef'][key], ); result = false; } } else if (key === 'height' || key === 'width') { if ( parseFloat(vtree['props'][key]) !== parseFloat(vtree['domRef'][key]) ) { console.warn( 'Property ' + key + ' differs', vtree['props'][key], vtree['domRef'][key], ); result = false; } } else if (key === 'class' || key === 'className') { if (vtree['props'][key] !== vtree['domRef'].className) { console.warn( 'Property class differs', vtree['props'][key], vtree['domRef'].className, ); result = false; } } else if (!vtree['domRef'][key]) { Eif (vtree['props'][key] !== vtree['domRef'].getAttribute(key)) { console.warn( 'Property ' + key + ' differs', vtree['props'][key], vtree['domRef'].getAttribute(key), ); result = false; } } else if (vtree['props'][key] !== vtree['domRef'][key]) { console.warn( 'Property ' + key + ' differs', vtree['props'][key], vtree['domRef'][key], ); result = false; } } // styles must be identical keyLength = Object.keys(vtree['css']).length; for (i = 0; i < keyLength; i++) { key = Object.keys(vtree['css'])[i]; if (key === 'color') { if ( parseColor(vtree['domRef'].style[key]).toString() !== parseColor(vtree['css'][key]).toString() ) { console.warn( 'Style ' + key + ' differs', vtree['css'][key], vtree['domRef'].style[key], ); result = false; } } else if (vtree['css'][key] !== vtree['domRef'].style[key]) { console.warn( 'Style ' + key + ' differs', vtree['css'][key], vtree['domRef'].style[key], ); result = false; } } // recursive call for `vnode` / `vcomp` for (i = 0; i < vtree.children.length; i++) { result &= integrityCheck(result, vtree.children[i]); } } return result; }; var walk = function (logLevel, vtree, node) { // This is slightly more complicated than one might expect since // browsers will collapse consecutive text nodes into a single text node. // There can thus be fewer DOM nodes than VDOM nodes. // We handle this in collapseSiblingTextNodes var vdomChild, domChild; vtree['domRef'] = node; // Fire onCreated events as though the elements had just been created. callCreated(vtree); vtree.children = collapseSiblingTextNodes(vtree.children); for (var i = 0; i < vtree.children.length; i++) { vdomChild = vtree['children'][i]; domChild = node.childNodes[i]; if (!domChild) { diagnoseError(logLevel, vdomChild, domChild); return false; } if (vdomChild.type === 'vtext') { if (domChild.nodeType !== 3) { diagnoseError(logLevel, vdomChild, domChild); return false; } if (vdomChild['text'] === domChild.textContent) { vdomChild['domRef'] = domChild; } else { diagnoseError(logLevel, vdomChild, domChild); return false; } } else Iif (vdomChild['type'] === 'vcomp') { vdomChild['mount'](function (component) { vdomChild.children.push(component); walk(logLevel, vdomChild, domChild); }); } else { if (domChild.nodeType !== 1) return false; vdomChild['domRef'] = domChild; walk(logLevel, vdomChild, domChild); } } return true; }; /* various utilities */ var callFocus = function (id, delay) { var setFocus = function () { var e = document.getElementById(id); if (e && e.focus) e.focus(); }; delay > 0 ? setTimeout(setFocus, delay) : setFocus(); }; var callBlur = function (id, delay) { var setBlur = function () { var e = document.getElementById(id); if (e && e.blur) e.blur(); }; delay > 0 ? setTimeout(setBlur, delay) : setBlur(); }; var setBodyComponent = function (componentId) { document.body.setAttribute('data-component-id', componentId); }; /* dmj, keep quoted field names so closure-compiler doesn't rename */ return { /* utils */ 'callFocus': callFocus, 'callBlur': callBlur, /* testing */ 'integrityCheck': integrityCheck, /* event handling */ 'eventJSON': eventJSON, 'delegate': delegate, 'undelegate': undelegate, /* component util */ 'setBodyComponent': setBodyComponent, /* core functions */ 'diff': diff, /* isomorphic */ 'hydrate': hydrate, /* version */ 'version': '1.9.0.0', }; })(); |