vendor: 3,358 bytes, lines 1-6
1// Copyright (c) 2024, Mason Freed 2// All rights reserved. 3// 4// This source code is licensed under the BSD-style license found in the 5// LICENSE file in the root directory of this source tree. 6!function(){if(window.mutationEventsPolyfillInstalled)return;window.mutationEventsPolyfillInstalled=!0;let e="MutationEvent"in window;if(e&&!window.mutationEventsUsePolyfillAlways)return;let t=new Set(["DOMCharacterDataModified","DOMNodeInserted","DOMNodeInsertedIntoDocument","DOMNodeRemoved","DOMNodeRemovedFromDocument","DOMSubtreeModified",]),n="Polyfilled",o={attrChange:0,bubbles:!0,cancelable:!1,newValue:"",prevValue:"",relatedNode:null};function r(e,t,r,a){let l=Object.assign({},o);r&&(l=Object.assign(l,r));let i=new Event(e+n,l);i.attrChange=l.attrChange,i.newValue=l.newValue,i.prevValue=l.prevValue,i.relatedNode=l.relatedNode,a&&Object.defineProperty(i,"target",{writable:!1,value:a}),t.dispatchEvent(i)}function a(e,t){let n=document.createTreeWalker(e,NodeFilter.SHOW_ALL);do t(n.currentNode);while(n.nextNode())}let l=new Map,i=new Set;function u(e){let t=[];for(let n of(e.forEach(function(e){let n=e.target,o=e.type;"attributes"===o?(null===e.oldValue||null===n.getAttribute(e.attributeName))&&r("DOMSubtreeModified",n,{attributeName:e.attributeName}):"characterData"===o?(r("DOMCharacterDataModified",n,{prevValue:e.oldValue,newValue:n.textContent}),t.push(n)):"childList"===o&&(e.removedNodes.forEach(e=>{t.push(n),r("DOMNodeRemoved",e),r("DOMNodeRemoved",n,void 0,e),a(e,e=>r("DOMNodeRemovedFromDocument",e,{bubbles:!1})),r("DOMNodeRemovedFromDocument",n,{bubbles:!1},e)}),e.addedNodes.forEach(e=>{t.push(n),r("DOMNodeInserted",e),a(e,e=>r("DOMNodeInsertedIntoDocument",e,{bubbles:!1}))}))}),t))r("DOMSubtreeModified",n)}function d(e){let t=e.getRootNode();for(;t instanceof ShadowRoot;)t=t.host.getRootNode();return t instanceof Document?t.documentElement:t}function s(e,t){return e&&e.has&&e.has(t)}let c={subtree:!0,childList:!0,attributes:!0,attributeOldValue:!0,characterData:!0,characterDataOldValue:!0},f=Element.prototype.addEventListener;function v(e,o,r){return s(t,e)?{fullEventName:e+n,augmentedListener(t){Object.defineProperty(t,"type",{writable:!1,value:e}),o(t)}}:{fullEventName:e,augmentedListener:o}}Element.prototype.addEventListener=function(e,n,o){if(s(t,e)){!function e(t){if(s(i,t))return;i.add(t);let n=d(t);if(s(l,n)){l.get(n).count++;return}let o=new MutationObserver(u);l.set(n,{observer:o,count:1}),o.observe(n,c)}(this);let{augmentedListener:r,fullEventName:a}=v(e,n,o);f.apply(this,[a,r,o]);return}f.call(this,e,n,o)};let p=window.removeEventListener;Element.prototype.removeEventListener=function(e,n,o){if(s(t,e)){!function e(t){if(!s(i,t))return;i.delete(t);let n=d(t);if(s(l,n)&&0==--l.get(n).count){let o=l.get(n).observer;l.delete(n),o.disconnect()}}(this);let{augmentedListener:r,fullEventName:a}=v(e,n,o);p.apply(this,[a,r,o]);return}p.call(this,e,n,o)},window.MutationEvent=class extends CustomEvent{constructor(e,t){if("MagicString"!==e)throw"Illegal constructor";super("",t)}initMutationEvent(...e){this.initCustomEvent(...e)}static MODIFICATION=1;static ADDITION=2;static REMOVAL=3},window.initMutationEvent=()=>new MutationEvent;let h=Document.prototype.createEvent;Document.prototype.createEvent=function(e,...t){return"MutationEvent"===e?new MutationEvent("MagicString"):h.call(this,e,...t)}}();
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.