PageSourceSearch

https://afsprakenstelsel.twiin.nl/__theme/b_8ca5a7d7-80f3-41c8-bea…/51/unsafe-html-B1yMZI_M.js

js twiin.nl collected 2026-10-03 22:34:47 UTC 11,133 bytes, 284 lines download raw bytes

vendor: 4,170 bytes, lines 1-69
1/**
2 * @license
3 * Copyright 2017 Google LLC
4 * SPDX-License-Identifier: BSD-3-Clause
5 */
6const H = globalThis, M = H.trustedTypes, L = M ? M.createPolicy("lit-html", { createHTML: (n) => n }) : void 0, W = "$lit$", u = `lit$${Math.random().toFixed(9).slice(2)}$`, k = "?" + u, z = `<${k}>`, v = document, x = () => v.createComment(""), N = (n) => n === null || typeof n != "object" && typeof n != "function", U = Array.isArray, Z = (n) => U(n) || typeof (n == null ? void 0 : n[Symbol.iterator]) == "function", S = `[ 	
7\f\r]`, y = /<(?:(!--|\/[^a-zA-Z])|(\/?[a-zA-Z][^>\s]*)|(\/?$))/g, B = /-->/g, P = />/g, p = RegExp(`>|${S}(?:([^\\s"'>=/]+)(${S}*=${S}*(?:[^ 	
8\f\r"'\`<>=]|("|')|))|$)`, "g"), D = /'/g, O = /"/g, V = /^(?:script|style|textarea|title)$/i, F = (n) => (t, ...e) => ({ _$litType$: n, strings: t, values: e }), st = F(1), f = Symbol.for("lit-noChange"), $ = Symbol.for("lit-nothing"), R = /* @__PURE__ */ new WeakMap(), g = v.createTreeWalker(v, 129);
9function j(n, t) {
10  if (!U(n) || !n.hasOwnProperty("raw")) throw Error("invalid template strings array");
11  return L !== void 0 ? L.createHTML(t) : t;
12}
13const q = (n, t) => {
14  const e = n.length - 1, i = [];
15  let s, o = t === 2 ? "<svg>" : t === 3 ? "<math>" : "", r = y;
16  for (let a = 0; a < e; a++) {
17    const h = n[a];
18    let c, _, l = -1, A = 0;
19    for (; A < h.length && (r.lastIndex = A, _ = r.exec(h), _ !== null); ) A = r.lastIndex, r === y ? _[1] === "!--" ? r = B : _[1] !== void 0 ? r = P : _[2] !== void 0 ? (V.test(_[2]) && (s = RegExp("</" + _[2], "g")), r = p) : _[3] !== void 0 && (r = p) : r === p ? _[0] === ">" ? (r = s ?? y, l = -1) : _[1] === void 0 ? l = -2 : (l = r.lastIndex - _[2].length, c = _[1], r = _[3] === void 0 ? p : _[3] === '"' ? O : D) : r === O || r === D ? r = p : r === B || r === P ? r = y : (r = p, s = void 0);
20    const d = r === p && n[a + 1].startsWith("/>") ? " " : "";
21    o += r === y ? h + z : l >= 0 ? (i.push(c), h.slice(0, l) + W + h.slice(l) + u + d) : h + u + (l === -2 ? a : d);
22  }
23  return [j(n, o + (n[e] || "<?>") + (t === 2 ? "</svg>" : t === 3 ? "</math>" : "")), i];
24};
25class T {
26  constructor({ strings: t, _$litType$: e }, i) {
27    let s;
28    this.parts = [];
29    let o = 0, r = 0;
30    const a = t.length - 1, h = this.parts, [c, _] = q(t, e);
31    if (this.el = T.createElement(c, i), g.currentNode = this.el.content, e === 2 || e === 3) {
32      const l = this.el.content.firstChild;
33      l.replaceWith(...l.childNodes);
34    }
35    for (; (s = g.nextNode()) !== null && h.length < a; ) {
36      if (s.nodeType === 1) {
37        if (s.hasAttributes()) for (const l of s.getAttributeNames()) if (l.endsWith(W)) {
38          const A = _[r++], d = s.getAttribute(l).split(u), C = /([.?@])?(.*)/.exec(A);
39          h.push({ type: 1, index: o, name: C[2], strings: d, ctor: C[1] === "." ? J : C[1] === "?" ? K : C[1] === "@" ? Q : w }), s.removeAttribute(l);
40        } else l.startsWith(u) && (h.push({ type: 6, index: o }), s.removeAttribute(l));
41        if (V.test(s.tagName)) {
42          const l = s.textContent.split(u), A = l.length - 1;
43          if (A > 0) {
44            s.textContent = M ? M.emptyScript : "";
45            for (let d = 0; d < A; d++) s.append(l[d], x()), g.nextNode(), h.push({ type: 2, index: ++o });
46            s.append(l[A], x());
47          }
48        }
49      } else if (s.nodeType === 8) if (s.data === k) h.push({ type: 2, index: o });
50      else {
51        let l = -1;
52        for (; (l = s.data.indexOf(u, l + 1)) !== -1; ) h.push({ type: 7, index: o }), l += u.length - 1;
53      }
54      o++;
55    }
56  }
57  static createElement(t, e) {
58    const i = v.createElement("template");
59    return i.innerHTML = t, i;
60  }
61}
62function m(n, t, e = n, i) {
63  var r, a;
64  if (t === f) return t;
65  let s = i !== void 0 ? (r = e._$Co) == null ? void 0 : r[i] : e._$Cl;
66  const o = N(t) ? void 0 : t._$litDirective$;
67  return (s == null ? void 0 : s.constructor) !== o && ((a = s == null ? void 0 : s._$AO) == null || a.call(s, !1), o === void 0 ? s = void 0 : (s = new o(n), s._$AT(n, e, i)), i !== void 0 ? (e._$Co ?? (e._$Co = []))[i] = s : e._$Cl = s), s !== void 0 && (t = m(n, s._$AS(n, t.values), s, i)), t;
68}
69class G {
vendor: 6,963 bytes, lines 70-284
70  constructor(t, e) {
71    this._$AV = [], this._$AN = void 0, this._$AD = t, this._$AM = e;
72  }
73  get parentNode() {
74    return this._$AM.parentNode;
75  }
76  get _$AU() {
77    return this._$AM._$AU;
78  }
79  u(t) {
80    const { el: { content: e }, parts: i } = this._$AD, s = ((t == null ? void 0 : t.creationScope) ?? v).importNode(e, !0);
81    g.currentNode = s;
82    let o = g.nextNode(), r = 0, a = 0, h = i[0];
83    for (; h !== void 0; ) {
84      if (r === h.index) {
85        let c;
86        h.type === 2 ? c = new b(o, o.nextSibling, this, t) : h.type === 1 ? c = new h.ctor(o, h.name, h.strings, this, t) : h.type === 6 && (c = new X(o, this, t)), this._$AV.push(c), h = i[++a];
87      }
88      r !== (h == null ? void 0 : h.index) && (o = g.nextNode(), r++);
89    }
90    return g.currentNode = v, s;
91  }
92  p(t) {
93    let e = 0;
94    for (const i of this._$AV) i !== void 0 && (i.strings !== void 0 ? (i._$AI(t, i, e), e += i.strings.length - 2) : i._$AI(t[e])), e++;
95  }
96}
97class b {
98  get _$AU() {
99    var t;
100    return ((t = this._$AM) == null ? void 0 : t._$AU) ?? this._$Cv;
101  }
102  constructor(t, e, i, s) {
103    this.type = 2, this._$AH = $, this._$AN = void 0, this._$AA = t, this._$AB = e, this._$AM = i, this.options = s, this._$Cv = (s == null ? void 0 : s.isConnected) ?? !0;
104  }
105  get parentNode() {
106    let t = this._$AA.parentNode;
107    const e = this._$AM;
108    return e !== void 0 && (t == null ? void 0 : t.nodeType) === 11 && (t = e.parentNode), t;
109  }
110  get startNode() {
111    return this._$AA;
112  }
113  get endNode() {
114    return this._$AB;
115  }
116  _$AI(t, e = this) {
117    t = m(this, t, e), N(t) ? t === $ || t == null || t === "" ? (this._$AH !== $ && this._$AR(), this._$AH = $) : t !== this._$AH && t !== f && this._(t) : t._$litType$ !== void 0 ? this.$(t) : t.nodeType !== void 0 ? this.T(t) : Z(t) ? this.k(t) : this._(t);
118  }
119  O(t) {
120    return this._$AA.parentNode.insertBefore(t, this._$AB);
121  }
122  T(t) {
123    this._$AH !== t && (this._$AR(), this._$AH = this.O(t));
124  }
125  _(t) {
126    this._$AH !== $ && N(this._$AH) ? this._$AA.nextSibling.data = t : this.T(v.createTextNode(t)), this._$AH = t;
127  }
128  $(t) {
129    var o;
130    const { values: e, _$litType$: i } = t, s = typeof i == "number" ? this._$AC(t) : (i.el === void 0 && (i.el = T.createElement(j(i.h, i.h[0]), this.options)), i);
131    if (((o = this._$AH) == null ? void 0 : o._$AD) === s) this._$AH.p(e);
132    else {
133      const r = new G(s, this), a = r.u(this.options);
134      r.p(e), this.T(a), this._$AH = r;
135    }
136  }
137  _$AC(t) {
138    let e = R.get(t.strings);
139    return e === void 0 && R.set(t.strings, e = new T(t)), e;
140  }
141  k(t) {
142    U(this._$AH) || (this._$AH = [], this._$AR());
143    const e = this._$AH;
144    let i, s = 0;
145    for (const o of t) s === e.length ? e.push(i = new b(this.O(x()), this.O(x()), this, this.options)) : i = e[s], i._$AI(o), s++;
146    s < e.length && (this._$AR(i && i._$AB.nextSibling, s), e.length = s);
147  }
148  _$AR(t = this._$AA.nextSibling, e) {
149    var i;
150    for ((i = this._$AP) == null ? void 0 : i.call(this, !1, !0, e); t !== this._$AB; ) {
151      const s = t.nextSibling;
152      t.remove(), t = s;
153    }
154  }
155  setConnected(t) {
156    var e;
157    this._$AM === void 0 && (this._$Cv = t, (e = this._$AP) == null || e.call(this, t));
158  }
159}
160class w {
161  get tagName() {
162    return this.element.tagName;
163  }
164  get _$AU() {
165    return this._$AM._$AU;
166  }
167  constructor(t, e, i, s, o) {
168    this.type = 1, this._$AH = $, this._$AN = void 0, this.element = t, this.name = e, this._$AM = s, this.options = o, i.length > 2 || i[0] !== "" || i[1] !== "" ? (this._$AH = Array(i.length - 1).fill(new String()), this.strings = i) : this._$AH = $;
169  }
170  _$AI(t, e = this, i, s) {
171    const o = this.strings;
172    let r = !1;
173    if (o === void 0) t = m(this, t, e, 0), r = !N(t) || t !== this._$AH && t !== f, r && (this._$AH = t);
174    else {
175      const a = t;
176      let h, c;
177      for (t = o[0], h = 0; h < o.length - 1; h++) c = m(this, a[i + h], e, h), c === f && (c = this._$AH[h]), r || (r = !N(c) || c !== this._$AH[h]), c === $ ? t = $ : t !== $ && (t += (c ?? "") + o[h + 1]), this._$AH[h] = c;
178    }
179    r && !s && this.j(t);
180  }
181  j(t) {
182    t === $ ? this.element.removeAttribute(this.name) : this.element.setAttribute(this.name, t ?? "");
183  }
184}
185class J extends w {
186  constructor() {
187    super(...arguments), this.type = 3;
188  }
189  j(t) {
190    this.element[this.name] = t === $ ? void 0 : t;
191  }
192}
193class K extends w {
194  constructor() {
195    super(...arguments), this.type = 4;
196  }
197  j(t) {
198    this.element.toggleAttribute(this.name, !!t && t !== $);
199  }
200}
201class Q extends w {
202  constructor(t, e, i, s, o) {
203    super(t, e, i, s, o), this.type = 5;
204  }
205  _$AI(t, e = this) {
206    if ((t = m(this, t, e, 0) ?? $) === f) return;
207    const i = this._$AH, s = t === $ && i !== $ || t.capture !== i.capture || t.once !== i.once || t.passive !== i.passive, o = t !== $ && (i === $ || s);
208    s && this.element.removeEventListener(this.name, this, i), o && this.element.addEventListener(this.name, this, t), this._$AH = t;
209  }
210  handleEvent(t) {
211    var e;
212    typeof this._$AH == "function" ? this._$AH.call(((e = this.options) == null ? void 0 : e.host) ?? this.element, t) : this._$AH.handleEvent(t);
213  }
214}
215class X {
216  constructor(t, e, i) {
217    this.element = t, this.type = 6, this._$AN = void 0, this._$AM = e, this.options = i;
218  }
219  get _$AU() {
220    return this._$AM._$AU;
221  }
222  _$AI(t) {
223    m(this, t);
224  }
225}
226const E = H.litHtmlPolyfillSupport;
227E == null || E(T, b), (H.litHtmlVersions ?? (H.litHtmlVersions = [])).push("3.3.1");
228const it = (n, t, e) => {
229  const i = t;
230  let s = i._$litPart$;
231  return s === void 0 && (i._$litPart$ = s = new b(t.insertBefore(x(), null), null, void 0, {})), s._$AI(n), s;
232};
233/**
234 * @license
235 * Copyright 2017 Google LLC
236 * SPDX-License-Identifier: BSD-3-Clause
237 */
238const Y = { CHILD: 2 }, tt = (n) => (...t) => ({ _$litDirective$: n, values: t });
239class et {
240  constructor(t) {
241  }
242  get _$AU() {
243    return this._$AM._$AU;
244  }
245  _$AT(t, e, i) {
246    this._$Ct = t, this._$AM = e, this._$Ci = i;
247  }
248  _$AS(t, e) {
249    return this.update(t, e);
250  }
251  update(t, e) {
252    return this.render(...e);
253  }
254}
255/**
256 * @license
257 * Copyright 2017 Google LLC
258 * SPDX-License-Identifier: BSD-3-Clause
259 */
260class I extends et {
261  constructor(t) {
262    if (super(t), this.it = $, t.type !== Y.CHILD) throw Error(this.constructor.directiveName + "() can only be used in child bindings");
263  }
264  render(t) {
265    if (t === $ || t == null) return this._t = void 0, this.it = t;
266    if (t === f) return t;
267    if (typeof t != "string") throw Error(this.constructor.directiveName + "() called with a non-string value");
268    if (t === this.it) return this._t;
269    this.it = t;
270    const e = [t];
271    return e.raw = e, this._t = { _$litType$: this.constructor.resultType, strings: e, values: [] };
272  }
273}
274I.directiveName = "unsafeHTML", I.resultType = 1;
275const nt = tt(I);
276export {
277  it as B,
278  $ as E,
279  tt as e,
280  et as i,
281  nt as o,
282  Y as t,
283  st as x
284};

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.