@asamuzakjp/dom-selector 3.0.1 → 3.0.2

package/dist/cjs/js/finder.js

@@ -1,2 +1,2 @@
-var j=Object.create;var W=Object.defineProperty;var B=Object.getOwnPropertyDescriptor;var G=Object.getOwnPropertyNames;var q=Object.getPrototypeOf,V=Object.prototype.hasOwnProperty;var X=(T,a)=>{for(var e in a)W(T,e,{get:a[e],enumerable:!0})},H=(T,a,e,n)=>{if(a&&typeof a=="object"||typeof a=="function")for(let i of G(a))!V.call(T,i)&&i!==e&&W(T,i,{get:()=>a[i],enumerable:!(n=B(a,i))||n.enumerable});return T};var Y=(T,a,e)=>(e=T!=null?j(q(T)):{},H(a||!T||!T.__esModule?W(e,"default",{value:T,enumerable:!0}):e,T)),K=T=>H(W({},"__esModule",{value:!0}),T);var Q={};X(Q,{Finder:()=>J});module.exports=K(Q);var z=Y(require("is-potential-custom-element-name"),1),A=require("./dom-util.js"),D=require("./matcher.js"),v=require("./parser.js"),h=require("./constant.js");const C="next",O="prev",L="all",$="first",R="lineal",P="self",I=h.SHOW_DOCUMENT|h.SHOW_DOCUMENT_FRAGMENT|h.SHOW_ELEMENT;class J{#a;#l;#t;#r;#e;#n;#b;#c;#s;#h;#o;#d;#i;#f;constructor(){this.#l=new WeakMap}_onError(a){if(!this.#b)if(a instanceof DOMException||this.#f&&a instanceof this.#f.DOMException)if(a.name===h.NOT_SUPPORTED_ERR)this.#i&&console.warn(a.message);else throw this.#f?new this.#f.DOMException(a.message,a.name):a;else throw a}_setup(a,e,n={}){const{noexcept:i,warn:t}=n;return this.#b=!!i,this.#i=!!t,this.#e=e,[this.#f,this.#t,this.#s]=(0,A.prepareDOMObjects)(e),this.#h=(0,A.isInShadowTree)(e),[this.#a,this.#n]=this._correspond(a),this.#c=new WeakMap,e}_correspond(a){const e=[];let n,i=this.#t&&this.#l.get(this.#t);if(i&&i.has(`${a}`)&&(n=i.get(a)),n){const t=n.length;for(let c=0;c<t;c++)n[c].dir=null,n[c].filtered=!1,n[c].find=!1,e[c]=[]}else{let t;try{t=(0,v.parseSelector)(a)}catch(f){this._onError(f)}const c=(0,v.walkAST)(t);n=[];let o=0;for(const[...f]of c){const r=[];let s=f.shift();if(s&&s.type!==h.COMBINATOR){const l=new Set;for(;s;){if(s.type===h.COMBINATOR){const[u]=f;if(u.type===h.COMBINATOR){const d=`Invalid selector ${a}`;throw new DOMException(d,h.SYNTAX_ERR)}r.push({combo:s,leaves:(0,v.sortAST)(l)}),l.clear()}else s&&l.add(s);if(f.length)s=f.shift();else{r.push({combo:null,leaves:(0,v.sortAST)(l)}),l.clear();break}}}n.push({branch:r,dir:null,filtered:!1,find:!1}),e[o]=[],o++}this.#t&&(i||(i=new Map),i.set(`${a}`,n),this.#l.set(this.#t,i))}return[n,e]}_prepareTreeWalkers(a){return this.#d=this.#t.createTreeWalker(this.#s,I),this.#r=this.#t.createTreeWalker(a,I),this.#o=!1,[this.#d,this.#r]}_traverse(a={},e=this.#d){let n,i=e.currentNode;if(a.nodeType===h.ELEMENT_NODE&&i===a)n=i;else{if(i!==e.root)for(;i&&!(i===e.root||a.nodeType===h.ELEMENT_NODE&&i===a);)i=e.parentNode();if(a.nodeType===h.ELEMENT_NODE)for(;i;){if(i===a){n=i;break}i=e.nextNode()}else n=i}return n??null}_collectNthChild(a,e,n){const{a:i,b:t,reverse:c,selector:o}=a,{parentNode:f}=e;let r=new Set,s;if(o&&(this.#l.has(o)?s=this.#l.get(o):(s=(0,v.walkAST)(o),this.#l.set(o,s))),f){const l=this.#t.createTreeWalker(f,I);let u=0,d=l.firstChild();for(;d;)u++,d=l.nextSibling();d=this._traverse(f,l);const g=new Set;if(s)for(d=this._traverse(f,l),d=l.firstChild();d;){let m;for(const _ of s)if(m=this._matchLeaves(_,d,n),!m)break;m&&g.add(d),d=l.nextSibling()}if(i===0){if(t>0&&t<=u){if(g.size){let m=0;for(d=this._traverse(f,l),c?d=l.lastChild():d=l.firstChild();d;){if(g.has(d)){if(m===t-1){r.add(d);break}m++}c?d=l.previousSibling():d=l.nextSibling()}}else if(!o){let m=0;for(d=this._traverse(f,l),c?d=l.lastChild():d=l.firstChild();d;){if(m===t-1){r.add(d);break}c?d=l.previousSibling():d=l.nextSibling(),m++}}}}else{let m=t-1;if(i>0)for(;m<0;)m+=i;if(m>=0&&m<u){let _=0,k=i>0?0:t-1;for(d=this._traverse(f,l),c?d=l.lastChild():d=l.firstChild();d&&(d&&m>=0&&m<u);)g.size?g.has(d)&&(k===m&&(r.add(d),m+=i),i>0?k++:k--):_===m&&(o||r.add(d),m+=i),c?d=l.previousSibling():d=l.nextSibling(),_++}}if(c&&r.size>1){const m=[...r];r=new Set(m.reverse())}}else if(e===this.#s&&i+t===1)if(s){let l;for(const u of s)if(l=this._matchLeaves(u,e,n),l)break;l&&r.add(e)}else r.add(e);return r}_collectNthOfType(a,e){const{a:n,b:i,reverse:t}=a,{localName:c,parentNode:o,prefix:f}=e;let r=new Set;if(o){const s=this.#t.createTreeWalker(o,I);let l=0,u=s.firstChild();for(;u;)l++,u=s.nextSibling();if(n===0){if(i>0&&i<=l){let d=0;for(u=this._traverse(o,s),t?u=s.lastChild():u=s.firstChild();u;){const{localName:g,prefix:m}=u;if(g===c&&m===f){if(d===i-1){r.add(u);break}d++}t?u=s.previousSibling():u=s.nextSibling()}}}else{let d=i-1;if(n>0)for(;d<0;)d+=n;if(d>=0&&d<l){let g=n>0?0:i-1;for(u=this._traverse(o,s),t?u=s.lastChild():u=s.firstChild();u;){const{localName:m,prefix:_}=u;if(m===c&&_===f){if(g===d&&(r.add(u),d+=n),d<0||d>=l)break;n>0?g++:g--}t?u=s.previousSibling():u=s.nextSibling()}}}if(t&&r.size>1){const d=[...r];r=new Set(d.reverse())}}else e===this.#s&&n+i===1&&r.add(e);return r}_matchAnPlusB(a,e,n,i){const{nth:{a:t,b:c,name:o},selector:f}=a,r=(0,v.unescapeSelector)(o),s=new Map;r?(r==="even"?(s.set("a",2),s.set("b",0)):r==="odd"&&(s.set("a",2),s.set("b",1)),n.indexOf("last")>-1&&s.set("reverse",!0)):(typeof t=="string"&&/-?\d+/.test(t)?s.set("a",t*1):s.set("a",0),typeof c=="string"&&/-?\d+/.test(c)?s.set("b",c*1):s.set("b",0),n.indexOf("last")>-1&&s.set("reverse",!0));let l=new Set;if(s.has("a")&&s.has("b")){if(/^nth-(?:last-)?child$/.test(n)){f&&s.set("selector",f);const u=Object.fromEntries(s),d=this._collectNthChild(u,e,i);d.size&&(l=d)}else if(/^nth-(?:last-)?of-type$/.test(n)){const u=Object.fromEntries(s),d=this._collectNthOfType(u,e);d.size&&(l=d)}}return l}_matchDirectionPseudoClass(a,e){const n=(0,v.unescapeSelector)(a.name),i=(0,A.getDirectionality)(e);let t;return n===i&&(t=e),t??null}_matchLanguagePseudoClass(a,e){const n=(0,v.unescapeSelector)(a.name);let i;if(n==="*")if(e.hasAttribute("lang"))e.getAttribute("lang")&&(i=e);else{let t=e.parentNode;for(;t&&t.nodeType===h.ELEMENT_NODE;){if(t.hasAttribute("lang")){t.getAttribute("lang")&&(i=e);break}t=t.parentNode}}else if(n){const t=`(?:-${h.ALPHA_NUM})*`;if(new RegExp(`^(?:\\*-)?${h.ALPHA_NUM}${t}$`,"i").test(n)){let o;if(n.indexOf("-")>-1){const[f,r,...s]=n.split("-");let l;f==="*"?l=`${h.ALPHA_NUM}${t}`:l=`${f}${t}`;const u=`-${r}${t}`,d=s.length;let g="";if(d)for(let m=0;m<d;m++)g+=`-${s[m]}${t}`;o=new RegExp(`^${l}${u}${g}$`,"i")}else o=new RegExp(`^${n}${t}$`,"i");if(e.hasAttribute("lang"))o.test(e.getAttribute("lang"))&&(i=e);else{let f=e.parentNode;for(;f&&f.nodeType===h.ELEMENT_NODE;){if(f.hasAttribute("lang")){const r=f.getAttribute("lang");o.test(r)&&(i=e);break}f=f.parentNode}}}}return i??null}_matchHasPseudoFunc(a,e,n={}){let i;if(Array.isArray(a)&&a.length){const[t]=a,{type:c}=t;let o;c===h.COMBINATOR?o=a.shift():o={name:" ",type:h.COMBINATOR};const f=[];for(;a.length;){const[l]=a,{type:u}=l;if(u===h.COMBINATOR)break;f.push(a.shift())}const r={combo:o,leaves:f};n.dir=C;const s=this._matchCombinator(r,e,n);if(s.size)if(a.length){for(const l of s)if(i=this._matchHasPseudoFunc(Object.assign([],a),l,n),i)break}else i=!0}return!!i}_matchLogicalPseudoFunc(a,e,n={}){const{astName:i="",branches:t=[],selector:c="",twigBranches:o=[]}=a;let f;if(i==="has")if(c.includes(":has("))f=null;else{let r;for(const s of t)if(r=this._matchHasPseudoFunc(Object.assign([],s),e,n),r)break;r&&(f=e)}else{const r=/^(?:is|where)$/.test(i);n.forgive=r;const s=o.length;let l;for(let u=0;u<s;u++){const d=o[u],g=d.length-1,{leaves:m}=d[g];if(l=this._matchLeaves(m,e,n),l&&g>0){let _=new Set([e]);for(let k=g-1;k>=0;k--){const N=d[k],b=[];n.dir=O;for(const w of _){const p=this._matchCombinator(N,w,n);p.size&&b.push(...p)}if(b.length)k===0?l=!0:_=new Set(b);else{l=!1;break}}}if(l)break}i==="not"?l||(f=e):l&&(f=e)}return f??null}_matchPseudoClassSelector(a,e,n={}){const{children:i}=a,{localName:t,parentNode:c}=e,{forgive:o,warn:f=this.#i}=n,r=(0,v.unescapeSelector)(a.name);let s=new Set;if(h.REG_LOGICAL_PSEUDO.test(r)){let l;if(this.#l.has(a))l=this.#l.get(a);else{const d=(0,v.walkAST)(a),g=[],m=[];for(const[..._]of d){for(const w of _){const p=(0,v.generateCSS)(w);g.push(p)}const k=[],N=new Set;let b=_.shift();for(;b;)if(b.type===h.COMBINATOR?(k.push({combo:b,leaves:[...N]}),N.clear()):b&&N.add(b),_.length)b=_.shift();else{k.push({combo:null,leaves:[...N]}),N.clear();break}m.push(k)}l={astName:r,branches:d,twigBranches:m,selector:g.join(",")},this.#l.set(a,l)}const u=this._matchLogicalPseudoFunc(l,e,n);u&&s.add(u)}else if(Array.isArray(i)){const[l]=i;if(/^nth-(?:last-)?(?:child|of-type)$/.test(r)){const u=this._matchAnPlusB(l,e,r,n);u.size&&(s=u)}else if(r==="dir"){const u=this._matchDirectionPseudoClass(l,e);u&&s.add(u)}else if(r==="lang"){const u=this._matchLanguagePseudoClass(l,e);u&&s.add(u)}else switch(r){case"current":case"nth-col":case"nth-last-col":{if(f){const u=`Unsupported pseudo-class :${r}()`;throw new DOMException(u,h.NOT_SUPPORTED_ERR)}break}case"host":case"host-context":break;default:if(!o){const u=`Unknown pseudo-class :${r}()`;throw new DOMException(u,h.SYNTAX_ERR)}}}else{const l=/^a(?:rea)?$/,u=/^(?:(?:fieldse|inpu|selec)t|button|opt(?:group|ion)|textarea)$/,d=/^(?:(?:inpu|selec)t|button|form|textarea)$/,g=/^d(?:etails|ialog)$/,m=/^(?:checkbox|radio)$/,_=/^(?:date(?:time-local)?|month|time|week)$/,k=/(?:(?:rang|tim)e|date(?:time-local)?|month|number|week)$/,N=/^(?:(?:emai|te|ur)l|number|password|search|text)$/;switch(r){case"any-link":case"link":{l.test(t)&&e.hasAttribute("href")&&s.add(e);break}case"local-link":{if(l.test(t)&&e.hasAttribute("href")){const{href:b,origin:w,pathname:p}=new URL(this.#t.URL),y=new URL(e.getAttribute("href"),b);y.origin===w&&y.pathname===p&&s.add(e)}break}case"visited":break;case"target":{const{hash:b}=new URL(this.#t.URL);e.id&&b===`#${e.id}`&&this.#t.contains(e)&&s.add(e);break}case"target-within":{const{hash:b}=new URL(this.#t.URL);if(b){const w=b.replace(/^#/,"");let p=this.#t.getElementById(w);for(;p;){if(p===e){s.add(e);break}p=p.parentNode}}break}case"scope":{this.#e.nodeType===h.ELEMENT_NODE?e===this.#e&&s.add(e):e===this.#t.documentElement&&s.add(e);break}case"focus":{e===this.#t.activeElement&&s.add(e);break}case"focus-within":{let b=this.#t.activeElement;for(;b;){if(b===e){s.add(e);break}b=b.parentNode}break}case"open":{g.test(t)&&e.hasAttribute("open")&&s.add(e);break}case"closed":{g.test(t)&&!e.hasAttribute("open")&&s.add(e);break}case"disabled":{if(u.test(t)||(0,z.default)(t))if(e.disabled||e.hasAttribute("disabled"))s.add(e);else{let b=c;for(;b&&b.localName!=="fieldset";)b=b.parentNode;b&&c.localName!=="legend"&&b.hasAttribute("disabled")&&s.add(e)}break}case"enabled":{(u.test(t)||(0,z.default)(t))&&!(e.disabled&&e.hasAttribute("disabled"))&&s.add(e);break}case"read-only":{switch(t){case"textarea":{(e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled"))&&s.add(e);break}case"input":{(!e.type||_.test(e.type)||N.test(e.type))&&(e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled"))&&s.add(e);break}default:(0,A.isContentEditable)(e)||s.add(e)}break}case"read-write":{switch(t){case"textarea":{e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled")||s.add(e);break}case"input":{(!e.type||_.test(e.type)||N.test(e.type))&&!(e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled"))&&s.add(e);break}default:(0,A.isContentEditable)(e)&&s.add(e)}break}case"placeholder-shown":{let b;t==="textarea"?b=e:t==="input"&&(e.hasAttribute("type")?N.test(e.getAttribute("type"))&&(b=e):b=e),b&&e.value===""&&e.hasAttribute("placeholder")&&e.getAttribute("placeholder").trim().length&&s.add(e);break}case"checked":{(e.checked&&t==="input"&&e.hasAttribute("type")&&m.test(e.getAttribute("type"))||e.selected&&t==="option")&&s.add(e);break}case"indeterminate":{if(e.indeterminate&&t==="input"&&e.type==="checkbox"||t==="progress"&&!e.hasAttribute("value"))s.add(e);else if(t==="input"&&e.type==="radio"&&!e.hasAttribute("checked")){const b=e.name;let w=e.parentNode;for(;w&&w.localName!=="form";)w=w.parentNode;w||(w=this.#t.documentElement);let p;const y=w.getElementsByTagName("input"),E=y.length;if(E)for(let x=0;x<E;x++){const S=y[x];if(S.getAttribute("type")==="radio"&&(b?S.getAttribute("name")===b&&(p=!!S.checked):S.hasAttribute("name")||(p=!!S.checked),p))break}p||s.add(e)}break}case"default":{const b=/^(?:button|reset)$/,w=/^(?:image|submit)$/;if(t==="button"&&!(e.hasAttribute("type")&&b.test(e.getAttribute("type")))||t==="input"&&e.hasAttribute("type")&&w.test(e.getAttribute("type"))){let p=e.parentNode;for(;p&&p.localName!=="form";)p=p.parentNode;if(p){const y=this.#t.createTreeWalker(p,h.SHOW_ELEMENT);let E=y.firstChild();for(;E;){const x=E.localName;let S;if(x==="button"?S=!(E.hasAttribute("type")&&b.test(E.getAttribute("type"))):x==="input"&&(S=E.hasAttribute("type")&&w.test(E.getAttribute("type"))),S){E===e&&s.add(e);break}E=y.nextNode()}}}else if(t==="input"&&e.hasAttribute("type")&&m.test(e.getAttribute("type"))&&(e.checked||e.hasAttribute("checked")))s.add(e);else if(t==="option"){let p=!1,y=c;for(;y&&y.localName!=="datalist";){if(y.localName==="select"){(y.multiple||y.hasAttribute("multiple"))&&(p=!0);break}y=y.parentNode}if(p)(e.selected||e.hasAttribute("selected"))&&s.add(e);else{const E=new Set,x=this.#t.createTreeWalker(c,h.SHOW_ELEMENT);let S=x.firstChild();for(;S;){if(S.selected||S.hasAttribute("selected")){E.add(S);break}S=x.nextSibling()}E.size&&E.has(e)&&s.add(e)}}break}case"valid":{if(d.test(t))e.checkValidity()&&s.add(e);else if(t==="fieldset"){let b;const w=this.#t.createTreeWalker(e,h.SHOW_ELEMENT);let p=w.firstChild();for(;p&&!(d.test(p.localName)&&(b=p.checkValidity(),!b));)p=w.nextNode();b&&s.add(e)}break}case"invalid":{if(d.test(t))e.checkValidity()||s.add(e);else if(t==="fieldset"){let b;const w=this.#t.createTreeWalker(e,h.SHOW_ELEMENT);let p=w.firstChild();for(;p&&!(d.test(p.localName)&&(b=p.checkValidity(),!b));)p=w.nextNode();b||s.add(e)}break}case"in-range":{t==="input"&&!(e.readonly||e.hasAttribute("readonly"))&&!(e.disabled||e.hasAttribute("disabled"))&&e.hasAttribute("type")&&k.test(e.getAttribute("type"))&&!(e.validity.rangeUnderflow||e.validity.rangeOverflow)&&(e.hasAttribute("min")||e.hasAttribute("max")||e.getAttribute("type")==="range")&&s.add(e);break}case"out-of-range":{t==="input"&&!(e.readonly||e.hasAttribute("readonly"))&&!(e.disabled||e.hasAttribute("disabled"))&&e.hasAttribute("type")&&k.test(e.getAttribute("type"))&&(e.validity.rangeUnderflow||e.validity.rangeOverflow)&&s.add(e);break}case"required":{let b;if(/^(?:select|textarea)$/.test(t))b=e;else if(t==="input")if(e.hasAttribute("type")){const w=e.getAttribute("type");(w==="file"||m.test(w)||_.test(w)||N.test(w))&&(b=e)}else b=e;b&&(e.required||e.hasAttribute("required"))&&s.add(e);break}case"optional":{let b;if(/^(?:select|textarea)$/.test(t))b=e;else if(t==="input")if(e.hasAttribute("type")){const w=e.getAttribute("type");(w==="file"||m.test(w)||_.test(w)||N.test(w))&&(b=e)}else b=e;b&&!(e.required||e.hasAttribute("required"))&&s.add(e);break}case"root":{e===this.#t.documentElement&&s.add(e);break}case"empty":{if(e.hasChildNodes()){let b;const w=this.#t.createTreeWalker(e,h.SHOW_ALL);let p=w.firstChild();for(;p&&(b=p.nodeType!==h.ELEMENT_NODE&&p.nodeType!==h.TEXT_NODE,!!b);)p=w.nextSibling();b&&s.add(e)}else s.add(e);break}case"first-child":{(c&&e===c.firstElementChild||e===this.#s)&&s.add(e);break}case"last-child":{(c&&e===c.lastElementChild||e===this.#s)&&s.add(e);break}case"only-child":{(c&&e===c.firstElementChild&&e===c.lastElementChild||e===this.#s)&&s.add(e);break}case"first-of-type":{if(c){const[b]=this._collectNthOfType({a:0,b:1},e);b&&s.add(b)}else e===this.#s&&s.add(e);break}case"last-of-type":{if(c){const[b]=this._collectNthOfType({a:0,b:1,reverse:!0},e);b&&s.add(b)}else e===this.#s&&s.add(e);break}case"only-of-type":{if(c){const[b]=this._collectNthOfType({a:0,b:1},e);if(b===e){const[w]=this._collectNthOfType({a:0,b:1,reverse:!0},e);w===e&&s.add(e)}}else e===this.#s&&s.add(e);break}case"host":case"host-context":break;case"after":case"before":case"first-letter":case"first-line":{if(f){const b=`Unsupported pseudo-element ::${r}`;throw new DOMException(b,h.NOT_SUPPORTED_ERR)}break}case"active":case"autofill":case"blank":case"buffering":case"current":case"defined":case"focus-visible":case"fullscreen":case"future":case"hover":case"modal":case"muted":case"past":case"paused":case"picture-in-picture":case"playing":case"seeking":case"stalled":case"user-invalid":case"user-valid":case"volume-locked":case"-webkit-autofill":{if(f){const b=`Unsupported pseudo-class :${r}`;throw new DOMException(b,h.NOT_SUPPORTED_ERR)}break}default:if(r.startsWith("-webkit-")){if(f){const b=`Unsupported pseudo-class :${r}`;throw new DOMException(b,h.NOT_SUPPORTED_ERR)}}else if(!o){const b=`Unknown pseudo-class :${r}`;throw new DOMException(b,h.SYNTAX_ERR)}}}return s}_matchShadowHostPseudoClass(a,e){const{children:n}=a,i=(0,v.unescapeSelector)(a.name);let t;if(Array.isArray(n)){const[c]=(0,v.walkAST)(n[0]),[...o]=c,{host:f}=e;if(i==="host"){let r;for(const s of o){const{type:l}=s;if(l===h.COMBINATOR){const d=`Invalid selector ${(0,v.generateCSS)(a)}`;throw new DOMException(d,h.SYNTAX_ERR)}if(r=this._matchSelector(s,f).has(f),!r)break}r&&(t=e)}else if(i==="host-context"){let r,s=f;for(;s;){for(const l of o){const{type:u}=l;if(u===h.COMBINATOR){const g=`Invalid selector ${(0,v.generateCSS)(a)}`;throw new DOMException(g,h.SYNTAX_ERR)}if(r=this._matchSelector(l,s).has(s),!r)break}if(r)break;s=s.parentNode}r&&(t=e)}}else if(i==="host")t=e;else{const c=`Invalid selector :${i}`;throw new DOMException(c,h.SYNTAX_ERR)}return t??null}_matchSelector(a,e,n){const{type:i}=a,t=(0,v.unescapeSelector)(a.name);let c=new Set;if(e.nodeType===h.ELEMENT_NODE)switch(i){case h.SELECTOR_PSEUDO_CLASS:{const o=this._matchPseudoClassSelector(a,e,n);o.size&&(c=o);break}case h.SELECTOR_PSEUDO_ELEMENT:{(0,D.matchPseudoElementSelector)(t,n);break}default:{const o=(0,D.matchSelector)(a,e,n);o&&c.add(o)}}else if(this.#h&&i===h.SELECTOR_PSEUDO_CLASS&&e.nodeType===h.DOCUMENT_FRAGMENT_NODE){if(t!=="has"&&h.REG_LOGICAL_PSEUDO.test(t)){const o=this._matchPseudoClassSelector(a,e,n);o.size&&(c=o)}else if(h.REG_SHADOW_HOST.test(t)){const o=this._matchShadowHostPseudoClass(a,e,n);o&&c.add(o)}}return c}_matchLeaves(a,e,n){let i;if(this.#c.has(a)){const t=this.#c.get(a);if(t.has(e))i=t.get(e);else{for(const c of a)if(i=this._matchSelector(c,e,n).has(e),!i)break;t.set(e,i),this.#c.set(a,t)}}else{for(const c of a)if(i=this._matchSelector(c,e,n).has(e),!i)break;const t=new WeakMap;t.set(e,i),this.#c.set(a,t)}return!!i}_matchHTMLCollection(a,e={}){const{compound:n,filterLeaves:i}=e;let t=new Set;const c=a.length;if(c)if(n)for(let o=0;o<c;o++){const f=a[o];this._matchLeaves(i,f,e)&&t.add(f)}else{const o=[].slice.call(a);t=new Set(o)}return t}_findDescendantNodes(a,e,n){const[i,...t]=a,{type:c}=i,o=(0,v.unescapeSelector)(i.name),f=t.length>0;let r=new Set,s=!1;if(this.#h)s=!0;else switch(c){case h.SELECTOR_ID:{if(this.#s.nodeType===h.ELEMENT_NODE)s=!0;else{const l=this.#s.getElementById(o);l&&l!==e&&e.contains(l)&&(f?this._matchLeaves(t,l,n)&&r.add(l):r.add(l))}break}case h.SELECTOR_CLASS:{const l=e.getElementsByClassName(o);r=this._matchHTMLCollection(l,{compound:f,filterLeaves:t});break}case h.SELECTOR_TYPE:{if(this.#t.contentType==="text/html"&&!/[*|]/.test(o)){const l=e.getElementsByTagName(o);r=this._matchHTMLCollection(l,{compound:f,filterLeaves:t})}else s=!0;break}case h.SELECTOR_PSEUDO_ELEMENT:{(0,D.matchPseudoElementSelector)(o,n);break}default:s=!0}return{nodes:r,pending:s}}_matchCombinator(a,e,n={}){const{combo:i,leaves:t}=a,{name:c}=i,{dir:o}=n;let f=new Set;if(o===C)switch(c){case"+":{const r=e.nextElementSibling;r&&this._matchLeaves(t,r,n)&&f.add(r);break}case"~":{const{parentNode:r}=e;if(r){const s=this.#t.createTreeWalker(r,h.SHOW_ELEMENT);let l=this._traverse(e,s);for(l===e&&(l=s.nextSibling());l;)this._matchLeaves(t,l,n)&&f.add(l),l=s.nextSibling()}break}case">":{const r=this.#t.createTreeWalker(e,h.SHOW_ELEMENT);let s=r.firstChild();for(;s;)this._matchLeaves(t,s,n)&&f.add(s),s=r.nextSibling();break}case" ":default:{const{nodes:r,pending:s}=this._findDescendantNodes(t,e);if(r.size)f=r;else if(s){const l=this.#t.createTreeWalker(e,h.SHOW_ELEMENT);let u=l.nextNode();for(;u;)this._matchLeaves(t,u,n)&&f.add(u),u=l.nextNode()}}}else switch(c){case"+":{const r=e.previousElementSibling;r&&this._matchLeaves(t,r,n)&&f.add(r);break}case"~":{const r=this.#t.createTreeWalker(e.parentNode,h.SHOW_ELEMENT);let s=r.firstChild();for(;s&&s!==e;)this._matchLeaves(t,s,n)&&f.add(s),s=r.nextSibling();break}case">":{const r=e.parentNode;r&&this._matchLeaves(t,r,n)&&f.add(r);break}case" ":default:{const r=[];let s=e.parentNode;for(;s;)this._matchLeaves(t,s,n)&&r.push(s),s=s.parentNode;r.length&&(f=new Set(r.reverse()))}}return f}_findNode(a,e={}){const{node:n}=e;let i,t=this._traverse(n,this.#r);if(t)for(t.nodeType!==h.ELEMENT_NODE?t=this.#r.nextNode():t===n&&t!==this.#s&&(t=this.#r.nextNode());t;){let c;if(this.#e.nodeType===h.ELEMENT_NODE?t===this.#e?c=!0:c=this.#e.contains(t):c=!0,c&&this._matchLeaves(a,t,{warn:this.#i})){i=t;break}t=this.#r.nextNode()}return i??null}_matchSelf(a){const e=[];let n=!1;return this._matchLeaves(a,this.#e)&&(e.push(this.#e),n=!0),[e,n]}_findLineal(a,e={}){const{complex:n,compound:i,filterLeaves:t}=e,c=[];let o=!1,f=this._matchLeaves([a],this.#e);if(f&&!i&&!n?(c.push(this.#e),o=!0):f&&i&&!n&&(f=this._matchLeaves(t,this.#e),f&&(c.push(this.#e),o=!0)),!f||n){f&&(c.push(this.#e),i||(o=!0));let r=this.#e.parentNode;for(;r&&(f=this._matchLeaves([a],r),f&&(c.push(r),i||(o=!0)),r.parentNode);)r=r.parentNode}return[c,o]}_findFirst(a){const e=[];let n=!1;const i=this._findNode(a,{node:this.#e});return i&&(e.push(i),n=!0),[e,n]}_findFromHTMLCollection(a,e={}){const{compound:n,filterLeaves:i}=e;let t=[],c=!1;const o=a.length;if(o)if(this.#e.nodeType===h.ELEMENT_NODE)for(let f=0;f<o;f++){const r=a[f];(r===this.#e||(0,A.isInclusive)(r,this.#e))&&(n?this._matchLeaves(i,r,{warn:this.#i})&&(t.push(r),c=!0):(t.push(r),c=!0))}else t=[].slice.call(a),n||(c=!0);return[t,c]}_findEntryNodes(a,e,n){const{leaves:i}=a,[t,...c]=i,{type:o}=t,f=(0,v.unescapeSelector)(t.name),r=c.length>0;let s=[],l=!1,u=!1;switch(o){case h.SELECTOR_PSEUDO_ELEMENT:{(0,D.matchPseudoElementSelector)(f,{warn:this.#i});break}case h.SELECTOR_ID:{if(e===P)[s,l]=this._matchSelf(i);else if(e===R)[s,l]=this._findLineal(t,{complex:n,compound:r,filterLeaves:c});else if(e===$&&this.#s.nodeType!==h.ELEMENT_NODE){const d=this.#s.getElementById(f);d&&(r?this._matchLeaves(c,d,{warn:this.#i})&&(s.push(d),l=!0):(s.push(d),l=!0))}else u=!0;break}case h.SELECTOR_CLASS:{if(e===P)[s,l]=this._matchSelf(i);else if(e===R)[s,l]=this._findLineal(t,{complex:n,compound:r,filterLeaves:c});else if(e===$)[s,l]=this._findFirst(i);else if(this.#s.nodeType===h.DOCUMENT_NODE){const d=this.#s.getElementsByClassName(f);[s,l]=this._findFromHTMLCollection(d,{compound:r,filterLeaves:c})}else u=!0;break}case h.SELECTOR_TYPE:{if(e===P)[s,l]=this._matchSelf(i);else if(e===R)[s,l]=this._findLineal(t,{complex:n,compound:r,filterLeaves:c});else if(this.#t.contentType==="text/html"&&this.#s.nodeType===h.DOCUMENT_NODE&&!/[*|]/.test(f)){const d=this.#s.getElementsByTagName(f);[s,l]=this._findFromHTMLCollection(d,{compound:r,filterLeaves:c})}else u=!0;break}default:if(e!==R&&h.REG_SHADOW_HOST.test(f)){if(this.#h&&this.#e.nodeType===h.DOCUMENT_FRAGMENT_NODE){const d=this._matchShadowHostPseudoClass(t,this.#e);d&&(s.push(d),l=!0)}}else e===P?[s,l]=this._matchSelf(i):e===R?[s,l]=this._findLineal(t,{complex:n,compound:r,filterLeaves:c}):e===$?[s,l]=this._findFirst(i):u=!0}return{compound:r,filtered:l,nodes:s,pending:u}}_getEntryTwig(a,e){const n=a.length,i=n>1,t=a[0];let c,o;if(i){const{combo:f,leaves:[{name:r,type:s}]}=t,l=a[n-1],{leaves:[{name:u,type:d}]}=l;if(d===h.SELECTOR_PSEUDO_ELEMENT||d===h.SELECTOR_ID)c=O,o=l;else if(s===h.SELECTOR_PSEUDO_ELEMENT||s===h.SELECTOR_ID)c=C,o=t;else if(e===L)if(r==="*"&&s===h.SELECTOR_TYPE)c=O,o=l;else if(u==="*"&&d===h.SELECTOR_TYPE)c=C,o=t;else if(n===2){const{name:g}=f;/^[+~]$/.test(g)?(c=O,o=l):(c=C,o=t)}else c=C,o=t;else if(u==="*"&&d===h.SELECTOR_TYPE)c=C,o=t;else if(r==="*"&&s===h.SELECTOR_TYPE)c=O,o=l;else{let g,m;for(const{combo:_,leaves:[k]}of a){const{type:N}=k,b=(0,v.unescapeSelector)(k.name);if(N===h.SELECTOR_PSEUDO_CLASS&&b==="dir"){g=!1;break}if(_&&!m){const{name:w}=_;/^[+~]$/.test(w)&&(g=!0,m=!0)}}g?(c=C,o=t):(c=O,o=l)}}else c=O,o=t;return{complex:i,dir:c,twig:o}}_collectNodes(a){const e=this.#a.values();if(a===L||a===$){const n=new Set;let i=0;for(const{branch:t}of e){const{complex:c,dir:o,twig:f}=this._getEntryTwig(t,a),{compound:r,filtered:s,nodes:l,pending:u}=this._findEntryNodes(f,a,c);l.length?(this.#a[i].find=!0,this.#n[i]=l):u&&n.add(new Map([["index",i],["twig",f]])),this.#a[i].dir=o,this.#a[i].filtered=s||!r,i++}if(n.size){let t,c;this.#e!==this.#s&&this.#e.nodeType===h.ELEMENT_NODE?(t=this.#e,c=this.#r):(t=this.#s,c=this.#d);let o=this._traverse(t,c);for(;o;){let f=!1;if(this.#e.nodeType===h.ELEMENT_NODE?o===this.#e?f=!0:f=this.#e.contains(o):f=!0,f)for(const r of n){const{leaves:s}=r.get("twig");if(this._matchLeaves(s,o,{warn:this.#i})){const u=r.get("index");this.#a[u].filtered=!0,this.#a[u].find=!0,this.#n[u].push(o)}}o=c.nextNode()}}}else{let n=0;for(const{branch:i}of e){const t=i[i.length-1],c=i.length>1,{compound:o,filtered:f,nodes:r}=this._findEntryNodes(t,a,c);r.length&&(this.#a[n].find=!0,this.#n[n]=r),this.#a[n].dir=O,this.#a[n].filtered=f||!o,n++}}return[this.#a,this.#n]}_matchNodes(a){const[...e]=this.#a,n=e.length;let i=new Set;for(let t=0;t<n;t++){const{branch:c,dir:o,filtered:f,find:r}=e[t],s=c.length;if(s&&r){const l=this.#n[t],u=l.length,d=s-1;if(d===0){const{leaves:[,...g]}=c[0];if((a===L||a===$)&&this.#e.nodeType===h.ELEMENT_NODE)for(let m=0;m<u;m++){const _=l[m];if(_!==this.#e&&this.#e.contains(_)&&(i.add(_),a!==L))break}else if(g.length)for(let m=0;m<u;m++){const _=l[m];if((f||this._matchLeaves(g,_,{warn:this.#i}))&&(i.add(_),a!==L))break}else if(a===L)if(i.size){const m=[...i];i=new Set([...m,...l]),this.#o=!0}else i=new Set([...l]);else{const[m]=[...l];i.add(m)}}else if(o===C){let{combo:g,leaves:m}=c[0];const[,..._]=m;let k;for(let N=0;N<u;N++){const b=l[N];if(f||this._matchLeaves(_,b,{warn:this.#i})){let p=new Set([b]);for(let y=1;y<s;y++){const{combo:E,leaves:x}=c[y],S=[];for(const M of p){const U={combo:g,leaves:x},F=this._matchCombinator(U,M,{dir:o,warn:this.#i});F.size&&S.push(...F)}if(S.length)if(y===d){if(a===L){if(i.size){const M=[...i];i=new Set([...M,...S])}else i=new Set([...S]);this.#o=!0}else{const[M]=(0,A.sortNodes)(S);i.add(M)}k=!0}else g=E,p=new Set(S),k=!1;else{k=!1;break}}}else k=!1;if(k&&a!==L)break}if(!k&&a===$){const[N]=[...l];let b=this._findNode(m,{node:N});for(;b;){let w=new Set([b]);for(let p=1;p<s;p++){const{combo:y,leaves:E}=c[p],x=[];for(const S of w){const M={combo:g,leaves:E},U=this._matchCombinator(M,S,{dir:o,warn:this.#i});U.size&&x.push(...U)}if(x.length)if(p===d){const[S]=(0,A.sortNodes)(x);i.add(S),k=!0}else g=y,w=new Set(x),k=!1;else{k=!1;break}}if(k)break;b=this._findNode(m,{node:b}),w=new Set([b])}}}else{const{leaves:g}=c[d];let m;for(let _=0;_<u;_++){const k=l[_];let N=new Set([k]);for(let b=d-1;b>=0;b--){const w=c[b],p=[];for(const y of N){const E=this._matchCombinator(w,y,{dir:o,warn:this.#i});E.size&&p.push(...E)}if(p.length)b===0?(i.add(k),m=!0,a===L&&s>1&&i.size>1&&(this.#o=!0)):(N=new Set(p),m=!1);else{m=!1;break}}if(m&&a!==L)break}if(!m&&a===$){const[_]=[...l];let k=this._findNode(g,{node:_});for(;k;){let N=new Set([k]);for(let b=d-1;b>=0;b--){const w=c[b],p=[];for(const y of N){const E=this._matchCombinator(w,y,{dir:o,warn:this.#i});E.size&&p.push(...E)}if(p.length)b===0?(i.add(k),m=!0):(N=new Set(p),m=!1);else{m=!1;break}}if(m)break;k=this._findNode(g,{node:k}),N=new Set([k])}}}}}return i}_find(a){return this._collectNodes(a),this._matchNodes(a)}matches(a,e,n){let i;try{if(this.#e=this._setup(a,e,n),e.nodeType!==h.ELEMENT_NODE){const c=`Unexpected node ${e.nodeName}`;throw new TypeError(c)}const t=this._find(P);t.size&&(i=t.has(this.#e))}catch(t){this._onError(t)}return!!i}closest(a,e,n){let i;try{if(this.#e=this._setup(a,e,n),e.nodeType!==h.ELEMENT_NODE){const o=`Unexpected node ${e.nodeName}`;throw new TypeError(o)}const t=this._find(R);let c=this.#e;for(;c;){if(t.has(c)){i=c;break}if(c.parentNode)c=c.parentNode;else break}}catch(t){this._onError(t)}return i??null}querySelector(a,e,n){let i;try{this.#e=this._setup(a,e,n),this._prepareTreeWalkers(e);const t=this._find($);t.delete(this.#e),t.size&&([i]=(0,A.sortNodes)(t))}catch(t){this._onError(t)}return i??null}querySelectorAll(a,e,n){let i;try{this.#e=this._setup(a,e,n),this._prepareTreeWalkers(e);const t=this._find(L);t.delete(this.#e),t.size&&(this.#o?i=(0,A.sortNodes)(t):i=[...t])}catch(t){this._onError(t)}return i??[]}}0&&(module.exports={Finder});
+var j=Object.create;var U=Object.defineProperty;var F=Object.getOwnPropertyDescriptor;var H=Object.getOwnPropertyNames;var B=Object.getPrototypeOf,G=Object.prototype.hasOwnProperty;var q=(T,a)=>{for(var e in a)U(T,e,{get:a[e],enumerable:!0})},I=(T,a,e,c)=>{if(a&&typeof a=="object"||typeof a=="function")for(let i of H(a))!G.call(T,i)&&i!==e&&U(T,i,{get:()=>a[i],enumerable:!(c=F(a,i))||c.enumerable});return T};var V=(T,a,e)=>(e=T!=null?j(B(T)):{},I(a||!T||!T.__esModule?U(e,"default",{value:T,enumerable:!0}):e,T)),X=T=>I(U({},"__esModule",{value:!0}),T);var K={};q(K,{Finder:()=>Y});module.exports=X(K);var z=V(require("is-potential-custom-element-name"),1),A=require("./dom-util.js"),R=require("./matcher.js"),S=require("./parser.js"),h=require("./constant.js");const C="next",O="prev",L="all",$="first",M="lineal",P="self",W=h.SHOW_DOCUMENT|h.SHOW_DOCUMENT_FRAGMENT|h.SHOW_ELEMENT;class Y{#a;#l;#t;#r;#e;#c;#b;#o;#s;#h;#f;#d;#i;#n;constructor(){this.#l=new WeakMap}_onError(a){if(!this.#b)if(a instanceof DOMException||this.#n&&a instanceof this.#n.DOMException)if(a.name===h.NOT_SUPPORTED_ERR)this.#i&&console.warn(a.message);else throw this.#n?new this.#n.DOMException(a.message,a.name):a;else throw a}_setup(a,e,c={}){const{noexcept:i,warn:t}=c;return this.#b=!!i,this.#i=!!t,this.#e=e,[this.#n,this.#t,this.#s]=(0,A.prepareDOMObjects)(e),this.#h=(0,A.isInShadowTree)(e),[this.#a,this.#c]=this._correspond(a),this.#o=new WeakMap,e}_correspond(a){const e=[];let c,i=this.#t&&this.#l.get(this.#t);if(i&&i.has(`${a}`)&&(c=i.get(a)),c){const t=c.length;for(let n=0;n<t;n++)c[n].dir=null,c[n].filtered=!1,c[n].find=!1,e[n]=[]}else{let t;try{t=(0,S.parseSelector)(a)}catch(f){this._onError(f)}const n=(0,S.walkAST)(t);c=[];let o=0;for(const[...f]of n){const l=[];let s=f.shift();if(s&&s.type!==h.COMBINATOR){const r=new Set;for(;s;){if(s.type===h.COMBINATOR){const[b]=f;if(b.type===h.COMBINATOR){const d=`Invalid selector ${a}`;throw new DOMException(d,h.SYNTAX_ERR)}l.push({combo:s,leaves:(0,S.sortAST)(r)}),r.clear()}else if(s){let{name:b}=s;b&&(Object.prototype.hasOwnProperty.call(b,"name")?(b=(0,S.unescapeSelector)(b.name),/[|:]/.test(b)&&(s.namespace=!0)):typeof b=="string"&&(b=(0,S.unescapeSelector)(b),/[|:]/.test(b)&&(s.namespace=!0))),r.add(s)}if(f.length)s=f.shift();else{l.push({combo:null,leaves:(0,S.sortAST)(r)}),r.clear();break}}}c.push({branch:l,dir:null,filtered:!1,find:!1}),e[o]=[],o++}this.#t&&(i||(i=new Map),i.set(`${a}`,c),this.#l.set(this.#t,i))}return[c,e]}_prepareTreeWalkers(a){return this.#d=this.#t.createTreeWalker(this.#s,W),this.#r=this.#t.createTreeWalker(a,W),this.#f=!1,[this.#d,this.#r]}_traverse(a={},e=this.#d){let c,i=e.currentNode;if(a.nodeType===h.ELEMENT_NODE&&i===a)c=i;else{if(i!==e.root)for(;i&&!(i===e.root||a.nodeType===h.ELEMENT_NODE&&i===a);)i=e.parentNode();if(a.nodeType===h.ELEMENT_NODE)for(;i;){if(i===a){c=i;break}i=e.nextNode()}else c=i}return c??null}_collectNthChild(a,e,c){const{a:i,b:t,reverse:n,selector:o}=a,{parentNode:f}=e;let l=new Set,s;if(o&&(this.#l.has(o)?s=this.#l.get(o):(s=(0,S.walkAST)(o),this.#l.set(o,s))),f){const r=this.#t.createTreeWalker(f,W);let b=0,d=r.firstChild();for(;d;)b++,d=r.nextSibling();d=this._traverse(f,r);const k=new Set;if(s)for(d=this._traverse(f,r),d=r.firstChild();d;){let m;for(const g of s)if(m=this._matchLeaves(g,d,c),!m)break;m&&k.add(d),d=r.nextSibling()}if(i===0){if(t>0&&t<=b){if(k.size){let m=0;for(d=this._traverse(f,r),n?d=r.lastChild():d=r.firstChild();d;){if(k.has(d)){if(m===t-1){l.add(d);break}m++}n?d=r.previousSibling():d=r.nextSibling()}}else if(!o){let m=0;for(d=this._traverse(f,r),n?d=r.lastChild():d=r.firstChild();d;){if(m===t-1){l.add(d);break}n?d=r.previousSibling():d=r.nextSibling(),m++}}}}else{let m=t-1;if(i>0)for(;m<0;)m+=i;if(m>=0&&m<b){let g=0,_=i>0?0:t-1;for(d=this._traverse(f,r),n?d=r.lastChild():d=r.firstChild();d&&(d&&m>=0&&m<b);)k.size?k.has(d)&&(_===m&&(l.add(d),m+=i),i>0?_++:_--):g===m&&(o||l.add(d),m+=i),n?d=r.previousSibling():d=r.nextSibling(),g++}}if(n&&l.size>1){const m=[...l];l=new Set(m.reverse())}}else if(e===this.#s&&i+t===1)if(s){let r;for(const b of s)if(r=this._matchLeaves(b,e,c),r)break;r&&l.add(e)}else l.add(e);return l}_collectNthOfType(a,e){const{a:c,b:i,reverse:t}=a,{localName:n,parentNode:o,prefix:f}=e;let l=new Set;if(o){const s=this.#t.createTreeWalker(o,W);let r=0,b=s.firstChild();for(;b;)r++,b=s.nextSibling();if(c===0){if(i>0&&i<=r){let d=0;for(b=this._traverse(o,s),t?b=s.lastChild():b=s.firstChild();b;){const{localName:k,prefix:m}=b;if(k===n&&m===f){if(d===i-1){l.add(b);break}d++}t?b=s.previousSibling():b=s.nextSibling()}}}else{let d=i-1;if(c>0)for(;d<0;)d+=c;if(d>=0&&d<r){let k=c>0?0:i-1;for(b=this._traverse(o,s),t?b=s.lastChild():b=s.firstChild();b;){const{localName:m,prefix:g}=b;if(m===n&&g===f){if(k===d&&(l.add(b),d+=c),d<0||d>=r)break;c>0?k++:k--}t?b=s.previousSibling():b=s.nextSibling()}}}if(t&&l.size>1){const d=[...l];l=new Set(d.reverse())}}else e===this.#s&&c+i===1&&l.add(e);return l}_matchAnPlusB(a,e,c,i){const{nth:{a:t,b:n,name:o},selector:f}=a,l=(0,S.unescapeSelector)(o),s=new Map;l?(l==="even"?(s.set("a",2),s.set("b",0)):l==="odd"&&(s.set("a",2),s.set("b",1)),c.indexOf("last")>-1&&s.set("reverse",!0)):(typeof t=="string"&&/-?\d+/.test(t)?s.set("a",t*1):s.set("a",0),typeof n=="string"&&/-?\d+/.test(n)?s.set("b",n*1):s.set("b",0),c.indexOf("last")>-1&&s.set("reverse",!0));let r=new Set;if(s.has("a")&&s.has("b")){if(/^nth-(?:last-)?child$/.test(c)){f&&s.set("selector",f);const b=Object.fromEntries(s),d=this._collectNthChild(b,e,i);d.size&&(r=d)}else if(/^nth-(?:last-)?of-type$/.test(c)){const b=Object.fromEntries(s),d=this._collectNthOfType(b,e);d.size&&(r=d)}}return r}_matchDirectionPseudoClass(a,e){const c=(0,S.unescapeSelector)(a.name),i=(0,A.getDirectionality)(e);let t;return c===i&&(t=e),t??null}_matchLanguagePseudoClass(a,e){const c=(0,S.unescapeSelector)(a.name);let i;if(c==="*")if(e.hasAttribute("lang"))e.getAttribute("lang")&&(i=e);else{let t=e.parentNode;for(;t&&t.nodeType===h.ELEMENT_NODE;){if(t.hasAttribute("lang")){t.getAttribute("lang")&&(i=e);break}t=t.parentNode}}else if(c){const t=`(?:-${h.ALPHA_NUM})*`;if(new RegExp(`^(?:\\*-)?${h.ALPHA_NUM}${t}$`,"i").test(c)){let o;if(c.indexOf("-")>-1){const[f,l,...s]=c.split("-");let r;f==="*"?r=`${h.ALPHA_NUM}${t}`:r=`${f}${t}`;const b=`-${l}${t}`,d=s.length;let k="";if(d)for(let m=0;m<d;m++)k+=`-${s[m]}${t}`;o=new RegExp(`^${r}${b}${k}$`,"i")}else o=new RegExp(`^${c}${t}$`,"i");if(e.hasAttribute("lang"))o.test(e.getAttribute("lang"))&&(i=e);else{let f=e.parentNode;for(;f&&f.nodeType===h.ELEMENT_NODE;){if(f.hasAttribute("lang")){const l=f.getAttribute("lang");o.test(l)&&(i=e);break}f=f.parentNode}}}}return i??null}_matchHasPseudoFunc(a,e,c={}){let i;if(Array.isArray(a)&&a.length){const[t]=a,{type:n}=t;let o;n===h.COMBINATOR?o=a.shift():o={name:" ",type:h.COMBINATOR};const f=[];for(;a.length;){const[r]=a,{type:b}=r;if(b===h.COMBINATOR)break;f.push(a.shift())}const l={combo:o,leaves:f};c.dir=C;const s=this._matchCombinator(l,e,c);if(s.size)if(a.length){for(const r of s)if(i=this._matchHasPseudoFunc(Object.assign([],a),r,c),i)break}else i=!0}return!!i}_matchLogicalPseudoFunc(a,e,c={}){const{astName:i="",branches:t=[],selector:n="",twigBranches:o=[]}=a;let f;if(i==="has")if(n.includes(":has("))f=null;else{let l;for(const s of t)if(l=this._matchHasPseudoFunc(Object.assign([],s),e,c),l)break;l&&(f=e)}else{const l=/^(?:is|where)$/.test(i);c.forgive=l;const s=o.length;let r;for(let b=0;b<s;b++){const d=o[b],k=d.length-1,{leaves:m}=d[k];if(r=this._matchLeaves(m,e,c),r&&k>0){let g=new Set([e]);for(let _=k-1;_>=0;_--){const y=d[_],u=[];c.dir=O;for(const p of g){const w=this._matchCombinator(y,p,c);w.size&&u.push(...w)}if(u.length)_===0?r=!0:g=new Set(u);else{r=!1;break}}}if(r)break}i==="not"?r||(f=e):r&&(f=e)}return f??null}_matchPseudoClassSelector(a,e,c={}){const{children:i}=a,{localName:t,parentNode:n}=e,{forgive:o,warn:f=this.#i}=c,l=(0,S.unescapeSelector)(a.name);let s=new Set;if(h.REG_LOGICAL_PSEUDO.test(l)){let r;if(this.#l.has(a))r=this.#l.get(a);else{const d=(0,S.walkAST)(a),k=[],m=[];for(const[...g]of d){for(const p of g){const w=(0,S.generateCSS)(p);k.push(w)}const _=[],y=new Set;let u=g.shift();for(;u;)if(u.type===h.COMBINATOR?(_.push({combo:u,leaves:[...y]}),y.clear()):u&&y.add(u),g.length)u=g.shift();else{_.push({combo:null,leaves:[...y]}),y.clear();break}m.push(_)}r={astName:l,branches:d,twigBranches:m,selector:k.join(",")},this.#l.set(a,r)}const b=this._matchLogicalPseudoFunc(r,e,c);b&&s.add(b)}else if(Array.isArray(i)){const[r]=i;if(/^nth-(?:last-)?(?:child|of-type)$/.test(l)){const b=this._matchAnPlusB(r,e,l,c);b.size&&(s=b)}else if(l==="dir"){const b=this._matchDirectionPseudoClass(r,e);b&&s.add(b)}else if(l==="lang"){const b=this._matchLanguagePseudoClass(r,e);b&&s.add(b)}else switch(l){case"current":case"nth-col":case"nth-last-col":{if(f){const b=`Unsupported pseudo-class :${l}()`;throw new DOMException(b,h.NOT_SUPPORTED_ERR)}break}case"host":case"host-context":break;default:if(!o){const b=`Unknown pseudo-class :${l}()`;throw new DOMException(b,h.SYNTAX_ERR)}}}else{const r=/^a(?:rea)?$/,b=/^(?:(?:fieldse|inpu|selec)t|button|opt(?:group|ion)|textarea)$/,d=/^(?:(?:inpu|selec)t|button|form|textarea)$/,k=/^d(?:etails|ialog)$/,m=/^(?:checkbox|radio)$/,g=/^(?:date(?:time-local)?|month|time|week)$/,_=/(?:(?:rang|tim)e|date(?:time-local)?|month|number|week)$/,y=/^(?:(?:emai|te|ur)l|number|password|search|text)$/;switch(l){case"any-link":case"link":{r.test(t)&&e.hasAttribute("href")&&s.add(e);break}case"local-link":{if(r.test(t)&&e.hasAttribute("href")){const{href:u,origin:p,pathname:w}=new URL(this.#t.URL),E=new URL(e.getAttribute("href"),u);E.origin===p&&E.pathname===w&&s.add(e)}break}case"visited":break;case"target":{const{hash:u}=new URL(this.#t.URL);e.id&&u===`#${e.id}`&&this.#t.contains(e)&&s.add(e);break}case"target-within":{const{hash:u}=new URL(this.#t.URL);if(u){const p=u.replace(/^#/,"");let w=this.#t.getElementById(p);for(;w;){if(w===e){s.add(e);break}w=w.parentNode}}break}case"scope":{this.#e.nodeType===h.ELEMENT_NODE?e===this.#e&&s.add(e):e===this.#t.documentElement&&s.add(e);break}case"focus":{e===this.#t.activeElement&&this.#n.getComputedStyle(e).display!=="none"&&s.add(e);break}case"focus-within":{let u=this.#t.activeElement;for(;u;){if(u===e){this.#n.getComputedStyle(e).display!=="none"&&s.add(e);break}u=u.parentNode}break}case"open":{k.test(t)&&e.hasAttribute("open")&&s.add(e);break}case"closed":{k.test(t)&&!e.hasAttribute("open")&&s.add(e);break}case"disabled":{if(b.test(t)||(0,z.default)(t))if(e.disabled||e.hasAttribute("disabled"))s.add(e);else{let u=n;for(;u&&u.localName!=="fieldset";)u=u.parentNode;u&&n.localName!=="legend"&&u.hasAttribute("disabled")&&s.add(e)}break}case"enabled":{(b.test(t)||(0,z.default)(t))&&!(e.disabled&&e.hasAttribute("disabled"))&&s.add(e);break}case"read-only":{switch(t){case"textarea":{(e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled"))&&s.add(e);break}case"input":{(!e.type||g.test(e.type)||y.test(e.type))&&(e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled"))&&s.add(e);break}default:(0,A.isContentEditable)(e)||s.add(e)}break}case"read-write":{switch(t){case"textarea":{e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled")||s.add(e);break}case"input":{(!e.type||g.test(e.type)||y.test(e.type))&&!(e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled"))&&s.add(e);break}default:(0,A.isContentEditable)(e)&&s.add(e)}break}case"placeholder-shown":{let u;t==="textarea"?u=e:t==="input"&&(e.hasAttribute("type")?y.test(e.getAttribute("type"))&&(u=e):u=e),u&&e.value===""&&e.hasAttribute("placeholder")&&e.getAttribute("placeholder").trim().length&&s.add(e);break}case"checked":{(e.checked&&t==="input"&&e.hasAttribute("type")&&m.test(e.getAttribute("type"))||e.selected&&t==="option")&&s.add(e);break}case"indeterminate":{if(e.indeterminate&&t==="input"&&e.type==="checkbox"||t==="progress"&&!e.hasAttribute("value"))s.add(e);else if(t==="input"&&e.type==="radio"&&!e.hasAttribute("checked")){const u=e.name;let p=e.parentNode;for(;p&&p.localName!=="form";)p=p.parentNode;p||(p=this.#t.documentElement);let w;const E=p.getElementsByTagName("input"),N=E.length;if(N)for(let v=0;v<N;v++){const x=E[v];if(x.getAttribute("type")==="radio"&&(u?x.getAttribute("name")===u&&(w=!!x.checked):x.hasAttribute("name")||(w=!!x.checked),w))break}w||s.add(e)}break}case"default":{const u=/^(?:button|reset)$/,p=/^(?:image|submit)$/;if(t==="button"&&!(e.hasAttribute("type")&&u.test(e.getAttribute("type")))||t==="input"&&e.hasAttribute("type")&&p.test(e.getAttribute("type"))){let w=e.parentNode;for(;w&&w.localName!=="form";)w=w.parentNode;if(w){const E=this.#t.createTreeWalker(w,h.SHOW_ELEMENT);let N=E.firstChild();for(;N;){const v=N.localName;let x;if(v==="button"?x=!(N.hasAttribute("type")&&u.test(N.getAttribute("type"))):v==="input"&&(x=N.hasAttribute("type")&&p.test(N.getAttribute("type"))),x){N===e&&s.add(e);break}N=E.nextNode()}}}else if(t==="input"&&e.hasAttribute("type")&&m.test(e.getAttribute("type"))&&(e.checked||e.hasAttribute("checked")))s.add(e);else if(t==="option"){let w=!1,E=n;for(;E&&E.localName!=="datalist";){if(E.localName==="select"){(E.multiple||E.hasAttribute("multiple"))&&(w=!0);break}E=E.parentNode}if(w)(e.selected||e.hasAttribute("selected"))&&s.add(e);else{const N=new Set,v=this.#t.createTreeWalker(n,h.SHOW_ELEMENT);let x=v.firstChild();for(;x;){if(x.selected||x.hasAttribute("selected")){N.add(x);break}x=v.nextSibling()}N.size&&N.has(e)&&s.add(e)}}break}case"valid":{if(d.test(t))e.checkValidity()&&s.add(e);else if(t==="fieldset"){let u;const p=this.#t.createTreeWalker(e,h.SHOW_ELEMENT);let w=p.firstChild();for(;w&&!(d.test(w.localName)&&(u=w.checkValidity(),!u));)w=p.nextNode();u&&s.add(e)}break}case"invalid":{if(d.test(t))e.checkValidity()||s.add(e);else if(t==="fieldset"){let u;const p=this.#t.createTreeWalker(e,h.SHOW_ELEMENT);let w=p.firstChild();for(;w&&!(d.test(w.localName)&&(u=w.checkValidity(),!u));)w=p.nextNode();u||s.add(e)}break}case"in-range":{t==="input"&&!(e.readonly||e.hasAttribute("readonly"))&&!(e.disabled||e.hasAttribute("disabled"))&&e.hasAttribute("type")&&_.test(e.getAttribute("type"))&&!(e.validity.rangeUnderflow||e.validity.rangeOverflow)&&(e.hasAttribute("min")||e.hasAttribute("max")||e.getAttribute("type")==="range")&&s.add(e);break}case"out-of-range":{t==="input"&&!(e.readonly||e.hasAttribute("readonly"))&&!(e.disabled||e.hasAttribute("disabled"))&&e.hasAttribute("type")&&_.test(e.getAttribute("type"))&&(e.validity.rangeUnderflow||e.validity.rangeOverflow)&&s.add(e);break}case"required":{let u;if(/^(?:select|textarea)$/.test(t))u=e;else if(t==="input")if(e.hasAttribute("type")){const p=e.getAttribute("type");(p==="file"||m.test(p)||g.test(p)||y.test(p))&&(u=e)}else u=e;u&&(e.required||e.hasAttribute("required"))&&s.add(e);break}case"optional":{let u;if(/^(?:select|textarea)$/.test(t))u=e;else if(t==="input")if(e.hasAttribute("type")){const p=e.getAttribute("type");(p==="file"||m.test(p)||g.test(p)||y.test(p))&&(u=e)}else u=e;u&&!(e.required||e.hasAttribute("required"))&&s.add(e);break}case"root":{e===this.#t.documentElement&&s.add(e);break}case"empty":{if(e.hasChildNodes()){let u;const p=this.#t.createTreeWalker(e,h.SHOW_ALL);let w=p.firstChild();for(;w&&(u=w.nodeType!==h.ELEMENT_NODE&&w.nodeType!==h.TEXT_NODE,!!u);)w=p.nextSibling();u&&s.add(e)}else s.add(e);break}case"first-child":{(n&&e===n.firstElementChild||e===this.#s)&&s.add(e);break}case"last-child":{(n&&e===n.lastElementChild||e===this.#s)&&s.add(e);break}case"only-child":{(n&&e===n.firstElementChild&&e===n.lastElementChild||e===this.#s)&&s.add(e);break}case"first-of-type":{if(n){const[u]=this._collectNthOfType({a:0,b:1},e);u&&s.add(u)}else e===this.#s&&s.add(e);break}case"last-of-type":{if(n){const[u]=this._collectNthOfType({a:0,b:1,reverse:!0},e);u&&s.add(u)}else e===this.#s&&s.add(e);break}case"only-of-type":{if(n){const[u]=this._collectNthOfType({a:0,b:1},e);if(u===e){const[p]=this._collectNthOfType({a:0,b:1,reverse:!0},e);p===e&&s.add(e)}}else e===this.#s&&s.add(e);break}case"host":case"host-context":break;case"after":case"before":case"first-letter":case"first-line":{if(f){const u=`Unsupported pseudo-element ::${l}`;throw new DOMException(u,h.NOT_SUPPORTED_ERR)}break}case"active":case"autofill":case"blank":case"buffering":case"current":case"defined":case"focus-visible":case"fullscreen":case"future":case"hover":case"modal":case"muted":case"past":case"paused":case"picture-in-picture":case"playing":case"seeking":case"stalled":case"user-invalid":case"user-valid":case"volume-locked":case"-webkit-autofill":{if(f){const u=`Unsupported pseudo-class :${l}`;throw new DOMException(u,h.NOT_SUPPORTED_ERR)}break}default:if(l.startsWith("-webkit-")){if(f){const u=`Unsupported pseudo-class :${l}`;throw new DOMException(u,h.NOT_SUPPORTED_ERR)}}else if(!o){const u=`Unknown pseudo-class :${l}`;throw new DOMException(u,h.SYNTAX_ERR)}}}return s}_matchShadowHostPseudoClass(a,e){const{children:c}=a,i=(0,S.unescapeSelector)(a.name);let t;if(Array.isArray(c)){const[n]=(0,S.walkAST)(c[0]),[...o]=n,{host:f}=e;if(i==="host"){let l;for(const s of o){const{type:r}=s;if(r===h.COMBINATOR){const d=`Invalid selector ${(0,S.generateCSS)(a)}`;throw new DOMException(d,h.SYNTAX_ERR)}if(l=this._matchSelector(s,f).has(f),!l)break}l&&(t=e)}else if(i==="host-context"){let l,s=f;for(;s;){for(const r of o){const{type:b}=r;if(b===h.COMBINATOR){const k=`Invalid selector ${(0,S.generateCSS)(a)}`;throw new DOMException(k,h.SYNTAX_ERR)}if(l=this._matchSelector(r,s).has(s),!l)break}if(l)break;s=s.parentNode}l&&(t=e)}}else if(i==="host")t=e;else{const n=`Invalid selector :${i}`;throw new DOMException(n,h.SYNTAX_ERR)}return t??null}_matchSelector(a,e,c){const{type:i}=a,t=(0,S.unescapeSelector)(a.name);let n=new Set;if(e.nodeType===h.ELEMENT_NODE)switch(i){case h.SELECTOR_PSEUDO_CLASS:{const o=this._matchPseudoClassSelector(a,e,c);o.size&&(n=o);break}case h.SELECTOR_PSEUDO_ELEMENT:{(0,R.matchPseudoElementSelector)(t,c);break}default:{const o=(0,R.matchSelector)(a,e,c);o&&n.add(o)}}else if(this.#h&&i===h.SELECTOR_PSEUDO_CLASS&&e.nodeType===h.DOCUMENT_FRAGMENT_NODE){if(t!=="has"&&h.REG_LOGICAL_PSEUDO.test(t)){const o=this._matchPseudoClassSelector(a,e,c);o.size&&(n=o)}else if(h.REG_SHADOW_HOST.test(t)){const o=this._matchShadowHostPseudoClass(a,e,c);o&&n.add(o)}}return n}_matchLeaves(a,e,c){let i;if(this.#o.has(a)){const t=this.#o.get(a);if(t.has(e))i=t.get(e);else{for(const n of a)if(i=this._matchSelector(n,e,c).has(e),!i)break;t.set(e,i),this.#o.set(a,t)}}else{for(const n of a)if(i=this._matchSelector(n,e,c).has(e),!i)break;const t=new WeakMap;t.set(e,i),this.#o.set(a,t)}return!!i}_matchHTMLCollection(a,e={}){const{compound:c,filterLeaves:i}=e;let t=new Set;const n=a.length;if(n)if(c)for(let o=0;o<n;o++){const f=a[o];this._matchLeaves(i,f,e)&&t.add(f)}else{const o=[].slice.call(a);t=new Set(o)}return t}_findDescendantNodes(a,e,c){const[i,...t]=a,{type:n}=i,o=(0,S.unescapeSelector)(i.name),f=t.length>0;let l=new Set,s=!1;if(this.#h)s=!0;else switch(n){case h.SELECTOR_PSEUDO_ELEMENT:{(0,R.matchPseudoElementSelector)(o,c);break}case h.SELECTOR_ID:{if(this.#s.nodeType===h.ELEMENT_NODE)s=!0;else{const r=this.#s.getElementById(o);r&&r!==e&&e.contains(r)&&(f?this._matchLeaves(t,r,c)&&l.add(r):l.add(r))}break}case h.SELECTOR_CLASS:{const r=e.getElementsByClassName(o);l=this._matchHTMLCollection(r,{compound:f,filterLeaves:t});break}case h.SELECTOR_TYPE:{if(this.#t.contentType==="text/html"&&!/[*|]/.test(o)){const r=e.getElementsByTagName(o);l=this._matchHTMLCollection(r,{compound:f,filterLeaves:t})}else s=!0;break}default:s=!0}return{nodes:l,pending:s}}_matchCombinator(a,e,c={}){const{combo:i,leaves:t}=a,{name:n}=i,{dir:o}=c;let f=new Set;if(o===C)switch(n){case"+":{const l=e.nextElementSibling;l&&this._matchLeaves(t,l,c)&&f.add(l);break}case"~":{const{parentNode:l}=e;if(l){const s=this.#t.createTreeWalker(l,h.SHOW_ELEMENT);let r=this._traverse(e,s);for(r===e&&(r=s.nextSibling());r;)this._matchLeaves(t,r,c)&&f.add(r),r=s.nextSibling()}break}case">":{const l=this.#t.createTreeWalker(e,h.SHOW_ELEMENT);let s=l.firstChild();for(;s;)this._matchLeaves(t,s,c)&&f.add(s),s=l.nextSibling();break}case" ":default:{const{nodes:l,pending:s}=this._findDescendantNodes(t,e);if(l.size)f=l;else if(s){const r=this.#t.createTreeWalker(e,h.SHOW_ELEMENT);let b=r.nextNode();for(;b;)this._matchLeaves(t,b,c)&&f.add(b),b=r.nextNode()}}}else switch(n){case"+":{const l=e.previousElementSibling;l&&this._matchLeaves(t,l,c)&&f.add(l);break}case"~":{const l=this.#t.createTreeWalker(e.parentNode,h.SHOW_ELEMENT);let s=l.firstChild();for(;s&&s!==e;)this._matchLeaves(t,s,c)&&f.add(s),s=l.nextSibling();break}case">":{const l=e.parentNode;l&&this._matchLeaves(t,l,c)&&f.add(l);break}case" ":default:{const l=[];let s=e.parentNode;for(;s;)this._matchLeaves(t,s,c)&&l.push(s),s=s.parentNode;l.length&&(f=new Set(l.reverse()))}}return f}_findNode(a,e={}){const{node:c}=e;let i,t=this._traverse(c,this.#r);if(t)for(t.nodeType!==h.ELEMENT_NODE?t=this.#r.nextNode():t===c&&t!==this.#s&&(t=this.#r.nextNode());t;){let n;if(this.#e.nodeType===h.ELEMENT_NODE?t===this.#e?n=!0:n=this.#e.contains(t):n=!0,n&&this._matchLeaves(a,t,{warn:this.#i})){i=t;break}t=this.#r.nextNode()}return i??null}_matchSelf(a){const e=[];let c=!1;return this._matchLeaves(a,this.#e)&&(e.push(this.#e),c=!0),[e,c]}_findLineal(a,e={}){const{complex:c,compound:i,filterLeaves:t}=e,n=[];let o=!1,f=this._matchLeaves([a],this.#e);if(f&&!c&&(i?(f=this._matchLeaves(t,this.#e),f&&(n.push(this.#e),o=!0)):(n.push(this.#e),o=!0)),!f||c){f&&(n.push(this.#e),i||(o=!0));let l=this.#e.parentNode;for(;l&&(f=this._matchLeaves([a],l),f&&(n.push(l),i||(o=!0)),l.parentNode);)l=l.parentNode}return[n,o]}_findFirst(a){const e=[];let c=!1;const i=this._findNode(a,{node:this.#e});return i&&(e.push(i),c=!0),[e,c]}_findFromHTMLCollection(a,e={}){const{compound:c,filterLeaves:i}=e;let t=[],n=!1;const o=a.length;if(o)if(this.#e.nodeType===h.ELEMENT_NODE)for(let f=0;f<o;f++){const l=a[f];(l===this.#e||(0,A.isInclusive)(l,this.#e))&&(c?this._matchLeaves(i,l,{warn:this.#i})&&(t.push(l),n=!0):(t.push(l),n=!0))}else if(c)for(let f=0;f<o;f++){const l=a[f];this._matchLeaves(i,l,{warn:this.#i})&&(t.push(l),n=!0)}else t=[].slice.call(a),n=!0;return[t,n]}_findEntryNodes(a,e,c){const{leaves:i}=a,[t,...n]=i,{type:o}=t,f=(0,S.unescapeSelector)(t.name),l=n.length>0;let s=[],r=!1,b=!1;switch(o){case h.SELECTOR_PSEUDO_ELEMENT:{(0,R.matchPseudoElementSelector)(f,{warn:this.#i});break}case h.SELECTOR_ID:{if(e===P)[s,r]=this._matchSelf(i);else if(e===M)[s,r]=this._findLineal(t,{complex:c,compound:l,filterLeaves:n});else if(e===$&&this.#s.nodeType!==h.ELEMENT_NODE){const d=this.#s.getElementById(f);d&&(l?this._matchLeaves(n,d,{warn:this.#i})&&(s.push(d),r=!0):(s.push(d),r=!0))}else b=!0;break}case h.SELECTOR_CLASS:{if(e===P)[s,r]=this._matchSelf(i);else if(e===M)[s,r]=this._findLineal(t,{complex:c,compound:l,filterLeaves:n});else if(e===$)[s,r]=this._findFirst(i);else if(this.#s.nodeType===h.DOCUMENT_NODE){const d=this.#s.getElementsByClassName(f);[s,r]=this._findFromHTMLCollection(d,{compound:l,filterLeaves:n})}else b=!0;break}case h.SELECTOR_TYPE:{if(e===P)[s,r]=this._matchSelf(i);else if(e===M)[s,r]=this._findLineal(t,{complex:c,compound:l,filterLeaves:n});else if(this.#t.contentType==="text/html"&&this.#s.nodeType===h.DOCUMENT_NODE&&!/[*|]/.test(f)){const d=this.#s.getElementsByTagName(f);[s,r]=this._findFromHTMLCollection(d,{compound:l,filterLeaves:n})}else b=!0;break}default:if(e!==M&&h.REG_SHADOW_HOST.test(f)){if(this.#h&&this.#e.nodeType===h.DOCUMENT_FRAGMENT_NODE){const d=this._matchShadowHostPseudoClass(t,this.#e);d&&(s.push(d),r=!0)}}else e===P?[s,r]=this._matchSelf(i):e===M?[s,r]=this._findLineal(t,{complex:c,compound:l,filterLeaves:n}):e===$?[s,r]=this._findFirst(i):b=!0}return{compound:l,filtered:r,nodes:s,pending:b}}_getEntryTwig(a,e){const c=a.length,i=c>1,t=a[0];let n,o;if(i){const{combo:f,leaves:[{name:l,type:s}]}=t,r=a[c-1],{leaves:[{name:b,type:d}]}=r;if(d===h.SELECTOR_PSEUDO_ELEMENT||d===h.SELECTOR_ID)n=O,o=r;else if(s===h.SELECTOR_PSEUDO_ELEMENT||s===h.SELECTOR_ID)n=C,o=t;else if(e===L)if(l==="*"&&s===h.SELECTOR_TYPE)n=O,o=r;else if(b==="*"&&d===h.SELECTOR_TYPE)n=C,o=t;else if(c===2){const{name:k}=f;/^[+~]$/.test(k)?(n=O,o=r):(n=C,o=t)}else n=C,o=t;else if(b==="*"&&d===h.SELECTOR_TYPE)n=C,o=t;else if(l==="*"&&s===h.SELECTOR_TYPE)n=O,o=r;else{let k,m;for(const{combo:g,leaves:[_]}of a){const{type:y}=_,u=(0,S.unescapeSelector)(_.name);if(y===h.SELECTOR_PSEUDO_CLASS&&u==="dir"){k=!1;break}if(g&&!m){const{name:p}=g;/^[+~]$/.test(p)&&(k=!0,m=!0)}}k?(n=C,o=t):(n=O,o=r)}}else n=O,o=t;return{complex:i,dir:n,twig:o}}_collectNodes(a){const e=this.#a.values();if(a===L||a===$){const c=new Set;let i=0;for(const{branch:t}of e){const{complex:n,dir:o,twig:f}=this._getEntryTwig(t,a),{compound:l,filtered:s,nodes:r,pending:b}=this._findEntryNodes(f,a,n);r.length?(this.#a[i].find=!0,this.#c[i]=r):b&&c.add(new Map([["index",i],["twig",f]])),this.#a[i].dir=o,this.#a[i].filtered=s||!l,i++}if(c.size){let t,n;this.#e!==this.#s&&this.#e.nodeType===h.ELEMENT_NODE?(t=this.#e,n=this.#r):(t=this.#s,n=this.#d);let o=this._traverse(t,n);for(;o;){let f=!1;if(this.#e.nodeType===h.ELEMENT_NODE?o===this.#e?f=!0:f=this.#e.contains(o):f=!0,f)for(const l of c){const{leaves:s}=l.get("twig");if(this._matchLeaves(s,o,{warn:this.#i})){const b=l.get("index");this.#a[b].filtered=!0,this.#a[b].find=!0,this.#c[b].push(o)}}o=n.nextNode()}}}else{let c=0;for(const{branch:i}of e){const t=i[i.length-1],n=i.length>1,{compound:o,filtered:f,nodes:l}=this._findEntryNodes(t,a,n);l.length&&(this.#a[c].find=!0,this.#c[c]=l),this.#a[c].dir=O,this.#a[c].filtered=f||!o,c++}}return[this.#a,this.#c]}_matchNodes(a){const[...e]=this.#a,c=e.length;let i=new Set;for(let t=0;t<c;t++){const{branch:n,dir:o,filtered:f,find:l}=e[t],s=n.length;if(s&&l){const r=this.#c[t],b=r.length,d=s-1;if(d===0){const{leaves:[,...k]}=n[0];if((a===L||a===$)&&this.#e.nodeType===h.ELEMENT_NODE)for(let m=0;m<b;m++){const g=r[m];if(g!==this.#e&&this.#e.contains(g)&&(i.add(g),a!==L))break}else if(k.length)for(let m=0;m<b;m++){const g=r[m];if((f||this._matchLeaves(k,g,{warn:this.#i}))&&(i.add(g),a!==L))break}else if(a===L)if(i.size){const m=[...i];i=new Set([...m,...r]),this.#f=!0}else i=new Set([...r]);else{const[m]=[...r];i.add(m)}}else if(o===C){let{combo:k,leaves:m}=n[0],g;for(let _=0;_<b;_++){const y=r[_];let u=new Set([y]);for(let p=1;p<s;p++){const{combo:w,leaves:E}=n[p],N=[];for(const v of u){const x={combo:k,leaves:E},D=this._matchCombinator(x,v,{dir:o,warn:this.#i});D.size&&N.push(...D)}if(N.length)if(p===d){if(a===L){if(i.size){const v=[...i];i=new Set([...v,...N])}else i=new Set([...N]);this.#f=!0}else{const[v]=(0,A.sortNodes)(N);i.add(v)}g=!0}else k=w,u=new Set(N),g=!1;else{g=!1;break}}if(g&&a!==L)break}if(!g&&a===$){const[_]=[...r];let y=this._findNode(m,{node:_});for(;y;){let u=new Set([y]);for(let p=1;p<s;p++){const{combo:w,leaves:E}=n[p],N=[];for(const v of u){const x={combo:k,leaves:E},D=this._matchCombinator(x,v,{dir:o,warn:this.#i});D.size&&N.push(...D)}if(N.length)if(p===d){const[v]=(0,A.sortNodes)(N);i.add(v),g=!0}else k=w,u=new Set(N),g=!1;else{g=!1;break}}if(g)break;y=this._findNode(m,{node:y}),u=new Set([y])}}}else{const{leaves:k}=n[d];let m;for(let g=0;g<b;g++){const _=r[g];let y=new Set([_]);for(let u=d-1;u>=0;u--){const p=n[u],w=[];for(const E of y){const N=this._matchCombinator(p,E,{dir:o,warn:this.#i});N.size&&w.push(...N)}if(w.length)u===0?(i.add(_),m=!0,a===L&&s>1&&i.size>1&&(this.#f=!0)):(y=new Set(w),m=!1);else{m=!1;break}}if(m&&a!==L)break}if(!m&&a===$){const[g]=[...r];let _=this._findNode(k,{node:g});for(;_;){let y=new Set([_]);for(let u=d-1;u>=0;u--){const p=n[u],w=[];for(const E of y){const N=this._matchCombinator(p,E,{dir:o,warn:this.#i});N.size&&w.push(...N)}if(w.length)u===0?(i.add(_),m=!0):(y=new Set(w),m=!1);else{m=!1;break}}if(m)break;_=this._findNode(k,{node:_}),y=new Set([_])}}}}}return i}_find(a){return this._collectNodes(a),this._matchNodes(a)}matches(a,e,c){let i;try{if(this.#e=this._setup(a,e,c),e.nodeType!==h.ELEMENT_NODE){const n=`Unexpected node ${e.nodeName}`;throw new TypeError(n)}i=this._find(P).size}catch(t){this._onError(t)}return!!i}closest(a,e,c){let i;try{if(this.#e=this._setup(a,e,c),e.nodeType!==h.ELEMENT_NODE){const n=`Unexpected node ${e.nodeName}`;throw new TypeError(n)}const t=this._find(M);if(t.size){let n=this.#e;for(;n;){if(t.has(n)){i=n;break}n=n.parentNode}}}catch(t){this._onError(t)}return i??null}querySelector(a,e,c){let i;try{this.#e=this._setup(a,e,c),this._prepareTreeWalkers(e);const t=this._find($);t.delete(this.#e),t.size&&([i]=(0,A.sortNodes)(t))}catch(t){this._onError(t)}return i??null}querySelectorAll(a,e,c){let i;try{this.#e=this._setup(a,e,c),this._prepareTreeWalkers(e);const t=this._find(L);t.delete(this.#e),t.size&&(this.#f?i=(0,A.sortNodes)(t):i=[...t])}catch(t){this._onError(t)}return i??[]}}0&&(module.exports={Finder});
 //# sourceMappingURL=finder.js.map

package/dist/cjs/js/finder.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/js/finder.js"],
-  "sourcesContent": ["/**\n * finder.js\n */\n\n/* import */\nimport isCustomElementName from 'is-potential-custom-element-name';\nimport {\n  getDirectionality, isContentEditable, isInclusive, isInShadowTree,\n  prepareDOMObjects, sortNodes\n} from './dom-util.js';\nimport { matchSelector, matchPseudoElementSelector } from './matcher.js';\nimport {\n  generateCSS, parseSelector, sortAST, unescapeSelector, walkAST\n} from './parser.js';\n\n/* constants */\nimport {\n  ALPHA_NUM, COMBINATOR, DOCUMENT_FRAGMENT_NODE, DOCUMENT_NODE, ELEMENT_NODE,\n  NOT_SUPPORTED_ERR, REG_LOGICAL_PSEUDO, REG_SHADOW_HOST, SELECTOR_CLASS,\n  SELECTOR_ID, SELECTOR_PSEUDO_CLASS, SELECTOR_PSEUDO_ELEMENT, SELECTOR_TYPE,\n  SHOW_ALL, SHOW_DOCUMENT, SHOW_DOCUMENT_FRAGMENT, SHOW_ELEMENT, SYNTAX_ERR,\n  TEXT_NODE\n} from './constant.js';\nconst DIR_NEXT = 'next';\nconst DIR_PREV = 'prev';\nconst TARGET_ALL = 'all';\nconst TARGET_FIRST = 'first';\nconst TARGET_LINEAL = 'lineal';\nconst TARGET_SELF = 'self';\nconst WALKER_FILTER = SHOW_DOCUMENT | SHOW_DOCUMENT_FRAGMENT | SHOW_ELEMENT;\n\n/**\n * Finder\n * NOTE: #ast[i] corresponds to #nodes[i]\n * #ast: [\n *   {\n *     branch: branch[],\n *     dir: string|null,\n *     filtered: boolean,\n *     find: boolean\n *   },\n *   {\n *     branch: branch[],\n *     dir: string|null,\n *     filtered: boolean,\n *     find: boolean\n *   }\n * ]\n * #nodes: [\n *   [node{}, node{}],\n *   [node{}, node{}, node{}]\n * ]\n * branch[]: [twig{}, twig{}]\n * twig{}: {\n *   combo: leaf{}|null,\n *   leaves: leaves[]\n * }\n * leaves[]: [leaf{}, leaf{}, leaf{}]\n * leaf{}: CSSTree AST object\n * node{}: Element node\n */\nexport class Finder {\n  /* private fields */\n  #ast;\n  #cache;\n  #document;\n  #finder;\n  #node;\n  #nodes;\n  #noexcept;\n  #results;\n  #root;\n  #shadow;\n  #sort;\n  #tree;\n  #warn;\n  #window;\n\n  /**\n   * construct\n   */\n  constructor() {\n    this.#cache = new WeakMap();\n  }\n\n  /**\n   * handle error\n   * @private\n   * @param {Error} e - Error\n   * @throws Error\n   * @returns {void}\n   */\n  _onError(e) {\n    if (!this.#noexcept) {\n      if (e instanceof DOMException ||\n          (this.#window && e instanceof this.#window.DOMException)) {\n        if (e.name === NOT_SUPPORTED_ERR) {\n          if (this.#warn) {\n            console.warn(e.message);\n          }\n        } else if (this.#window) {\n          throw new this.#window.DOMException(e.message, e.name);\n        } else {\n          throw e;\n        }\n      } else {\n        throw e;\n      }\n    }\n  }\n\n  /**\n   * setup finder\n   * @private\n   * @param {string} selector - CSS selector\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @param {object} opt - options\n   * @param {boolean} [opt.noexcept] - no exception\n   * @param {boolean} [opt.warn] - console warn\n   * @returns {object} - node\n   */\n  _setup(selector, node, opt = {}) {\n    const { noexcept, warn } = opt;\n    this.#noexcept = !!noexcept;\n    this.#warn = !!warn;\n    this.#node = node;\n    [this.#window, this.#document, this.#root] = prepareDOMObjects(node);\n    this.#shadow = isInShadowTree(node);\n    [this.#ast, this.#nodes] = this._correspond(selector);\n    this.#results = new WeakMap();\n    return node;\n  }\n\n  /**\n   * correspond #ast and #nodes\n   * @private\n   * @param {string} selector - CSS selector\n   * @returns {Array.<Array.<object|undefined>>} - array of #ast and #nodes\n   */\n  _correspond(selector) {\n    const nodes = [];\n    let ast;\n    let cachedItem = this.#document && this.#cache.get(this.#document);\n    if (cachedItem && cachedItem.has(`${selector}`)) {\n      ast = cachedItem.get(selector);\n    }\n    if (ast) {\n      const l = ast.length;\n      for (let i = 0; i < l; i++) {\n        ast[i].dir = null;\n        ast[i].filtered = false;\n        ast[i].find = false;\n        nodes[i] = [];\n      }\n    } else {\n      let cssAst;\n      try {\n        cssAst = parseSelector(selector);\n      } catch (e) {\n        this._onError(e);\n      }\n      const branches = walkAST(cssAst);\n      ast = [];\n      let i = 0;\n      for (const [...items] of branches) {\n        const branch = [];\n        let item = items.shift();\n        if (item && item.type !== COMBINATOR) {\n          const leaves = new Set();\n          while (item) {\n            if (item.type === COMBINATOR) {\n              const [nextItem] = items;\n              if (nextItem.type === COMBINATOR) {\n                const msg = `Invalid selector ${selector}`;\n                throw new DOMException(msg, SYNTAX_ERR);\n              }\n              branch.push({\n                combo: item,\n                leaves: sortAST(leaves)\n              });\n              leaves.clear();\n            } else if (item) {\n              leaves.add(item);\n            }\n            if (items.length) {\n              item = items.shift();\n            } else {\n              branch.push({\n                combo: null,\n                leaves: sortAST(leaves)\n              });\n              leaves.clear();\n              break;\n            }\n          }\n        }\n        ast.push({\n          branch,\n          dir: null,\n          filtered: false,\n          find: false\n        });\n        nodes[i] = [];\n        i++;\n      }\n      if (this.#document) {\n        if (!cachedItem) {\n          cachedItem = new Map();\n        }\n        cachedItem.set(`${selector}`, ast);\n        this.#cache.set(this.#document, cachedItem);\n      }\n    }\n    return [\n      ast,\n      nodes\n    ];\n  }\n\n  /**\n   * prepare tree walkers\n   * @private\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @returns {Array} - [#tree, #finder]\n   */\n  _prepareTreeWalkers(node) {\n    this.#tree = this.#document.createTreeWalker(this.#root, WALKER_FILTER);\n    this.#finder = this.#document.createTreeWalker(node, WALKER_FILTER);\n    this.#sort = false;\n    return [\n      this.#tree,\n      this.#finder\n    ];\n  }\n\n  /**\n   * traverse tree walker\n   * @private\n   * @param {object} [node] - Element node\n   * @param {object} [walker] - tree walker\n   * @returns {?object} - current node\n   */\n  _traverse(node = {}, walker = this.#tree) {\n    let current;\n    let refNode = walker.currentNode;\n    if (node.nodeType === ELEMENT_NODE && refNode === node) {\n      current = refNode;\n    } else {\n      if (refNode !== walker.root) {\n        while (refNode) {\n          if (refNode === walker.root ||\n              (node.nodeType === ELEMENT_NODE && refNode === node)) {\n            break;\n          }\n          refNode = walker.parentNode();\n        }\n      }\n      if (node.nodeType === ELEMENT_NODE) {\n        while (refNode) {\n          if (refNode === node) {\n            current = refNode;\n            break;\n          }\n          refNode = walker.nextNode();\n        }\n      } else {\n        current = refNode;\n      }\n    }\n    return current ?? null;\n  }\n\n  /**\n   * collect nth child\n   * @private\n   * @param {object} anb - An+B options\n   * @param {number} anb.a - a\n   * @param {number} anb.b - b\n   * @param {boolean} [anb.reverse] - reverse order\n   * @param {object} [anb.selector] - AST\n   * @param {object} node - Element node\n   * @param {object} opt - options\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _collectNthChild(anb, node, opt) {\n    const { a, b, reverse, selector } = anb;\n    const { parentNode } = node;\n    let matched = new Set();\n    let selectorBranches;\n    if (selector) {\n      if (this.#cache.has(selector)) {\n        selectorBranches = this.#cache.get(selector);\n      } else {\n        selectorBranches = walkAST(selector);\n        this.#cache.set(selector, selectorBranches);\n      }\n    }\n    if (parentNode) {\n      const walker = this.#document.createTreeWalker(parentNode, WALKER_FILTER);\n      let l = 0;\n      let refNode = walker.firstChild();\n      while (refNode) {\n        l++;\n        refNode = walker.nextSibling();\n      }\n      refNode = this._traverse(parentNode, walker);\n      const selectorNodes = new Set();\n      if (selectorBranches) {\n        refNode = this._traverse(parentNode, walker);\n        refNode = walker.firstChild();\n        while (refNode) {\n          let bool;\n          for (const leaves of selectorBranches) {\n            bool = this._matchLeaves(leaves, refNode, opt);\n            if (!bool) {\n              break;\n            }\n          }\n          if (bool) {\n            selectorNodes.add(refNode);\n          }\n          refNode = walker.nextSibling();\n        }\n      }\n      // :first-child, :last-child, :nth-child(b of S), :nth-last-child(b of S)\n      if (a === 0) {\n        if (b > 0 && b <= l) {\n          if (selectorNodes.size) {\n            let i = 0;\n            refNode = this._traverse(parentNode, walker);\n            if (reverse) {\n              refNode = walker.lastChild();\n            } else {\n              refNode = walker.firstChild();\n            }\n            while (refNode) {\n              if (selectorNodes.has(refNode)) {\n                if (i === b - 1) {\n                  matched.add(refNode);\n                  break;\n                }\n                i++;\n              }\n              if (reverse) {\n                refNode = walker.previousSibling();\n              } else {\n                refNode = walker.nextSibling();\n              }\n            }\n          } else if (!selector) {\n            let i = 0;\n            refNode = this._traverse(parentNode, walker);\n            if (reverse) {\n              refNode = walker.lastChild();\n            } else {\n              refNode = walker.firstChild();\n            }\n            while (refNode) {\n              if (i === b - 1) {\n                matched.add(refNode);\n                break;\n              }\n              if (reverse) {\n                refNode = walker.previousSibling();\n              } else {\n                refNode = walker.nextSibling();\n              }\n              i++;\n            }\n          }\n        }\n      // :nth-child()\n      } else {\n        let nth = b - 1;\n        if (a > 0) {\n          while (nth < 0) {\n            nth += a;\n          }\n        }\n        if (nth >= 0 && nth < l) {\n          let i = 0;\n          let j = a > 0 ? 0 : b - 1;\n          refNode = this._traverse(parentNode, walker);\n          if (reverse) {\n            refNode = walker.lastChild();\n          } else {\n            refNode = walker.firstChild();\n          }\n          while (refNode) {\n            if (refNode && nth >= 0 && nth < l) {\n              if (selectorNodes.size) {\n                if (selectorNodes.has(refNode)) {\n                  if (j === nth) {\n                    matched.add(refNode);\n                    nth += a;\n                  }\n                  if (a > 0) {\n                    j++;\n                  } else {\n                    j--;\n                  }\n                }\n              } else if (i === nth) {\n                if (!selector) {\n                  matched.add(refNode);\n                }\n                nth += a;\n              }\n              if (reverse) {\n                refNode = walker.previousSibling();\n              } else {\n                refNode = walker.nextSibling();\n              }\n              i++;\n            } else {\n              break;\n            }\n          }\n        }\n      }\n      if (reverse && matched.size > 1) {\n        const m = [...matched];\n        matched = new Set(m.reverse());\n      }\n    } else if (node === this.#root && (a + b) === 1) {\n      if (selectorBranches) {\n        let bool;\n        for (const leaves of selectorBranches) {\n          bool = this._matchLeaves(leaves, node, opt);\n          if (bool) {\n            break;\n          }\n        }\n        if (bool) {\n          matched.add(node);\n        }\n      } else {\n        matched.add(node);\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * collect nth of type\n   * @private\n   * @param {object} anb - An+B options\n   * @param {number} anb.a - a\n   * @param {number} anb.b - b\n   * @param {boolean} [anb.reverse] - reverse order\n   * @param {object} node - Element node\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _collectNthOfType(anb, node) {\n    const { a, b, reverse } = anb;\n    const { localName, parentNode, prefix } = node;\n    let matched = new Set();\n    if (parentNode) {\n      const walker = this.#document.createTreeWalker(parentNode, WALKER_FILTER);\n      let l = 0;\n      let refNode = walker.firstChild();\n      while (refNode) {\n        l++;\n        refNode = walker.nextSibling();\n      }\n      // :first-of-type, :last-of-type\n      if (a === 0) {\n        if (b > 0 && b <= l) {\n          let j = 0;\n          refNode = this._traverse(parentNode, walker);\n          if (reverse) {\n            refNode = walker.lastChild();\n          } else {\n            refNode = walker.firstChild();\n          }\n          while (refNode) {\n            const { localName: itemLocalName, prefix: itemPrefix } = refNode;\n            if (itemLocalName === localName && itemPrefix === prefix) {\n              if (j === b - 1) {\n                matched.add(refNode);\n                break;\n              }\n              j++;\n            }\n            if (reverse) {\n              refNode = walker.previousSibling();\n            } else {\n              refNode = walker.nextSibling();\n            }\n          }\n        }\n      // :nth-of-type()\n      } else {\n        let nth = b - 1;\n        if (a > 0) {\n          while (nth < 0) {\n            nth += a;\n          }\n        }\n        if (nth >= 0 && nth < l) {\n          let j = a > 0 ? 0 : b - 1;\n          refNode = this._traverse(parentNode, walker);\n          if (reverse) {\n            refNode = walker.lastChild();\n          } else {\n            refNode = walker.firstChild();\n          }\n          while (refNode) {\n            const { localName: itemLocalName, prefix: itemPrefix } = refNode;\n            if (itemLocalName === localName && itemPrefix === prefix) {\n              if (j === nth) {\n                matched.add(refNode);\n                nth += a;\n              }\n              if (nth < 0 || nth >= l) {\n                break;\n              } else if (a > 0) {\n                j++;\n              } else {\n                j--;\n              }\n            }\n            if (reverse) {\n              refNode = walker.previousSibling();\n            } else {\n              refNode = walker.nextSibling();\n            }\n          }\n        }\n      }\n      if (reverse && matched.size > 1) {\n        const m = [...matched];\n        matched = new Set(m.reverse());\n      }\n    } else if (node === this.#root && (a + b) === 1) {\n      matched.add(node);\n    }\n    return matched;\n  }\n\n  /**\n   * match An+B\n   * @private\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @param {string} nthName - nth pseudo-class name\n   * @param {object} opt - options\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchAnPlusB(ast, node, nthName, opt) {\n    const {\n      nth: {\n        a,\n        b,\n        name: nthIdentName\n      },\n      selector\n    } = ast;\n    const identName = unescapeSelector(nthIdentName);\n    const anbMap = new Map();\n    if (identName) {\n      if (identName === 'even') {\n        anbMap.set('a', 2);\n        anbMap.set('b', 0);\n      } else if (identName === 'odd') {\n        anbMap.set('a', 2);\n        anbMap.set('b', 1);\n      }\n      if (nthName.indexOf('last') > -1) {\n        anbMap.set('reverse', true);\n      }\n    } else {\n      if (typeof a === 'string' && /-?\\d+/.test(a)) {\n        anbMap.set('a', a * 1);\n      } else {\n        anbMap.set('a', 0);\n      }\n      if (typeof b === 'string' && /-?\\d+/.test(b)) {\n        anbMap.set('b', b * 1);\n      } else {\n        anbMap.set('b', 0);\n      }\n      if (nthName.indexOf('last') > -1) {\n        anbMap.set('reverse', true);\n      }\n    }\n    let matched = new Set();\n    if (anbMap.has('a') && anbMap.has('b')) {\n      if (/^nth-(?:last-)?child$/.test(nthName)) {\n        if (selector) {\n          anbMap.set('selector', selector);\n        }\n        const anb = Object.fromEntries(anbMap);\n        const nodes = this._collectNthChild(anb, node, opt);\n        if (nodes.size) {\n          matched = nodes;\n        }\n      } else if (/^nth-(?:last-)?of-type$/.test(nthName)) {\n        const anb = Object.fromEntries(anbMap);\n        const nodes = this._collectNthOfType(anb, node);\n        if (nodes.size) {\n          matched = nodes;\n        }\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * match directionality pseudo-class - :dir()\n   * @private\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @returns {?object} - matched node\n   */\n  _matchDirectionPseudoClass(ast, node) {\n    const astName = unescapeSelector(ast.name);\n    const dir = getDirectionality(node);\n    let res;\n    if (astName === dir) {\n      res = node;\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match language pseudo-class - :lang()\n   * @private\n   * @see https://datatracker.ietf.org/doc/html/rfc4647#section-3.3.1\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @returns {?object} - matched node\n   */\n  _matchLanguagePseudoClass(ast, node) {\n    const astName = unescapeSelector(ast.name);\n    let res;\n    if (astName === '*') {\n      if (node.hasAttribute('lang')) {\n        if (node.getAttribute('lang')) {\n          res = node;\n        }\n      } else {\n        let parent = node.parentNode;\n        while (parent) {\n          if (parent.nodeType === ELEMENT_NODE) {\n            if (parent.hasAttribute('lang')) {\n              if (parent.getAttribute('lang')) {\n                res = node;\n              }\n              break;\n            }\n            parent = parent.parentNode;\n          } else {\n            break;\n          }\n        }\n      }\n    } else if (astName) {\n      const langPart = `(?:-${ALPHA_NUM})*`;\n      const regLang = new RegExp(`^(?:\\\\*-)?${ALPHA_NUM}${langPart}$`, 'i');\n      if (regLang.test(astName)) {\n        let regExtendedLang;\n        if (astName.indexOf('-') > -1) {\n          const [langMain, langSub, ...langRest] = astName.split('-');\n          let extendedMain;\n          if (langMain === '*') {\n            extendedMain = `${ALPHA_NUM}${langPart}`;\n          } else {\n            extendedMain = `${langMain}${langPart}`;\n          }\n          const extendedSub = `-${langSub}${langPart}`;\n          const len = langRest.length;\n          let extendedRest = '';\n          if (len) {\n            for (let i = 0; i < len; i++) {\n              extendedRest += `-${langRest[i]}${langPart}`;\n            }\n          }\n          regExtendedLang =\n            new RegExp(`^${extendedMain}${extendedSub}${extendedRest}$`, 'i');\n        } else {\n          regExtendedLang = new RegExp(`^${astName}${langPart}$`, 'i');\n        }\n        if (node.hasAttribute('lang')) {\n          if (regExtendedLang.test(node.getAttribute('lang'))) {\n            res = node;\n          }\n        } else {\n          let parent = node.parentNode;\n          while (parent) {\n            if (parent.nodeType === ELEMENT_NODE) {\n              if (parent.hasAttribute('lang')) {\n                const value = parent.getAttribute('lang');\n                if (regExtendedLang.test(value)) {\n                  res = node;\n                }\n                break;\n              }\n              parent = parent.parentNode;\n            } else {\n              break;\n            }\n          }\n        }\n      }\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match :has() pseudo-class function\n   * @private\n   * @param {Array.<object>} leaves - AST leaves\n   * @param {object} node - Element node\n   * @param {object} opt - options\n   * @returns {boolean} - result\n   */\n  _matchHasPseudoFunc(leaves, node, opt = {}) {\n    let bool;\n    if (Array.isArray(leaves) && leaves.length) {\n      const [leaf] = leaves;\n      const { type: leafType } = leaf;\n      let combo;\n      if (leafType === COMBINATOR) {\n        combo = leaves.shift();\n      } else {\n        combo = {\n          name: ' ',\n          type: COMBINATOR\n        };\n      }\n      const twigLeaves = [];\n      while (leaves.length) {\n        const [item] = leaves;\n        const { type: itemType } = item;\n        if (itemType === COMBINATOR) {\n          break;\n        } else {\n          twigLeaves.push(leaves.shift());\n        }\n      }\n      const twig = {\n        combo,\n        leaves: twigLeaves\n      };\n      opt.dir = DIR_NEXT;\n      const nodes = this._matchCombinator(twig, node, opt);\n      if (nodes.size) {\n        if (leaves.length) {\n          for (const nextNode of nodes) {\n            bool = this._matchHasPseudoFunc(Object.assign([], leaves),\n              nextNode, opt);\n            if (bool) {\n              break;\n            }\n          }\n        } else {\n          bool = true;\n        }\n      }\n    }\n    return !!bool;\n  }\n\n  /**\n   * match logical pseudo-class functions - :has(), :is(), :not(), :where()\n   * @private\n   * @param {object} astData - AST data\n   * @param {object} node - Element node\n   * @param {object} opt - options\n   * @returns {?object} - matched node\n   */\n  _matchLogicalPseudoFunc(astData, node, opt = {}) {\n    const {\n      astName = '', branches = [], selector = '', twigBranches = []\n    } = astData;\n    let res;\n    if (astName === 'has') {\n      if (selector.includes(':has(')) {\n        res = null;\n      } else {\n        let bool;\n        for (const leaves of branches) {\n          bool = this._matchHasPseudoFunc(Object.assign([], leaves), node, opt);\n          if (bool) {\n            break;\n          }\n        }\n        if (bool) {\n          res = node;\n        }\n      }\n    } else {\n      const forgive = /^(?:is|where)$/.test(astName);\n      opt.forgive = forgive;\n      const l = twigBranches.length;\n      let bool;\n      for (let i = 0; i < l; i++) {\n        const branch = twigBranches[i];\n        const lastIndex = branch.length - 1;\n        const { leaves } = branch[lastIndex];\n        bool = this._matchLeaves(leaves, node, opt);\n        if (bool && lastIndex > 0) {\n          let nextNodes = new Set([node]);\n          for (let j = lastIndex - 1; j >= 0; j--) {\n            const twig = branch[j];\n            const arr = [];\n            opt.dir = DIR_PREV;\n            for (const nextNode of nextNodes) {\n              const m = this._matchCombinator(twig, nextNode, opt);\n              if (m.size) {\n                arr.push(...m);\n              }\n            }\n            if (arr.length) {\n              if (j === 0) {\n                bool = true;\n              } else {\n                nextNodes = new Set(arr);\n              }\n            } else {\n              bool = false;\n              break;\n            }\n          }\n        }\n        if (bool) {\n          break;\n        }\n      }\n      if (astName === 'not') {\n        if (!bool) {\n          res = node;\n        }\n      } else if (bool) {\n        res = node;\n      }\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match pseudo-class selector\n   * @private\n   * @see https://html.spec.whatwg.org/#pseudo-classes\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @param {object} opt - options\n   * @param {boolean} [opt.forgive] - forgive unknown pseudo-class\n   * @param {boolean} [opt.warn] - warn unsupported pseudo-class\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchPseudoClassSelector(ast, node, opt = {}) {\n    const { children: astChildren } = ast;\n    const { localName, parentNode } = node;\n    const {\n      forgive,\n      warn = this.#warn\n    } = opt;\n    const astName = unescapeSelector(ast.name);\n    let matched = new Set();\n    // :has(), :is(), :not(), :where()\n    if (REG_LOGICAL_PSEUDO.test(astName)) {\n      let astData;\n      if (this.#cache.has(ast)) {\n        astData = this.#cache.get(ast);\n      } else {\n        const branches = walkAST(ast);\n        const selectors = [];\n        const twigBranches = [];\n        for (const [...leaves] of branches) {\n          for (const leaf of leaves) {\n            const css = generateCSS(leaf);\n            selectors.push(css);\n          }\n          const branch = [];\n          const leavesSet = new Set();\n          let item = leaves.shift();\n          while (item) {\n            if (item.type === COMBINATOR) {\n              branch.push({\n                combo: item,\n                leaves: [...leavesSet]\n              });\n              leavesSet.clear();\n            } else if (item) {\n              leavesSet.add(item);\n            }\n            if (leaves.length) {\n              item = leaves.shift();\n            } else {\n              branch.push({\n                combo: null,\n                leaves: [...leavesSet]\n              });\n              leavesSet.clear();\n              break;\n            }\n          }\n          twigBranches.push(branch);\n        }\n        astData = {\n          astName,\n          branches,\n          twigBranches,\n          selector: selectors.join(',')\n        };\n        this.#cache.set(ast, astData);\n      }\n      const res = this._matchLogicalPseudoFunc(astData, node, opt);\n      if (res) {\n        matched.add(res);\n      }\n    } else if (Array.isArray(astChildren)) {\n      const [branch] = astChildren;\n      // :nth-child(), :nth-last-child(), nth-of-type(), :nth-last-of-type()\n      if (/^nth-(?:last-)?(?:child|of-type)$/.test(astName)) {\n        const nodes = this._matchAnPlusB(branch, node, astName, opt);\n        if (nodes.size) {\n          matched = nodes;\n        }\n      // :dir()\n      } else if (astName === 'dir') {\n        const res = this._matchDirectionPseudoClass(branch, node);\n        if (res) {\n          matched.add(res);\n        }\n      // :lang()\n      } else if (astName === 'lang') {\n        const res = this._matchLanguagePseudoClass(branch, node);\n        if (res) {\n          matched.add(res);\n        }\n      } else {\n        switch (astName) {\n          case 'current':\n          case 'nth-col':\n          case 'nth-last-col': {\n            if (warn) {\n              const msg = `Unsupported pseudo-class :${astName}()`;\n              throw new DOMException(msg, NOT_SUPPORTED_ERR);\n            }\n            break;\n          }\n          case 'host':\n          case 'host-context': {\n            // ignore\n            break;\n          }\n          default: {\n            if (!forgive) {\n              const msg = `Unknown pseudo-class :${astName}()`;\n              throw new DOMException(msg, SYNTAX_ERR);\n            }\n          }\n        }\n      }\n    } else {\n      const regAnchor = /^a(?:rea)?$/;\n      const regFormCtrl =\n        /^(?:(?:fieldse|inpu|selec)t|button|opt(?:group|ion)|textarea)$/;\n      const regFormValidity = /^(?:(?:inpu|selec)t|button|form|textarea)$/;\n      const regInteract = /^d(?:etails|ialog)$/;\n      const regTypeCheck = /^(?:checkbox|radio)$/;\n      const regTypeDate = /^(?:date(?:time-local)?|month|time|week)$/;\n      const regTypeRange =\n        /(?:(?:rang|tim)e|date(?:time-local)?|month|number|week)$/;\n      const regTypeText = /^(?:(?:emai|te|ur)l|number|password|search|text)$/;\n      switch (astName) {\n        case 'any-link':\n        case 'link': {\n          if (regAnchor.test(localName) && node.hasAttribute('href')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'local-link': {\n          if (regAnchor.test(localName) && node.hasAttribute('href')) {\n            const { href, origin, pathname } = new URL(this.#document.URL);\n            const attrURL = new URL(node.getAttribute('href'), href);\n            if (attrURL.origin === origin && attrURL.pathname === pathname) {\n              matched.add(node);\n            }\n          }\n          break;\n        }\n        case 'visited': {\n          // prevent fingerprinting\n          break;\n        }\n        case 'target': {\n          const { hash } = new URL(this.#document.URL);\n          if (node.id && hash === `#${node.id}` &&\n              this.#document.contains(node)) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'target-within': {\n          const { hash } = new URL(this.#document.URL);\n          if (hash) {\n            const id = hash.replace(/^#/, '');\n            let current = this.#document.getElementById(id);\n            while (current) {\n              if (current === node) {\n                matched.add(node);\n                break;\n              }\n              current = current.parentNode;\n            }\n          }\n          break;\n        }\n        case 'scope': {\n          if (this.#node.nodeType === ELEMENT_NODE) {\n            if (node === this.#node) {\n              matched.add(node);\n            }\n          } else if (node === this.#document.documentElement) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'focus': {\n          if (node === this.#document.activeElement) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'focus-within': {\n          let current = this.#document.activeElement;\n          while (current) {\n            if (current === node) {\n              matched.add(node);\n              break;\n            }\n            current = current.parentNode;\n          }\n          break;\n        }\n        case 'open': {\n          if (regInteract.test(localName) && node.hasAttribute('open')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'closed': {\n          if (regInteract.test(localName) && !node.hasAttribute('open')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'disabled': {\n          if (regFormCtrl.test(localName) || isCustomElementName(localName)) {\n            if (node.disabled || node.hasAttribute('disabled')) {\n              matched.add(node);\n            } else {\n              let parent = parentNode;\n              while (parent) {\n                if (parent.localName === 'fieldset') {\n                  break;\n                }\n                parent = parent.parentNode;\n              }\n              if (parent && parentNode.localName !== 'legend' &&\n                  parent.hasAttribute('disabled')) {\n                matched.add(node);\n              }\n            }\n          }\n          break;\n        }\n        case 'enabled': {\n          if ((regFormCtrl.test(localName) || isCustomElementName(localName)) &&\n              !(node.disabled && node.hasAttribute('disabled'))) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'read-only': {\n          switch (localName) {\n            case 'textarea': {\n              if (node.readonly || node.hasAttribute('readonly') ||\n                  node.disabled || node.hasAttribute('disabled')) {\n                matched.add(node);\n              }\n              break;\n            }\n            case 'input': {\n              if ((!node.type || regTypeDate.test(node.type) ||\n                   regTypeText.test(node.type)) &&\n                  (node.readonly || node.hasAttribute('readonly') ||\n                   node.disabled || node.hasAttribute('disabled'))) {\n                matched.add(node);\n              }\n              break;\n            }\n            default: {\n              if (!isContentEditable(node)) {\n                matched.add(node);\n              }\n            }\n          }\n          break;\n        }\n        case 'read-write': {\n          switch (localName) {\n            case 'textarea': {\n              if (!(node.readonly || node.hasAttribute('readonly') ||\n                    node.disabled || node.hasAttribute('disabled'))) {\n                matched.add(node);\n              }\n              break;\n            }\n            case 'input': {\n              if ((!node.type || regTypeDate.test(node.type) ||\n                   regTypeText.test(node.type)) &&\n                  !(node.readonly || node.hasAttribute('readonly') ||\n                    node.disabled || node.hasAttribute('disabled'))) {\n                matched.add(node);\n              }\n              break;\n            }\n            default: {\n              if (isContentEditable(node)) {\n                matched.add(node);\n              }\n            }\n          }\n          break;\n        }\n        case 'placeholder-shown': {\n          let targetNode;\n          if (localName === 'textarea') {\n            targetNode = node;\n          } else if (localName === 'input') {\n            if (node.hasAttribute('type')) {\n              if (regTypeText.test(node.getAttribute('type'))) {\n                targetNode = node;\n              }\n            } else {\n              targetNode = node;\n            }\n          }\n          if (targetNode && node.value === '' &&\n              node.hasAttribute('placeholder') &&\n              node.getAttribute('placeholder').trim().length) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'checked': {\n          if ((node.checked && localName === 'input' &&\n               node.hasAttribute('type') &&\n               regTypeCheck.test(node.getAttribute('type'))) ||\n              (node.selected && localName === 'option')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'indeterminate': {\n          if ((node.indeterminate && localName === 'input' &&\n               node.type === 'checkbox') ||\n              (localName === 'progress' && !node.hasAttribute('value'))) {\n            matched.add(node);\n          } else if (localName === 'input' && node.type === 'radio' &&\n                     !node.hasAttribute('checked')) {\n            const nodeName = node.name;\n            let parent = node.parentNode;\n            while (parent) {\n              if (parent.localName === 'form') {\n                break;\n              }\n              parent = parent.parentNode;\n            }\n            if (!parent) {\n              parent = this.#document.documentElement;\n            }\n            let checked;\n            const items = parent.getElementsByTagName('input');\n            const l = items.length;\n            if (l) {\n              for (let i = 0; i < l; i++) {\n                const item = items[i];\n                if (item.getAttribute('type') === 'radio') {\n                  if (nodeName) {\n                    if (item.getAttribute('name') === nodeName) {\n                      checked = !!item.checked;\n                    }\n                  } else if (!item.hasAttribute('name')) {\n                    checked = !!item.checked;\n                  }\n                  if (checked) {\n                    break;\n                  }\n                }\n              }\n            }\n            if (!checked) {\n              matched.add(node);\n            }\n          }\n          break;\n        }\n        case 'default': {\n          const regTypeReset = /^(?:button|reset)$/;\n          const regTypeSubmit = /^(?:image|submit)$/;\n          // button[type=\"submit\"], input[type=\"submit\"], input[type=\"image\"]\n          if ((localName === 'button' &&\n               !(node.hasAttribute('type') &&\n                 regTypeReset.test(node.getAttribute('type')))) ||\n              (localName === 'input' && node.hasAttribute('type') &&\n               regTypeSubmit.test(node.getAttribute('type')))) {\n            let form = node.parentNode;\n            while (form) {\n              if (form.localName === 'form') {\n                break;\n              }\n              form = form.parentNode;\n            }\n            if (form) {\n              const walker =\n                this.#document.createTreeWalker(form, SHOW_ELEMENT);\n              let nextNode = walker.firstChild();\n              while (nextNode) {\n                const nodeName = nextNode.localName;\n                let m;\n                if (nodeName === 'button') {\n                  m = !(nextNode.hasAttribute('type') &&\n                    regTypeReset.test(nextNode.getAttribute('type')));\n                } else if (nodeName === 'input') {\n                  m = nextNode.hasAttribute('type') &&\n                    regTypeSubmit.test(nextNode.getAttribute('type'));\n                }\n                if (m) {\n                  if (nextNode === node) {\n                    matched.add(node);\n                  }\n                  break;\n                }\n                nextNode = walker.nextNode();\n              }\n            }\n          // input[type=\"checkbox\"], input[type=\"radio\"]\n          } else if (localName === 'input' && node.hasAttribute('type') &&\n                     regTypeCheck.test(node.getAttribute('type')) &&\n                     (node.checked || node.hasAttribute('checked'))) {\n            matched.add(node);\n          // option\n          } else if (localName === 'option') {\n            let isMultiple = false;\n            let parent = parentNode;\n            while (parent) {\n              if (parent.localName === 'datalist') {\n                break;\n              } else if (parent.localName === 'select') {\n                if (parent.multiple || parent.hasAttribute('multiple')) {\n                  isMultiple = true;\n                }\n                break;\n              }\n              parent = parent.parentNode;\n            }\n            if (isMultiple) {\n              if (node.selected || node.hasAttribute('selected')) {\n                matched.add(node);\n              }\n            } else {\n              const defaultOpt = new Set();\n              const walker =\n                this.#document.createTreeWalker(parentNode, SHOW_ELEMENT);\n              let refNode = walker.firstChild();\n              while (refNode) {\n                if (refNode.selected || refNode.hasAttribute('selected')) {\n                  defaultOpt.add(refNode);\n                  break;\n                }\n                refNode = walker.nextSibling();\n              }\n              if (defaultOpt.size) {\n                if (defaultOpt.has(node)) {\n                  matched.add(node);\n                }\n              }\n            }\n          }\n          break;\n        }\n        case 'valid': {\n          if (regFormValidity.test(localName)) {\n            if (node.checkValidity()) {\n              matched.add(node);\n            }\n          } else if (localName === 'fieldset') {\n            let bool;\n            const walker = this.#document.createTreeWalker(node, SHOW_ELEMENT);\n            let refNode = walker.firstChild();\n            while (refNode) {\n              if (regFormValidity.test(refNode.localName)) {\n                bool = refNode.checkValidity();\n                if (!bool) {\n                  break;\n                }\n              }\n              refNode = walker.nextNode();\n            }\n            if (bool) {\n              matched.add(node);\n            }\n          }\n          break;\n        }\n        case 'invalid': {\n          if (regFormValidity.test(localName)) {\n            if (!node.checkValidity()) {\n              matched.add(node);\n            }\n          } else if (localName === 'fieldset') {\n            let bool;\n            const walker = this.#document.createTreeWalker(node, SHOW_ELEMENT);\n            let refNode = walker.firstChild();\n            while (refNode) {\n              if (regFormValidity.test(refNode.localName)) {\n                bool = refNode.checkValidity();\n                if (!bool) {\n                  break;\n                }\n              }\n              refNode = walker.nextNode();\n            }\n            if (!bool) {\n              matched.add(node);\n            }\n          }\n          break;\n        }\n        case 'in-range': {\n          if (localName === 'input' &&\n              !(node.readonly || node.hasAttribute('readonly')) &&\n              !(node.disabled || node.hasAttribute('disabled')) &&\n              node.hasAttribute('type') &&\n              regTypeRange.test(node.getAttribute('type')) &&\n              !(node.validity.rangeUnderflow ||\n                node.validity.rangeOverflow) &&\n              (node.hasAttribute('min') || node.hasAttribute('max') ||\n               node.getAttribute('type') === 'range')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'out-of-range': {\n          if (localName === 'input' &&\n              !(node.readonly || node.hasAttribute('readonly')) &&\n              !(node.disabled || node.hasAttribute('disabled')) &&\n              node.hasAttribute('type') &&\n              regTypeRange.test(node.getAttribute('type')) &&\n              (node.validity.rangeUnderflow || node.validity.rangeOverflow)) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'required': {\n          let targetNode;\n          if (/^(?:select|textarea)$/.test(localName)) {\n            targetNode = node;\n          } else if (localName === 'input') {\n            if (node.hasAttribute('type')) {\n              const inputType = node.getAttribute('type');\n              if (inputType === 'file' || regTypeCheck.test(inputType) ||\n                  regTypeDate.test(inputType) || regTypeText.test(inputType)) {\n                targetNode = node;\n              }\n            } else {\n              targetNode = node;\n            }\n          }\n          if (targetNode &&\n              (node.required || node.hasAttribute('required'))) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'optional': {\n          let targetNode;\n          if (/^(?:select|textarea)$/.test(localName)) {\n            targetNode = node;\n          } else if (localName === 'input') {\n            if (node.hasAttribute('type')) {\n              const inputType = node.getAttribute('type');\n              if (inputType === 'file' || regTypeCheck.test(inputType) ||\n                  regTypeDate.test(inputType) || regTypeText.test(inputType)) {\n                targetNode = node;\n              }\n            } else {\n              targetNode = node;\n            }\n          }\n          if (targetNode &&\n              !(node.required || node.hasAttribute('required'))) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'root': {\n          if (node === this.#document.documentElement) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'empty': {\n          if (node.hasChildNodes()) {\n            let bool;\n            const walker = this.#document.createTreeWalker(node, SHOW_ALL);\n            let refNode = walker.firstChild();\n            while (refNode) {\n              bool = refNode.nodeType !== ELEMENT_NODE &&\n                refNode.nodeType !== TEXT_NODE;\n              if (!bool) {\n                break;\n              }\n              refNode = walker.nextSibling();\n            }\n            if (bool) {\n              matched.add(node);\n            }\n          } else {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'first-child': {\n          if ((parentNode && node === parentNode.firstElementChild) ||\n              node === this.#root) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'last-child': {\n          if ((parentNode && node === parentNode.lastElementChild) ||\n              node === this.#root) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'only-child': {\n          if ((parentNode && node === parentNode.firstElementChild &&\n               node === parentNode.lastElementChild) || node === this.#root) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'first-of-type': {\n          if (parentNode) {\n            const [node1] = this._collectNthOfType({\n              a: 0,\n              b: 1\n            }, node);\n            if (node1) {\n              matched.add(node1);\n            }\n          } else if (node === this.#root) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'last-of-type': {\n          if (parentNode) {\n            const [node1] = this._collectNthOfType({\n              a: 0,\n              b: 1,\n              reverse: true\n            }, node);\n            if (node1) {\n              matched.add(node1);\n            }\n          } else if (node === this.#root) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'only-of-type': {\n          if (parentNode) {\n            const [node1] = this._collectNthOfType({\n              a: 0,\n              b: 1\n            }, node);\n            if (node1 === node) {\n              const [node2] = this._collectNthOfType({\n                a: 0,\n                b: 1,\n                reverse: true\n              }, node);\n              if (node2 === node) {\n                matched.add(node);\n              }\n            }\n          } else if (node === this.#root) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'host':\n        case 'host-context': {\n          // ignore\n          break;\n        }\n        // legacy pseudo-elements\n        case 'after':\n        case 'before':\n        case 'first-letter':\n        case 'first-line': {\n          if (warn) {\n            const msg = `Unsupported pseudo-element ::${astName}`;\n            throw new DOMException(msg, NOT_SUPPORTED_ERR);\n          }\n          break;\n        }\n        case 'active':\n        case 'autofill':\n        case 'blank':\n        case 'buffering':\n        case 'current':\n        case 'defined':\n        case 'focus-visible':\n        case 'fullscreen':\n        case 'future':\n        case 'hover':\n        case 'modal':\n        case 'muted':\n        case 'past':\n        case 'paused':\n        case 'picture-in-picture':\n        case 'playing':\n        case 'seeking':\n        case 'stalled':\n        case 'user-invalid':\n        case 'user-valid':\n        case 'volume-locked':\n        case '-webkit-autofill': {\n          if (warn) {\n            const msg = `Unsupported pseudo-class :${astName}`;\n            throw new DOMException(msg, NOT_SUPPORTED_ERR);\n          }\n          break;\n        }\n        default: {\n          if (astName.startsWith('-webkit-')) {\n            if (warn) {\n              const msg = `Unsupported pseudo-class :${astName}`;\n              throw new DOMException(msg, NOT_SUPPORTED_ERR);\n            }\n          } else if (!forgive) {\n            const msg = `Unknown pseudo-class :${astName}`;\n            throw new DOMException(msg, SYNTAX_ERR);\n          }\n        }\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * match shadow host pseudo class\n   * @private\n   * @param {object} ast - AST\n   * @param {object} node - DocumentFragment node\n   * @returns {?object} - matched node\n   */\n  _matchShadowHostPseudoClass(ast, node) {\n    const { children: astChildren } = ast;\n    const astName = unescapeSelector(ast.name);\n    let res;\n    if (Array.isArray(astChildren)) {\n      const [branch] = walkAST(astChildren[0]);\n      const [...leaves] = branch;\n      const { host } = node;\n      if (astName === 'host') {\n        let bool;\n        for (const leaf of leaves) {\n          const { type: leafType } = leaf;\n          if (leafType === COMBINATOR) {\n            const css = generateCSS(ast);\n            const msg = `Invalid selector ${css}`;\n            throw new DOMException(msg, SYNTAX_ERR);\n          }\n          bool = this._matchSelector(leaf, host).has(host);\n          if (!bool) {\n            break;\n          }\n        }\n        if (bool) {\n          res = node;\n        }\n      } else if (astName === 'host-context') {\n        let bool;\n        let parent = host;\n        while (parent) {\n          for (const leaf of leaves) {\n            const { type: leafType } = leaf;\n            if (leafType === COMBINATOR) {\n              const css = generateCSS(ast);\n              const msg = `Invalid selector ${css}`;\n              throw new DOMException(msg, SYNTAX_ERR);\n            }\n            bool = this._matchSelector(leaf, parent).has(parent);\n            if (!bool) {\n              break;\n            }\n          }\n          if (bool) {\n            break;\n          } else {\n            parent = parent.parentNode;\n          }\n        }\n        if (bool) {\n          res = node;\n        }\n      }\n    } else if (astName === 'host') {\n      res = node;\n    } else {\n      const msg = `Invalid selector :${astName}`;\n      throw new DOMException(msg, SYNTAX_ERR);\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match selector\n   * @private\n   * @param {object} ast - AST\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @param {object} [opt] - options\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchSelector(ast, node, opt) {\n    const { type: astType } = ast;\n    const astName = unescapeSelector(ast.name);\n    let matched = new Set();\n    if (node.nodeType === ELEMENT_NODE) {\n      switch (astType) {\n        case SELECTOR_PSEUDO_CLASS: {\n          const nodes = this._matchPseudoClassSelector(ast, node, opt);\n          if (nodes.size) {\n            matched = nodes;\n          }\n          break;\n        }\n        case SELECTOR_PSEUDO_ELEMENT: {\n          matchPseudoElementSelector(astName, opt);\n          break;\n        }\n        default: {\n          const res = matchSelector(ast, node, opt);\n          if (res) {\n            matched.add(res);\n          }\n        }\n      }\n    } else if (this.#shadow && astType === SELECTOR_PSEUDO_CLASS &&\n               node.nodeType === DOCUMENT_FRAGMENT_NODE) {\n      if (astName !== 'has' && REG_LOGICAL_PSEUDO.test(astName)) {\n        const nodes = this._matchPseudoClassSelector(ast, node, opt);\n        if (nodes.size) {\n          matched = nodes;\n        }\n      } else if (REG_SHADOW_HOST.test(astName)) {\n        const res = this._matchShadowHostPseudoClass(ast, node, opt);\n        if (res) {\n          matched.add(res);\n        }\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * match leaves\n   * @private\n   * @param {Array.<object>} leaves - AST leaves\n   * @param {object} node - node\n   * @param {object} opt - options\n   * @returns {boolean} - result\n   */\n  _matchLeaves(leaves, node, opt) {\n    let bool;\n    if (this.#results.has(leaves)) {\n      const result = this.#results.get(leaves);\n      if (result.has(node)) {\n        bool = result.get(node);\n      } else {\n        for (const leaf of leaves) {\n          bool = this._matchSelector(leaf, node, opt).has(node);\n          if (!bool) {\n            break;\n          }\n        }\n        result.set(node, bool);\n        this.#results.set(leaves, result);\n      }\n    } else {\n      for (const leaf of leaves) {\n        bool = this._matchSelector(leaf, node, opt).has(node);\n        if (!bool) {\n          break;\n        }\n      }\n      const result = new WeakMap();\n      result.set(node, bool);\n      this.#results.set(leaves, result);\n    }\n    return !!bool;\n  }\n\n  /**\n   * match HTML collection\n   * @private\n   * @param {object} items - HTML collection\n   * @param {object} opt - options\n   * @returns {Set.<object>} - matched nodes\n   */\n  _matchHTMLCollection(items, opt = {}) {\n    const { compound, filterLeaves } = opt;\n    let nodes = new Set();\n    const l = items.length;\n    if (l) {\n      if (compound) {\n        for (let i = 0; i < l; i++) {\n          const item = items[i];\n          const bool = this._matchLeaves(filterLeaves, item, opt);\n          if (bool) {\n            nodes.add(item);\n          }\n        }\n      } else {\n        const arr = [].slice.call(items);\n        nodes = new Set(arr);\n      }\n    }\n    return nodes;\n  }\n\n  /**\n   * find descendant nodes\n   * @private\n   * @param {Array.<object>} leaves - AST leaves\n   * @param {object} baseNode - base Element node\n   * @param {object} opt - options\n   * @returns {object} - collection of nodes and pending state\n   */\n  _findDescendantNodes(leaves, baseNode, opt) {\n    const [leaf, ...filterLeaves] = leaves;\n    const { type: leafType } = leaf;\n    const leafName = unescapeSelector(leaf.name);\n    const compound = filterLeaves.length > 0;\n    let nodes = new Set();\n    let pending = false;\n    if (this.#shadow) {\n      pending = true;\n    } else {\n      switch (leafType) {\n        case SELECTOR_ID: {\n          if (this.#root.nodeType === ELEMENT_NODE) {\n            pending = true;\n          } else {\n            const node = this.#root.getElementById(leafName);\n            if (node && node !== baseNode && baseNode.contains(node)) {\n              if (compound) {\n                const bool = this._matchLeaves(filterLeaves, node, opt);\n                if (bool) {\n                  nodes.add(node);\n                }\n              } else {\n                nodes.add(node);\n              }\n            }\n          }\n          break;\n        }\n        case SELECTOR_CLASS: {\n          const items = baseNode.getElementsByClassName(leafName);\n          nodes = this._matchHTMLCollection(items, {\n            compound,\n            filterLeaves\n          });\n          break;\n        }\n        case SELECTOR_TYPE: {\n          if (this.#document.contentType === 'text/html' &&\n              !/[*|]/.test(leafName)) {\n            const items = baseNode.getElementsByTagName(leafName);\n            nodes = this._matchHTMLCollection(items, {\n              compound,\n              filterLeaves\n            });\n          } else {\n            pending = true;\n          }\n          break;\n        }\n        case SELECTOR_PSEUDO_ELEMENT: {\n          matchPseudoElementSelector(leafName, opt);\n          break;\n        }\n        default: {\n          pending = true;\n        }\n      }\n    }\n    return {\n      nodes,\n      pending\n    };\n  }\n\n  /**\n   * match combinator\n   * @private\n   * @param {object} twig - twig\n   * @param {object} node - Element node\n   * @param {object} opt - option\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchCombinator(twig, node, opt = {}) {\n    const { combo, leaves } = twig;\n    const { name: comboName } = combo;\n    const { dir } = opt;\n    let matched = new Set();\n    if (dir === DIR_NEXT) {\n      switch (comboName) {\n        case '+': {\n          const refNode = node.nextElementSibling;\n          if (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, opt);\n            if (bool) {\n              matched.add(refNode);\n            }\n          }\n          break;\n        }\n        case '~': {\n          const { parentNode } = node;\n          if (parentNode) {\n            const walker =\n              this.#document.createTreeWalker(parentNode, SHOW_ELEMENT);\n            let refNode = this._traverse(node, walker);\n            if (refNode === node) {\n              refNode = walker.nextSibling();\n            }\n            while (refNode) {\n              const bool = this._matchLeaves(leaves, refNode, opt);\n              if (bool) {\n                matched.add(refNode);\n              }\n              refNode = walker.nextSibling();\n            }\n          }\n          break;\n        }\n        case '>': {\n          const walker = this.#document.createTreeWalker(node, SHOW_ELEMENT);\n          let refNode = walker.firstChild();\n          while (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, opt);\n            if (bool) {\n              matched.add(refNode);\n            }\n            refNode = walker.nextSibling();\n          }\n          break;\n        }\n        case ' ':\n        default: {\n          const { nodes, pending } = this._findDescendantNodes(leaves, node);\n          if (nodes.size) {\n            matched = nodes;\n          } else if (pending) {\n            const walker = this.#document.createTreeWalker(node, SHOW_ELEMENT);\n            let refNode = walker.nextNode();\n            while (refNode) {\n              const bool = this._matchLeaves(leaves, refNode, opt);\n              if (bool) {\n                matched.add(refNode);\n              }\n              refNode = walker.nextNode();\n            }\n          }\n        }\n      }\n    } else {\n      switch (comboName) {\n        case '+': {\n          const refNode = node.previousElementSibling;\n          if (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, opt);\n            if (bool) {\n              matched.add(refNode);\n            }\n          }\n          break;\n        }\n        case '~': {\n          const walker =\n            this.#document.createTreeWalker(node.parentNode, SHOW_ELEMENT);\n          let refNode = walker.firstChild();\n          while (refNode) {\n            if (refNode === node) {\n              break;\n            } else {\n              const bool = this._matchLeaves(leaves, refNode, opt);\n              if (bool) {\n                matched.add(refNode);\n              }\n            }\n            refNode = walker.nextSibling();\n          }\n          break;\n        }\n        case '>': {\n          const refNode = node.parentNode;\n          if (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, opt);\n            if (bool) {\n              matched.add(refNode);\n            }\n          }\n          break;\n        }\n        case ' ':\n        default: {\n          const arr = [];\n          let refNode = node.parentNode;\n          while (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, opt);\n            if (bool) {\n              arr.push(refNode);\n            }\n            refNode = refNode.parentNode;\n          }\n          if (arr.length) {\n            matched = new Set(arr.reverse());\n          }\n        }\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * find matched node from finder\n   * @private\n   * @param {Array.<object>} leaves - AST leaves\n   * @param {object} [opt] - options\n   * @param {object} [opt.node] - node to start from\n   * @returns {?object} - matched node\n   */\n  _findNode(leaves, opt = {}) {\n    const { node } = opt;\n    let matchedNode;\n    let refNode = this._traverse(node, this.#finder);\n    if (refNode) {\n      if (refNode.nodeType !== ELEMENT_NODE) {\n        refNode = this.#finder.nextNode();\n      } else if (refNode === node) {\n        if (refNode !== this.#root) {\n          refNode = this.#finder.nextNode();\n        }\n      }\n      while (refNode) {\n        let bool;\n        if (this.#node.nodeType === ELEMENT_NODE) {\n          if (refNode === this.#node) {\n            bool = true;\n          } else {\n            bool = this.#node.contains(refNode);\n          }\n        } else {\n          bool = true;\n        }\n        if (bool) {\n          const matched = this._matchLeaves(leaves, refNode, {\n            warn: this.#warn\n          });\n          if (matched) {\n            matchedNode = refNode;\n            break;\n          }\n        }\n        refNode = this.#finder.nextNode();\n      }\n    }\n    return matchedNode ?? null;\n  }\n\n  /**\n   * match self\n   * @private\n   * @param {Array} leaves - AST leaves\n   * @returns {Array} - [nodes, filtered]\n   */\n  _matchSelf(leaves) {\n    const nodes = [];\n    let filtered = false;\n    const bool = this._matchLeaves(leaves, this.#node);\n    if (bool) {\n      nodes.push(this.#node);\n      filtered = true;\n    }\n    return [nodes, filtered];\n  }\n\n  /**\n   * find lineal\n   * @private\n   * @param {Array} leaf - AST leaf\n   * @param {object} opt - options\n   * @returns {Array} - [nodes, filtered]\n   */\n  _findLineal(leaf, opt = {}) {\n    const { complex, compound, filterLeaves } = opt;\n    const nodes = [];\n    let filtered = false;\n    let bool = this._matchLeaves([leaf], this.#node);\n    if (bool && !compound && !complex) {\n      nodes.push(this.#node);\n      filtered = true;\n    } else if (bool && compound && !complex) {\n      bool = this._matchLeaves(filterLeaves, this.#node);\n      if (bool) {\n        nodes.push(this.#node);\n        filtered = true;\n      }\n    }\n    if (!bool || complex) {\n      if (bool) {\n        nodes.push(this.#node);\n        if (!compound) {\n          filtered = true;\n        }\n      }\n      let refNode = this.#node.parentNode;\n      while (refNode) {\n        bool = this._matchLeaves([leaf], refNode);\n        if (bool) {\n          nodes.push(refNode);\n          if (!compound) {\n            filtered = true;\n          }\n        }\n        if (refNode.parentNode) {\n          refNode = refNode.parentNode;\n        } else {\n          break;\n        }\n      }\n    }\n    return [nodes, filtered];\n  }\n\n  /**\n   * find first\n   * @private\n   * @param {Array} leaves - AST leaves\n   * @returns {Array} - [nodes, filtered]\n   */\n  _findFirst(leaves) {\n    const nodes = [];\n    let filtered = false;\n    const node = this._findNode(leaves, {\n      node: this.#node\n    });\n    if (node) {\n      nodes.push(node);\n      filtered = true;\n    }\n    return [nodes, filtered];\n  }\n\n  /**\n   * find from HTML collection\n   * @private\n   * @param {object} items - HTML collection\n   * @param {object} opt - options\n   * @param {boolean} [opt.compound] - compound selector\n   * @param {Array} [opt.filterLeaves] - filter leaves\n   * @returns {Array} - [nodes, filtered]\n   */\n  _findFromHTMLCollection(items, opt = {}) {\n    const { compound, filterLeaves } = opt;\n    let nodes = [];\n    let filtered = false;\n    const l = items.length;\n    if (l) {\n      if (this.#node.nodeType === ELEMENT_NODE) {\n        for (let i = 0; i < l; i++) {\n          const node = items[i];\n          if (node === this.#node || isInclusive(node, this.#node)) {\n            if (compound) {\n              const bool = this._matchLeaves(filterLeaves, node, {\n                warn: this.#warn\n              });\n              if (bool) {\n                nodes.push(node);\n                filtered = true;\n              }\n            } else {\n              nodes.push(node);\n              filtered = true;\n            }\n          }\n        }\n      } else {\n        nodes = [].slice.call(items);\n        if (!compound) {\n          filtered = true;\n        }\n      }\n    }\n    return [nodes, filtered];\n  }\n\n  /**\n   * find entry nodes\n   * @private\n   * @param {object} twig - twig\n   * @param {string} targetType - target type\n   * @param {boolean} complex - complex selector\n   * @returns {object} - collection of nodes etc.\n   */\n  _findEntryNodes(twig, targetType, complex) {\n    const { leaves } = twig;\n    const [leaf, ...filterLeaves] = leaves;\n    const { type: leafType } = leaf;\n    const leafName = unescapeSelector(leaf.name);\n    const compound = filterLeaves.length > 0;\n    let nodes = [];\n    let filtered = false;\n    let pending = false;\n    switch (leafType) {\n      case SELECTOR_PSEUDO_ELEMENT: {\n        matchPseudoElementSelector(leafName, {\n          warn: this.#warn\n        });\n        break;\n      }\n      case SELECTOR_ID: {\n        if (targetType === TARGET_SELF) {\n          [nodes, filtered] = this._matchSelf(leaves);\n        } else if (targetType === TARGET_LINEAL) {\n          [nodes, filtered] = this._findLineal(leaf, {\n            complex,\n            compound,\n            filterLeaves\n          });\n        } else if (targetType === TARGET_FIRST &&\n                   this.#root.nodeType !== ELEMENT_NODE) {\n          const node = this.#root.getElementById(leafName);\n          if (node) {\n            if (compound) {\n              const bool = this._matchLeaves(filterLeaves, node, {\n                warn: this.#warn\n              });\n              if (bool) {\n                nodes.push(node);\n                filtered = true;\n              }\n            } else {\n              nodes.push(node);\n              filtered = true;\n            }\n          }\n        } else {\n          pending = true;\n        }\n        break;\n      }\n      case SELECTOR_CLASS: {\n        if (targetType === TARGET_SELF) {\n          [nodes, filtered] = this._matchSelf(leaves);\n        } else if (targetType === TARGET_LINEAL) {\n          [nodes, filtered] = this._findLineal(leaf, {\n            complex,\n            compound,\n            filterLeaves\n          });\n        } else if (targetType === TARGET_FIRST) {\n          [nodes, filtered] = this._findFirst(leaves);\n        } else if (this.#root.nodeType === DOCUMENT_NODE) {\n          const items = this.#root.getElementsByClassName(leafName);\n          [nodes, filtered] = this._findFromHTMLCollection(items, {\n            compound,\n            filterLeaves\n          });\n        } else {\n          pending = true;\n        }\n        break;\n      }\n      case SELECTOR_TYPE: {\n        if (targetType === TARGET_SELF) {\n          [nodes, filtered] = this._matchSelf(leaves);\n        } else if (targetType === TARGET_LINEAL) {\n          [nodes, filtered] = this._findLineal(leaf, {\n            complex,\n            compound,\n            filterLeaves\n          });\n        } else if (this.#document.contentType === 'text/html' &&\n                   this.#root.nodeType === DOCUMENT_NODE &&\n                   !/[*|]/.test(leafName)) {\n          const items = this.#root.getElementsByTagName(leafName);\n          [nodes, filtered] = this._findFromHTMLCollection(items, {\n            compound,\n            filterLeaves\n          });\n        } else {\n          pending = true;\n        }\n        break;\n      }\n      default: {\n        if (targetType !== TARGET_LINEAL && REG_SHADOW_HOST.test(leafName)) {\n          if (this.#shadow &&\n              this.#node.nodeType === DOCUMENT_FRAGMENT_NODE) {\n            const node = this._matchShadowHostPseudoClass(leaf, this.#node);\n            if (node) {\n              nodes.push(node);\n              filtered = true;\n            }\n          }\n        } else if (targetType === TARGET_SELF) {\n          [nodes, filtered] = this._matchSelf(leaves);\n        } else if (targetType === TARGET_LINEAL) {\n          [nodes, filtered] = this._findLineal(leaf, {\n            complex,\n            compound,\n            filterLeaves\n          });\n        } else if (targetType === TARGET_FIRST) {\n          [nodes, filtered] = this._findFirst(leaves);\n        } else {\n          pending = true;\n        }\n      }\n    }\n    return {\n      compound,\n      filtered,\n      nodes,\n      pending\n    };\n  }\n\n  /**\n   * get entry twig\n   * @private\n   * @param {Array.<object>} branch - AST branch\n   * @param {string} targetType - target type\n   * @returns {object} - direction and twig\n   */\n  _getEntryTwig(branch, targetType) {\n    const branchLen = branch.length;\n    const complex = branchLen > 1;\n    const firstTwig = branch[0];\n    let dir;\n    let twig;\n    if (complex) {\n      const {\n        combo: firstCombo,\n        leaves: [{\n          name: firstName,\n          type: firstType\n        }]\n      } = firstTwig;\n      const lastTwig = branch[branchLen - 1];\n      const {\n        leaves: [{\n          name: lastName,\n          type: lastType\n        }]\n      } = lastTwig;\n      if (lastType === SELECTOR_PSEUDO_ELEMENT || lastType === SELECTOR_ID) {\n        dir = DIR_PREV;\n        twig = lastTwig;\n      } else if (firstType === SELECTOR_PSEUDO_ELEMENT ||\n                 firstType === SELECTOR_ID) {\n        dir = DIR_NEXT;\n        twig = firstTwig;\n      } else if (targetType === TARGET_ALL) {\n        if (firstName === '*' && firstType === SELECTOR_TYPE) {\n          dir = DIR_PREV;\n          twig = lastTwig;\n        } else if (lastName === '*' && lastType === SELECTOR_TYPE) {\n          dir = DIR_NEXT;\n          twig = firstTwig;\n        } else if (branchLen === 2) {\n          const { name: comboName } = firstCombo;\n          if (/^[+~]$/.test(comboName)) {\n            dir = DIR_PREV;\n            twig = lastTwig;\n          } else {\n            dir = DIR_NEXT;\n            twig = firstTwig;\n          }\n        } else {\n          dir = DIR_NEXT;\n          twig = firstTwig;\n        }\n      } else if (lastName === '*' && lastType === SELECTOR_TYPE) {\n        dir = DIR_NEXT;\n        twig = firstTwig;\n      } else if (firstName === '*' && firstType === SELECTOR_TYPE) {\n        dir = DIR_PREV;\n        twig = lastTwig;\n      } else {\n        let bool;\n        let sibling;\n        for (const { combo, leaves: [leaf] } of branch) {\n          const { type: leafType } = leaf;\n          const leafName = unescapeSelector(leaf.name);\n          if (leafType === SELECTOR_PSEUDO_CLASS && leafName === 'dir') {\n            bool = false;\n            break;\n          }\n          if (combo && !sibling) {\n            const { name: comboName } = combo;\n            if (/^[+~]$/.test(comboName)) {\n              bool = true;\n              sibling = true;\n            }\n          }\n        }\n        if (bool) {\n          dir = DIR_NEXT;\n          twig = firstTwig;\n        } else {\n          dir = DIR_PREV;\n          twig = lastTwig;\n        }\n      }\n    } else {\n      dir = DIR_PREV;\n      twig = firstTwig;\n    }\n    return {\n      complex,\n      dir,\n      twig\n    };\n  }\n\n  /**\n   * collect nodes\n   * @private\n   * @param {string} targetType - target type\n   * @returns {Array.<Array.<object|undefined>>} - #ast and #nodes\n   */\n  _collectNodes(targetType) {\n    const ast = this.#ast.values();\n    if (targetType === TARGET_ALL || targetType === TARGET_FIRST) {\n      const pendingItems = new Set();\n      let i = 0;\n      for (const { branch } of ast) {\n        const { complex, dir, twig } = this._getEntryTwig(branch, targetType);\n        const {\n          compound, filtered, nodes, pending\n        } = this._findEntryNodes(twig, targetType, complex);\n        if (nodes.length) {\n          this.#ast[i].find = true;\n          this.#nodes[i] = nodes;\n        } else if (pending) {\n          pendingItems.add(new Map([\n            ['index', i],\n            ['twig', twig]\n          ]));\n        }\n        this.#ast[i].dir = dir;\n        this.#ast[i].filtered = filtered || !compound;\n        i++;\n      }\n      if (pendingItems.size) {\n        let node;\n        let walker;\n        if (this.#node !== this.#root && this.#node.nodeType === ELEMENT_NODE) {\n          node = this.#node;\n          walker = this.#finder;\n        } else {\n          node = this.#root;\n          walker = this.#tree;\n        }\n        let nextNode = this._traverse(node, walker);\n        while (nextNode) {\n          let bool = false;\n          if (this.#node.nodeType === ELEMENT_NODE) {\n            if (nextNode === this.#node) {\n              bool = true;\n            } else {\n              bool = this.#node.contains(nextNode);\n            }\n          } else {\n            bool = true;\n          }\n          if (bool) {\n            for (const pendingItem of pendingItems) {\n              const { leaves } = pendingItem.get('twig');\n              const matched = this._matchLeaves(leaves, nextNode, {\n                warn: this.#warn\n              });\n              if (matched) {\n                const index = pendingItem.get('index');\n                this.#ast[index].filtered = true;\n                this.#ast[index].find = true;\n                this.#nodes[index].push(nextNode);\n              }\n            }\n          }\n          nextNode = walker.nextNode();\n        }\n      }\n    } else {\n      let i = 0;\n      for (const { branch } of ast) {\n        const twig = branch[branch.length - 1];\n        const complex = branch.length > 1;\n        const {\n          compound, filtered, nodes\n        } = this._findEntryNodes(twig, targetType, complex);\n        if (nodes.length) {\n          this.#ast[i].find = true;\n          this.#nodes[i] = nodes;\n        }\n        this.#ast[i].dir = DIR_PREV;\n        this.#ast[i].filtered = filtered || !compound;\n        i++;\n      }\n    }\n    return [\n      this.#ast,\n      this.#nodes\n    ];\n  }\n\n  /**\n   * match nodes\n   * @private\n   * @param {string} targetType - target type\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchNodes(targetType) {\n    const [...branches] = this.#ast;\n    const l = branches.length;\n    let nodes = new Set();\n    for (let i = 0; i < l; i++) {\n      const { branch, dir, filtered, find } = branches[i];\n      const branchLen = branch.length;\n      if (branchLen && find) {\n        const entryNodes = this.#nodes[i];\n        const entryNodesLen = entryNodes.length;\n        const lastIndex = branchLen - 1;\n        if (lastIndex === 0) {\n          const { leaves: [, ...filterLeaves] } = branch[0];\n          if ((targetType === TARGET_ALL || targetType === TARGET_FIRST) &&\n              this.#node.nodeType === ELEMENT_NODE) {\n            for (let j = 0; j < entryNodesLen; j++) {\n              const node = entryNodes[j];\n              if (node !== this.#node && this.#node.contains(node)) {\n                nodes.add(node);\n                if (targetType !== TARGET_ALL) {\n                  break;\n                }\n              }\n            }\n          } else if (filterLeaves.length) {\n            for (let j = 0; j < entryNodesLen; j++) {\n              const node = entryNodes[j];\n              const bool = filtered || this._matchLeaves(filterLeaves, node, {\n                warn: this.#warn\n              });\n              if (bool) {\n                nodes.add(node);\n                if (targetType !== TARGET_ALL) {\n                  break;\n                }\n              }\n            }\n          } else if (targetType === TARGET_ALL) {\n            if (nodes.size) {\n              const n = [...nodes];\n              nodes = new Set([...n, ...entryNodes]);\n              this.#sort = true;\n            } else {\n              nodes = new Set([...entryNodes]);\n            }\n          } else {\n            const [node] = [...entryNodes];\n            nodes.add(node);\n          }\n        } else if (dir === DIR_NEXT) {\n          let { combo, leaves: entryLeaves } = branch[0];\n          const [, ...filterLeaves] = entryLeaves;\n          let matched;\n          for (let j = 0; j < entryNodesLen; j++) {\n            const node = entryNodes[j];\n            const bool = filtered || this._matchLeaves(filterLeaves, node, {\n              warn: this.#warn\n            });\n            if (bool) {\n              let nextNodes = new Set([node]);\n              for (let j = 1; j < branchLen; j++) {\n                const { combo: nextCombo, leaves } = branch[j];\n                const arr = [];\n                for (const nextNode of nextNodes) {\n                  const twig = {\n                    combo,\n                    leaves\n                  };\n                  const m = this._matchCombinator(twig, nextNode, {\n                    dir,\n                    warn: this.#warn\n                  });\n                  if (m.size) {\n                    arr.push(...m);\n                  }\n                }\n                if (arr.length) {\n                  if (j === lastIndex) {\n                    if (targetType === TARGET_ALL) {\n                      if (nodes.size) {\n                        const n = [...nodes];\n                        nodes = new Set([...n, ...arr]);\n                      } else {\n                        nodes = new Set([...arr]);\n                      }\n                      this.#sort = true;\n                    } else {\n                      const [node] = sortNodes(arr);\n                      nodes.add(node);\n                    }\n                    matched = true;\n                  } else {\n                    combo = nextCombo;\n                    nextNodes = new Set(arr);\n                    matched = false;\n                  }\n                } else {\n                  matched = false;\n                  break;\n                }\n              }\n            } else {\n              matched = false;\n            }\n            if (matched && targetType !== TARGET_ALL) {\n              break;\n            }\n          }\n          if (!matched && targetType === TARGET_FIRST) {\n            const [entryNode] = [...entryNodes];\n            let refNode = this._findNode(entryLeaves, {\n              node: entryNode\n            });\n            while (refNode) {\n              let nextNodes = new Set([refNode]);\n              for (let j = 1; j < branchLen; j++) {\n                const { combo: nextCombo, leaves } = branch[j];\n                const arr = [];\n                for (const nextNode of nextNodes) {\n                  const twig = {\n                    combo,\n                    leaves\n                  };\n                  const m = this._matchCombinator(twig, nextNode, {\n                    dir,\n                    warn: this.#warn\n                  });\n                  if (m.size) {\n                    arr.push(...m);\n                  }\n                }\n                if (arr.length) {\n                  if (j === lastIndex) {\n                    const [node] = sortNodes(arr);\n                    nodes.add(node);\n                    matched = true;\n                  } else {\n                    combo = nextCombo;\n                    nextNodes = new Set(arr);\n                    matched = false;\n                  }\n                } else {\n                  matched = false;\n                  break;\n                }\n              }\n              if (matched) {\n                break;\n              }\n              refNode = this._findNode(entryLeaves, {\n                node: refNode\n              });\n              nextNodes = new Set([refNode]);\n            }\n          }\n        } else {\n          const { leaves: entryLeaves } = branch[lastIndex];\n          let matched;\n          for (let j = 0; j < entryNodesLen; j++) {\n            const node = entryNodes[j];\n            let nextNodes = new Set([node]);\n            for (let j = lastIndex - 1; j >= 0; j--) {\n              const twig = branch[j];\n              const arr = [];\n              for (const nextNode of nextNodes) {\n                const m = this._matchCombinator(twig, nextNode, {\n                  dir,\n                  warn: this.#warn\n                });\n                if (m.size) {\n                  arr.push(...m);\n                }\n              }\n              if (arr.length) {\n                if (j === 0) {\n                  nodes.add(node);\n                  matched = true;\n                  if (targetType === TARGET_ALL &&\n                      branchLen > 1 && nodes.size > 1) {\n                    this.#sort = true;\n                  }\n                } else {\n                  nextNodes = new Set(arr);\n                  matched = false;\n                }\n              } else {\n                matched = false;\n                break;\n              }\n            }\n            if (matched && targetType !== TARGET_ALL) {\n              break;\n            }\n          }\n          if (!matched && targetType === TARGET_FIRST) {\n            const [entryNode] = [...entryNodes];\n            let refNode = this._findNode(entryLeaves, {\n              node: entryNode\n            });\n            while (refNode) {\n              let nextNodes = new Set([refNode]);\n              for (let j = lastIndex - 1; j >= 0; j--) {\n                const twig = branch[j];\n                const arr = [];\n                for (const nextNode of nextNodes) {\n                  const m = this._matchCombinator(twig, nextNode, {\n                    dir,\n                    warn: this.#warn\n                  });\n                  if (m.size) {\n                    arr.push(...m);\n                  }\n                }\n                if (arr.length) {\n                  if (j === 0) {\n                    nodes.add(refNode);\n                    matched = true;\n                  } else {\n                    nextNodes = new Set(arr);\n                    matched = false;\n                  }\n                } else {\n                  matched = false;\n                  break;\n                }\n              }\n              if (matched) {\n                break;\n              }\n              refNode = this._findNode(entryLeaves, {\n                node: refNode\n              });\n              nextNodes = new Set([refNode]);\n            }\n          }\n        }\n      }\n    }\n    return nodes;\n  }\n\n  /**\n   * find matched nodes\n   * @private\n   * @param {string} targetType - target type\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _find(targetType) {\n    this._collectNodes(targetType);\n    const nodes = this._matchNodes(targetType);\n    return nodes;\n  }\n\n  /**\n   * matches\n   * @param {string} selector - CSS selector\n   * @param {object} node - Element node\n   * @param {object} opt - options\n   * @returns {boolean} - `true` if matched `false` otherwise\n   */\n  matches(selector, node, opt) {\n    let res;\n    try {\n      this.#node = this._setup(selector, node, opt);\n      if (node.nodeType !== ELEMENT_NODE) {\n        const msg = `Unexpected node ${node.nodeName}`;\n        throw new TypeError(msg);\n      }\n      const nodes = this._find(TARGET_SELF);\n      if (nodes.size) {\n        res = nodes.has(this.#node);\n      }\n    } catch (e) {\n      this._onError(e);\n    }\n    return !!res;\n  }\n\n  /**\n   * closest\n   * @param {string} selector - CSS selector\n   * @param {object} node - Element node\n   * @param {object} opt - options\n   * @returns {?object} - matched node\n   */\n  closest(selector, node, opt) {\n    let res;\n    try {\n      this.#node = this._setup(selector, node, opt);\n      if (node.nodeType !== ELEMENT_NODE) {\n        const msg = `Unexpected node ${node.nodeName}`;\n        throw new TypeError(msg);\n      }\n      const nodes = this._find(TARGET_LINEAL);\n      let refNode = this.#node;\n      while (refNode) {\n        if (nodes.has(refNode)) {\n          res = refNode;\n          break;\n        }\n        if (refNode.parentNode) {\n          refNode = refNode.parentNode;\n        } else {\n          break;\n        }\n      }\n    } catch (e) {\n      this._onError(e);\n    }\n    return res ?? null;\n  }\n\n  /**\n   * query selector\n   * @param {string} selector - CSS selector\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @param {object} opt - options\n   * @returns {?object} - matched node\n   */\n  querySelector(selector, node, opt) {\n    let res;\n    try {\n      this.#node = this._setup(selector, node, opt);\n      this._prepareTreeWalkers(node);\n      const nodes = this._find(TARGET_FIRST);\n      nodes.delete(this.#node);\n      if (nodes.size) {\n        [res] = sortNodes(nodes);\n      }\n    } catch (e) {\n      this._onError(e);\n    }\n    return res ?? null;\n  }\n\n  /**\n   * query selector all\n   * NOTE: returns Array, not NodeList\n   * @param {string} selector - CSS selector\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @param {object} opt - options\n   * @returns {Array.<object|undefined>} - collection of matched nodes\n   */\n  querySelectorAll(selector, node, opt) {\n    let res;\n    try {\n      this.#node = this._setup(selector, node, opt);\n      this._prepareTreeWalkers(node);\n      const nodes = this._find(TARGET_ALL);\n      nodes.delete(this.#node);\n      if (nodes.size) {\n        if (this.#sort) {\n          res = sortNodes(nodes);\n        } else {\n          res = [...nodes];\n        }\n      }\n    } catch (e) {\n      this._onError(e);\n    }\n    return res ?? [];\n  }\n};\n"],
-  "mappings": "6iBAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,YAAAE,IAAA,eAAAC,EAAAH,GAKA,IAAAI,EAAgC,iDAChCC,EAGO,yBACPC,EAA0D,wBAC1DC,EAEO,uBAGPC,EAMO,yBACP,MAAMC,EAAW,OACXC,EAAW,OACXC,EAAa,MACbC,EAAe,QACfC,EAAgB,SAChBC,EAAc,OACdC,EAAgB,gBAAgB,yBAAyB,eAgCxD,MAAMb,CAAO,CAElBc,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAKA,aAAc,CACZ,KAAKZ,GAAS,IAAI,OACpB,CASA,SAASa,EAAG,CACV,GAAI,CAAC,KAAKR,GACR,GAAIQ,aAAa,cACZ,KAAKD,IAAWC,aAAa,KAAKD,GAAQ,aAC7C,GAAIC,EAAE,OAAS,oBACT,KAAKF,IACP,QAAQ,KAAKE,EAAE,OAAO,MAEnB,OAAI,KAAKD,GACR,IAAI,KAAKA,GAAQ,aAAaC,EAAE,QAASA,EAAE,IAAI,EAE/CA,MAGR,OAAMA,CAGZ,CAYA,OAAOC,EAAUC,EAAMC,EAAM,CAAC,EAAG,CAC/B,KAAM,CAAE,SAAAC,EAAU,KAAAC,CAAK,EAAIF,EAC3B,YAAKX,GAAY,CAAC,CAACY,EACnB,KAAKN,GAAQ,CAAC,CAACO,EACf,KAAKf,GAAQY,EACb,CAAC,KAAKH,GAAS,KAAKX,GAAW,KAAKM,EAAK,KAAI,qBAAkBQ,CAAI,EACnE,KAAKP,MAAU,kBAAeO,CAAI,EAClC,CAAC,KAAKhB,GAAM,KAAKK,EAAM,EAAI,KAAK,YAAYU,CAAQ,EACpD,KAAKR,GAAW,IAAI,QACbS,CACT,CAQA,YAAYD,EAAU,CACpB,MAAMK,EAAQ,CAAC,EACf,IAAIC,EACAC,EAAa,KAAKpB,IAAa,KAAKD,GAAO,IAAI,KAAKC,EAAS,EAIjE,GAHIoB,GAAcA,EAAW,IAAI,GAAGP,CAAQ,EAAE,IAC5CM,EAAMC,EAAW,IAAIP,CAAQ,GAE3BM,EAAK,CACP,MAAME,EAAIF,EAAI,OACd,QAASG,EAAI,EAAGA,EAAID,EAAGC,IACrBH,EAAIG,CAAC,EAAE,IAAM,KACbH,EAAIG,CAAC,EAAE,SAAW,GAClBH,EAAIG,CAAC,EAAE,KAAO,GACdJ,EAAMI,CAAC,EAAI,CAAC,CAEhB,KAAO,CACL,IAAIC,EACJ,GAAI,CACFA,KAAS,iBAAcV,CAAQ,CACjC,OAASD,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,MAAMY,KAAW,WAAQD,CAAM,EAC/BJ,EAAM,CAAC,EACP,IAAIG,EAAI,EACR,SAAW,CAAC,GAAGG,CAAK,IAAKD,EAAU,CACjC,MAAME,EAAS,CAAC,EAChB,IAAIC,EAAOF,EAAM,MAAM,EACvB,GAAIE,GAAQA,EAAK,OAAS,aAAY,CACpC,MAAMC,EAAS,IAAI,IACnB,KAAOD,GAAM,CACX,GAAIA,EAAK,OAAS,aAAY,CAC5B,KAAM,CAACE,CAAQ,EAAIJ,EACnB,GAAII,EAAS,OAAS,aAAY,CAChC,MAAMC,EAAM,oBAAoBjB,CAAQ,GACxC,MAAM,IAAI,aAAaiB,EAAK,YAAU,CACxC,CACAJ,EAAO,KAAK,CACV,MAAOC,EACP,UAAQ,WAAQC,CAAM,CACxB,CAAC,EACDA,EAAO,MAAM,CACf,MAAWD,GACTC,EAAO,IAAID,CAAI,EAEjB,GAAIF,EAAM,OACRE,EAAOF,EAAM,MAAM,MACd,CACLC,EAAO,KAAK,CACV,MAAO,KACP,UAAQ,WAAQE,CAAM,CACxB,CAAC,EACDA,EAAO,MAAM,EACb,KACF,CACF,CACF,CACAT,EAAI,KAAK,CACP,OAAAO,EACA,IAAK,KACL,SAAU,GACV,KAAM,EACR,CAAC,EACDR,EAAMI,CAAC,EAAI,CAAC,EACZA,GACF,CACI,KAAKtB,KACFoB,IACHA,EAAa,IAAI,KAEnBA,EAAW,IAAI,GAAGP,CAAQ,GAAIM,CAAG,EACjC,KAAKpB,GAAO,IAAI,KAAKC,GAAWoB,CAAU,EAE9C,CACA,MAAO,CACLD,EACAD,CACF,CACF,CAQA,oBAAoBJ,EAAM,CACxB,YAAKL,GAAQ,KAAKT,GAAU,iBAAiB,KAAKM,GAAOT,CAAa,EACtE,KAAKI,GAAU,KAAKD,GAAU,iBAAiBc,EAAMjB,CAAa,EAClE,KAAKW,GAAQ,GACN,CACL,KAAKC,GACL,KAAKR,EACP,CACF,CASA,UAAUa,EAAO,CAAC,EAAGiB,EAAS,KAAKtB,GAAO,CACxC,IAAIuB,EACAC,EAAUF,EAAO,YACrB,GAAIjB,EAAK,WAAa,gBAAgBmB,IAAYnB,EAChDkB,EAAUC,MACL,CACL,GAAIA,IAAYF,EAAO,KACrB,KAAOE,GACD,EAAAA,IAAYF,EAAO,MAClBjB,EAAK,WAAa,gBAAgBmB,IAAYnB,IAGnDmB,EAAUF,EAAO,WAAW,EAGhC,GAAIjB,EAAK,WAAa,eACpB,KAAOmB,GAAS,CACd,GAAIA,IAAYnB,EAAM,CACpBkB,EAAUC,EACV,KACF,CACAA,EAAUF,EAAO,SAAS,CAC5B,MAEAC,EAAUC,CAEd,CACA,OAAOD,GAAW,IACpB,CAcA,iBAAiBE,EAAKpB,EAAMC,EAAK,CAC/B,KAAM,CAAE,EAAAoB,EAAG,EAAAC,EAAG,QAAAC,EAAS,SAAAxB,CAAS,EAAIqB,EAC9B,CAAE,WAAAI,CAAW,EAAIxB,EACvB,IAAIyB,EAAU,IAAI,IACdC,EASJ,GARI3B,IACE,KAAKd,GAAO,IAAIc,CAAQ,EAC1B2B,EAAmB,KAAKzC,GAAO,IAAIc,CAAQ,GAE3C2B,KAAmB,WAAQ3B,CAAQ,EACnC,KAAKd,GAAO,IAAIc,EAAU2B,CAAgB,IAG1CF,EAAY,CACd,MAAMP,EAAS,KAAK/B,GAAU,iBAAiBsC,EAAYzC,CAAa,EACxE,IAAIwB,EAAI,EACJY,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACLZ,IACAY,EAAUF,EAAO,YAAY,EAE/BE,EAAU,KAAK,UAAUK,EAAYP,CAAM,EAC3C,MAAMU,EAAgB,IAAI,IAC1B,GAAID,EAGF,IAFAP,EAAU,KAAK,UAAUK,EAAYP,CAAM,EAC3CE,EAAUF,EAAO,WAAW,EACrBE,GAAS,CACd,IAAIS,EACJ,UAAWd,KAAUY,EAEnB,GADAE,EAAO,KAAK,aAAad,EAAQK,EAASlB,CAAG,EACzC,CAAC2B,EACH,MAGAA,GACFD,EAAc,IAAIR,CAAO,EAE3BA,EAAUF,EAAO,YAAY,CAC/B,CAGF,GAAII,IAAM,GACR,GAAIC,EAAI,GAAKA,GAAKf,GAChB,GAAIoB,EAAc,KAAM,CACtB,IAAInB,EAAI,EAOR,IANAW,EAAU,KAAK,UAAUK,EAAYP,CAAM,EACvCM,EACFJ,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,GAAS,CACd,GAAIQ,EAAc,IAAIR,CAAO,EAAG,CAC9B,GAAIX,IAAMc,EAAI,EAAG,CACfG,EAAQ,IAAIN,CAAO,EACnB,KACF,CACAX,GACF,CACIe,EACFJ,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,CAEjC,CACF,SAAW,CAAClB,EAAU,CACpB,IAAIS,EAAI,EAOR,IANAW,EAAU,KAAK,UAAUK,EAAYP,CAAM,EACvCM,EACFJ,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,GAAS,CACd,GAAIX,IAAMc,EAAI,EAAG,CACfG,EAAQ,IAAIN,CAAO,EACnB,KACF,CACII,EACFJ,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,EAE/BT,GACF,CACF,OAGG,CACL,IAAIqB,EAAMP,EAAI,EACd,GAAID,EAAI,EACN,KAAOQ,EAAM,GACXA,GAAOR,EAGX,GAAIQ,GAAO,GAAKA,EAAMtB,EAAG,CACvB,IAAIC,EAAI,EACJsB,EAAIT,EAAI,EAAI,EAAIC,EAAI,EAOxB,IANAH,EAAU,KAAK,UAAUK,EAAYP,CAAM,EACvCM,EACFJ,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,IACDA,GAAWU,GAAO,GAAKA,EAAMtB,IAC3BoB,EAAc,KACZA,EAAc,IAAIR,CAAO,IACvBW,IAAMD,IACRJ,EAAQ,IAAIN,CAAO,EACnBU,GAAOR,GAELA,EAAI,EACNS,IAEAA,KAGKtB,IAAMqB,IACV9B,GACH0B,EAAQ,IAAIN,CAAO,EAErBU,GAAOR,GAELE,EACFJ,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,EAE/BT,GAKN,CACF,CACA,GAAIe,GAAWE,EAAQ,KAAO,EAAG,CAC/B,MAAM,EAAI,CAAC,GAAGA,CAAO,EACrBA,EAAU,IAAI,IAAI,EAAE,QAAQ,CAAC,CAC/B,CACF,SAAWzB,IAAS,KAAKR,IAAU6B,EAAIC,IAAO,EAC5C,GAAII,EAAkB,CACpB,IAAIE,EACJ,UAAWd,KAAUY,EAEnB,GADAE,EAAO,KAAK,aAAad,EAAQd,EAAMC,CAAG,EACtC2B,EACF,MAGAA,GACFH,EAAQ,IAAIzB,CAAI,CAEpB,MACEyB,EAAQ,IAAIzB,CAAI,EAGpB,OAAOyB,CACT,CAYA,kBAAkBL,EAAKpB,EAAM,CAC3B,KAAM,CAAE,EAAAqB,EAAG,EAAAC,EAAG,QAAAC,CAAQ,EAAIH,EACpB,CAAE,UAAAW,EAAW,WAAAP,EAAY,OAAAQ,CAAO,EAAIhC,EAC1C,IAAIyB,EAAU,IAAI,IAClB,GAAID,EAAY,CACd,MAAMP,EAAS,KAAK/B,GAAU,iBAAiBsC,EAAYzC,CAAa,EACxE,IAAI,EAAI,EACJoC,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACL,IACAA,EAAUF,EAAO,YAAY,EAG/B,GAAII,IAAM,GACR,GAAIC,EAAI,GAAKA,GAAK,EAAG,CACnB,IAAIQ,EAAI,EAOR,IANAX,EAAU,KAAK,UAAUK,EAAYP,CAAM,EACvCM,EACFJ,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,GAAS,CACd,KAAM,CAAE,UAAWc,EAAe,OAAQC,CAAW,EAAIf,EACzD,GAAIc,IAAkBF,GAAaG,IAAeF,EAAQ,CACxD,GAAIF,IAAMR,EAAI,EAAG,CACfG,EAAQ,IAAIN,CAAO,EACnB,KACF,CACAW,GACF,CACIP,EACFJ,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,CAEjC,CACF,MAEK,CACL,IAAIY,EAAMP,EAAI,EACd,GAAID,EAAI,EACN,KAAOQ,EAAM,GACXA,GAAOR,EAGX,GAAIQ,GAAO,GAAKA,EAAM,EAAG,CACvB,IAAIC,EAAIT,EAAI,EAAI,EAAIC,EAAI,EAOxB,IANAH,EAAU,KAAK,UAAUK,EAAYP,CAAM,EACvCM,EACFJ,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,GAAS,CACd,KAAM,CAAE,UAAWc,EAAe,OAAQC,CAAW,EAAIf,EACzD,GAAIc,IAAkBF,GAAaG,IAAeF,EAAQ,CAKxD,GAJIF,IAAMD,IACRJ,EAAQ,IAAIN,CAAO,EACnBU,GAAOR,GAELQ,EAAM,GAAKA,GAAO,EACpB,MACSR,EAAI,EACbS,IAEAA,GAEJ,CACIP,EACFJ,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,CAEjC,CACF,CACF,CACA,GAAIM,GAAWE,EAAQ,KAAO,EAAG,CAC/B,MAAMU,EAAI,CAAC,GAAGV,CAAO,EACrBA,EAAU,IAAI,IAAIU,EAAE,QAAQ,CAAC,CAC/B,CACF,MAAWnC,IAAS,KAAKR,IAAU6B,EAAIC,IAAO,GAC5CG,EAAQ,IAAIzB,CAAI,EAElB,OAAOyB,CACT,CAWA,cAAcpB,EAAKL,EAAMoC,EAASnC,EAAK,CACrC,KAAM,CACJ,IAAK,CACH,EAAAoB,EACA,EAAAC,EACA,KAAMe,CACR,EACA,SAAAtC,CACF,EAAIM,EACEiC,KAAY,oBAAiBD,CAAY,EACzCE,EAAS,IAAI,IACfD,GACEA,IAAc,QAChBC,EAAO,IAAI,IAAK,CAAC,EACjBA,EAAO,IAAI,IAAK,CAAC,GACRD,IAAc,QACvBC,EAAO,IAAI,IAAK,CAAC,EACjBA,EAAO,IAAI,IAAK,CAAC,GAEfH,EAAQ,QAAQ,MAAM,EAAI,IAC5BG,EAAO,IAAI,UAAW,EAAI,IAGxB,OAAOlB,GAAM,UAAY,QAAQ,KAAKA,CAAC,EACzCkB,EAAO,IAAI,IAAKlB,EAAI,CAAC,EAErBkB,EAAO,IAAI,IAAK,CAAC,EAEf,OAAOjB,GAAM,UAAY,QAAQ,KAAKA,CAAC,EACzCiB,EAAO,IAAI,IAAKjB,EAAI,CAAC,EAErBiB,EAAO,IAAI,IAAK,CAAC,EAEfH,EAAQ,QAAQ,MAAM,EAAI,IAC5BG,EAAO,IAAI,UAAW,EAAI,GAG9B,IAAId,EAAU,IAAI,IAClB,GAAIc,EAAO,IAAI,GAAG,GAAKA,EAAO,IAAI,GAAG,GACnC,GAAI,wBAAwB,KAAKH,CAAO,EAAG,CACrCrC,GACFwC,EAAO,IAAI,WAAYxC,CAAQ,EAEjC,MAAMqB,EAAM,OAAO,YAAYmB,CAAM,EAC/BnC,EAAQ,KAAK,iBAAiBgB,EAAKpB,EAAMC,CAAG,EAC9CG,EAAM,OACRqB,EAAUrB,EAEd,SAAW,0BAA0B,KAAKgC,CAAO,EAAG,CAClD,MAAMhB,EAAM,OAAO,YAAYmB,CAAM,EAC/BnC,EAAQ,KAAK,kBAAkBgB,EAAKpB,CAAI,EAC1CI,EAAM,OACRqB,EAAUrB,EAEd,EAEF,OAAOqB,CACT,CASA,2BAA2BpB,EAAKL,EAAM,CACpC,MAAMwC,KAAU,oBAAiBnC,EAAI,IAAI,EACnCoC,KAAM,qBAAkBzC,CAAI,EAClC,IAAI0C,EACJ,OAAIF,IAAYC,IACdC,EAAM1C,GAED0C,GAAO,IAChB,CAUA,0BAA0BrC,EAAKL,EAAM,CACnC,MAAMwC,KAAU,oBAAiBnC,EAAI,IAAI,EACzC,IAAIqC,EACJ,GAAIF,IAAY,IACd,GAAIxC,EAAK,aAAa,MAAM,EACtBA,EAAK,aAAa,MAAM,IAC1B0C,EAAM1C,OAEH,CACL,IAAI2C,EAAS3C,EAAK,WAClB,KAAO2C,GACDA,EAAO,WAAa,gBAAc,CACpC,GAAIA,EAAO,aAAa,MAAM,EAAG,CAC3BA,EAAO,aAAa,MAAM,IAC5BD,EAAM1C,GAER,KACF,CACA2C,EAASA,EAAO,UAClB,CAIJ,SACSH,EAAS,CAClB,MAAMI,EAAW,OAAO,WAAS,KAEjC,GADgB,IAAI,OAAO,aAAa,WAAS,GAAGA,CAAQ,IAAK,GAAG,EACxD,KAAKJ,CAAO,EAAG,CACzB,IAAIK,EACJ,GAAIL,EAAQ,QAAQ,GAAG,EAAI,GAAI,CAC7B,KAAM,CAACM,EAAUC,EAAS,GAAGC,CAAQ,EAAIR,EAAQ,MAAM,GAAG,EAC1D,IAAIS,EACAH,IAAa,IACfG,EAAe,GAAG,WAAS,GAAGL,CAAQ,GAEtCK,EAAe,GAAGH,CAAQ,GAAGF,CAAQ,GAEvC,MAAMM,EAAc,IAAIH,CAAO,GAAGH,CAAQ,GACpCO,EAAMH,EAAS,OACrB,IAAII,EAAe,GACnB,GAAID,EACF,QAAS3C,EAAI,EAAGA,EAAI2C,EAAK3C,IACvB4C,GAAgB,IAAIJ,EAASxC,CAAC,CAAC,GAAGoC,CAAQ,GAG9CC,EACE,IAAI,OAAO,IAAII,CAAY,GAAGC,CAAW,GAAGE,CAAY,IAAK,GAAG,CACpE,MACEP,EAAkB,IAAI,OAAO,IAAIL,CAAO,GAAGI,CAAQ,IAAK,GAAG,EAE7D,GAAI5C,EAAK,aAAa,MAAM,EACtB6C,EAAgB,KAAK7C,EAAK,aAAa,MAAM,CAAC,IAChD0C,EAAM1C,OAEH,CACL,IAAI2C,EAAS3C,EAAK,WAClB,KAAO2C,GACDA,EAAO,WAAa,gBAAc,CACpC,GAAIA,EAAO,aAAa,MAAM,EAAG,CAC/B,MAAMU,EAAQV,EAAO,aAAa,MAAM,EACpCE,EAAgB,KAAKQ,CAAK,IAC5BX,EAAM1C,GAER,KACF,CACA2C,EAASA,EAAO,UAClB,CAIJ,CACF,CACF,CACA,OAAOD,GAAO,IAChB,CAUA,oBAAoB5B,EAAQd,EAAMC,EAAM,CAAC,EAAG,CAC1C,IAAI2B,EACJ,GAAI,MAAM,QAAQd,CAAM,GAAKA,EAAO,OAAQ,CAC1C,KAAM,CAACwC,CAAI,EAAIxC,EACT,CAAE,KAAMyC,CAAS,EAAID,EAC3B,IAAIE,EACAD,IAAa,aACfC,EAAQ1C,EAAO,MAAM,EAErB0C,EAAQ,CACN,KAAM,IACN,KAAM,YACR,EAEF,MAAMC,EAAa,CAAC,EACpB,KAAO3C,EAAO,QAAQ,CACpB,KAAM,CAACD,CAAI,EAAIC,EACT,CAAE,KAAM4C,CAAS,EAAI7C,EAC3B,GAAI6C,IAAa,aACf,MAEAD,EAAW,KAAK3C,EAAO,MAAM,CAAC,CAElC,CACA,MAAM6C,EAAO,CACX,MAAAH,EACA,OAAQC,CACV,EACAxD,EAAI,IAAMxB,EACV,MAAM2B,EAAQ,KAAK,iBAAiBuD,EAAM3D,EAAMC,CAAG,EACnD,GAAIG,EAAM,KACR,GAAIU,EAAO,QACT,UAAW8C,KAAYxD,EAGrB,GAFAwB,EAAO,KAAK,oBAAoB,OAAO,OAAO,CAAC,EAAGd,CAAM,EACtD8C,EAAU3D,CAAG,EACX2B,EACF,WAIJA,EAAO,EAGb,CACA,MAAO,CAAC,CAACA,CACX,CAUA,wBAAwBiC,EAAS7D,EAAMC,EAAM,CAAC,EAAG,CAC/C,KAAM,CACJ,QAAAuC,EAAU,GAAI,SAAA9B,EAAW,CAAC,EAAG,SAAAX,EAAW,GAAI,aAAA+D,EAAe,CAAC,CAC9D,EAAID,EACJ,IAAInB,EACJ,GAAIF,IAAY,MACd,GAAIzC,EAAS,SAAS,OAAO,EAC3B2C,EAAM,SACD,CACL,IAAId,EACJ,UAAWd,KAAUJ,EAEnB,GADAkB,EAAO,KAAK,oBAAoB,OAAO,OAAO,CAAC,EAAGd,CAAM,EAAGd,EAAMC,CAAG,EAChE2B,EACF,MAGAA,IACFc,EAAM1C,EAEV,KACK,CACL,MAAM+D,EAAU,iBAAiB,KAAKvB,CAAO,EAC7CvC,EAAI,QAAU8D,EACd,MAAMxD,EAAIuD,EAAa,OACvB,IAAIlC,EACJ,QAASpB,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMI,EAASkD,EAAatD,CAAC,EACvBwD,EAAYpD,EAAO,OAAS,EAC5B,CAAE,OAAAE,CAAO,EAAIF,EAAOoD,CAAS,EAEnC,GADApC,EAAO,KAAK,aAAad,EAAQd,EAAMC,CAAG,EACtC2B,GAAQoC,EAAY,EAAG,CACzB,IAAIC,EAAY,IAAI,IAAI,CAACjE,CAAI,CAAC,EAC9B,QAAS8B,EAAIkC,EAAY,EAAGlC,GAAK,EAAGA,IAAK,CACvC,MAAM6B,EAAO/C,EAAOkB,CAAC,EACfoC,EAAM,CAAC,EACbjE,EAAI,IAAMvB,EACV,UAAWkF,KAAYK,EAAW,CAChC,MAAM9B,EAAI,KAAK,iBAAiBwB,EAAMC,EAAU3D,CAAG,EAC/CkC,EAAE,MACJ+B,EAAI,KAAK,GAAG/B,CAAC,CAEjB,CACA,GAAI+B,EAAI,OACFpC,IAAM,EACRF,EAAO,GAEPqC,EAAY,IAAI,IAAIC,CAAG,MAEpB,CACLtC,EAAO,GACP,KACF,CACF,CACF,CACA,GAAIA,EACF,KAEJ,CACIY,IAAY,MACTZ,IACHc,EAAM1C,GAEC4B,IACTc,EAAM1C,EAEV,CACA,OAAO0C,GAAO,IAChB,CAaA,0BAA0BrC,EAAKL,EAAMC,EAAM,CAAC,EAAG,CAC7C,KAAM,CAAE,SAAUkE,CAAY,EAAI9D,EAC5B,CAAE,UAAA0B,EAAW,WAAAP,CAAW,EAAIxB,EAC5B,CACJ,QAAA+D,EACA,KAAA5D,EAAO,KAAKP,EACd,EAAIK,EACEuC,KAAU,oBAAiBnC,EAAI,IAAI,EACzC,IAAIoB,EAAU,IAAI,IAElB,GAAI,qBAAmB,KAAKe,CAAO,EAAG,CACpC,IAAIqB,EACJ,GAAI,KAAK5E,GAAO,IAAIoB,CAAG,EACrBwD,EAAU,KAAK5E,GAAO,IAAIoB,CAAG,MACxB,CACL,MAAMK,KAAW,WAAQL,CAAG,EACtB+D,EAAY,CAAC,EACbN,EAAe,CAAC,EACtB,SAAW,CAAC,GAAGhD,CAAM,IAAKJ,EAAU,CAClC,UAAW4C,KAAQxC,EAAQ,CACzB,MAAMuD,KAAM,eAAYf,CAAI,EAC5Bc,EAAU,KAAKC,CAAG,CACpB,CACA,MAAMzD,EAAS,CAAC,EACV0D,EAAY,IAAI,IACtB,IAAIzD,EAAOC,EAAO,MAAM,EACxB,KAAOD,GAUL,GATIA,EAAK,OAAS,cAChBD,EAAO,KAAK,CACV,MAAOC,EACP,OAAQ,CAAC,GAAGyD,CAAS,CACvB,CAAC,EACDA,EAAU,MAAM,GACPzD,GACTyD,EAAU,IAAIzD,CAAI,EAEhBC,EAAO,OACTD,EAAOC,EAAO,MAAM,MACf,CACLF,EAAO,KAAK,CACV,MAAO,KACP,OAAQ,CAAC,GAAG0D,CAAS,CACvB,CAAC,EACDA,EAAU,MAAM,EAChB,KACF,CAEFR,EAAa,KAAKlD,CAAM,CAC1B,CACAiD,EAAU,CACR,QAAArB,EACA,SAAA9B,EACA,aAAAoD,EACA,SAAUM,EAAU,KAAK,GAAG,CAC9B,EACA,KAAKnF,GAAO,IAAIoB,EAAKwD,CAAO,CAC9B,CACA,MAAMnB,EAAM,KAAK,wBAAwBmB,EAAS7D,EAAMC,CAAG,EACvDyC,GACFjB,EAAQ,IAAIiB,CAAG,CAEnB,SAAW,MAAM,QAAQyB,CAAW,EAAG,CACrC,KAAM,CAACvD,CAAM,EAAIuD,EAEjB,GAAI,oCAAoC,KAAK3B,CAAO,EAAG,CACrD,MAAMpC,EAAQ,KAAK,cAAcQ,EAAQZ,EAAMwC,EAASvC,CAAG,EACvDG,EAAM,OACRqB,EAAUrB,EAGd,SAAWoC,IAAY,MAAO,CAC5B,MAAME,EAAM,KAAK,2BAA2B9B,EAAQZ,CAAI,EACpD0C,GACFjB,EAAQ,IAAIiB,CAAG,CAGnB,SAAWF,IAAY,OAAQ,CAC7B,MAAME,EAAM,KAAK,0BAA0B9B,EAAQZ,CAAI,EACnD0C,GACFjB,EAAQ,IAAIiB,CAAG,CAEnB,KACE,QAAQF,EAAS,CACf,IAAK,UACL,IAAK,UACL,IAAK,eAAgB,CACnB,GAAIrC,EAAM,CACR,MAAMa,EAAM,6BAA6BwB,CAAO,KAChD,MAAM,IAAI,aAAaxB,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,IAAK,OACL,IAAK,eAEH,MAEF,QACE,GAAI,CAAC+C,EAAS,CACZ,MAAM/C,EAAM,yBAAyBwB,CAAO,KAC5C,MAAM,IAAI,aAAaxB,EAAK,YAAU,CACxC,CAEJ,CAEJ,KAAO,CACL,MAAMuD,EAAY,cACZC,EACJ,iEACIC,EAAkB,6CAClBC,EAAc,sBACdC,EAAe,uBACfC,EAAc,4CACdC,EACJ,2DACIC,EAAc,oDACpB,OAAQtC,EAAS,CACf,IAAK,WACL,IAAK,OAAQ,CACP+B,EAAU,KAAKxC,CAAS,GAAK/B,EAAK,aAAa,MAAM,GACvDyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,aAAc,CACjB,GAAIuE,EAAU,KAAKxC,CAAS,GAAK/B,EAAK,aAAa,MAAM,EAAG,CAC1D,KAAM,CAAE,KAAA+E,EAAM,OAAAC,EAAQ,SAAAC,CAAS,EAAI,IAAI,IAAI,KAAK/F,GAAU,GAAG,EACvDgG,EAAU,IAAI,IAAIlF,EAAK,aAAa,MAAM,EAAG+E,CAAI,EACnDG,EAAQ,SAAWF,GAAUE,EAAQ,WAAaD,GACpDxD,EAAQ,IAAIzB,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAEH,MAEF,IAAK,SAAU,CACb,KAAM,CAAE,KAAAmF,CAAK,EAAI,IAAI,IAAI,KAAKjG,GAAU,GAAG,EACvCc,EAAK,IAAMmF,IAAS,IAAInF,EAAK,EAAE,IAC/B,KAAKd,GAAU,SAASc,CAAI,GAC9ByB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,KAAM,CAAE,KAAAmF,CAAK,EAAI,IAAI,IAAI,KAAKjG,GAAU,GAAG,EAC3C,GAAIiG,EAAM,CACR,MAAMC,EAAKD,EAAK,QAAQ,KAAM,EAAE,EAChC,IAAIjE,EAAU,KAAKhC,GAAU,eAAekG,CAAE,EAC9C,KAAOlE,GAAS,CACd,GAAIA,IAAYlB,EAAM,CACpByB,EAAQ,IAAIzB,CAAI,EAChB,KACF,CACAkB,EAAUA,EAAQ,UACpB,CACF,CACA,KACF,CACA,IAAK,QAAS,CACR,KAAK9B,GAAM,WAAa,eACtBY,IAAS,KAAKZ,IAChBqC,EAAQ,IAAIzB,CAAI,EAETA,IAAS,KAAKd,GAAU,iBACjCuC,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,QAAS,CACRA,IAAS,KAAKd,GAAU,eAC1BuC,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,IAAIkB,EAAU,KAAKhC,GAAU,cAC7B,KAAOgC,GAAS,CACd,GAAIA,IAAYlB,EAAM,CACpByB,EAAQ,IAAIzB,CAAI,EAChB,KACF,CACAkB,EAAUA,EAAQ,UACpB,CACA,KACF,CACA,IAAK,OAAQ,CACPwD,EAAY,KAAK3C,CAAS,GAAK/B,EAAK,aAAa,MAAM,GACzDyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,SAAU,CACT0E,EAAY,KAAK3C,CAAS,GAAK,CAAC/B,EAAK,aAAa,MAAM,GAC1DyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,GAAIwE,EAAY,KAAKzC,CAAS,MAAK,EAAAsD,SAAoBtD,CAAS,EAC9D,GAAI/B,EAAK,UAAYA,EAAK,aAAa,UAAU,EAC/CyB,EAAQ,IAAIzB,CAAI,MACX,CACL,IAAI2C,EAASnB,EACb,KAAOmB,GACDA,EAAO,YAAc,YAGzBA,EAASA,EAAO,WAEdA,GAAUnB,EAAW,YAAc,UACnCmB,EAAO,aAAa,UAAU,GAChClB,EAAQ,IAAIzB,CAAI,CAEpB,CAEF,KACF,CACA,IAAK,UAAW,EACTwE,EAAY,KAAKzC,CAAS,MAAK,EAAAsD,SAAoBtD,CAAS,IAC7D,EAAE/B,EAAK,UAAYA,EAAK,aAAa,UAAU,IACjDyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,YAAa,CAChB,OAAQ+B,EAAW,CACjB,IAAK,WAAY,EACX/B,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,QAAS,EACP,CAACA,EAAK,MAAQ4E,EAAY,KAAK5E,EAAK,IAAI,GACxC8E,EAAY,KAAK9E,EAAK,IAAI,KAC1BA,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAChDyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,WACO,qBAAkBA,CAAI,GACzByB,EAAQ,IAAIzB,CAAI,CAGtB,CACA,KACF,CACA,IAAK,aAAc,CACjB,OAAQ+B,EAAW,CACjB,IAAK,WAAY,CACT/B,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,GACjDyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,QAAS,EACP,CAACA,EAAK,MAAQ4E,EAAY,KAAK5E,EAAK,IAAI,GACxC8E,EAAY,KAAK9E,EAAK,IAAI,IAC3B,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,IACjDyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,WACM,qBAAkBA,CAAI,GACxByB,EAAQ,IAAIzB,CAAI,CAGtB,CACA,KACF,CACA,IAAK,oBAAqB,CACxB,IAAIsF,EACAvD,IAAc,WAChBuD,EAAatF,EACJ+B,IAAc,UACnB/B,EAAK,aAAa,MAAM,EACtB8E,EAAY,KAAK9E,EAAK,aAAa,MAAM,CAAC,IAC5CsF,EAAatF,GAGfsF,EAAatF,GAGbsF,GAActF,EAAK,QAAU,IAC7BA,EAAK,aAAa,aAAa,GAC/BA,EAAK,aAAa,aAAa,EAAE,KAAK,EAAE,QAC1CyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,UAAW,EACTA,EAAK,SAAW+B,IAAc,SAC9B/B,EAAK,aAAa,MAAM,GACxB2E,EAAa,KAAK3E,EAAK,aAAa,MAAM,CAAC,GAC3CA,EAAK,UAAY+B,IAAc,WAClCN,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,GAAKA,EAAK,eAAiB+B,IAAc,SACpC/B,EAAK,OAAS,YACd+B,IAAc,YAAc,CAAC/B,EAAK,aAAa,OAAO,EACzDyB,EAAQ,IAAIzB,CAAI,UACP+B,IAAc,SAAW/B,EAAK,OAAS,SACvC,CAACA,EAAK,aAAa,SAAS,EAAG,CACxC,MAAMuF,EAAWvF,EAAK,KACtB,IAAI2C,EAAS3C,EAAK,WAClB,KAAO2C,GACDA,EAAO,YAAc,QAGzBA,EAASA,EAAO,WAEbA,IACHA,EAAS,KAAKzD,GAAU,iBAE1B,IAAIsG,EACJ,MAAM7E,EAAQgC,EAAO,qBAAqB,OAAO,EAC3CpC,EAAII,EAAM,OAChB,GAAIJ,EACF,QAASC,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMK,EAAOF,EAAMH,CAAC,EACpB,GAAIK,EAAK,aAAa,MAAM,IAAM,UAC5B0E,EACE1E,EAAK,aAAa,MAAM,IAAM0E,IAChCC,EAAU,CAAC,CAAC3E,EAAK,SAETA,EAAK,aAAa,MAAM,IAClC2E,EAAU,CAAC,CAAC3E,EAAK,SAEf2E,GACF,KAGN,CAEGA,GACH/D,EAAQ,IAAIzB,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAAW,CACd,MAAMyF,EAAe,qBACfC,EAAgB,qBAEtB,GAAK3D,IAAc,UACd,EAAE/B,EAAK,aAAa,MAAM,GACxByF,EAAa,KAAKzF,EAAK,aAAa,MAAM,CAAC,IAC7C+B,IAAc,SAAW/B,EAAK,aAAa,MAAM,GACjD0F,EAAc,KAAK1F,EAAK,aAAa,MAAM,CAAC,EAAI,CACnD,IAAI2F,EAAO3F,EAAK,WAChB,KAAO2F,GACDA,EAAK,YAAc,QAGvBA,EAAOA,EAAK,WAEd,GAAIA,EAAM,CACR,MAAM1E,EACJ,KAAK/B,GAAU,iBAAiByG,EAAM,cAAY,EACpD,IAAI/B,EAAW3C,EAAO,WAAW,EACjC,KAAO2C,GAAU,CACf,MAAM2B,EAAW3B,EAAS,UAC1B,IAAIzB,EAQJ,GAPIoD,IAAa,SACfpD,EAAI,EAAEyB,EAAS,aAAa,MAAM,GAChC6B,EAAa,KAAK7B,EAAS,aAAa,MAAM,CAAC,GACxC2B,IAAa,UACtBpD,EAAIyB,EAAS,aAAa,MAAM,GAC9B8B,EAAc,KAAK9B,EAAS,aAAa,MAAM,CAAC,GAEhDzB,EAAG,CACDyB,IAAa5D,GACfyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA4D,EAAW3C,EAAO,SAAS,CAC7B,CACF,CAEF,SAAWc,IAAc,SAAW/B,EAAK,aAAa,MAAM,GACjD2E,EAAa,KAAK3E,EAAK,aAAa,MAAM,CAAC,IAC1CA,EAAK,SAAWA,EAAK,aAAa,SAAS,GACrDyB,EAAQ,IAAIzB,CAAI,UAEP+B,IAAc,SAAU,CACjC,IAAI6D,EAAa,GACbjD,EAASnB,EACb,KAAOmB,GACDA,EAAO,YAAc,YADZ,CAGN,GAAIA,EAAO,YAAc,SAAU,EACpCA,EAAO,UAAYA,EAAO,aAAa,UAAU,KACnDiD,EAAa,IAEf,KACF,CACAjD,EAASA,EAAO,UAClB,CACA,GAAIiD,GACE5F,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CyB,EAAQ,IAAIzB,CAAI,MAEb,CACL,MAAM6F,EAAa,IAAI,IACjB5E,EACJ,KAAK/B,GAAU,iBAAiBsC,EAAY,cAAY,EAC1D,IAAIL,EAAUF,EAAO,WAAW,EAChC,KAAOE,GAAS,CACd,GAAIA,EAAQ,UAAYA,EAAQ,aAAa,UAAU,EAAG,CACxD0E,EAAW,IAAI1E,CAAO,EACtB,KACF,CACAA,EAAUF,EAAO,YAAY,CAC/B,CACI4E,EAAW,MACTA,EAAW,IAAI7F,CAAI,GACrByB,EAAQ,IAAIzB,CAAI,CAGtB,CACF,CACA,KACF,CACA,IAAK,QAAS,CACZ,GAAIyE,EAAgB,KAAK1C,CAAS,EAC5B/B,EAAK,cAAc,GACrByB,EAAQ,IAAIzB,CAAI,UAET+B,IAAc,WAAY,CACnC,IAAIH,EACJ,MAAMX,EAAS,KAAK/B,GAAU,iBAAiBc,EAAM,cAAY,EACjE,IAAImB,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACD,EAAAsD,EAAgB,KAAKtD,EAAQ,SAAS,IACxCS,EAAOT,EAAQ,cAAc,EACzB,CAACS,KAIPT,EAAUF,EAAO,SAAS,EAExBW,GACFH,EAAQ,IAAIzB,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAAW,CACd,GAAIyE,EAAgB,KAAK1C,CAAS,EAC3B/B,EAAK,cAAc,GACtByB,EAAQ,IAAIzB,CAAI,UAET+B,IAAc,WAAY,CACnC,IAAIH,EACJ,MAAMX,EAAS,KAAK/B,GAAU,iBAAiBc,EAAM,cAAY,EACjE,IAAImB,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACD,EAAAsD,EAAgB,KAAKtD,EAAQ,SAAS,IACxCS,EAAOT,EAAQ,cAAc,EACzB,CAACS,KAIPT,EAAUF,EAAO,SAAS,EAEvBW,GACHH,EAAQ,IAAIzB,CAAI,CAEpB,CACA,KACF,CACA,IAAK,WAAY,CACX+B,IAAc,SACd,EAAE/B,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CA,EAAK,aAAa,MAAM,GACxB6E,EAAa,KAAK7E,EAAK,aAAa,MAAM,CAAC,GAC3C,EAAEA,EAAK,SAAS,gBACdA,EAAK,SAAS,iBACfA,EAAK,aAAa,KAAK,GAAKA,EAAK,aAAa,KAAK,GACnDA,EAAK,aAAa,MAAM,IAAM,UACjCyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACf+B,IAAc,SACd,EAAE/B,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CA,EAAK,aAAa,MAAM,GACxB6E,EAAa,KAAK7E,EAAK,aAAa,MAAM,CAAC,IAC1CA,EAAK,SAAS,gBAAkBA,EAAK,SAAS,gBACjDyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,IAAIsF,EACJ,GAAI,wBAAwB,KAAKvD,CAAS,EACxCuD,EAAatF,UACJ+B,IAAc,QACvB,GAAI/B,EAAK,aAAa,MAAM,EAAG,CAC7B,MAAM8F,EAAY9F,EAAK,aAAa,MAAM,GACtC8F,IAAc,QAAUnB,EAAa,KAAKmB,CAAS,GACnDlB,EAAY,KAAKkB,CAAS,GAAKhB,EAAY,KAAKgB,CAAS,KAC3DR,EAAatF,EAEjB,MACEsF,EAAatF,EAGbsF,IACCtF,EAAK,UAAYA,EAAK,aAAa,UAAU,IAChDyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,IAAIsF,EACJ,GAAI,wBAAwB,KAAKvD,CAAS,EACxCuD,EAAatF,UACJ+B,IAAc,QACvB,GAAI/B,EAAK,aAAa,MAAM,EAAG,CAC7B,MAAM8F,EAAY9F,EAAK,aAAa,MAAM,GACtC8F,IAAc,QAAUnB,EAAa,KAAKmB,CAAS,GACnDlB,EAAY,KAAKkB,CAAS,GAAKhB,EAAY,KAAKgB,CAAS,KAC3DR,EAAatF,EAEjB,MACEsF,EAAatF,EAGbsF,GACA,EAAEtF,EAAK,UAAYA,EAAK,aAAa,UAAU,IACjDyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,OAAQ,CACPA,IAAS,KAAKd,GAAU,iBAC1BuC,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,QAAS,CACZ,GAAIA,EAAK,cAAc,EAAG,CACxB,IAAI4B,EACJ,MAAMX,EAAS,KAAK/B,GAAU,iBAAiBc,EAAM,UAAQ,EAC7D,IAAImB,EAAUF,EAAO,WAAW,EAChC,KAAOE,IACLS,EAAOT,EAAQ,WAAa,gBAC1BA,EAAQ,WAAa,YACnB,EAACS,IAGLT,EAAUF,EAAO,YAAY,EAE3BW,GACFH,EAAQ,IAAIzB,CAAI,CAEpB,MACEyB,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,cAAe,EACbwB,GAAcxB,IAASwB,EAAW,mBACnCxB,IAAS,KAAKR,KAChBiC,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,aAAc,EACZwB,GAAcxB,IAASwB,EAAW,kBACnCxB,IAAS,KAAKR,KAChBiC,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,aAAc,EACZwB,GAAcxB,IAASwB,EAAW,mBAClCxB,IAASwB,EAAW,kBAAqBxB,IAAS,KAAKR,KAC1DiC,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,GAAIwB,EAAY,CACd,KAAM,CAACuE,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,CACL,EAAG/F,CAAI,EACH+F,GACFtE,EAAQ,IAAIsE,CAAK,CAErB,MAAW/F,IAAS,KAAKR,IACvBiC,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,GAAIwB,EAAY,CACd,KAAM,CAACuE,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,EACH,QAAS,EACX,EAAG/F,CAAI,EACH+F,GACFtE,EAAQ,IAAIsE,CAAK,CAErB,MAAW/F,IAAS,KAAKR,IACvBiC,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,GAAIwB,EAAY,CACd,KAAM,CAACuE,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,CACL,EAAG/F,CAAI,EACP,GAAI+F,IAAU/F,EAAM,CAClB,KAAM,CAACgG,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,EACH,QAAS,EACX,EAAGhG,CAAI,EACHgG,IAAUhG,GACZyB,EAAQ,IAAIzB,CAAI,CAEpB,CACF,MAAWA,IAAS,KAAKR,IACvBiC,EAAQ,IAAIzB,CAAI,EAElB,KACF,CACA,IAAK,OACL,IAAK,eAEH,MAGF,IAAK,QACL,IAAK,SACL,IAAK,eACL,IAAK,aAAc,CACjB,GAAIG,EAAM,CACR,MAAMa,EAAM,gCAAgCwB,CAAO,GACnD,MAAM,IAAI,aAAaxB,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,IAAK,SACL,IAAK,WACL,IAAK,QACL,IAAK,YACL,IAAK,UACL,IAAK,UACL,IAAK,gBACL,IAAK,aACL,IAAK,SACL,IAAK,QACL,IAAK,QACL,IAAK,QACL,IAAK,OACL,IAAK,SACL,IAAK,qBACL,IAAK,UACL,IAAK,UACL,IAAK,UACL,IAAK,eACL,IAAK,aACL,IAAK,gBACL,IAAK,mBAAoB,CACvB,GAAIb,EAAM,CACR,MAAMa,EAAM,6BAA6BwB,CAAO,GAChD,MAAM,IAAI,aAAaxB,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,QACE,GAAIwB,EAAQ,WAAW,UAAU,GAC/B,GAAIrC,EAAM,CACR,MAAMa,EAAM,6BAA6BwB,CAAO,GAChD,MAAM,IAAI,aAAaxB,EAAK,mBAAiB,CAC/C,UACS,CAAC+C,EAAS,CACnB,MAAM/C,EAAM,yBAAyBwB,CAAO,GAC5C,MAAM,IAAI,aAAaxB,EAAK,YAAU,CACxC,CAEJ,CACF,CACA,OAAOS,CACT,CASA,4BAA4BpB,EAAKL,EAAM,CACrC,KAAM,CAAE,SAAUmE,CAAY,EAAI9D,EAC5BmC,KAAU,oBAAiBnC,EAAI,IAAI,EACzC,IAAIqC,EACJ,GAAI,MAAM,QAAQyB,CAAW,EAAG,CAC9B,KAAM,CAACvD,CAAM,KAAI,WAAQuD,EAAY,CAAC,CAAC,EACjC,CAAC,GAAGrD,CAAM,EAAIF,EACd,CAAE,KAAAqF,CAAK,EAAIjG,EACjB,GAAIwC,IAAY,OAAQ,CACtB,IAAIZ,EACJ,UAAW0B,KAAQxC,EAAQ,CACzB,KAAM,CAAE,KAAMyC,CAAS,EAAID,EAC3B,GAAIC,IAAa,aAAY,CAE3B,MAAMvC,EAAM,uBADA,eAAYX,CAAG,CACQ,GACnC,MAAM,IAAI,aAAaW,EAAK,YAAU,CACxC,CAEA,GADAY,EAAO,KAAK,eAAe0B,EAAM2C,CAAI,EAAE,IAAIA,CAAI,EAC3C,CAACrE,EACH,KAEJ,CACIA,IACFc,EAAM1C,EAEV,SAAWwC,IAAY,eAAgB,CACrC,IAAIZ,EACAe,EAASsD,EACb,KAAOtD,GAAQ,CACb,UAAWW,KAAQxC,EAAQ,CACzB,KAAM,CAAE,KAAMyC,CAAS,EAAID,EAC3B,GAAIC,IAAa,aAAY,CAE3B,MAAMvC,EAAM,uBADA,eAAYX,CAAG,CACQ,GACnC,MAAM,IAAI,aAAaW,EAAK,YAAU,CACxC,CAEA,GADAY,EAAO,KAAK,eAAe0B,EAAMX,CAAM,EAAE,IAAIA,CAAM,EAC/C,CAACf,EACH,KAEJ,CACA,GAAIA,EACF,MAEAe,EAASA,EAAO,UAEpB,CACIf,IACFc,EAAM1C,EAEV,CACF,SAAWwC,IAAY,OACrBE,EAAM1C,MACD,CACL,MAAMgB,EAAM,qBAAqBwB,CAAO,GACxC,MAAM,IAAI,aAAaxB,EAAK,YAAU,CACxC,CACA,OAAO0B,GAAO,IAChB,CAUA,eAAerC,EAAKL,EAAMC,EAAK,CAC7B,KAAM,CAAE,KAAMiG,CAAQ,EAAI7F,EACpBmC,KAAU,oBAAiBnC,EAAI,IAAI,EACzC,IAAIoB,EAAU,IAAI,IAClB,GAAIzB,EAAK,WAAa,eACpB,OAAQkG,EAAS,CACf,KAAK,wBAAuB,CAC1B,MAAM9F,EAAQ,KAAK,0BAA0BC,EAAKL,EAAMC,CAAG,EACvDG,EAAM,OACRqB,EAAUrB,GAEZ,KACF,CACA,KAAK,0BAAyB,IAC5B,8BAA2BoC,EAASvC,CAAG,EACvC,KACF,CACA,QAAS,CACP,MAAMyC,KAAM,iBAAcrC,EAAKL,EAAMC,CAAG,EACpCyC,GACFjB,EAAQ,IAAIiB,CAAG,CAEnB,CACF,SACS,KAAKjD,IAAWyG,IAAY,yBAC5BlG,EAAK,WAAa,0BAC3B,GAAIwC,IAAY,OAAS,qBAAmB,KAAKA,CAAO,EAAG,CACzD,MAAMpC,EAAQ,KAAK,0BAA0BC,EAAKL,EAAMC,CAAG,EACvDG,EAAM,OACRqB,EAAUrB,EAEd,SAAW,kBAAgB,KAAKoC,CAAO,EAAG,CACxC,MAAME,EAAM,KAAK,4BAA4BrC,EAAKL,EAAMC,CAAG,EACvDyC,GACFjB,EAAQ,IAAIiB,CAAG,CAEnB,EAEF,OAAOjB,CACT,CAUA,aAAaX,EAAQd,EAAMC,EAAK,CAC9B,IAAI2B,EACJ,GAAI,KAAKrC,GAAS,IAAIuB,CAAM,EAAG,CAC7B,MAAMqF,EAAS,KAAK5G,GAAS,IAAIuB,CAAM,EACvC,GAAIqF,EAAO,IAAInG,CAAI,EACjB4B,EAAOuE,EAAO,IAAInG,CAAI,MACjB,CACL,UAAWsD,KAAQxC,EAEjB,GADAc,EAAO,KAAK,eAAe0B,EAAMtD,EAAMC,CAAG,EAAE,IAAID,CAAI,EAChD,CAAC4B,EACH,MAGJuE,EAAO,IAAInG,EAAM4B,CAAI,EACrB,KAAKrC,GAAS,IAAIuB,EAAQqF,CAAM,CAClC,CACF,KAAO,CACL,UAAW7C,KAAQxC,EAEjB,GADAc,EAAO,KAAK,eAAe0B,EAAMtD,EAAMC,CAAG,EAAE,IAAID,CAAI,EAChD,CAAC4B,EACH,MAGJ,MAAMuE,EAAS,IAAI,QACnBA,EAAO,IAAInG,EAAM4B,CAAI,EACrB,KAAKrC,GAAS,IAAIuB,EAAQqF,CAAM,CAClC,CACA,MAAO,CAAC,CAACvE,CACX,CASA,qBAAqBjB,EAAOV,EAAM,CAAC,EAAG,CACpC,KAAM,CAAE,SAAAmG,EAAU,aAAAC,CAAa,EAAIpG,EACnC,IAAIG,EAAQ,IAAI,IAChB,MAAMG,EAAII,EAAM,OAChB,GAAIJ,EACF,GAAI6F,EACF,QAAS5F,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMK,EAAOF,EAAMH,CAAC,EACP,KAAK,aAAa6F,EAAcxF,EAAMZ,CAAG,GAEpDG,EAAM,IAAIS,CAAI,CAElB,KACK,CACL,MAAMqD,EAAM,CAAC,EAAE,MAAM,KAAKvD,CAAK,EAC/BP,EAAQ,IAAI,IAAI8D,CAAG,CACrB,CAEF,OAAO9D,CACT,CAUA,qBAAqBU,EAAQwF,EAAUrG,EAAK,CAC1C,KAAM,CAACqD,EAAM,GAAG+C,CAAY,EAAIvF,EAC1B,CAAE,KAAMyC,CAAS,EAAID,EACrBiD,KAAW,oBAAiBjD,EAAK,IAAI,EACrC8C,EAAWC,EAAa,OAAS,EACvC,IAAIjG,EAAQ,IAAI,IACZoG,EAAU,GACd,GAAI,KAAK/G,GACP+G,EAAU,OAEV,QAAQjD,EAAU,CAChB,KAAK,cAAa,CAChB,GAAI,KAAK/D,GAAM,WAAa,eAC1BgH,EAAU,OACL,CACL,MAAMxG,EAAO,KAAKR,GAAM,eAAe+G,CAAQ,EAC3CvG,GAAQA,IAASsG,GAAYA,EAAS,SAAStG,CAAI,IACjDoG,EACW,KAAK,aAAaC,EAAcrG,EAAMC,CAAG,GAEpDG,EAAM,IAAIJ,CAAI,EAGhBI,EAAM,IAAIJ,CAAI,EAGpB,CACA,KACF,CACA,KAAK,iBAAgB,CACnB,MAAMW,EAAQ2F,EAAS,uBAAuBC,CAAQ,EACtDnG,EAAQ,KAAK,qBAAqBO,EAAO,CACvC,SAAAyF,EACA,aAAAC,CACF,CAAC,EACD,KACF,CACA,KAAK,gBAAe,CAClB,GAAI,KAAKnH,GAAU,cAAgB,aAC/B,CAAC,OAAO,KAAKqH,CAAQ,EAAG,CAC1B,MAAM5F,EAAQ2F,EAAS,qBAAqBC,CAAQ,EACpDnG,EAAQ,KAAK,qBAAqBO,EAAO,CACvC,SAAAyF,EACA,aAAAC,CACF,CAAC,CACH,MACEG,EAAU,GAEZ,KACF,CACA,KAAK,0BAAyB,IAC5B,8BAA2BD,EAAUtG,CAAG,EACxC,KACF,CACA,QACEuG,EAAU,EAEd,CAEF,MAAO,CACL,MAAApG,EACA,QAAAoG,CACF,CACF,CAUA,iBAAiB7C,EAAM3D,EAAMC,EAAM,CAAC,EAAG,CACrC,KAAM,CAAE,MAAAuD,EAAO,OAAA1C,CAAO,EAAI6C,EACpB,CAAE,KAAM8C,CAAU,EAAIjD,EACtB,CAAE,IAAAf,CAAI,EAAIxC,EAChB,IAAIwB,EAAU,IAAI,IAClB,GAAIgB,IAAQhE,EACV,OAAQgI,EAAW,CACjB,IAAK,IAAK,CACR,MAAMtF,EAAUnB,EAAK,mBACjBmB,GACW,KAAK,aAAaL,EAAQK,EAASlB,CAAG,GAEjDwB,EAAQ,IAAIN,CAAO,EAGvB,KACF,CACA,IAAK,IAAK,CACR,KAAM,CAAE,WAAAK,CAAW,EAAIxB,EACvB,GAAIwB,EAAY,CACd,MAAMP,EACJ,KAAK/B,GAAU,iBAAiBsC,EAAY,cAAY,EAC1D,IAAIL,EAAU,KAAK,UAAUnB,EAAMiB,CAAM,EAIzC,IAHIE,IAAYnB,IACdmB,EAAUF,EAAO,YAAY,GAExBE,GACQ,KAAK,aAAaL,EAAQK,EAASlB,CAAG,GAEjDwB,EAAQ,IAAIN,CAAO,EAErBA,EAAUF,EAAO,YAAY,CAEjC,CACA,KACF,CACA,IAAK,IAAK,CACR,MAAMA,EAAS,KAAK/B,GAAU,iBAAiBc,EAAM,cAAY,EACjE,IAAImB,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACQ,KAAK,aAAaL,EAAQK,EAASlB,CAAG,GAEjDwB,EAAQ,IAAIN,CAAO,EAErBA,EAAUF,EAAO,YAAY,EAE/B,KACF,CACA,IAAK,IACL,QAAS,CACP,KAAM,CAAE,MAAAb,EAAO,QAAAoG,CAAQ,EAAI,KAAK,qBAAqB1F,EAAQd,CAAI,EACjE,GAAII,EAAM,KACRqB,EAAUrB,UACDoG,EAAS,CAClB,MAAMvF,EAAS,KAAK/B,GAAU,iBAAiBc,EAAM,cAAY,EACjE,IAAImB,EAAUF,EAAO,SAAS,EAC9B,KAAOE,GACQ,KAAK,aAAaL,EAAQK,EAASlB,CAAG,GAEjDwB,EAAQ,IAAIN,CAAO,EAErBA,EAAUF,EAAO,SAAS,CAE9B,CACF,CACF,KAEA,QAAQwF,EAAW,CACjB,IAAK,IAAK,CACR,MAAMtF,EAAUnB,EAAK,uBACjBmB,GACW,KAAK,aAAaL,EAAQK,EAASlB,CAAG,GAEjDwB,EAAQ,IAAIN,CAAO,EAGvB,KACF,CACA,IAAK,IAAK,CACR,MAAMF,EACJ,KAAK/B,GAAU,iBAAiBc,EAAK,WAAY,cAAY,EAC/D,IAAImB,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACDA,IAAYnB,GAGD,KAAK,aAAac,EAAQK,EAASlB,CAAG,GAEjDwB,EAAQ,IAAIN,CAAO,EAGvBA,EAAUF,EAAO,YAAY,EAE/B,KACF,CACA,IAAK,IAAK,CACR,MAAME,EAAUnB,EAAK,WACjBmB,GACW,KAAK,aAAaL,EAAQK,EAASlB,CAAG,GAEjDwB,EAAQ,IAAIN,CAAO,EAGvB,KACF,CACA,IAAK,IACL,QAAS,CACP,MAAM+C,EAAM,CAAC,EACb,IAAI/C,EAAUnB,EAAK,WACnB,KAAOmB,GACQ,KAAK,aAAaL,EAAQK,EAASlB,CAAG,GAEjDiE,EAAI,KAAK/C,CAAO,EAElBA,EAAUA,EAAQ,WAEhB+C,EAAI,SACNzC,EAAU,IAAI,IAAIyC,EAAI,QAAQ,CAAC,EAEnC,CACF,CAEF,OAAOzC,CACT,CAUA,UAAUX,EAAQb,EAAM,CAAC,EAAG,CAC1B,KAAM,CAAE,KAAAD,CAAK,EAAIC,EACjB,IAAIyG,EACAvF,EAAU,KAAK,UAAUnB,EAAM,KAAKb,EAAO,EAC/C,GAAIgC,EAQF,IAPIA,EAAQ,WAAa,eACvBA,EAAU,KAAKhC,GAAQ,SAAS,EACvBgC,IAAYnB,GACjBmB,IAAY,KAAK3B,KACnB2B,EAAU,KAAKhC,GAAQ,SAAS,GAG7BgC,GAAS,CACd,IAAIS,EAUJ,GATI,KAAKxC,GAAM,WAAa,eACtB+B,IAAY,KAAK/B,GACnBwC,EAAO,GAEPA,EAAO,KAAKxC,GAAM,SAAS+B,CAAO,EAGpCS,EAAO,GAELA,GACc,KAAK,aAAad,EAAQK,EAAS,CACjD,KAAM,KAAKvB,EACb,CAAC,EACY,CACX8G,EAAcvF,EACd,KACF,CAEFA,EAAU,KAAKhC,GAAQ,SAAS,CAClC,CAEF,OAAOuH,GAAe,IACxB,CAQA,WAAW5F,EAAQ,CACjB,MAAMV,EAAQ,CAAC,EACf,IAAIuG,EAAW,GAEf,OADa,KAAK,aAAa7F,EAAQ,KAAK1B,EAAK,IAE/CgB,EAAM,KAAK,KAAKhB,EAAK,EACrBuH,EAAW,IAEN,CAACvG,EAAOuG,CAAQ,CACzB,CASA,YAAYrD,EAAMrD,EAAM,CAAC,EAAG,CAC1B,KAAM,CAAE,QAAA2G,EAAS,SAAAR,EAAU,aAAAC,CAAa,EAAIpG,EACtCG,EAAQ,CAAC,EACf,IAAIuG,EAAW,GACX/E,EAAO,KAAK,aAAa,CAAC0B,CAAI,EAAG,KAAKlE,EAAK,EAW/C,GAVIwC,GAAQ,CAACwE,GAAY,CAACQ,GACxBxG,EAAM,KAAK,KAAKhB,EAAK,EACrBuH,EAAW,IACF/E,GAAQwE,GAAY,CAACQ,IAC9BhF,EAAO,KAAK,aAAayE,EAAc,KAAKjH,EAAK,EAC7CwC,IACFxB,EAAM,KAAK,KAAKhB,EAAK,EACrBuH,EAAW,KAGX,CAAC/E,GAAQgF,EAAS,CAChBhF,IACFxB,EAAM,KAAK,KAAKhB,EAAK,EAChBgH,IACHO,EAAW,KAGf,IAAIxF,EAAU,KAAK/B,GAAM,WACzB,KAAO+B,IACLS,EAAO,KAAK,aAAa,CAAC0B,CAAI,EAAGnC,CAAO,EACpCS,IACFxB,EAAM,KAAKe,CAAO,EACbiF,IACHO,EAAW,KAGXxF,EAAQ,aACVA,EAAUA,EAAQ,UAKxB,CACA,MAAO,CAACf,EAAOuG,CAAQ,CACzB,CAQA,WAAW7F,EAAQ,CACjB,MAAMV,EAAQ,CAAC,EACf,IAAIuG,EAAW,GACf,MAAM3G,EAAO,KAAK,UAAUc,EAAQ,CAClC,KAAM,KAAK1B,EACb,CAAC,EACD,OAAIY,IACFI,EAAM,KAAKJ,CAAI,EACf2G,EAAW,IAEN,CAACvG,EAAOuG,CAAQ,CACzB,CAWA,wBAAwBhG,EAAOV,EAAM,CAAC,EAAG,CACvC,KAAM,CAAE,SAAAmG,EAAU,aAAAC,CAAa,EAAIpG,EACnC,IAAIG,EAAQ,CAAC,EACTuG,EAAW,GACf,MAAMpG,EAAII,EAAM,OAChB,GAAIJ,EACF,GAAI,KAAKnB,GAAM,WAAa,eAC1B,QAASoB,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMR,EAAOW,EAAMH,CAAC,GAChBR,IAAS,KAAKZ,OAAS,eAAYY,EAAM,KAAKZ,EAAK,KACjDgH,EACW,KAAK,aAAaC,EAAcrG,EAAM,CACjD,KAAM,KAAKJ,EACb,CAAC,IAECQ,EAAM,KAAKJ,CAAI,EACf2G,EAAW,KAGbvG,EAAM,KAAKJ,CAAI,EACf2G,EAAW,IAGjB,MAEAvG,EAAQ,CAAC,EAAE,MAAM,KAAKO,CAAK,EACtByF,IACHO,EAAW,IAIjB,MAAO,CAACvG,EAAOuG,CAAQ,CACzB,CAUA,gBAAgBhD,EAAMkD,EAAYD,EAAS,CACzC,KAAM,CAAE,OAAA9F,CAAO,EAAI6C,EACb,CAACL,EAAM,GAAG+C,CAAY,EAAIvF,EAC1B,CAAE,KAAMyC,CAAS,EAAID,EACrBiD,KAAW,oBAAiBjD,EAAK,IAAI,EACrC8C,EAAWC,EAAa,OAAS,EACvC,IAAIjG,EAAQ,CAAC,EACTuG,EAAW,GACXH,EAAU,GACd,OAAQjD,EAAU,CAChB,KAAK,0BAAyB,IAC5B,8BAA2BgD,EAAU,CACnC,KAAM,KAAK3G,EACb,CAAC,EACD,KACF,CACA,KAAK,cAAa,CAChB,GAAIiH,IAAe/H,EACjB,CAACsB,EAAOuG,CAAQ,EAAI,KAAK,WAAW7F,CAAM,UACjC+F,IAAehI,EACxB,CAACuB,EAAOuG,CAAQ,EAAI,KAAK,YAAYrD,EAAM,CACzC,QAAAsD,EACA,SAAAR,EACA,aAAAC,CACF,CAAC,UACQQ,IAAejI,GACf,KAAKY,GAAM,WAAa,eAAc,CAC/C,MAAMQ,EAAO,KAAKR,GAAM,eAAe+G,CAAQ,EAC3CvG,IACEoG,EACW,KAAK,aAAaC,EAAcrG,EAAM,CACjD,KAAM,KAAKJ,EACb,CAAC,IAECQ,EAAM,KAAKJ,CAAI,EACf2G,EAAW,KAGbvG,EAAM,KAAKJ,CAAI,EACf2G,EAAW,IAGjB,MACEH,EAAU,GAEZ,KACF,CACA,KAAK,iBAAgB,CACnB,GAAIK,IAAe/H,EACjB,CAACsB,EAAOuG,CAAQ,EAAI,KAAK,WAAW7F,CAAM,UACjC+F,IAAehI,EACxB,CAACuB,EAAOuG,CAAQ,EAAI,KAAK,YAAYrD,EAAM,CACzC,QAAAsD,EACA,SAAAR,EACA,aAAAC,CACF,CAAC,UACQQ,IAAejI,EACxB,CAACwB,EAAOuG,CAAQ,EAAI,KAAK,WAAW7F,CAAM,UACjC,KAAKtB,GAAM,WAAa,gBAAe,CAChD,MAAMmB,EAAQ,KAAKnB,GAAM,uBAAuB+G,CAAQ,EACxD,CAACnG,EAAOuG,CAAQ,EAAI,KAAK,wBAAwBhG,EAAO,CACtD,SAAAyF,EACA,aAAAC,CACF,CAAC,CACH,MACEG,EAAU,GAEZ,KACF,CACA,KAAK,gBAAe,CAClB,GAAIK,IAAe/H,EACjB,CAACsB,EAAOuG,CAAQ,EAAI,KAAK,WAAW7F,CAAM,UACjC+F,IAAehI,EACxB,CAACuB,EAAOuG,CAAQ,EAAI,KAAK,YAAYrD,EAAM,CACzC,QAAAsD,EACA,SAAAR,EACA,aAAAC,CACF,CAAC,UACQ,KAAKnH,GAAU,cAAgB,aAC/B,KAAKM,GAAM,WAAa,iBACxB,CAAC,OAAO,KAAK+G,CAAQ,EAAG,CACjC,MAAM5F,EAAQ,KAAKnB,GAAM,qBAAqB+G,CAAQ,EACtD,CAACnG,EAAOuG,CAAQ,EAAI,KAAK,wBAAwBhG,EAAO,CACtD,SAAAyF,EACA,aAAAC,CACF,CAAC,CACH,MACEG,EAAU,GAEZ,KACF,CACA,QACE,GAAIK,IAAehI,GAAiB,kBAAgB,KAAK0H,CAAQ,GAC/D,GAAI,KAAK9G,IACL,KAAKL,GAAM,WAAa,yBAAwB,CAClD,MAAMY,EAAO,KAAK,4BAA4BsD,EAAM,KAAKlE,EAAK,EAC1DY,IACFI,EAAM,KAAKJ,CAAI,EACf2G,EAAW,GAEf,OACSE,IAAe/H,EACxB,CAACsB,EAAOuG,CAAQ,EAAI,KAAK,WAAW7F,CAAM,EACjC+F,IAAehI,EACxB,CAACuB,EAAOuG,CAAQ,EAAI,KAAK,YAAYrD,EAAM,CACzC,QAAAsD,EACA,SAAAR,EACA,aAAAC,CACF,CAAC,EACQQ,IAAejI,EACxB,CAACwB,EAAOuG,CAAQ,EAAI,KAAK,WAAW7F,CAAM,EAE1C0F,EAAU,EAGhB,CACA,MAAO,CACL,SAAAJ,EACA,SAAAO,EACA,MAAAvG,EACA,QAAAoG,CACF,CACF,CASA,cAAc5F,EAAQiG,EAAY,CAChC,MAAMC,EAAYlG,EAAO,OACnBgG,EAAUE,EAAY,EACtBC,EAAYnG,EAAO,CAAC,EAC1B,IAAI6B,EACAkB,EACJ,GAAIiD,EAAS,CACX,KAAM,CACJ,MAAOI,EACP,OAAQ,CAAC,CACP,KAAMC,EACN,KAAMC,CACR,CAAC,CACH,EAAIH,EACEI,EAAWvG,EAAOkG,EAAY,CAAC,EAC/B,CACJ,OAAQ,CAAC,CACP,KAAMM,EACN,KAAMC,CACR,CAAC,CACH,EAAIF,EACJ,GAAIE,IAAa,2BAA2BA,IAAa,cACvD5E,EAAM/D,EACNiF,EAAOwD,UACED,IAAc,2BACdA,IAAc,cACvBzE,EAAMhE,EACNkF,EAAOoD,UACEF,IAAelI,EACxB,GAAIsI,IAAc,KAAOC,IAAc,gBACrCzE,EAAM/D,EACNiF,EAAOwD,UACEC,IAAa,KAAOC,IAAa,gBAC1C5E,EAAMhE,EACNkF,EAAOoD,UACED,IAAc,EAAG,CAC1B,KAAM,CAAE,KAAML,CAAU,EAAIO,EACxB,SAAS,KAAKP,CAAS,GACzBhE,EAAM/D,EACNiF,EAAOwD,IAEP1E,EAAMhE,EACNkF,EAAOoD,EAEX,MACEtE,EAAMhE,EACNkF,EAAOoD,UAEAK,IAAa,KAAOC,IAAa,gBAC1C5E,EAAMhE,EACNkF,EAAOoD,UACEE,IAAc,KAAOC,IAAc,gBAC5CzE,EAAM/D,EACNiF,EAAOwD,MACF,CACL,IAAIvF,EACA0F,EACJ,SAAW,CAAE,MAAA9D,EAAO,OAAQ,CAACF,CAAI,CAAE,IAAK1C,EAAQ,CAC9C,KAAM,CAAE,KAAM2C,CAAS,EAAID,EACrBiD,KAAW,oBAAiBjD,EAAK,IAAI,EAC3C,GAAIC,IAAa,yBAAyBgD,IAAa,MAAO,CAC5D3E,EAAO,GACP,KACF,CACA,GAAI4B,GAAS,CAAC8D,EAAS,CACrB,KAAM,CAAE,KAAMb,CAAU,EAAIjD,EACxB,SAAS,KAAKiD,CAAS,IACzB7E,EAAO,GACP0F,EAAU,GAEd,CACF,CACI1F,GACFa,EAAMhE,EACNkF,EAAOoD,IAEPtE,EAAM/D,EACNiF,EAAOwD,EAEX,CACF,MACE1E,EAAM/D,EACNiF,EAAOoD,EAET,MAAO,CACL,QAAAH,EACA,IAAAnE,EACA,KAAAkB,CACF,CACF,CAQA,cAAckD,EAAY,CACxB,MAAMxG,EAAM,KAAKrB,GAAK,OAAO,EAC7B,GAAI6H,IAAelI,GAAckI,IAAejI,EAAc,CAC5D,MAAM2I,EAAe,IAAI,IACzB,IAAI,EAAI,EACR,SAAW,CAAE,OAAA3G,CAAO,IAAKP,EAAK,CAC5B,KAAM,CAAE,QAAAuG,EAAS,IAAAnE,EAAK,KAAAkB,CAAK,EAAI,KAAK,cAAc/C,EAAQiG,CAAU,EAC9D,CACJ,SAAAT,EAAU,SAAAO,EAAU,MAAAvG,EAAO,QAAAoG,CAC7B,EAAI,KAAK,gBAAgB7C,EAAMkD,EAAYD,CAAO,EAC9CxG,EAAM,QACR,KAAKpB,GAAK,CAAC,EAAE,KAAO,GACpB,KAAKK,GAAO,CAAC,EAAIe,GACRoG,GACTe,EAAa,IAAI,IAAI,IAAI,CACvB,CAAC,QAAS,CAAC,EACX,CAAC,OAAQ5D,CAAI,CACf,CAAC,CAAC,EAEJ,KAAK3E,GAAK,CAAC,EAAE,IAAMyD,EACnB,KAAKzD,GAAK,CAAC,EAAE,SAAW2H,GAAY,CAACP,EACrC,GACF,CACA,GAAImB,EAAa,KAAM,CACrB,IAAIvH,EACAiB,EACA,KAAK7B,KAAU,KAAKI,IAAS,KAAKJ,GAAM,WAAa,gBACvDY,EAAO,KAAKZ,GACZ6B,EAAS,KAAK9B,KAEda,EAAO,KAAKR,GACZyB,EAAS,KAAKtB,IAEhB,IAAIiE,EAAW,KAAK,UAAU5D,EAAMiB,CAAM,EAC1C,KAAO2C,GAAU,CACf,IAAIhC,EAAO,GAUX,GATI,KAAKxC,GAAM,WAAa,eACtBwE,IAAa,KAAKxE,GACpBwC,EAAO,GAEPA,EAAO,KAAKxC,GAAM,SAASwE,CAAQ,EAGrChC,EAAO,GAELA,EACF,UAAW4F,KAAeD,EAAc,CACtC,KAAM,CAAE,OAAAzG,CAAO,EAAI0G,EAAY,IAAI,MAAM,EAIzC,GAHgB,KAAK,aAAa1G,EAAQ8C,EAAU,CAClD,KAAM,KAAKhE,EACb,CAAC,EACY,CACX,MAAM6H,EAAQD,EAAY,IAAI,OAAO,EACrC,KAAKxI,GAAKyI,CAAK,EAAE,SAAW,GAC5B,KAAKzI,GAAKyI,CAAK,EAAE,KAAO,GACxB,KAAKpI,GAAOoI,CAAK,EAAE,KAAK7D,CAAQ,CAClC,CACF,CAEFA,EAAW3C,EAAO,SAAS,CAC7B,CACF,CACF,KAAO,CACL,IAAIT,EAAI,EACR,SAAW,CAAE,OAAAI,CAAO,IAAKP,EAAK,CAC5B,MAAMsD,EAAO/C,EAAOA,EAAO,OAAS,CAAC,EAC/BgG,EAAUhG,EAAO,OAAS,EAC1B,CACJ,SAAAwF,EAAU,SAAAO,EAAU,MAAAvG,CACtB,EAAI,KAAK,gBAAgBuD,EAAMkD,EAAYD,CAAO,EAC9CxG,EAAM,SACR,KAAKpB,GAAKwB,CAAC,EAAE,KAAO,GACpB,KAAKnB,GAAOmB,CAAC,EAAIJ,GAEnB,KAAKpB,GAAKwB,CAAC,EAAE,IAAM9B,EACnB,KAAKM,GAAKwB,CAAC,EAAE,SAAWmG,GAAY,CAACP,EACrC5F,GACF,CACF,CACA,MAAO,CACL,KAAKxB,GACL,KAAKK,EACP,CACF,CAQA,YAAYwH,EAAY,CACtB,KAAM,CAAC,GAAGnG,CAAQ,EAAI,KAAK1B,GACrBuB,EAAIG,EAAS,OACnB,IAAIN,EAAQ,IAAI,IAChB,QAASI,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,KAAM,CAAE,OAAAI,EAAQ,IAAA6B,EAAK,SAAAkE,EAAU,KAAAe,CAAK,EAAIhH,EAASF,CAAC,EAC5CsG,EAAYlG,EAAO,OACzB,GAAIkG,GAAaY,EAAM,CACrB,MAAMC,EAAa,KAAKtI,GAAOmB,CAAC,EAC1BoH,EAAgBD,EAAW,OAC3B3D,EAAY8C,EAAY,EAC9B,GAAI9C,IAAc,EAAG,CACnB,KAAM,CAAE,OAAQ,CAAC,CAAE,GAAGqC,CAAY,CAAE,EAAIzF,EAAO,CAAC,EAChD,IAAKiG,IAAelI,GAAckI,IAAejI,IAC7C,KAAKQ,GAAM,WAAa,eAC1B,QAAS0C,EAAI,EAAGA,EAAI8F,EAAe9F,IAAK,CACtC,MAAM9B,EAAO2H,EAAW7F,CAAC,EACzB,GAAI9B,IAAS,KAAKZ,IAAS,KAAKA,GAAM,SAASY,CAAI,IACjDI,EAAM,IAAIJ,CAAI,EACV6G,IAAelI,GACjB,KAGN,SACS0H,EAAa,OACtB,QAASvE,EAAI,EAAGA,EAAI8F,EAAe9F,IAAK,CACtC,MAAM9B,EAAO2H,EAAW7F,CAAC,EAIzB,IAHa6E,GAAY,KAAK,aAAaN,EAAcrG,EAAM,CAC7D,KAAM,KAAKJ,EACb,CAAC,KAECQ,EAAM,IAAIJ,CAAI,EACV6G,IAAelI,GACjB,KAGN,SACSkI,IAAelI,EACxB,GAAIyB,EAAM,KAAM,CACd,MAAMyH,EAAI,CAAC,GAAGzH,CAAK,EACnBA,EAAQ,IAAI,IAAI,CAAC,GAAGyH,EAAG,GAAGF,CAAU,CAAC,EACrC,KAAKjI,GAAQ,EACf,MACEU,EAAQ,IAAI,IAAI,CAAC,GAAGuH,CAAU,CAAC,MAE5B,CACL,KAAM,CAAC3H,CAAI,EAAI,CAAC,GAAG2H,CAAU,EAC7BvH,EAAM,IAAIJ,CAAI,CAChB,CACF,SAAWyC,IAAQhE,EAAU,CAC3B,GAAI,CAAE,MAAA+E,EAAO,OAAQsE,CAAY,EAAIlH,EAAO,CAAC,EAC7C,KAAM,CAAC,CAAE,GAAGyF,CAAY,EAAIyB,EAC5B,IAAIrG,EACJ,QAASK,EAAI,EAAGA,EAAI8F,EAAe9F,IAAK,CACtC,MAAM9B,EAAO2H,EAAW7F,CAAC,EAIzB,GAHa6E,GAAY,KAAK,aAAaN,EAAcrG,EAAM,CAC7D,KAAM,KAAKJ,EACb,CAAC,EACS,CACR,IAAIqE,EAAY,IAAI,IAAI,CAACjE,CAAI,CAAC,EAC9B,QAAS8B,EAAI,EAAGA,EAAIgF,EAAWhF,IAAK,CAClC,KAAM,CAAE,MAAOiG,EAAW,OAAAjH,CAAO,EAAIF,EAAOkB,CAAC,EACvCoC,EAAM,CAAC,EACb,UAAWN,KAAYK,EAAW,CAChC,MAAMN,EAAO,CACX,MAAAH,EACA,OAAA1C,CACF,EACMqB,EAAI,KAAK,iBAAiBwB,EAAMC,EAAU,CAC9C,IAAAnB,EACA,KAAM,KAAK7C,EACb,CAAC,EACGuC,EAAE,MACJ+B,EAAI,KAAK,GAAG/B,CAAC,CAEjB,CACA,GAAI+B,EAAI,OACN,GAAIpC,IAAMkC,EAAW,CACnB,GAAI6C,IAAelI,EAAY,CAC7B,GAAIyB,EAAM,KAAM,CACd,MAAMyH,EAAI,CAAC,GAAGzH,CAAK,EACnBA,EAAQ,IAAI,IAAI,CAAC,GAAGyH,EAAG,GAAG3D,CAAG,CAAC,CAChC,MACE9D,EAAQ,IAAI,IAAI,CAAC,GAAG8D,CAAG,CAAC,EAE1B,KAAKxE,GAAQ,EACf,KAAO,CACL,KAAM,CAACM,CAAI,KAAI,aAAUkE,CAAG,EAC5B9D,EAAM,IAAIJ,CAAI,CAChB,CACAyB,EAAU,EACZ,MACE+B,EAAQuE,EACR9D,EAAY,IAAI,IAAIC,CAAG,EACvBzC,EAAU,OAEP,CACLA,EAAU,GACV,KACF,CACF,CACF,MACEA,EAAU,GAEZ,GAAIA,GAAWoF,IAAelI,EAC5B,KAEJ,CACA,GAAI,CAAC8C,GAAWoF,IAAejI,EAAc,CAC3C,KAAM,CAACoJ,CAAS,EAAI,CAAC,GAAGL,CAAU,EAClC,IAAIxG,EAAU,KAAK,UAAU2G,EAAa,CACxC,KAAME,CACR,CAAC,EACD,KAAO7G,GAAS,CACd,IAAI8C,EAAY,IAAI,IAAI,CAAC9C,CAAO,CAAC,EACjC,QAASW,EAAI,EAAGA,EAAIgF,EAAWhF,IAAK,CAClC,KAAM,CAAE,MAAOiG,EAAW,OAAAjH,CAAO,EAAIF,EAAOkB,CAAC,EACvCoC,EAAM,CAAC,EACb,UAAWN,KAAYK,EAAW,CAChC,MAAMN,EAAO,CACX,MAAAH,EACA,OAAA1C,CACF,EACMqB,EAAI,KAAK,iBAAiBwB,EAAMC,EAAU,CAC9C,IAAAnB,EACA,KAAM,KAAK7C,EACb,CAAC,EACGuC,EAAE,MACJ+B,EAAI,KAAK,GAAG/B,CAAC,CAEjB,CACA,GAAI+B,EAAI,OACN,GAAIpC,IAAMkC,EAAW,CACnB,KAAM,CAAChE,CAAI,KAAI,aAAUkE,CAAG,EAC5B9D,EAAM,IAAIJ,CAAI,EACdyB,EAAU,EACZ,MACE+B,EAAQuE,EACR9D,EAAY,IAAI,IAAIC,CAAG,EACvBzC,EAAU,OAEP,CACLA,EAAU,GACV,KACF,CACF,CACA,GAAIA,EACF,MAEFN,EAAU,KAAK,UAAU2G,EAAa,CACpC,KAAM3G,CACR,CAAC,EACD8C,EAAY,IAAI,IAAI,CAAC9C,CAAO,CAAC,CAC/B,CACF,CACF,KAAO,CACL,KAAM,CAAE,OAAQ2G,CAAY,EAAIlH,EAAOoD,CAAS,EAChD,IAAIvC,EACJ,QAASK,EAAI,EAAGA,EAAI8F,EAAe9F,IAAK,CACtC,MAAM9B,EAAO2H,EAAW7F,CAAC,EACzB,IAAImC,EAAY,IAAI,IAAI,CAACjE,CAAI,CAAC,EAC9B,QAAS8B,EAAIkC,EAAY,EAAGlC,GAAK,EAAGA,IAAK,CACvC,MAAM6B,EAAO/C,EAAOkB,CAAC,EACfoC,EAAM,CAAC,EACb,UAAWN,KAAYK,EAAW,CAChC,MAAM9B,EAAI,KAAK,iBAAiBwB,EAAMC,EAAU,CAC9C,IAAAnB,EACA,KAAM,KAAK7C,EACb,CAAC,EACGuC,EAAE,MACJ+B,EAAI,KAAK,GAAG/B,CAAC,CAEjB,CACA,GAAI+B,EAAI,OACFpC,IAAM,GACR1B,EAAM,IAAIJ,CAAI,EACdyB,EAAU,GACNoF,IAAelI,GACfmI,EAAY,GAAK1G,EAAM,KAAO,IAChC,KAAKV,GAAQ,MAGfuE,EAAY,IAAI,IAAIC,CAAG,EACvBzC,EAAU,QAEP,CACLA,EAAU,GACV,KACF,CACF,CACA,GAAIA,GAAWoF,IAAelI,EAC5B,KAEJ,CACA,GAAI,CAAC8C,GAAWoF,IAAejI,EAAc,CAC3C,KAAM,CAACoJ,CAAS,EAAI,CAAC,GAAGL,CAAU,EAClC,IAAIxG,EAAU,KAAK,UAAU2G,EAAa,CACxC,KAAME,CACR,CAAC,EACD,KAAO7G,GAAS,CACd,IAAI8C,EAAY,IAAI,IAAI,CAAC9C,CAAO,CAAC,EACjC,QAASW,EAAIkC,EAAY,EAAGlC,GAAK,EAAGA,IAAK,CACvC,MAAM6B,EAAO/C,EAAOkB,CAAC,EACfoC,EAAM,CAAC,EACb,UAAWN,KAAYK,EAAW,CAChC,MAAM9B,EAAI,KAAK,iBAAiBwB,EAAMC,EAAU,CAC9C,IAAAnB,EACA,KAAM,KAAK7C,EACb,CAAC,EACGuC,EAAE,MACJ+B,EAAI,KAAK,GAAG/B,CAAC,CAEjB,CACA,GAAI+B,EAAI,OACFpC,IAAM,GACR1B,EAAM,IAAIe,CAAO,EACjBM,EAAU,KAEVwC,EAAY,IAAI,IAAIC,CAAG,EACvBzC,EAAU,QAEP,CACLA,EAAU,GACV,KACF,CACF,CACA,GAAIA,EACF,MAEFN,EAAU,KAAK,UAAU2G,EAAa,CACpC,KAAM3G,CACR,CAAC,EACD8C,EAAY,IAAI,IAAI,CAAC9C,CAAO,CAAC,CAC/B,CACF,CACF,CACF,CACF,CACA,OAAOf,CACT,CAQA,MAAMyG,EAAY,CAChB,YAAK,cAAcA,CAAU,EACf,KAAK,YAAYA,CAAU,CAE3C,CASA,QAAQ9G,EAAUC,EAAMC,EAAK,CAC3B,IAAIyC,EACJ,GAAI,CAEF,GADA,KAAKtD,GAAQ,KAAK,OAAOW,EAAUC,EAAMC,CAAG,EACxCD,EAAK,WAAa,eAAc,CAClC,MAAMgB,EAAM,mBAAmBhB,EAAK,QAAQ,GAC5C,MAAM,IAAI,UAAUgB,CAAG,CACzB,CACA,MAAMZ,EAAQ,KAAK,MAAMtB,CAAW,EAChCsB,EAAM,OACRsC,EAAMtC,EAAM,IAAI,KAAKhB,EAAK,EAE9B,OAASU,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,MAAO,CAAC,CAAC4C,CACX,CASA,QAAQ3C,EAAUC,EAAMC,EAAK,CAC3B,IAAIyC,EACJ,GAAI,CAEF,GADA,KAAKtD,GAAQ,KAAK,OAAOW,EAAUC,EAAMC,CAAG,EACxCD,EAAK,WAAa,eAAc,CAClC,MAAMgB,EAAM,mBAAmBhB,EAAK,QAAQ,GAC5C,MAAM,IAAI,UAAUgB,CAAG,CACzB,CACA,MAAMZ,EAAQ,KAAK,MAAMvB,CAAa,EACtC,IAAIsC,EAAU,KAAK/B,GACnB,KAAO+B,GAAS,CACd,GAAIf,EAAM,IAAIe,CAAO,EAAG,CACtBuB,EAAMvB,EACN,KACF,CACA,GAAIA,EAAQ,WACVA,EAAUA,EAAQ,eAElB,MAEJ,CACF,OAASrB,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,OAAO4C,GAAO,IAChB,CASA,cAAc3C,EAAUC,EAAMC,EAAK,CACjC,IAAIyC,EACJ,GAAI,CACF,KAAKtD,GAAQ,KAAK,OAAOW,EAAUC,EAAMC,CAAG,EAC5C,KAAK,oBAAoBD,CAAI,EAC7B,MAAMI,EAAQ,KAAK,MAAMxB,CAAY,EACrCwB,EAAM,OAAO,KAAKhB,EAAK,EACnBgB,EAAM,OACR,CAACsC,CAAG,KAAI,aAAUtC,CAAK,EAE3B,OAASN,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,OAAO4C,GAAO,IAChB,CAUA,iBAAiB3C,EAAUC,EAAMC,EAAK,CACpC,IAAIyC,EACJ,GAAI,CACF,KAAKtD,GAAQ,KAAK,OAAOW,EAAUC,EAAMC,CAAG,EAC5C,KAAK,oBAAoBD,CAAI,EAC7B,MAAMI,EAAQ,KAAK,MAAMzB,CAAU,EACnCyB,EAAM,OAAO,KAAKhB,EAAK,EACnBgB,EAAM,OACJ,KAAKV,GACPgD,KAAM,aAAUtC,CAAK,EAErBsC,EAAM,CAAC,GAAGtC,CAAK,EAGrB,OAASN,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,OAAO4C,GAAO,CAAC,CACjB,CACF",
-  "names": ["finder_exports", "__export", "Finder", "__toCommonJS", "import_is_potential_custom_element_name", "import_dom_util", "import_matcher", "import_parser", "import_constant", "DIR_NEXT", "DIR_PREV", "TARGET_ALL", "TARGET_FIRST", "TARGET_LINEAL", "TARGET_SELF", "WALKER_FILTER", "#ast", "#cache", "#document", "#finder", "#node", "#nodes", "#noexcept", "#results", "#root", "#shadow", "#sort", "#tree", "#warn", "#window", "e", "selector", "node", "opt", "noexcept", "warn", "nodes", "ast", "cachedItem", "l", "i", "cssAst", "branches", "items", "branch", "item", "leaves", "nextItem", "msg", "walker", "current", "refNode", "anb", "a", "b", "reverse", "parentNode", "matched", "selectorBranches", "selectorNodes", "bool", "nth", "j", "localName", "prefix", "itemLocalName", "itemPrefix", "m", "nthName", "nthIdentName", "identName", "anbMap", "astName", "dir", "res", "parent", "langPart", "regExtendedLang", "langMain", "langSub", "langRest", "extendedMain", "extendedSub", "len", "extendedRest", "value", "leaf", "leafType", "combo", "twigLeaves", "itemType", "twig", "nextNode", "astData", "twigBranches", "forgive", "lastIndex", "nextNodes", "arr", "astChildren", "selectors", "css", "leavesSet", "regAnchor", "regFormCtrl", "regFormValidity", "regInteract", "regTypeCheck", "regTypeDate", "regTypeRange", "regTypeText", "href", "origin", "pathname", "attrURL", "hash", "id", "isCustomElementName", "targetNode", "nodeName", "checked", "regTypeReset", "regTypeSubmit", "form", "isMultiple", "defaultOpt", "inputType", "node1", "node2", "host", "astType", "result", "compound", "filterLeaves", "baseNode", "leafName", "pending", "comboName", "matchedNode", "filtered", "complex", "targetType", "branchLen", "firstTwig", "firstCombo", "firstName", "firstType", "lastTwig", "lastName", "lastType", "sibling", "pendingItems", "pendingItem", "index", "find", "entryNodes", "entryNodesLen", "n", "entryLeaves", "nextCombo", "entryNode"]
+  "sourcesContent": ["/**\n * finder.js\n */\n\n/* import */\nimport isCustomElementName from 'is-potential-custom-element-name';\nimport {\n  getDirectionality, isContentEditable, isInclusive, isInShadowTree,\n  prepareDOMObjects, sortNodes\n} from './dom-util.js';\nimport { matchSelector, matchPseudoElementSelector } from './matcher.js';\nimport {\n  generateCSS, parseSelector, sortAST, unescapeSelector, walkAST\n} from './parser.js';\n\n/* constants */\nimport {\n  ALPHA_NUM, COMBINATOR, DOCUMENT_FRAGMENT_NODE, DOCUMENT_NODE, ELEMENT_NODE,\n  NOT_SUPPORTED_ERR, REG_LOGICAL_PSEUDO, REG_SHADOW_HOST, SELECTOR_CLASS,\n  SELECTOR_ID, SELECTOR_PSEUDO_CLASS, SELECTOR_PSEUDO_ELEMENT, SELECTOR_TYPE,\n  SHOW_ALL, SHOW_DOCUMENT, SHOW_DOCUMENT_FRAGMENT, SHOW_ELEMENT, SYNTAX_ERR,\n  TEXT_NODE\n} from './constant.js';\nconst DIR_NEXT = 'next';\nconst DIR_PREV = 'prev';\nconst TARGET_ALL = 'all';\nconst TARGET_FIRST = 'first';\nconst TARGET_LINEAL = 'lineal';\nconst TARGET_SELF = 'self';\nconst WALKER_FILTER = SHOW_DOCUMENT | SHOW_DOCUMENT_FRAGMENT | SHOW_ELEMENT;\n\n/**\n * Finder\n * NOTE: #ast[i] corresponds to #nodes[i]\n * #ast: [\n *   {\n *     branch: branch[],\n *     dir: string|null,\n *     filtered: boolean,\n *     find: boolean\n *   },\n *   {\n *     branch: branch[],\n *     dir: string|null,\n *     filtered: boolean,\n *     find: boolean\n *   }\n * ]\n * #nodes: [\n *   [node{}, node{}],\n *   [node{}, node{}, node{}]\n * ]\n * branch[]: [twig{}, twig{}]\n * twig{}: {\n *   combo: leaf{}|null,\n *   leaves: leaves[]\n * }\n * leaves[]: [leaf{}, leaf{}, leaf{}]\n * leaf{}: CSSTree AST object\n * node{}: Element node\n */\nexport class Finder {\n  /* private fields */\n  #ast;\n  #cache;\n  #document;\n  #finder;\n  #node;\n  #nodes;\n  #noexcept;\n  #results;\n  #root;\n  #shadow;\n  #sort;\n  #tree;\n  #warn;\n  #window;\n\n  /**\n   * construct\n   */\n  constructor() {\n    this.#cache = new WeakMap();\n  }\n\n  /**\n   * handle error\n   * @private\n   * @param {Error} e - Error\n   * @throws Error\n   * @returns {void}\n   */\n  _onError(e) {\n    if (!this.#noexcept) {\n      if (e instanceof DOMException ||\n          (this.#window && e instanceof this.#window.DOMException)) {\n        if (e.name === NOT_SUPPORTED_ERR) {\n          if (this.#warn) {\n            console.warn(e.message);\n          }\n        } else if (this.#window) {\n          throw new this.#window.DOMException(e.message, e.name);\n        } else {\n          throw e;\n        }\n      } else {\n        throw e;\n      }\n    }\n  }\n\n  /**\n   * setup finder\n   * @private\n   * @param {string} selector - CSS selector\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @param {object} opt - options\n   * @param {boolean} [opt.noexcept] - no exception\n   * @param {boolean} [opt.warn] - console warn\n   * @returns {object} - node\n   */\n  _setup(selector, node, opt = {}) {\n    const { noexcept, warn } = opt;\n    this.#noexcept = !!noexcept;\n    this.#warn = !!warn;\n    this.#node = node;\n    [this.#window, this.#document, this.#root] = prepareDOMObjects(node);\n    this.#shadow = isInShadowTree(node);\n    [this.#ast, this.#nodes] = this._correspond(selector);\n    this.#results = new WeakMap();\n    return node;\n  }\n\n  /**\n   * correspond #ast and #nodes\n   * @private\n   * @param {string} selector - CSS selector\n   * @returns {Array.<Array.<object|undefined>>} - array of #ast and #nodes\n   */\n  _correspond(selector) {\n    const nodes = [];\n    let ast;\n    let cachedItem = this.#document && this.#cache.get(this.#document);\n    if (cachedItem && cachedItem.has(`${selector}`)) {\n      ast = cachedItem.get(selector);\n    }\n    if (ast) {\n      const l = ast.length;\n      for (let i = 0; i < l; i++) {\n        ast[i].dir = null;\n        ast[i].filtered = false;\n        ast[i].find = false;\n        nodes[i] = [];\n      }\n    } else {\n      let cssAst;\n      try {\n        cssAst = parseSelector(selector);\n      } catch (e) {\n        this._onError(e);\n      }\n      const branches = walkAST(cssAst);\n      ast = [];\n      let i = 0;\n      for (const [...items] of branches) {\n        const branch = [];\n        let item = items.shift();\n        if (item && item.type !== COMBINATOR) {\n          const leaves = new Set();\n          while (item) {\n            if (item.type === COMBINATOR) {\n              const [nextItem] = items;\n              if (nextItem.type === COMBINATOR) {\n                const msg = `Invalid selector ${selector}`;\n                throw new DOMException(msg, SYNTAX_ERR);\n              }\n              branch.push({\n                combo: item,\n                leaves: sortAST(leaves)\n              });\n              leaves.clear();\n            } else if (item) {\n              let { name: itemName } = item;\n              if (itemName) {\n                if (Object.prototype.hasOwnProperty.call(itemName, 'name')) {\n                  itemName = unescapeSelector(itemName.name);\n                  if (/[|:]/.test(itemName)) {\n                    item.namespace = true;\n                  }\n                } else if (typeof itemName === 'string') {\n                  itemName = unescapeSelector(itemName);\n                  if (/[|:]/.test(itemName)) {\n                    item.namespace = true;\n                  }\n                }\n              }\n              leaves.add(item);\n            }\n            if (items.length) {\n              item = items.shift();\n            } else {\n              branch.push({\n                combo: null,\n                leaves: sortAST(leaves)\n              });\n              leaves.clear();\n              break;\n            }\n          }\n        }\n        ast.push({\n          branch,\n          dir: null,\n          filtered: false,\n          find: false\n        });\n        nodes[i] = [];\n        i++;\n      }\n      if (this.#document) {\n        if (!cachedItem) {\n          cachedItem = new Map();\n        }\n        cachedItem.set(`${selector}`, ast);\n        this.#cache.set(this.#document, cachedItem);\n      }\n    }\n    return [\n      ast,\n      nodes\n    ];\n  }\n\n  /**\n   * prepare tree walkers\n   * @private\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @returns {Array} - [#tree, #finder]\n   */\n  _prepareTreeWalkers(node) {\n    this.#tree = this.#document.createTreeWalker(this.#root, WALKER_FILTER);\n    this.#finder = this.#document.createTreeWalker(node, WALKER_FILTER);\n    this.#sort = false;\n    return [\n      this.#tree,\n      this.#finder\n    ];\n  }\n\n  /**\n   * traverse tree walker\n   * @private\n   * @param {object} [node] - Element node\n   * @param {object} [walker] - tree walker\n   * @returns {?object} - current node\n   */\n  _traverse(node = {}, walker = this.#tree) {\n    let current;\n    let refNode = walker.currentNode;\n    if (node.nodeType === ELEMENT_NODE && refNode === node) {\n      current = refNode;\n    } else {\n      if (refNode !== walker.root) {\n        while (refNode) {\n          if (refNode === walker.root ||\n              (node.nodeType === ELEMENT_NODE && refNode === node)) {\n            break;\n          }\n          refNode = walker.parentNode();\n        }\n      }\n      if (node.nodeType === ELEMENT_NODE) {\n        while (refNode) {\n          if (refNode === node) {\n            current = refNode;\n            break;\n          }\n          refNode = walker.nextNode();\n        }\n      } else {\n        current = refNode;\n      }\n    }\n    return current ?? null;\n  }\n\n  /**\n   * collect nth child\n   * @private\n   * @param {object} anb - An+B options\n   * @param {number} anb.a - a\n   * @param {number} anb.b - b\n   * @param {boolean} [anb.reverse] - reverse order\n   * @param {object} [anb.selector] - AST\n   * @param {object} node - Element node\n   * @param {object} opt - options\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _collectNthChild(anb, node, opt) {\n    const { a, b, reverse, selector } = anb;\n    const { parentNode } = node;\n    let matched = new Set();\n    let selectorBranches;\n    if (selector) {\n      if (this.#cache.has(selector)) {\n        selectorBranches = this.#cache.get(selector);\n      } else {\n        selectorBranches = walkAST(selector);\n        this.#cache.set(selector, selectorBranches);\n      }\n    }\n    if (parentNode) {\n      const walker = this.#document.createTreeWalker(parentNode, WALKER_FILTER);\n      let l = 0;\n      let refNode = walker.firstChild();\n      while (refNode) {\n        l++;\n        refNode = walker.nextSibling();\n      }\n      refNode = this._traverse(parentNode, walker);\n      const selectorNodes = new Set();\n      if (selectorBranches) {\n        refNode = this._traverse(parentNode, walker);\n        refNode = walker.firstChild();\n        while (refNode) {\n          let bool;\n          for (const leaves of selectorBranches) {\n            bool = this._matchLeaves(leaves, refNode, opt);\n            if (!bool) {\n              break;\n            }\n          }\n          if (bool) {\n            selectorNodes.add(refNode);\n          }\n          refNode = walker.nextSibling();\n        }\n      }\n      // :first-child, :last-child, :nth-child(b of S), :nth-last-child(b of S)\n      if (a === 0) {\n        if (b > 0 && b <= l) {\n          if (selectorNodes.size) {\n            let i = 0;\n            refNode = this._traverse(parentNode, walker);\n            if (reverse) {\n              refNode = walker.lastChild();\n            } else {\n              refNode = walker.firstChild();\n            }\n            while (refNode) {\n              if (selectorNodes.has(refNode)) {\n                if (i === b - 1) {\n                  matched.add(refNode);\n                  break;\n                }\n                i++;\n              }\n              if (reverse) {\n                refNode = walker.previousSibling();\n              } else {\n                refNode = walker.nextSibling();\n              }\n            }\n          } else if (!selector) {\n            let i = 0;\n            refNode = this._traverse(parentNode, walker);\n            if (reverse) {\n              refNode = walker.lastChild();\n            } else {\n              refNode = walker.firstChild();\n            }\n            while (refNode) {\n              if (i === b - 1) {\n                matched.add(refNode);\n                break;\n              }\n              if (reverse) {\n                refNode = walker.previousSibling();\n              } else {\n                refNode = walker.nextSibling();\n              }\n              i++;\n            }\n          }\n        }\n      // :nth-child()\n      } else {\n        let nth = b - 1;\n        if (a > 0) {\n          while (nth < 0) {\n            nth += a;\n          }\n        }\n        if (nth >= 0 && nth < l) {\n          let i = 0;\n          let j = a > 0 ? 0 : b - 1;\n          refNode = this._traverse(parentNode, walker);\n          if (reverse) {\n            refNode = walker.lastChild();\n          } else {\n            refNode = walker.firstChild();\n          }\n          while (refNode) {\n            if (refNode && nth >= 0 && nth < l) {\n              if (selectorNodes.size) {\n                if (selectorNodes.has(refNode)) {\n                  if (j === nth) {\n                    matched.add(refNode);\n                    nth += a;\n                  }\n                  if (a > 0) {\n                    j++;\n                  } else {\n                    j--;\n                  }\n                }\n              } else if (i === nth) {\n                if (!selector) {\n                  matched.add(refNode);\n                }\n                nth += a;\n              }\n              if (reverse) {\n                refNode = walker.previousSibling();\n              } else {\n                refNode = walker.nextSibling();\n              }\n              i++;\n            } else {\n              break;\n            }\n          }\n        }\n      }\n      if (reverse && matched.size > 1) {\n        const m = [...matched];\n        matched = new Set(m.reverse());\n      }\n    } else if (node === this.#root && (a + b) === 1) {\n      if (selectorBranches) {\n        let bool;\n        for (const leaves of selectorBranches) {\n          bool = this._matchLeaves(leaves, node, opt);\n          if (bool) {\n            break;\n          }\n        }\n        if (bool) {\n          matched.add(node);\n        }\n      } else {\n        matched.add(node);\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * collect nth of type\n   * @private\n   * @param {object} anb - An+B options\n   * @param {number} anb.a - a\n   * @param {number} anb.b - b\n   * @param {boolean} [anb.reverse] - reverse order\n   * @param {object} node - Element node\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _collectNthOfType(anb, node) {\n    const { a, b, reverse } = anb;\n    const { localName, parentNode, prefix } = node;\n    let matched = new Set();\n    if (parentNode) {\n      const walker = this.#document.createTreeWalker(parentNode, WALKER_FILTER);\n      let l = 0;\n      let refNode = walker.firstChild();\n      while (refNode) {\n        l++;\n        refNode = walker.nextSibling();\n      }\n      // :first-of-type, :last-of-type\n      if (a === 0) {\n        if (b > 0 && b <= l) {\n          let j = 0;\n          refNode = this._traverse(parentNode, walker);\n          if (reverse) {\n            refNode = walker.lastChild();\n          } else {\n            refNode = walker.firstChild();\n          }\n          while (refNode) {\n            const { localName: itemLocalName, prefix: itemPrefix } = refNode;\n            if (itemLocalName === localName && itemPrefix === prefix) {\n              if (j === b - 1) {\n                matched.add(refNode);\n                break;\n              }\n              j++;\n            }\n            if (reverse) {\n              refNode = walker.previousSibling();\n            } else {\n              refNode = walker.nextSibling();\n            }\n          }\n        }\n      // :nth-of-type()\n      } else {\n        let nth = b - 1;\n        if (a > 0) {\n          while (nth < 0) {\n            nth += a;\n          }\n        }\n        if (nth >= 0 && nth < l) {\n          let j = a > 0 ? 0 : b - 1;\n          refNode = this._traverse(parentNode, walker);\n          if (reverse) {\n            refNode = walker.lastChild();\n          } else {\n            refNode = walker.firstChild();\n          }\n          while (refNode) {\n            const { localName: itemLocalName, prefix: itemPrefix } = refNode;\n            if (itemLocalName === localName && itemPrefix === prefix) {\n              if (j === nth) {\n                matched.add(refNode);\n                nth += a;\n              }\n              if (nth < 0 || nth >= l) {\n                break;\n              } else if (a > 0) {\n                j++;\n              } else {\n                j--;\n              }\n            }\n            if (reverse) {\n              refNode = walker.previousSibling();\n            } else {\n              refNode = walker.nextSibling();\n            }\n          }\n        }\n      }\n      if (reverse && matched.size > 1) {\n        const m = [...matched];\n        matched = new Set(m.reverse());\n      }\n    } else if (node === this.#root && (a + b) === 1) {\n      matched.add(node);\n    }\n    return matched;\n  }\n\n  /**\n   * match An+B\n   * @private\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @param {string} nthName - nth pseudo-class name\n   * @param {object} opt - options\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchAnPlusB(ast, node, nthName, opt) {\n    const {\n      nth: {\n        a,\n        b,\n        name: nthIdentName\n      },\n      selector\n    } = ast;\n    const identName = unescapeSelector(nthIdentName);\n    const anbMap = new Map();\n    if (identName) {\n      if (identName === 'even') {\n        anbMap.set('a', 2);\n        anbMap.set('b', 0);\n      } else if (identName === 'odd') {\n        anbMap.set('a', 2);\n        anbMap.set('b', 1);\n      }\n      if (nthName.indexOf('last') > -1) {\n        anbMap.set('reverse', true);\n      }\n    } else {\n      if (typeof a === 'string' && /-?\\d+/.test(a)) {\n        anbMap.set('a', a * 1);\n      } else {\n        anbMap.set('a', 0);\n      }\n      if (typeof b === 'string' && /-?\\d+/.test(b)) {\n        anbMap.set('b', b * 1);\n      } else {\n        anbMap.set('b', 0);\n      }\n      if (nthName.indexOf('last') > -1) {\n        anbMap.set('reverse', true);\n      }\n    }\n    let matched = new Set();\n    if (anbMap.has('a') && anbMap.has('b')) {\n      if (/^nth-(?:last-)?child$/.test(nthName)) {\n        if (selector) {\n          anbMap.set('selector', selector);\n        }\n        const anb = Object.fromEntries(anbMap);\n        const nodes = this._collectNthChild(anb, node, opt);\n        if (nodes.size) {\n          matched = nodes;\n        }\n      } else if (/^nth-(?:last-)?of-type$/.test(nthName)) {\n        const anb = Object.fromEntries(anbMap);\n        const nodes = this._collectNthOfType(anb, node);\n        if (nodes.size) {\n          matched = nodes;\n        }\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * match directionality pseudo-class - :dir()\n   * @private\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @returns {?object} - matched node\n   */\n  _matchDirectionPseudoClass(ast, node) {\n    const astName = unescapeSelector(ast.name);\n    const dir = getDirectionality(node);\n    let res;\n    if (astName === dir) {\n      res = node;\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match language pseudo-class - :lang()\n   * @private\n   * @see https://datatracker.ietf.org/doc/html/rfc4647#section-3.3.1\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @returns {?object} - matched node\n   */\n  _matchLanguagePseudoClass(ast, node) {\n    const astName = unescapeSelector(ast.name);\n    let res;\n    if (astName === '*') {\n      if (node.hasAttribute('lang')) {\n        if (node.getAttribute('lang')) {\n          res = node;\n        }\n      } else {\n        let parent = node.parentNode;\n        while (parent) {\n          if (parent.nodeType === ELEMENT_NODE) {\n            if (parent.hasAttribute('lang')) {\n              if (parent.getAttribute('lang')) {\n                res = node;\n              }\n              break;\n            }\n            parent = parent.parentNode;\n          } else {\n            break;\n          }\n        }\n      }\n    } else if (astName) {\n      const langPart = `(?:-${ALPHA_NUM})*`;\n      const regLang = new RegExp(`^(?:\\\\*-)?${ALPHA_NUM}${langPart}$`, 'i');\n      if (regLang.test(astName)) {\n        let regExtendedLang;\n        if (astName.indexOf('-') > -1) {\n          const [langMain, langSub, ...langRest] = astName.split('-');\n          let extendedMain;\n          if (langMain === '*') {\n            extendedMain = `${ALPHA_NUM}${langPart}`;\n          } else {\n            extendedMain = `${langMain}${langPart}`;\n          }\n          const extendedSub = `-${langSub}${langPart}`;\n          const len = langRest.length;\n          let extendedRest = '';\n          if (len) {\n            for (let i = 0; i < len; i++) {\n              extendedRest += `-${langRest[i]}${langPart}`;\n            }\n          }\n          regExtendedLang =\n            new RegExp(`^${extendedMain}${extendedSub}${extendedRest}$`, 'i');\n        } else {\n          regExtendedLang = new RegExp(`^${astName}${langPart}$`, 'i');\n        }\n        if (node.hasAttribute('lang')) {\n          if (regExtendedLang.test(node.getAttribute('lang'))) {\n            res = node;\n          }\n        } else {\n          let parent = node.parentNode;\n          while (parent) {\n            if (parent.nodeType === ELEMENT_NODE) {\n              if (parent.hasAttribute('lang')) {\n                const value = parent.getAttribute('lang');\n                if (regExtendedLang.test(value)) {\n                  res = node;\n                }\n                break;\n              }\n              parent = parent.parentNode;\n            } else {\n              break;\n            }\n          }\n        }\n      }\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match :has() pseudo-class function\n   * @private\n   * @param {Array.<object>} leaves - AST leaves\n   * @param {object} node - Element node\n   * @param {object} opt - options\n   * @returns {boolean} - result\n   */\n  _matchHasPseudoFunc(leaves, node, opt = {}) {\n    let bool;\n    if (Array.isArray(leaves) && leaves.length) {\n      const [leaf] = leaves;\n      const { type: leafType } = leaf;\n      let combo;\n      if (leafType === COMBINATOR) {\n        combo = leaves.shift();\n      } else {\n        combo = {\n          name: ' ',\n          type: COMBINATOR\n        };\n      }\n      const twigLeaves = [];\n      while (leaves.length) {\n        const [item] = leaves;\n        const { type: itemType } = item;\n        if (itemType === COMBINATOR) {\n          break;\n        } else {\n          twigLeaves.push(leaves.shift());\n        }\n      }\n      const twig = {\n        combo,\n        leaves: twigLeaves\n      };\n      opt.dir = DIR_NEXT;\n      const nodes = this._matchCombinator(twig, node, opt);\n      if (nodes.size) {\n        if (leaves.length) {\n          for (const nextNode of nodes) {\n            bool = this._matchHasPseudoFunc(Object.assign([], leaves),\n              nextNode, opt);\n            if (bool) {\n              break;\n            }\n          }\n        } else {\n          bool = true;\n        }\n      }\n    }\n    return !!bool;\n  }\n\n  /**\n   * match logical pseudo-class functions - :has(), :is(), :not(), :where()\n   * @private\n   * @param {object} astData - AST data\n   * @param {object} node - Element node\n   * @param {object} opt - options\n   * @returns {?object} - matched node\n   */\n  _matchLogicalPseudoFunc(astData, node, opt = {}) {\n    const {\n      astName = '', branches = [], selector = '', twigBranches = []\n    } = astData;\n    let res;\n    if (astName === 'has') {\n      if (selector.includes(':has(')) {\n        res = null;\n      } else {\n        let bool;\n        for (const leaves of branches) {\n          bool = this._matchHasPseudoFunc(Object.assign([], leaves), node, opt);\n          if (bool) {\n            break;\n          }\n        }\n        if (bool) {\n          res = node;\n        }\n      }\n    } else {\n      const forgive = /^(?:is|where)$/.test(astName);\n      opt.forgive = forgive;\n      const l = twigBranches.length;\n      let bool;\n      for (let i = 0; i < l; i++) {\n        const branch = twigBranches[i];\n        const lastIndex = branch.length - 1;\n        const { leaves } = branch[lastIndex];\n        bool = this._matchLeaves(leaves, node, opt);\n        if (bool && lastIndex > 0) {\n          let nextNodes = new Set([node]);\n          for (let j = lastIndex - 1; j >= 0; j--) {\n            const twig = branch[j];\n            const arr = [];\n            opt.dir = DIR_PREV;\n            for (const nextNode of nextNodes) {\n              const m = this._matchCombinator(twig, nextNode, opt);\n              if (m.size) {\n                arr.push(...m);\n              }\n            }\n            if (arr.length) {\n              if (j === 0) {\n                bool = true;\n              } else {\n                nextNodes = new Set(arr);\n              }\n            } else {\n              bool = false;\n              break;\n            }\n          }\n        }\n        if (bool) {\n          break;\n        }\n      }\n      if (astName === 'not') {\n        if (!bool) {\n          res = node;\n        }\n      } else if (bool) {\n        res = node;\n      }\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match pseudo-class selector\n   * @private\n   * @see https://html.spec.whatwg.org/#pseudo-classes\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @param {object} opt - options\n   * @param {boolean} [opt.forgive] - forgive unknown pseudo-class\n   * @param {boolean} [opt.warn] - warn unsupported pseudo-class\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchPseudoClassSelector(ast, node, opt = {}) {\n    const { children: astChildren } = ast;\n    const { localName, parentNode } = node;\n    const {\n      forgive,\n      warn = this.#warn\n    } = opt;\n    const astName = unescapeSelector(ast.name);\n    let matched = new Set();\n    // :has(), :is(), :not(), :where()\n    if (REG_LOGICAL_PSEUDO.test(astName)) {\n      let astData;\n      if (this.#cache.has(ast)) {\n        astData = this.#cache.get(ast);\n      } else {\n        const branches = walkAST(ast);\n        const selectors = [];\n        const twigBranches = [];\n        for (const [...leaves] of branches) {\n          for (const leaf of leaves) {\n            const css = generateCSS(leaf);\n            selectors.push(css);\n          }\n          const branch = [];\n          const leavesSet = new Set();\n          let item = leaves.shift();\n          while (item) {\n            if (item.type === COMBINATOR) {\n              branch.push({\n                combo: item,\n                leaves: [...leavesSet]\n              });\n              leavesSet.clear();\n            } else if (item) {\n              leavesSet.add(item);\n            }\n            if (leaves.length) {\n              item = leaves.shift();\n            } else {\n              branch.push({\n                combo: null,\n                leaves: [...leavesSet]\n              });\n              leavesSet.clear();\n              break;\n            }\n          }\n          twigBranches.push(branch);\n        }\n        astData = {\n          astName,\n          branches,\n          twigBranches,\n          selector: selectors.join(',')\n        };\n        this.#cache.set(ast, astData);\n      }\n      const res = this._matchLogicalPseudoFunc(astData, node, opt);\n      if (res) {\n        matched.add(res);\n      }\n    } else if (Array.isArray(astChildren)) {\n      const [branch] = astChildren;\n      // :nth-child(), :nth-last-child(), nth-of-type(), :nth-last-of-type()\n      if (/^nth-(?:last-)?(?:child|of-type)$/.test(astName)) {\n        const nodes = this._matchAnPlusB(branch, node, astName, opt);\n        if (nodes.size) {\n          matched = nodes;\n        }\n      // :dir()\n      } else if (astName === 'dir') {\n        const res = this._matchDirectionPseudoClass(branch, node);\n        if (res) {\n          matched.add(res);\n        }\n      // :lang()\n      } else if (astName === 'lang') {\n        const res = this._matchLanguagePseudoClass(branch, node);\n        if (res) {\n          matched.add(res);\n        }\n      } else {\n        switch (astName) {\n          case 'current':\n          case 'nth-col':\n          case 'nth-last-col': {\n            if (warn) {\n              const msg = `Unsupported pseudo-class :${astName}()`;\n              throw new DOMException(msg, NOT_SUPPORTED_ERR);\n            }\n            break;\n          }\n          case 'host':\n          case 'host-context': {\n            // ignore\n            break;\n          }\n          default: {\n            if (!forgive) {\n              const msg = `Unknown pseudo-class :${astName}()`;\n              throw new DOMException(msg, SYNTAX_ERR);\n            }\n          }\n        }\n      }\n    } else {\n      const regAnchor = /^a(?:rea)?$/;\n      const regFormCtrl =\n        /^(?:(?:fieldse|inpu|selec)t|button|opt(?:group|ion)|textarea)$/;\n      const regFormValidity = /^(?:(?:inpu|selec)t|button|form|textarea)$/;\n      const regInteract = /^d(?:etails|ialog)$/;\n      const regTypeCheck = /^(?:checkbox|radio)$/;\n      const regTypeDate = /^(?:date(?:time-local)?|month|time|week)$/;\n      const regTypeRange =\n        /(?:(?:rang|tim)e|date(?:time-local)?|month|number|week)$/;\n      const regTypeText = /^(?:(?:emai|te|ur)l|number|password|search|text)$/;\n      switch (astName) {\n        case 'any-link':\n        case 'link': {\n          if (regAnchor.test(localName) && node.hasAttribute('href')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'local-link': {\n          if (regAnchor.test(localName) && node.hasAttribute('href')) {\n            const { href, origin, pathname } = new URL(this.#document.URL);\n            const attrURL = new URL(node.getAttribute('href'), href);\n            if (attrURL.origin === origin && attrURL.pathname === pathname) {\n              matched.add(node);\n            }\n          }\n          break;\n        }\n        case 'visited': {\n          // prevent fingerprinting\n          break;\n        }\n        case 'target': {\n          const { hash } = new URL(this.#document.URL);\n          if (node.id && hash === `#${node.id}` &&\n              this.#document.contains(node)) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'target-within': {\n          const { hash } = new URL(this.#document.URL);\n          if (hash) {\n            const id = hash.replace(/^#/, '');\n            let current = this.#document.getElementById(id);\n            while (current) {\n              if (current === node) {\n                matched.add(node);\n                break;\n              }\n              current = current.parentNode;\n            }\n          }\n          break;\n        }\n        case 'scope': {\n          if (this.#node.nodeType === ELEMENT_NODE) {\n            if (node === this.#node) {\n              matched.add(node);\n            }\n          } else if (node === this.#document.documentElement) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'focus': {\n          if (node === this.#document.activeElement &&\n              this.#window.getComputedStyle(node).display !== 'none') {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'focus-within': {\n          let current = this.#document.activeElement;\n          while (current) {\n            if (current === node) {\n              if (this.#window.getComputedStyle(node).display !== 'none') {\n                matched.add(node);\n              }\n              break;\n            }\n            current = current.parentNode;\n          }\n          break;\n        }\n        case 'open': {\n          if (regInteract.test(localName) && node.hasAttribute('open')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'closed': {\n          if (regInteract.test(localName) && !node.hasAttribute('open')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'disabled': {\n          if (regFormCtrl.test(localName) || isCustomElementName(localName)) {\n            if (node.disabled || node.hasAttribute('disabled')) {\n              matched.add(node);\n            } else {\n              let parent = parentNode;\n              while (parent) {\n                if (parent.localName === 'fieldset') {\n                  break;\n                }\n                parent = parent.parentNode;\n              }\n              if (parent && parentNode.localName !== 'legend' &&\n                  parent.hasAttribute('disabled')) {\n                matched.add(node);\n              }\n            }\n          }\n          break;\n        }\n        case 'enabled': {\n          if ((regFormCtrl.test(localName) || isCustomElementName(localName)) &&\n              !(node.disabled && node.hasAttribute('disabled'))) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'read-only': {\n          switch (localName) {\n            case 'textarea': {\n              if (node.readonly || node.hasAttribute('readonly') ||\n                  node.disabled || node.hasAttribute('disabled')) {\n                matched.add(node);\n              }\n              break;\n            }\n            case 'input': {\n              if ((!node.type || regTypeDate.test(node.type) ||\n                   regTypeText.test(node.type)) &&\n                  (node.readonly || node.hasAttribute('readonly') ||\n                   node.disabled || node.hasAttribute('disabled'))) {\n                matched.add(node);\n              }\n              break;\n            }\n            default: {\n              if (!isContentEditable(node)) {\n                matched.add(node);\n              }\n            }\n          }\n          break;\n        }\n        case 'read-write': {\n          switch (localName) {\n            case 'textarea': {\n              if (!(node.readonly || node.hasAttribute('readonly') ||\n                    node.disabled || node.hasAttribute('disabled'))) {\n                matched.add(node);\n              }\n              break;\n            }\n            case 'input': {\n              if ((!node.type || regTypeDate.test(node.type) ||\n                   regTypeText.test(node.type)) &&\n                  !(node.readonly || node.hasAttribute('readonly') ||\n                    node.disabled || node.hasAttribute('disabled'))) {\n                matched.add(node);\n              }\n              break;\n            }\n            default: {\n              if (isContentEditable(node)) {\n                matched.add(node);\n              }\n            }\n          }\n          break;\n        }\n        case 'placeholder-shown': {\n          let targetNode;\n          if (localName === 'textarea') {\n            targetNode = node;\n          } else if (localName === 'input') {\n            if (node.hasAttribute('type')) {\n              if (regTypeText.test(node.getAttribute('type'))) {\n                targetNode = node;\n              }\n            } else {\n              targetNode = node;\n            }\n          }\n          if (targetNode && node.value === '' &&\n              node.hasAttribute('placeholder') &&\n              node.getAttribute('placeholder').trim().length) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'checked': {\n          if ((node.checked && localName === 'input' &&\n               node.hasAttribute('type') &&\n               regTypeCheck.test(node.getAttribute('type'))) ||\n              (node.selected && localName === 'option')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'indeterminate': {\n          if ((node.indeterminate && localName === 'input' &&\n               node.type === 'checkbox') ||\n              (localName === 'progress' && !node.hasAttribute('value'))) {\n            matched.add(node);\n          } else if (localName === 'input' && node.type === 'radio' &&\n                     !node.hasAttribute('checked')) {\n            const nodeName = node.name;\n            let parent = node.parentNode;\n            while (parent) {\n              if (parent.localName === 'form') {\n                break;\n              }\n              parent = parent.parentNode;\n            }\n            if (!parent) {\n              parent = this.#document.documentElement;\n            }\n            let checked;\n            const items = parent.getElementsByTagName('input');\n            const l = items.length;\n            if (l) {\n              for (let i = 0; i < l; i++) {\n                const item = items[i];\n                if (item.getAttribute('type') === 'radio') {\n                  if (nodeName) {\n                    if (item.getAttribute('name') === nodeName) {\n                      checked = !!item.checked;\n                    }\n                  } else if (!item.hasAttribute('name')) {\n                    checked = !!item.checked;\n                  }\n                  if (checked) {\n                    break;\n                  }\n                }\n              }\n            }\n            if (!checked) {\n              matched.add(node);\n            }\n          }\n          break;\n        }\n        case 'default': {\n          const regTypeReset = /^(?:button|reset)$/;\n          const regTypeSubmit = /^(?:image|submit)$/;\n          // button[type=\"submit\"], input[type=\"submit\"], input[type=\"image\"]\n          if ((localName === 'button' &&\n               !(node.hasAttribute('type') &&\n                 regTypeReset.test(node.getAttribute('type')))) ||\n              (localName === 'input' && node.hasAttribute('type') &&\n               regTypeSubmit.test(node.getAttribute('type')))) {\n            let form = node.parentNode;\n            while (form) {\n              if (form.localName === 'form') {\n                break;\n              }\n              form = form.parentNode;\n            }\n            if (form) {\n              const walker =\n                this.#document.createTreeWalker(form, SHOW_ELEMENT);\n              let nextNode = walker.firstChild();\n              while (nextNode) {\n                const nodeName = nextNode.localName;\n                let m;\n                if (nodeName === 'button') {\n                  m = !(nextNode.hasAttribute('type') &&\n                    regTypeReset.test(nextNode.getAttribute('type')));\n                } else if (nodeName === 'input') {\n                  m = nextNode.hasAttribute('type') &&\n                    regTypeSubmit.test(nextNode.getAttribute('type'));\n                }\n                if (m) {\n                  if (nextNode === node) {\n                    matched.add(node);\n                  }\n                  break;\n                }\n                nextNode = walker.nextNode();\n              }\n            }\n          // input[type=\"checkbox\"], input[type=\"radio\"]\n          } else if (localName === 'input' && node.hasAttribute('type') &&\n                     regTypeCheck.test(node.getAttribute('type')) &&\n                     (node.checked || node.hasAttribute('checked'))) {\n            matched.add(node);\n          // option\n          } else if (localName === 'option') {\n            let isMultiple = false;\n            let parent = parentNode;\n            while (parent) {\n              if (parent.localName === 'datalist') {\n                break;\n              } else if (parent.localName === 'select') {\n                if (parent.multiple || parent.hasAttribute('multiple')) {\n                  isMultiple = true;\n                }\n                break;\n              }\n              parent = parent.parentNode;\n            }\n            if (isMultiple) {\n              if (node.selected || node.hasAttribute('selected')) {\n                matched.add(node);\n              }\n            } else {\n              const defaultOpt = new Set();\n              const walker =\n                this.#document.createTreeWalker(parentNode, SHOW_ELEMENT);\n              let refNode = walker.firstChild();\n              while (refNode) {\n                if (refNode.selected || refNode.hasAttribute('selected')) {\n                  defaultOpt.add(refNode);\n                  break;\n                }\n                refNode = walker.nextSibling();\n              }\n              if (defaultOpt.size) {\n                if (defaultOpt.has(node)) {\n                  matched.add(node);\n                }\n              }\n            }\n          }\n          break;\n        }\n        case 'valid': {\n          if (regFormValidity.test(localName)) {\n            if (node.checkValidity()) {\n              matched.add(node);\n            }\n          } else if (localName === 'fieldset') {\n            let bool;\n            const walker = this.#document.createTreeWalker(node, SHOW_ELEMENT);\n            let refNode = walker.firstChild();\n            while (refNode) {\n              if (regFormValidity.test(refNode.localName)) {\n                bool = refNode.checkValidity();\n                if (!bool) {\n                  break;\n                }\n              }\n              refNode = walker.nextNode();\n            }\n            if (bool) {\n              matched.add(node);\n            }\n          }\n          break;\n        }\n        case 'invalid': {\n          if (regFormValidity.test(localName)) {\n            if (!node.checkValidity()) {\n              matched.add(node);\n            }\n          } else if (localName === 'fieldset') {\n            let bool;\n            const walker = this.#document.createTreeWalker(node, SHOW_ELEMENT);\n            let refNode = walker.firstChild();\n            while (refNode) {\n              if (regFormValidity.test(refNode.localName)) {\n                bool = refNode.checkValidity();\n                if (!bool) {\n                  break;\n                }\n              }\n              refNode = walker.nextNode();\n            }\n            if (!bool) {\n              matched.add(node);\n            }\n          }\n          break;\n        }\n        case 'in-range': {\n          if (localName === 'input' &&\n              !(node.readonly || node.hasAttribute('readonly')) &&\n              !(node.disabled || node.hasAttribute('disabled')) &&\n              node.hasAttribute('type') &&\n              regTypeRange.test(node.getAttribute('type')) &&\n              !(node.validity.rangeUnderflow ||\n                node.validity.rangeOverflow) &&\n              (node.hasAttribute('min') || node.hasAttribute('max') ||\n               node.getAttribute('type') === 'range')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'out-of-range': {\n          if (localName === 'input' &&\n              !(node.readonly || node.hasAttribute('readonly')) &&\n              !(node.disabled || node.hasAttribute('disabled')) &&\n              node.hasAttribute('type') &&\n              regTypeRange.test(node.getAttribute('type')) &&\n              (node.validity.rangeUnderflow || node.validity.rangeOverflow)) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'required': {\n          let targetNode;\n          if (/^(?:select|textarea)$/.test(localName)) {\n            targetNode = node;\n          } else if (localName === 'input') {\n            if (node.hasAttribute('type')) {\n              const inputType = node.getAttribute('type');\n              if (inputType === 'file' || regTypeCheck.test(inputType) ||\n                  regTypeDate.test(inputType) || regTypeText.test(inputType)) {\n                targetNode = node;\n              }\n            } else {\n              targetNode = node;\n            }\n          }\n          if (targetNode &&\n              (node.required || node.hasAttribute('required'))) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'optional': {\n          let targetNode;\n          if (/^(?:select|textarea)$/.test(localName)) {\n            targetNode = node;\n          } else if (localName === 'input') {\n            if (node.hasAttribute('type')) {\n              const inputType = node.getAttribute('type');\n              if (inputType === 'file' || regTypeCheck.test(inputType) ||\n                  regTypeDate.test(inputType) || regTypeText.test(inputType)) {\n                targetNode = node;\n              }\n            } else {\n              targetNode = node;\n            }\n          }\n          if (targetNode &&\n              !(node.required || node.hasAttribute('required'))) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'root': {\n          if (node === this.#document.documentElement) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'empty': {\n          if (node.hasChildNodes()) {\n            let bool;\n            const walker = this.#document.createTreeWalker(node, SHOW_ALL);\n            let refNode = walker.firstChild();\n            while (refNode) {\n              bool = refNode.nodeType !== ELEMENT_NODE &&\n                refNode.nodeType !== TEXT_NODE;\n              if (!bool) {\n                break;\n              }\n              refNode = walker.nextSibling();\n            }\n            if (bool) {\n              matched.add(node);\n            }\n          } else {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'first-child': {\n          if ((parentNode && node === parentNode.firstElementChild) ||\n              node === this.#root) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'last-child': {\n          if ((parentNode && node === parentNode.lastElementChild) ||\n              node === this.#root) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'only-child': {\n          if ((parentNode && node === parentNode.firstElementChild &&\n               node === parentNode.lastElementChild) || node === this.#root) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'first-of-type': {\n          if (parentNode) {\n            const [node1] = this._collectNthOfType({\n              a: 0,\n              b: 1\n            }, node);\n            if (node1) {\n              matched.add(node1);\n            }\n          } else if (node === this.#root) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'last-of-type': {\n          if (parentNode) {\n            const [node1] = this._collectNthOfType({\n              a: 0,\n              b: 1,\n              reverse: true\n            }, node);\n            if (node1) {\n              matched.add(node1);\n            }\n          } else if (node === this.#root) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'only-of-type': {\n          if (parentNode) {\n            const [node1] = this._collectNthOfType({\n              a: 0,\n              b: 1\n            }, node);\n            if (node1 === node) {\n              const [node2] = this._collectNthOfType({\n                a: 0,\n                b: 1,\n                reverse: true\n              }, node);\n              if (node2 === node) {\n                matched.add(node);\n              }\n            }\n          } else if (node === this.#root) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'host':\n        case 'host-context': {\n          // ignore\n          break;\n        }\n        // legacy pseudo-elements\n        case 'after':\n        case 'before':\n        case 'first-letter':\n        case 'first-line': {\n          if (warn) {\n            const msg = `Unsupported pseudo-element ::${astName}`;\n            throw new DOMException(msg, NOT_SUPPORTED_ERR);\n          }\n          break;\n        }\n        case 'active':\n        case 'autofill':\n        case 'blank':\n        case 'buffering':\n        case 'current':\n        case 'defined':\n        case 'focus-visible':\n        case 'fullscreen':\n        case 'future':\n        case 'hover':\n        case 'modal':\n        case 'muted':\n        case 'past':\n        case 'paused':\n        case 'picture-in-picture':\n        case 'playing':\n        case 'seeking':\n        case 'stalled':\n        case 'user-invalid':\n        case 'user-valid':\n        case 'volume-locked':\n        case '-webkit-autofill': {\n          if (warn) {\n            const msg = `Unsupported pseudo-class :${astName}`;\n            throw new DOMException(msg, NOT_SUPPORTED_ERR);\n          }\n          break;\n        }\n        default: {\n          if (astName.startsWith('-webkit-')) {\n            if (warn) {\n              const msg = `Unsupported pseudo-class :${astName}`;\n              throw new DOMException(msg, NOT_SUPPORTED_ERR);\n            }\n          } else if (!forgive) {\n            const msg = `Unknown pseudo-class :${astName}`;\n            throw new DOMException(msg, SYNTAX_ERR);\n          }\n        }\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * match shadow host pseudo class\n   * @private\n   * @param {object} ast - AST\n   * @param {object} node - DocumentFragment node\n   * @returns {?object} - matched node\n   */\n  _matchShadowHostPseudoClass(ast, node) {\n    const { children: astChildren } = ast;\n    const astName = unescapeSelector(ast.name);\n    let res;\n    if (Array.isArray(astChildren)) {\n      const [branch] = walkAST(astChildren[0]);\n      const [...leaves] = branch;\n      const { host } = node;\n      if (astName === 'host') {\n        let bool;\n        for (const leaf of leaves) {\n          const { type: leafType } = leaf;\n          if (leafType === COMBINATOR) {\n            const css = generateCSS(ast);\n            const msg = `Invalid selector ${css}`;\n            throw new DOMException(msg, SYNTAX_ERR);\n          }\n          bool = this._matchSelector(leaf, host).has(host);\n          if (!bool) {\n            break;\n          }\n        }\n        if (bool) {\n          res = node;\n        }\n      } else if (astName === 'host-context') {\n        let bool;\n        let parent = host;\n        while (parent) {\n          for (const leaf of leaves) {\n            const { type: leafType } = leaf;\n            if (leafType === COMBINATOR) {\n              const css = generateCSS(ast);\n              const msg = `Invalid selector ${css}`;\n              throw new DOMException(msg, SYNTAX_ERR);\n            }\n            bool = this._matchSelector(leaf, parent).has(parent);\n            if (!bool) {\n              break;\n            }\n          }\n          if (bool) {\n            break;\n          } else {\n            parent = parent.parentNode;\n          }\n        }\n        if (bool) {\n          res = node;\n        }\n      }\n    } else if (astName === 'host') {\n      res = node;\n    } else {\n      const msg = `Invalid selector :${astName}`;\n      throw new DOMException(msg, SYNTAX_ERR);\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match selector\n   * @private\n   * @param {object} ast - AST\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @param {object} [opt] - options\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchSelector(ast, node, opt) {\n    const { type: astType } = ast;\n    const astName = unescapeSelector(ast.name);\n    let matched = new Set();\n    if (node.nodeType === ELEMENT_NODE) {\n      switch (astType) {\n        case SELECTOR_PSEUDO_CLASS: {\n          const nodes = this._matchPseudoClassSelector(ast, node, opt);\n          if (nodes.size) {\n            matched = nodes;\n          }\n          break;\n        }\n        case SELECTOR_PSEUDO_ELEMENT: {\n          matchPseudoElementSelector(astName, opt);\n          break;\n        }\n        default: {\n          const res = matchSelector(ast, node, opt);\n          if (res) {\n            matched.add(res);\n          }\n        }\n      }\n    } else if (this.#shadow && astType === SELECTOR_PSEUDO_CLASS &&\n               node.nodeType === DOCUMENT_FRAGMENT_NODE) {\n      if (astName !== 'has' && REG_LOGICAL_PSEUDO.test(astName)) {\n        const nodes = this._matchPseudoClassSelector(ast, node, opt);\n        if (nodes.size) {\n          matched = nodes;\n        }\n      } else if (REG_SHADOW_HOST.test(astName)) {\n        const res = this._matchShadowHostPseudoClass(ast, node, opt);\n        if (res) {\n          matched.add(res);\n        }\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * match leaves\n   * @private\n   * @param {Array.<object>} leaves - AST leaves\n   * @param {object} node - node\n   * @param {object} opt - options\n   * @returns {boolean} - result\n   */\n  _matchLeaves(leaves, node, opt) {\n    let bool;\n    if (this.#results.has(leaves)) {\n      const result = this.#results.get(leaves);\n      if (result.has(node)) {\n        bool = result.get(node);\n      } else {\n        for (const leaf of leaves) {\n          bool = this._matchSelector(leaf, node, opt).has(node);\n          if (!bool) {\n            break;\n          }\n        }\n        result.set(node, bool);\n        this.#results.set(leaves, result);\n      }\n    } else {\n      for (const leaf of leaves) {\n        bool = this._matchSelector(leaf, node, opt).has(node);\n        if (!bool) {\n          break;\n        }\n      }\n      const result = new WeakMap();\n      result.set(node, bool);\n      this.#results.set(leaves, result);\n    }\n    return !!bool;\n  }\n\n  /**\n   * match HTML collection\n   * @private\n   * @param {object} items - HTML collection\n   * @param {object} opt - options\n   * @returns {Set.<object>} - matched nodes\n   */\n  _matchHTMLCollection(items, opt = {}) {\n    const { compound, filterLeaves } = opt;\n    let nodes = new Set();\n    const l = items.length;\n    if (l) {\n      if (compound) {\n        for (let i = 0; i < l; i++) {\n          const item = items[i];\n          const bool = this._matchLeaves(filterLeaves, item, opt);\n          if (bool) {\n            nodes.add(item);\n          }\n        }\n      } else {\n        const arr = [].slice.call(items);\n        nodes = new Set(arr);\n      }\n    }\n    return nodes;\n  }\n\n  /**\n   * find descendant nodes\n   * @private\n   * @param {Array.<object>} leaves - AST leaves\n   * @param {object} baseNode - base Element node\n   * @param {object} opt - options\n   * @returns {object} - collection of nodes and pending state\n   */\n  _findDescendantNodes(leaves, baseNode, opt) {\n    const [leaf, ...filterLeaves] = leaves;\n    const { type: leafType } = leaf;\n    const leafName = unescapeSelector(leaf.name);\n    const compound = filterLeaves.length > 0;\n    let nodes = new Set();\n    let pending = false;\n    if (this.#shadow) {\n      pending = true;\n    } else {\n      switch (leafType) {\n        case SELECTOR_PSEUDO_ELEMENT: {\n          matchPseudoElementSelector(leafName, opt);\n          break;\n        }\n        case SELECTOR_ID: {\n          if (this.#root.nodeType === ELEMENT_NODE) {\n            pending = true;\n          } else {\n            const node = this.#root.getElementById(leafName);\n            if (node && node !== baseNode && baseNode.contains(node)) {\n              if (compound) {\n                const bool = this._matchLeaves(filterLeaves, node, opt);\n                if (bool) {\n                  nodes.add(node);\n                }\n              } else {\n                nodes.add(node);\n              }\n            }\n          }\n          break;\n        }\n        case SELECTOR_CLASS: {\n          const items = baseNode.getElementsByClassName(leafName);\n          nodes = this._matchHTMLCollection(items, {\n            compound,\n            filterLeaves\n          });\n          break;\n        }\n        case SELECTOR_TYPE: {\n          if (this.#document.contentType === 'text/html' &&\n              !/[*|]/.test(leafName)) {\n            const items = baseNode.getElementsByTagName(leafName);\n            nodes = this._matchHTMLCollection(items, {\n              compound,\n              filterLeaves\n            });\n          } else {\n            pending = true;\n          }\n          break;\n        }\n        default: {\n          pending = true;\n        }\n      }\n    }\n    return {\n      nodes,\n      pending\n    };\n  }\n\n  /**\n   * match combinator\n   * @private\n   * @param {object} twig - twig\n   * @param {object} node - Element node\n   * @param {object} opt - option\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchCombinator(twig, node, opt = {}) {\n    const { combo, leaves } = twig;\n    const { name: comboName } = combo;\n    const { dir } = opt;\n    let matched = new Set();\n    if (dir === DIR_NEXT) {\n      switch (comboName) {\n        case '+': {\n          const refNode = node.nextElementSibling;\n          if (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, opt);\n            if (bool) {\n              matched.add(refNode);\n            }\n          }\n          break;\n        }\n        case '~': {\n          const { parentNode } = node;\n          if (parentNode) {\n            const walker =\n              this.#document.createTreeWalker(parentNode, SHOW_ELEMENT);\n            let refNode = this._traverse(node, walker);\n            if (refNode === node) {\n              refNode = walker.nextSibling();\n            }\n            while (refNode) {\n              const bool = this._matchLeaves(leaves, refNode, opt);\n              if (bool) {\n                matched.add(refNode);\n              }\n              refNode = walker.nextSibling();\n            }\n          }\n          break;\n        }\n        case '>': {\n          const walker = this.#document.createTreeWalker(node, SHOW_ELEMENT);\n          let refNode = walker.firstChild();\n          while (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, opt);\n            if (bool) {\n              matched.add(refNode);\n            }\n            refNode = walker.nextSibling();\n          }\n          break;\n        }\n        case ' ':\n        default: {\n          const { nodes, pending } = this._findDescendantNodes(leaves, node);\n          if (nodes.size) {\n            matched = nodes;\n          } else if (pending) {\n            const walker = this.#document.createTreeWalker(node, SHOW_ELEMENT);\n            let refNode = walker.nextNode();\n            while (refNode) {\n              const bool = this._matchLeaves(leaves, refNode, opt);\n              if (bool) {\n                matched.add(refNode);\n              }\n              refNode = walker.nextNode();\n            }\n          }\n        }\n      }\n    } else {\n      switch (comboName) {\n        case '+': {\n          const refNode = node.previousElementSibling;\n          if (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, opt);\n            if (bool) {\n              matched.add(refNode);\n            }\n          }\n          break;\n        }\n        case '~': {\n          const walker =\n            this.#document.createTreeWalker(node.parentNode, SHOW_ELEMENT);\n          let refNode = walker.firstChild();\n          while (refNode) {\n            if (refNode === node) {\n              break;\n            } else {\n              const bool = this._matchLeaves(leaves, refNode, opt);\n              if (bool) {\n                matched.add(refNode);\n              }\n            }\n            refNode = walker.nextSibling();\n          }\n          break;\n        }\n        case '>': {\n          const refNode = node.parentNode;\n          if (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, opt);\n            if (bool) {\n              matched.add(refNode);\n            }\n          }\n          break;\n        }\n        case ' ':\n        default: {\n          const arr = [];\n          let refNode = node.parentNode;\n          while (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, opt);\n            if (bool) {\n              arr.push(refNode);\n            }\n            refNode = refNode.parentNode;\n          }\n          if (arr.length) {\n            matched = new Set(arr.reverse());\n          }\n        }\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * find matched node from finder\n   * @private\n   * @param {Array.<object>} leaves - AST leaves\n   * @param {object} [opt] - options\n   * @param {object} [opt.node] - node to start from\n   * @returns {?object} - matched node\n   */\n  _findNode(leaves, opt = {}) {\n    const { node } = opt;\n    let matchedNode;\n    let refNode = this._traverse(node, this.#finder);\n    if (refNode) {\n      if (refNode.nodeType !== ELEMENT_NODE) {\n        refNode = this.#finder.nextNode();\n      } else if (refNode === node) {\n        if (refNode !== this.#root) {\n          refNode = this.#finder.nextNode();\n        }\n      }\n      while (refNode) {\n        let bool;\n        if (this.#node.nodeType === ELEMENT_NODE) {\n          if (refNode === this.#node) {\n            bool = true;\n          } else {\n            bool = this.#node.contains(refNode);\n          }\n        } else {\n          bool = true;\n        }\n        if (bool) {\n          const matched = this._matchLeaves(leaves, refNode, {\n            warn: this.#warn\n          });\n          if (matched) {\n            matchedNode = refNode;\n            break;\n          }\n        }\n        refNode = this.#finder.nextNode();\n      }\n    }\n    return matchedNode ?? null;\n  }\n\n  /**\n   * match self\n   * @private\n   * @param {Array} leaves - AST leaves\n   * @returns {Array} - [nodes, filtered]\n   */\n  _matchSelf(leaves) {\n    const nodes = [];\n    let filtered = false;\n    const bool = this._matchLeaves(leaves, this.#node);\n    if (bool) {\n      nodes.push(this.#node);\n      filtered = true;\n    }\n    return [nodes, filtered];\n  }\n\n  /**\n   * find lineal\n   * @private\n   * @param {Array} leaf - AST leaf\n   * @param {object} opt - options\n   * @returns {Array} - [nodes, filtered]\n   */\n  _findLineal(leaf, opt = {}) {\n    const { complex, compound, filterLeaves } = opt;\n    const nodes = [];\n    let filtered = false;\n    let bool = this._matchLeaves([leaf], this.#node);\n    if (bool && !complex) {\n      if (compound) {\n        bool = this._matchLeaves(filterLeaves, this.#node);\n        if (bool) {\n          nodes.push(this.#node);\n          filtered = true;\n        }\n      } else {\n        nodes.push(this.#node);\n        filtered = true;\n      }\n    }\n    if (!bool || complex) {\n      if (bool) {\n        nodes.push(this.#node);\n        if (!compound) {\n          filtered = true;\n        }\n      }\n      let refNode = this.#node.parentNode;\n      while (refNode) {\n        bool = this._matchLeaves([leaf], refNode);\n        if (bool) {\n          nodes.push(refNode);\n          if (!compound) {\n            filtered = true;\n          }\n        }\n        if (refNode.parentNode) {\n          refNode = refNode.parentNode;\n        } else {\n          break;\n        }\n      }\n    }\n    return [nodes, filtered];\n  }\n\n  /**\n   * find first\n   * @private\n   * @param {Array} leaves - AST leaves\n   * @returns {Array} - [nodes, filtered]\n   */\n  _findFirst(leaves) {\n    const nodes = [];\n    let filtered = false;\n    const node = this._findNode(leaves, {\n      node: this.#node\n    });\n    if (node) {\n      nodes.push(node);\n      filtered = true;\n    }\n    return [nodes, filtered];\n  }\n\n  /**\n   * find from HTML collection\n   * @private\n   * @param {object} items - HTML collection\n   * @param {object} opt - options\n   * @param {boolean} [opt.compound] - compound selector\n   * @param {Array} [opt.filterLeaves] - filter leaves\n   * @returns {Array} - [nodes, filtered]\n   */\n  _findFromHTMLCollection(items, opt = {}) {\n    const { compound, filterLeaves } = opt;\n    let nodes = [];\n    let filtered = false;\n    const l = items.length;\n    if (l) {\n      if (this.#node.nodeType === ELEMENT_NODE) {\n        for (let i = 0; i < l; i++) {\n          const node = items[i];\n          if (node === this.#node || isInclusive(node, this.#node)) {\n            if (compound) {\n              const bool = this._matchLeaves(filterLeaves, node, {\n                warn: this.#warn\n              });\n              if (bool) {\n                nodes.push(node);\n                filtered = true;\n              }\n            } else {\n              nodes.push(node);\n              filtered = true;\n            }\n          }\n        }\n      } else if (compound) {\n        for (let i = 0; i < l; i++) {\n          const node = items[i];\n          const bool = this._matchLeaves(filterLeaves, node, {\n            warn: this.#warn\n          });\n          if (bool) {\n            nodes.push(node);\n            filtered = true;\n          }\n        }\n      } else {\n        nodes = [].slice.call(items);\n        filtered = true;\n      }\n    }\n    return [nodes, filtered];\n  }\n\n  /**\n   * find entry nodes\n   * @private\n   * @param {object} twig - twig\n   * @param {string} targetType - target type\n   * @param {boolean} complex - complex selector\n   * @returns {object} - collection of nodes etc.\n   */\n  _findEntryNodes(twig, targetType, complex) {\n    const { leaves } = twig;\n    const [leaf, ...filterLeaves] = leaves;\n    const { type: leafType } = leaf;\n    const leafName = unescapeSelector(leaf.name);\n    const compound = filterLeaves.length > 0;\n    let nodes = [];\n    let filtered = false;\n    let pending = false;\n    switch (leafType) {\n      case SELECTOR_PSEUDO_ELEMENT: {\n        matchPseudoElementSelector(leafName, {\n          warn: this.#warn\n        });\n        break;\n      }\n      case SELECTOR_ID: {\n        if (targetType === TARGET_SELF) {\n          [nodes, filtered] = this._matchSelf(leaves);\n        } else if (targetType === TARGET_LINEAL) {\n          [nodes, filtered] = this._findLineal(leaf, {\n            complex,\n            compound,\n            filterLeaves\n          });\n        } else if (targetType === TARGET_FIRST &&\n                   this.#root.nodeType !== ELEMENT_NODE) {\n          const node = this.#root.getElementById(leafName);\n          if (node) {\n            if (compound) {\n              const bool = this._matchLeaves(filterLeaves, node, {\n                warn: this.#warn\n              });\n              if (bool) {\n                nodes.push(node);\n                filtered = true;\n              }\n            } else {\n              nodes.push(node);\n              filtered = true;\n            }\n          }\n        } else {\n          pending = true;\n        }\n        break;\n      }\n      case SELECTOR_CLASS: {\n        if (targetType === TARGET_SELF) {\n          [nodes, filtered] = this._matchSelf(leaves);\n        } else if (targetType === TARGET_LINEAL) {\n          [nodes, filtered] = this._findLineal(leaf, {\n            complex,\n            compound,\n            filterLeaves\n          });\n        } else if (targetType === TARGET_FIRST) {\n          [nodes, filtered] = this._findFirst(leaves);\n        } else if (this.#root.nodeType === DOCUMENT_NODE) {\n          const items = this.#root.getElementsByClassName(leafName);\n          [nodes, filtered] = this._findFromHTMLCollection(items, {\n            compound,\n            filterLeaves\n          });\n        } else {\n          pending = true;\n        }\n        break;\n      }\n      case SELECTOR_TYPE: {\n        if (targetType === TARGET_SELF) {\n          [nodes, filtered] = this._matchSelf(leaves);\n        } else if (targetType === TARGET_LINEAL) {\n          [nodes, filtered] = this._findLineal(leaf, {\n            complex,\n            compound,\n            filterLeaves\n          });\n        } else if (this.#document.contentType === 'text/html' &&\n                   this.#root.nodeType === DOCUMENT_NODE &&\n                   !/[*|]/.test(leafName)) {\n          const items = this.#root.getElementsByTagName(leafName);\n          [nodes, filtered] = this._findFromHTMLCollection(items, {\n            compound,\n            filterLeaves\n          });\n        } else {\n          pending = true;\n        }\n        break;\n      }\n      default: {\n        if (targetType !== TARGET_LINEAL && REG_SHADOW_HOST.test(leafName)) {\n          if (this.#shadow &&\n              this.#node.nodeType === DOCUMENT_FRAGMENT_NODE) {\n            const node = this._matchShadowHostPseudoClass(leaf, this.#node);\n            if (node) {\n              nodes.push(node);\n              filtered = true;\n            }\n          }\n        } else if (targetType === TARGET_SELF) {\n          [nodes, filtered] = this._matchSelf(leaves);\n        } else if (targetType === TARGET_LINEAL) {\n          [nodes, filtered] = this._findLineal(leaf, {\n            complex,\n            compound,\n            filterLeaves\n          });\n        } else if (targetType === TARGET_FIRST) {\n          [nodes, filtered] = this._findFirst(leaves);\n        } else {\n          pending = true;\n        }\n      }\n    }\n    return {\n      compound,\n      filtered,\n      nodes,\n      pending\n    };\n  }\n\n  /**\n   * get entry twig\n   * @private\n   * @param {Array.<object>} branch - AST branch\n   * @param {string} targetType - target type\n   * @returns {object} - direction and twig\n   */\n  _getEntryTwig(branch, targetType) {\n    const branchLen = branch.length;\n    const complex = branchLen > 1;\n    const firstTwig = branch[0];\n    let dir;\n    let twig;\n    if (complex) {\n      const {\n        combo: firstCombo,\n        leaves: [{\n          name: firstName,\n          type: firstType\n        }]\n      } = firstTwig;\n      const lastTwig = branch[branchLen - 1];\n      const {\n        leaves: [{\n          name: lastName,\n          type: lastType\n        }]\n      } = lastTwig;\n      if (lastType === SELECTOR_PSEUDO_ELEMENT || lastType === SELECTOR_ID) {\n        dir = DIR_PREV;\n        twig = lastTwig;\n      } else if (firstType === SELECTOR_PSEUDO_ELEMENT ||\n                 firstType === SELECTOR_ID) {\n        dir = DIR_NEXT;\n        twig = firstTwig;\n      } else if (targetType === TARGET_ALL) {\n        if (firstName === '*' && firstType === SELECTOR_TYPE) {\n          dir = DIR_PREV;\n          twig = lastTwig;\n        } else if (lastName === '*' && lastType === SELECTOR_TYPE) {\n          dir = DIR_NEXT;\n          twig = firstTwig;\n        } else if (branchLen === 2) {\n          const { name: comboName } = firstCombo;\n          if (/^[+~]$/.test(comboName)) {\n            dir = DIR_PREV;\n            twig = lastTwig;\n          } else {\n            dir = DIR_NEXT;\n            twig = firstTwig;\n          }\n        } else {\n          dir = DIR_NEXT;\n          twig = firstTwig;\n        }\n      } else if (lastName === '*' && lastType === SELECTOR_TYPE) {\n        dir = DIR_NEXT;\n        twig = firstTwig;\n      } else if (firstName === '*' && firstType === SELECTOR_TYPE) {\n        dir = DIR_PREV;\n        twig = lastTwig;\n      } else {\n        let bool;\n        let sibling;\n        for (const { combo, leaves: [leaf] } of branch) {\n          const { type: leafType } = leaf;\n          const leafName = unescapeSelector(leaf.name);\n          if (leafType === SELECTOR_PSEUDO_CLASS && leafName === 'dir') {\n            bool = false;\n            break;\n          }\n          if (combo && !sibling) {\n            const { name: comboName } = combo;\n            if (/^[+~]$/.test(comboName)) {\n              bool = true;\n              sibling = true;\n            }\n          }\n        }\n        if (bool) {\n          dir = DIR_NEXT;\n          twig = firstTwig;\n        } else {\n          dir = DIR_PREV;\n          twig = lastTwig;\n        }\n      }\n    } else {\n      dir = DIR_PREV;\n      twig = firstTwig;\n    }\n    return {\n      complex,\n      dir,\n      twig\n    };\n  }\n\n  /**\n   * collect nodes\n   * @private\n   * @param {string} targetType - target type\n   * @returns {Array.<Array.<object|undefined>>} - #ast and #nodes\n   */\n  _collectNodes(targetType) {\n    const ast = this.#ast.values();\n    if (targetType === TARGET_ALL || targetType === TARGET_FIRST) {\n      const pendingItems = new Set();\n      let i = 0;\n      for (const { branch } of ast) {\n        const { complex, dir, twig } = this._getEntryTwig(branch, targetType);\n        const {\n          compound, filtered, nodes, pending\n        } = this._findEntryNodes(twig, targetType, complex);\n        if (nodes.length) {\n          this.#ast[i].find = true;\n          this.#nodes[i] = nodes;\n        } else if (pending) {\n          pendingItems.add(new Map([\n            ['index', i],\n            ['twig', twig]\n          ]));\n        }\n        this.#ast[i].dir = dir;\n        this.#ast[i].filtered = filtered || !compound;\n        i++;\n      }\n      if (pendingItems.size) {\n        let node;\n        let walker;\n        if (this.#node !== this.#root && this.#node.nodeType === ELEMENT_NODE) {\n          node = this.#node;\n          walker = this.#finder;\n        } else {\n          node = this.#root;\n          walker = this.#tree;\n        }\n        let nextNode = this._traverse(node, walker);\n        while (nextNode) {\n          let bool = false;\n          if (this.#node.nodeType === ELEMENT_NODE) {\n            if (nextNode === this.#node) {\n              bool = true;\n            } else {\n              bool = this.#node.contains(nextNode);\n            }\n          } else {\n            bool = true;\n          }\n          if (bool) {\n            for (const pendingItem of pendingItems) {\n              const { leaves } = pendingItem.get('twig');\n              const matched = this._matchLeaves(leaves, nextNode, {\n                warn: this.#warn\n              });\n              if (matched) {\n                const index = pendingItem.get('index');\n                this.#ast[index].filtered = true;\n                this.#ast[index].find = true;\n                this.#nodes[index].push(nextNode);\n              }\n            }\n          }\n          nextNode = walker.nextNode();\n        }\n      }\n    } else {\n      let i = 0;\n      for (const { branch } of ast) {\n        const twig = branch[branch.length - 1];\n        const complex = branch.length > 1;\n        const {\n          compound, filtered, nodes\n        } = this._findEntryNodes(twig, targetType, complex);\n        if (nodes.length) {\n          this.#ast[i].find = true;\n          this.#nodes[i] = nodes;\n        }\n        this.#ast[i].dir = DIR_PREV;\n        this.#ast[i].filtered = filtered || !compound;\n        i++;\n      }\n    }\n    return [\n      this.#ast,\n      this.#nodes\n    ];\n  }\n\n  /**\n   * match nodes\n   * @private\n   * @param {string} targetType - target type\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchNodes(targetType) {\n    const [...branches] = this.#ast;\n    const l = branches.length;\n    let nodes = new Set();\n    for (let i = 0; i < l; i++) {\n      const { branch, dir, filtered, find } = branches[i];\n      const branchLen = branch.length;\n      if (branchLen && find) {\n        const entryNodes = this.#nodes[i];\n        const entryNodesLen = entryNodes.length;\n        const lastIndex = branchLen - 1;\n        if (lastIndex === 0) {\n          const { leaves: [, ...filterLeaves] } = branch[0];\n          if ((targetType === TARGET_ALL || targetType === TARGET_FIRST) &&\n              this.#node.nodeType === ELEMENT_NODE) {\n            for (let j = 0; j < entryNodesLen; j++) {\n              const node = entryNodes[j];\n              if (node !== this.#node && this.#node.contains(node)) {\n                nodes.add(node);\n                if (targetType !== TARGET_ALL) {\n                  break;\n                }\n              }\n            }\n          } else if (filterLeaves.length) {\n            for (let j = 0; j < entryNodesLen; j++) {\n              const node = entryNodes[j];\n              const bool = filtered || this._matchLeaves(filterLeaves, node, {\n                warn: this.#warn\n              });\n              if (bool) {\n                nodes.add(node);\n                if (targetType !== TARGET_ALL) {\n                  break;\n                }\n              }\n            }\n          } else if (targetType === TARGET_ALL) {\n            if (nodes.size) {\n              const n = [...nodes];\n              nodes = new Set([...n, ...entryNodes]);\n              this.#sort = true;\n            } else {\n              nodes = new Set([...entryNodes]);\n            }\n          } else {\n            const [node] = [...entryNodes];\n            nodes.add(node);\n          }\n        } else if (dir === DIR_NEXT) {\n          let { combo, leaves: entryLeaves } = branch[0];\n          let matched;\n          for (let j = 0; j < entryNodesLen; j++) {\n            const node = entryNodes[j];\n            let nextNodes = new Set([node]);\n            for (let j = 1; j < branchLen; j++) {\n              const { combo: nextCombo, leaves } = branch[j];\n              const arr = [];\n              for (const nextNode of nextNodes) {\n                const twig = {\n                  combo,\n                  leaves\n                };\n                const m = this._matchCombinator(twig, nextNode, {\n                  dir,\n                  warn: this.#warn\n                });\n                if (m.size) {\n                  arr.push(...m);\n                }\n              }\n              if (arr.length) {\n                if (j === lastIndex) {\n                  if (targetType === TARGET_ALL) {\n                    if (nodes.size) {\n                      const n = [...nodes];\n                      nodes = new Set([...n, ...arr]);\n                    } else {\n                      nodes = new Set([...arr]);\n                    }\n                    this.#sort = true;\n                  } else {\n                    const [node] = sortNodes(arr);\n                    nodes.add(node);\n                  }\n                  matched = true;\n                } else {\n                  combo = nextCombo;\n                  nextNodes = new Set(arr);\n                  matched = false;\n                }\n              } else {\n                matched = false;\n                break;\n              }\n            }\n            if (matched && targetType !== TARGET_ALL) {\n              break;\n            }\n          }\n          if (!matched && targetType === TARGET_FIRST) {\n            const [entryNode] = [...entryNodes];\n            let refNode = this._findNode(entryLeaves, {\n              node: entryNode\n            });\n            while (refNode) {\n              let nextNodes = new Set([refNode]);\n              for (let j = 1; j < branchLen; j++) {\n                const { combo: nextCombo, leaves } = branch[j];\n                const arr = [];\n                for (const nextNode of nextNodes) {\n                  const twig = {\n                    combo,\n                    leaves\n                  };\n                  const m = this._matchCombinator(twig, nextNode, {\n                    dir,\n                    warn: this.#warn\n                  });\n                  if (m.size) {\n                    arr.push(...m);\n                  }\n                }\n                if (arr.length) {\n                  if (j === lastIndex) {\n                    const [node] = sortNodes(arr);\n                    nodes.add(node);\n                    matched = true;\n                  } else {\n                    combo = nextCombo;\n                    nextNodes = new Set(arr);\n                    matched = false;\n                  }\n                } else {\n                  matched = false;\n                  break;\n                }\n              }\n              if (matched) {\n                break;\n              }\n              refNode = this._findNode(entryLeaves, {\n                node: refNode\n              });\n              nextNodes = new Set([refNode]);\n            }\n          }\n        } else {\n          const { leaves: entryLeaves } = branch[lastIndex];\n          let matched;\n          for (let j = 0; j < entryNodesLen; j++) {\n            const node = entryNodes[j];\n            let nextNodes = new Set([node]);\n            for (let j = lastIndex - 1; j >= 0; j--) {\n              const twig = branch[j];\n              const arr = [];\n              for (const nextNode of nextNodes) {\n                const m = this._matchCombinator(twig, nextNode, {\n                  dir,\n                  warn: this.#warn\n                });\n                if (m.size) {\n                  arr.push(...m);\n                }\n              }\n              if (arr.length) {\n                if (j === 0) {\n                  nodes.add(node);\n                  matched = true;\n                  if (targetType === TARGET_ALL &&\n                      branchLen > 1 && nodes.size > 1) {\n                    this.#sort = true;\n                  }\n                } else {\n                  nextNodes = new Set(arr);\n                  matched = false;\n                }\n              } else {\n                matched = false;\n                break;\n              }\n            }\n            if (matched && targetType !== TARGET_ALL) {\n              break;\n            }\n          }\n          if (!matched && targetType === TARGET_FIRST) {\n            const [entryNode] = [...entryNodes];\n            let refNode = this._findNode(entryLeaves, {\n              node: entryNode\n            });\n            while (refNode) {\n              let nextNodes = new Set([refNode]);\n              for (let j = lastIndex - 1; j >= 0; j--) {\n                const twig = branch[j];\n                const arr = [];\n                for (const nextNode of nextNodes) {\n                  const m = this._matchCombinator(twig, nextNode, {\n                    dir,\n                    warn: this.#warn\n                  });\n                  if (m.size) {\n                    arr.push(...m);\n                  }\n                }\n                if (arr.length) {\n                  if (j === 0) {\n                    nodes.add(refNode);\n                    matched = true;\n                  } else {\n                    nextNodes = new Set(arr);\n                    matched = false;\n                  }\n                } else {\n                  matched = false;\n                  break;\n                }\n              }\n              if (matched) {\n                break;\n              }\n              refNode = this._findNode(entryLeaves, {\n                node: refNode\n              });\n              nextNodes = new Set([refNode]);\n            }\n          }\n        }\n      }\n    }\n    return nodes;\n  }\n\n  /**\n   * find matched nodes\n   * @private\n   * @param {string} targetType - target type\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _find(targetType) {\n    this._collectNodes(targetType);\n    const nodes = this._matchNodes(targetType);\n    return nodes;\n  }\n\n  /**\n   * matches\n   * @param {string} selector - CSS selector\n   * @param {object} node - Element node\n   * @param {object} opt - options\n   * @returns {boolean} - `true` if matched `false` otherwise\n   */\n  matches(selector, node, opt) {\n    let res;\n    try {\n      this.#node = this._setup(selector, node, opt);\n      if (node.nodeType !== ELEMENT_NODE) {\n        const msg = `Unexpected node ${node.nodeName}`;\n        throw new TypeError(msg);\n      }\n      const nodes = this._find(TARGET_SELF);\n      res = nodes.size;\n    } catch (e) {\n      this._onError(e);\n    }\n    return !!res;\n  }\n\n  /**\n   * closest\n   * @param {string} selector - CSS selector\n   * @param {object} node - Element node\n   * @param {object} opt - options\n   * @returns {?object} - matched node\n   */\n  closest(selector, node, opt) {\n    let res;\n    try {\n      this.#node = this._setup(selector, node, opt);\n      if (node.nodeType !== ELEMENT_NODE) {\n        const msg = `Unexpected node ${node.nodeName}`;\n        throw new TypeError(msg);\n      }\n      const nodes = this._find(TARGET_LINEAL);\n      if (nodes.size) {\n        let refNode = this.#node;\n        while (refNode) {\n          if (nodes.has(refNode)) {\n            res = refNode;\n            break;\n          }\n          refNode = refNode.parentNode;\n        }\n      }\n    } catch (e) {\n      this._onError(e);\n    }\n    return res ?? null;\n  }\n\n  /**\n   * query selector\n   * @param {string} selector - CSS selector\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @param {object} opt - options\n   * @returns {?object} - matched node\n   */\n  querySelector(selector, node, opt) {\n    let res;\n    try {\n      this.#node = this._setup(selector, node, opt);\n      this._prepareTreeWalkers(node);\n      const nodes = this._find(TARGET_FIRST);\n      nodes.delete(this.#node);\n      if (nodes.size) {\n        [res] = sortNodes(nodes);\n      }\n    } catch (e) {\n      this._onError(e);\n    }\n    return res ?? null;\n  }\n\n  /**\n   * query selector all\n   * NOTE: returns Array, not NodeList\n   * @param {string} selector - CSS selector\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @param {object} opt - options\n   * @returns {Array.<object|undefined>} - collection of matched nodes\n   */\n  querySelectorAll(selector, node, opt) {\n    let res;\n    try {\n      this.#node = this._setup(selector, node, opt);\n      this._prepareTreeWalkers(node);\n      const nodes = this._find(TARGET_ALL);\n      nodes.delete(this.#node);\n      if (nodes.size) {\n        if (this.#sort) {\n          res = sortNodes(nodes);\n        } else {\n          res = [...nodes];\n        }\n      }\n    } catch (e) {\n      this._onError(e);\n    }\n    return res ?? [];\n  }\n};\n"],
+  "mappings": "6iBAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,YAAAE,IAAA,eAAAC,EAAAH,GAKA,IAAAI,EAAgC,iDAChCC,EAGO,yBACPC,EAA0D,wBAC1DC,EAEO,uBAGPC,EAMO,yBACP,MAAMC,EAAW,OACXC,EAAW,OACXC,EAAa,MACbC,EAAe,QACfC,EAAgB,SAChBC,EAAc,OACdC,EAAgB,gBAAgB,yBAAyB,eAgCxD,MAAMb,CAAO,CAElBc,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAKA,aAAc,CACZ,KAAKZ,GAAS,IAAI,OACpB,CASA,SAASa,EAAG,CACV,GAAI,CAAC,KAAKR,GACR,GAAIQ,aAAa,cACZ,KAAKD,IAAWC,aAAa,KAAKD,GAAQ,aAC7C,GAAIC,EAAE,OAAS,oBACT,KAAKF,IACP,QAAQ,KAAKE,EAAE,OAAO,MAEnB,OAAI,KAAKD,GACR,IAAI,KAAKA,GAAQ,aAAaC,EAAE,QAASA,EAAE,IAAI,EAE/CA,MAGR,OAAMA,CAGZ,CAYA,OAAOC,EAAUC,EAAMC,EAAM,CAAC,EAAG,CAC/B,KAAM,CAAE,SAAAC,EAAU,KAAAC,CAAK,EAAIF,EAC3B,YAAKX,GAAY,CAAC,CAACY,EACnB,KAAKN,GAAQ,CAAC,CAACO,EACf,KAAKf,GAAQY,EACb,CAAC,KAAKH,GAAS,KAAKX,GAAW,KAAKM,EAAK,KAAI,qBAAkBQ,CAAI,EACnE,KAAKP,MAAU,kBAAeO,CAAI,EAClC,CAAC,KAAKhB,GAAM,KAAKK,EAAM,EAAI,KAAK,YAAYU,CAAQ,EACpD,KAAKR,GAAW,IAAI,QACbS,CACT,CAQA,YAAYD,EAAU,CACpB,MAAMK,EAAQ,CAAC,EACf,IAAIC,EACAC,EAAa,KAAKpB,IAAa,KAAKD,GAAO,IAAI,KAAKC,EAAS,EAIjE,GAHIoB,GAAcA,EAAW,IAAI,GAAGP,CAAQ,EAAE,IAC5CM,EAAMC,EAAW,IAAIP,CAAQ,GAE3BM,EAAK,CACP,MAAME,EAAIF,EAAI,OACd,QAASG,EAAI,EAAGA,EAAID,EAAGC,IACrBH,EAAIG,CAAC,EAAE,IAAM,KACbH,EAAIG,CAAC,EAAE,SAAW,GAClBH,EAAIG,CAAC,EAAE,KAAO,GACdJ,EAAMI,CAAC,EAAI,CAAC,CAEhB,KAAO,CACL,IAAIC,EACJ,GAAI,CACFA,KAAS,iBAAcV,CAAQ,CACjC,OAASD,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,MAAMY,KAAW,WAAQD,CAAM,EAC/BJ,EAAM,CAAC,EACP,IAAIG,EAAI,EACR,SAAW,CAAC,GAAGG,CAAK,IAAKD,EAAU,CACjC,MAAME,EAAS,CAAC,EAChB,IAAIC,EAAOF,EAAM,MAAM,EACvB,GAAIE,GAAQA,EAAK,OAAS,aAAY,CACpC,MAAMC,EAAS,IAAI,IACnB,KAAOD,GAAM,CACX,GAAIA,EAAK,OAAS,aAAY,CAC5B,KAAM,CAACE,CAAQ,EAAIJ,EACnB,GAAII,EAAS,OAAS,aAAY,CAChC,MAAMC,EAAM,oBAAoBjB,CAAQ,GACxC,MAAM,IAAI,aAAaiB,EAAK,YAAU,CACxC,CACAJ,EAAO,KAAK,CACV,MAAOC,EACP,UAAQ,WAAQC,CAAM,CACxB,CAAC,EACDA,EAAO,MAAM,CACf,SAAWD,EAAM,CACf,GAAI,CAAE,KAAMI,CAAS,EAAIJ,EACrBI,IACE,OAAO,UAAU,eAAe,KAAKA,EAAU,MAAM,GACvDA,KAAW,oBAAiBA,EAAS,IAAI,EACrC,OAAO,KAAKA,CAAQ,IACtBJ,EAAK,UAAY,KAEV,OAAOI,GAAa,WAC7BA,KAAW,oBAAiBA,CAAQ,EAChC,OAAO,KAAKA,CAAQ,IACtBJ,EAAK,UAAY,MAIvBC,EAAO,IAAID,CAAI,CACjB,CACA,GAAIF,EAAM,OACRE,EAAOF,EAAM,MAAM,MACd,CACLC,EAAO,KAAK,CACV,MAAO,KACP,UAAQ,WAAQE,CAAM,CACxB,CAAC,EACDA,EAAO,MAAM,EACb,KACF,CACF,CACF,CACAT,EAAI,KAAK,CACP,OAAAO,EACA,IAAK,KACL,SAAU,GACV,KAAM,EACR,CAAC,EACDR,EAAMI,CAAC,EAAI,CAAC,EACZA,GACF,CACI,KAAKtB,KACFoB,IACHA,EAAa,IAAI,KAEnBA,EAAW,IAAI,GAAGP,CAAQ,GAAIM,CAAG,EACjC,KAAKpB,GAAO,IAAI,KAAKC,GAAWoB,CAAU,EAE9C,CACA,MAAO,CACLD,EACAD,CACF,CACF,CAQA,oBAAoBJ,EAAM,CACxB,YAAKL,GAAQ,KAAKT,GAAU,iBAAiB,KAAKM,GAAOT,CAAa,EACtE,KAAKI,GAAU,KAAKD,GAAU,iBAAiBc,EAAMjB,CAAa,EAClE,KAAKW,GAAQ,GACN,CACL,KAAKC,GACL,KAAKR,EACP,CACF,CASA,UAAUa,EAAO,CAAC,EAAGkB,EAAS,KAAKvB,GAAO,CACxC,IAAIwB,EACAC,EAAUF,EAAO,YACrB,GAAIlB,EAAK,WAAa,gBAAgBoB,IAAYpB,EAChDmB,EAAUC,MACL,CACL,GAAIA,IAAYF,EAAO,KACrB,KAAOE,GACD,EAAAA,IAAYF,EAAO,MAClBlB,EAAK,WAAa,gBAAgBoB,IAAYpB,IAGnDoB,EAAUF,EAAO,WAAW,EAGhC,GAAIlB,EAAK,WAAa,eACpB,KAAOoB,GAAS,CACd,GAAIA,IAAYpB,EAAM,CACpBmB,EAAUC,EACV,KACF,CACAA,EAAUF,EAAO,SAAS,CAC5B,MAEAC,EAAUC,CAEd,CACA,OAAOD,GAAW,IACpB,CAcA,iBAAiBE,EAAKrB,EAAMC,EAAK,CAC/B,KAAM,CAAE,EAAAqB,EAAG,EAAAC,EAAG,QAAAC,EAAS,SAAAzB,CAAS,EAAIsB,EAC9B,CAAE,WAAAI,CAAW,EAAIzB,EACvB,IAAI0B,EAAU,IAAI,IACdC,EASJ,GARI5B,IACE,KAAKd,GAAO,IAAIc,CAAQ,EAC1B4B,EAAmB,KAAK1C,GAAO,IAAIc,CAAQ,GAE3C4B,KAAmB,WAAQ5B,CAAQ,EACnC,KAAKd,GAAO,IAAIc,EAAU4B,CAAgB,IAG1CF,EAAY,CACd,MAAMP,EAAS,KAAKhC,GAAU,iBAAiBuC,EAAY1C,CAAa,EACxE,IAAIwB,EAAI,EACJa,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACLb,IACAa,EAAUF,EAAO,YAAY,EAE/BE,EAAU,KAAK,UAAUK,EAAYP,CAAM,EAC3C,MAAMU,EAAgB,IAAI,IAC1B,GAAID,EAGF,IAFAP,EAAU,KAAK,UAAUK,EAAYP,CAAM,EAC3CE,EAAUF,EAAO,WAAW,EACrBE,GAAS,CACd,IAAIS,EACJ,UAAWf,KAAUa,EAEnB,GADAE,EAAO,KAAK,aAAaf,EAAQM,EAASnB,CAAG,EACzC,CAAC4B,EACH,MAGAA,GACFD,EAAc,IAAIR,CAAO,EAE3BA,EAAUF,EAAO,YAAY,CAC/B,CAGF,GAAII,IAAM,GACR,GAAIC,EAAI,GAAKA,GAAKhB,GAChB,GAAIqB,EAAc,KAAM,CACtB,IAAIpB,EAAI,EAOR,IANAY,EAAU,KAAK,UAAUK,EAAYP,CAAM,EACvCM,EACFJ,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,GAAS,CACd,GAAIQ,EAAc,IAAIR,CAAO,EAAG,CAC9B,GAAIZ,IAAMe,EAAI,EAAG,CACfG,EAAQ,IAAIN,CAAO,EACnB,KACF,CACAZ,GACF,CACIgB,EACFJ,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,CAEjC,CACF,SAAW,CAACnB,EAAU,CACpB,IAAIS,EAAI,EAOR,IANAY,EAAU,KAAK,UAAUK,EAAYP,CAAM,EACvCM,EACFJ,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,GAAS,CACd,GAAIZ,IAAMe,EAAI,EAAG,CACfG,EAAQ,IAAIN,CAAO,EACnB,KACF,CACII,EACFJ,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,EAE/BV,GACF,CACF,OAGG,CACL,IAAIsB,EAAMP,EAAI,EACd,GAAID,EAAI,EACN,KAAOQ,EAAM,GACXA,GAAOR,EAGX,GAAIQ,GAAO,GAAKA,EAAMvB,EAAG,CACvB,IAAIC,EAAI,EACJuB,EAAIT,EAAI,EAAI,EAAIC,EAAI,EAOxB,IANAH,EAAU,KAAK,UAAUK,EAAYP,CAAM,EACvCM,EACFJ,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,IACDA,GAAWU,GAAO,GAAKA,EAAMvB,IAC3BqB,EAAc,KACZA,EAAc,IAAIR,CAAO,IACvBW,IAAMD,IACRJ,EAAQ,IAAIN,CAAO,EACnBU,GAAOR,GAELA,EAAI,EACNS,IAEAA,KAGKvB,IAAMsB,IACV/B,GACH2B,EAAQ,IAAIN,CAAO,EAErBU,GAAOR,GAELE,EACFJ,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,EAE/BV,GAKN,CACF,CACA,GAAIgB,GAAWE,EAAQ,KAAO,EAAG,CAC/B,MAAM,EAAI,CAAC,GAAGA,CAAO,EACrBA,EAAU,IAAI,IAAI,EAAE,QAAQ,CAAC,CAC/B,CACF,SAAW1B,IAAS,KAAKR,IAAU8B,EAAIC,IAAO,EAC5C,GAAII,EAAkB,CACpB,IAAIE,EACJ,UAAWf,KAAUa,EAEnB,GADAE,EAAO,KAAK,aAAaf,EAAQd,EAAMC,CAAG,EACtC4B,EACF,MAGAA,GACFH,EAAQ,IAAI1B,CAAI,CAEpB,MACE0B,EAAQ,IAAI1B,CAAI,EAGpB,OAAO0B,CACT,CAYA,kBAAkBL,EAAKrB,EAAM,CAC3B,KAAM,CAAE,EAAAsB,EAAG,EAAAC,EAAG,QAAAC,CAAQ,EAAIH,EACpB,CAAE,UAAAW,EAAW,WAAAP,EAAY,OAAAQ,CAAO,EAAIjC,EAC1C,IAAI0B,EAAU,IAAI,IAClB,GAAID,EAAY,CACd,MAAMP,EAAS,KAAKhC,GAAU,iBAAiBuC,EAAY1C,CAAa,EACxE,IAAIwB,EAAI,EACJa,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACLb,IACAa,EAAUF,EAAO,YAAY,EAG/B,GAAII,IAAM,GACR,GAAIC,EAAI,GAAKA,GAAKhB,EAAG,CACnB,IAAIwB,EAAI,EAOR,IANAX,EAAU,KAAK,UAAUK,EAAYP,CAAM,EACvCM,EACFJ,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,GAAS,CACd,KAAM,CAAE,UAAWc,EAAe,OAAQC,CAAW,EAAIf,EACzD,GAAIc,IAAkBF,GAAaG,IAAeF,EAAQ,CACxD,GAAIF,IAAMR,EAAI,EAAG,CACfG,EAAQ,IAAIN,CAAO,EACnB,KACF,CACAW,GACF,CACIP,EACFJ,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,CAEjC,CACF,MAEK,CACL,IAAIY,EAAMP,EAAI,EACd,GAAID,EAAI,EACN,KAAOQ,EAAM,GACXA,GAAOR,EAGX,GAAIQ,GAAO,GAAKA,EAAMvB,EAAG,CACvB,IAAIwB,EAAIT,EAAI,EAAI,EAAIC,EAAI,EAOxB,IANAH,EAAU,KAAK,UAAUK,EAAYP,CAAM,EACvCM,EACFJ,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,GAAS,CACd,KAAM,CAAE,UAAWc,EAAe,OAAQC,CAAW,EAAIf,EACzD,GAAIc,IAAkBF,GAAaG,IAAeF,EAAQ,CAKxD,GAJIF,IAAMD,IACRJ,EAAQ,IAAIN,CAAO,EACnBU,GAAOR,GAELQ,EAAM,GAAKA,GAAOvB,EACpB,MACSe,EAAI,EACbS,IAEAA,GAEJ,CACIP,EACFJ,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,CAEjC,CACF,CACF,CACA,GAAIM,GAAWE,EAAQ,KAAO,EAAG,CAC/B,MAAMU,EAAI,CAAC,GAAGV,CAAO,EACrBA,EAAU,IAAI,IAAIU,EAAE,QAAQ,CAAC,CAC/B,CACF,MAAWpC,IAAS,KAAKR,IAAU8B,EAAIC,IAAO,GAC5CG,EAAQ,IAAI1B,CAAI,EAElB,OAAO0B,CACT,CAWA,cAAcrB,EAAKL,EAAMqC,EAASpC,EAAK,CACrC,KAAM,CACJ,IAAK,CACH,EAAAqB,EACA,EAAAC,EACA,KAAMe,CACR,EACA,SAAAvC,CACF,EAAIM,EACEkC,KAAY,oBAAiBD,CAAY,EACzCE,EAAS,IAAI,IACfD,GACEA,IAAc,QAChBC,EAAO,IAAI,IAAK,CAAC,EACjBA,EAAO,IAAI,IAAK,CAAC,GACRD,IAAc,QACvBC,EAAO,IAAI,IAAK,CAAC,EACjBA,EAAO,IAAI,IAAK,CAAC,GAEfH,EAAQ,QAAQ,MAAM,EAAI,IAC5BG,EAAO,IAAI,UAAW,EAAI,IAGxB,OAAOlB,GAAM,UAAY,QAAQ,KAAKA,CAAC,EACzCkB,EAAO,IAAI,IAAKlB,EAAI,CAAC,EAErBkB,EAAO,IAAI,IAAK,CAAC,EAEf,OAAOjB,GAAM,UAAY,QAAQ,KAAKA,CAAC,EACzCiB,EAAO,IAAI,IAAKjB,EAAI,CAAC,EAErBiB,EAAO,IAAI,IAAK,CAAC,EAEfH,EAAQ,QAAQ,MAAM,EAAI,IAC5BG,EAAO,IAAI,UAAW,EAAI,GAG9B,IAAId,EAAU,IAAI,IAClB,GAAIc,EAAO,IAAI,GAAG,GAAKA,EAAO,IAAI,GAAG,GACnC,GAAI,wBAAwB,KAAKH,CAAO,EAAG,CACrCtC,GACFyC,EAAO,IAAI,WAAYzC,CAAQ,EAEjC,MAAMsB,EAAM,OAAO,YAAYmB,CAAM,EAC/BpC,EAAQ,KAAK,iBAAiBiB,EAAKrB,EAAMC,CAAG,EAC9CG,EAAM,OACRsB,EAAUtB,EAEd,SAAW,0BAA0B,KAAKiC,CAAO,EAAG,CAClD,MAAMhB,EAAM,OAAO,YAAYmB,CAAM,EAC/BpC,EAAQ,KAAK,kBAAkBiB,EAAKrB,CAAI,EAC1CI,EAAM,OACRsB,EAAUtB,EAEd,EAEF,OAAOsB,CACT,CASA,2BAA2BrB,EAAKL,EAAM,CACpC,MAAMyC,KAAU,oBAAiBpC,EAAI,IAAI,EACnCqC,KAAM,qBAAkB1C,CAAI,EAClC,IAAI2C,EACJ,OAAIF,IAAYC,IACdC,EAAM3C,GAED2C,GAAO,IAChB,CAUA,0BAA0BtC,EAAKL,EAAM,CACnC,MAAMyC,KAAU,oBAAiBpC,EAAI,IAAI,EACzC,IAAIsC,EACJ,GAAIF,IAAY,IACd,GAAIzC,EAAK,aAAa,MAAM,EACtBA,EAAK,aAAa,MAAM,IAC1B2C,EAAM3C,OAEH,CACL,IAAI4C,EAAS5C,EAAK,WAClB,KAAO4C,GACDA,EAAO,WAAa,gBAAc,CACpC,GAAIA,EAAO,aAAa,MAAM,EAAG,CAC3BA,EAAO,aAAa,MAAM,IAC5BD,EAAM3C,GAER,KACF,CACA4C,EAASA,EAAO,UAClB,CAIJ,SACSH,EAAS,CAClB,MAAMI,EAAW,OAAO,WAAS,KAEjC,GADgB,IAAI,OAAO,aAAa,WAAS,GAAGA,CAAQ,IAAK,GAAG,EACxD,KAAKJ,CAAO,EAAG,CACzB,IAAIK,EACJ,GAAIL,EAAQ,QAAQ,GAAG,EAAI,GAAI,CAC7B,KAAM,CAACM,EAAUC,EAAS,GAAGC,CAAQ,EAAIR,EAAQ,MAAM,GAAG,EAC1D,IAAIS,EACAH,IAAa,IACfG,EAAe,GAAG,WAAS,GAAGL,CAAQ,GAEtCK,EAAe,GAAGH,CAAQ,GAAGF,CAAQ,GAEvC,MAAMM,EAAc,IAAIH,CAAO,GAAGH,CAAQ,GACpCO,EAAMH,EAAS,OACrB,IAAII,EAAe,GACnB,GAAID,EACF,QAAS5C,EAAI,EAAGA,EAAI4C,EAAK5C,IACvB6C,GAAgB,IAAIJ,EAASzC,CAAC,CAAC,GAAGqC,CAAQ,GAG9CC,EACE,IAAI,OAAO,IAAII,CAAY,GAAGC,CAAW,GAAGE,CAAY,IAAK,GAAG,CACpE,MACEP,EAAkB,IAAI,OAAO,IAAIL,CAAO,GAAGI,CAAQ,IAAK,GAAG,EAE7D,GAAI7C,EAAK,aAAa,MAAM,EACtB8C,EAAgB,KAAK9C,EAAK,aAAa,MAAM,CAAC,IAChD2C,EAAM3C,OAEH,CACL,IAAI4C,EAAS5C,EAAK,WAClB,KAAO4C,GACDA,EAAO,WAAa,gBAAc,CACpC,GAAIA,EAAO,aAAa,MAAM,EAAG,CAC/B,MAAMU,EAAQV,EAAO,aAAa,MAAM,EACpCE,EAAgB,KAAKQ,CAAK,IAC5BX,EAAM3C,GAER,KACF,CACA4C,EAASA,EAAO,UAClB,CAIJ,CACF,CACF,CACA,OAAOD,GAAO,IAChB,CAUA,oBAAoB7B,EAAQd,EAAMC,EAAM,CAAC,EAAG,CAC1C,IAAI4B,EACJ,GAAI,MAAM,QAAQf,CAAM,GAAKA,EAAO,OAAQ,CAC1C,KAAM,CAACyC,CAAI,EAAIzC,EACT,CAAE,KAAM0C,CAAS,EAAID,EAC3B,IAAIE,EACAD,IAAa,aACfC,EAAQ3C,EAAO,MAAM,EAErB2C,EAAQ,CACN,KAAM,IACN,KAAM,YACR,EAEF,MAAMC,EAAa,CAAC,EACpB,KAAO5C,EAAO,QAAQ,CACpB,KAAM,CAACD,CAAI,EAAIC,EACT,CAAE,KAAM6C,CAAS,EAAI9C,EAC3B,GAAI8C,IAAa,aACf,MAEAD,EAAW,KAAK5C,EAAO,MAAM,CAAC,CAElC,CACA,MAAM8C,EAAO,CACX,MAAAH,EACA,OAAQC,CACV,EACAzD,EAAI,IAAMxB,EACV,MAAM2B,EAAQ,KAAK,iBAAiBwD,EAAM5D,EAAMC,CAAG,EACnD,GAAIG,EAAM,KACR,GAAIU,EAAO,QACT,UAAW+C,KAAYzD,EAGrB,GAFAyB,EAAO,KAAK,oBAAoB,OAAO,OAAO,CAAC,EAAGf,CAAM,EACtD+C,EAAU5D,CAAG,EACX4B,EACF,WAIJA,EAAO,EAGb,CACA,MAAO,CAAC,CAACA,CACX,CAUA,wBAAwBiC,EAAS9D,EAAMC,EAAM,CAAC,EAAG,CAC/C,KAAM,CACJ,QAAAwC,EAAU,GAAI,SAAA/B,EAAW,CAAC,EAAG,SAAAX,EAAW,GAAI,aAAAgE,EAAe,CAAC,CAC9D,EAAID,EACJ,IAAInB,EACJ,GAAIF,IAAY,MACd,GAAI1C,EAAS,SAAS,OAAO,EAC3B4C,EAAM,SACD,CACL,IAAId,EACJ,UAAWf,KAAUJ,EAEnB,GADAmB,EAAO,KAAK,oBAAoB,OAAO,OAAO,CAAC,EAAGf,CAAM,EAAGd,EAAMC,CAAG,EAChE4B,EACF,MAGAA,IACFc,EAAM3C,EAEV,KACK,CACL,MAAMgE,EAAU,iBAAiB,KAAKvB,CAAO,EAC7CxC,EAAI,QAAU+D,EACd,MAAMzD,EAAIwD,EAAa,OACvB,IAAIlC,EACJ,QAASrB,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMI,EAASmD,EAAavD,CAAC,EACvByD,EAAYrD,EAAO,OAAS,EAC5B,CAAE,OAAAE,CAAO,EAAIF,EAAOqD,CAAS,EAEnC,GADApC,EAAO,KAAK,aAAaf,EAAQd,EAAMC,CAAG,EACtC4B,GAAQoC,EAAY,EAAG,CACzB,IAAIC,EAAY,IAAI,IAAI,CAAClE,CAAI,CAAC,EAC9B,QAAS+B,EAAIkC,EAAY,EAAGlC,GAAK,EAAGA,IAAK,CACvC,MAAM6B,EAAOhD,EAAOmB,CAAC,EACfoC,EAAM,CAAC,EACblE,EAAI,IAAMvB,EACV,UAAWmF,KAAYK,EAAW,CAChC,MAAM9B,EAAI,KAAK,iBAAiBwB,EAAMC,EAAU5D,CAAG,EAC/CmC,EAAE,MACJ+B,EAAI,KAAK,GAAG/B,CAAC,CAEjB,CACA,GAAI+B,EAAI,OACFpC,IAAM,EACRF,EAAO,GAEPqC,EAAY,IAAI,IAAIC,CAAG,MAEpB,CACLtC,EAAO,GACP,KACF,CACF,CACF,CACA,GAAIA,EACF,KAEJ,CACIY,IAAY,MACTZ,IACHc,EAAM3C,GAEC6B,IACTc,EAAM3C,EAEV,CACA,OAAO2C,GAAO,IAChB,CAaA,0BAA0BtC,EAAKL,EAAMC,EAAM,CAAC,EAAG,CAC7C,KAAM,CAAE,SAAUmE,CAAY,EAAI/D,EAC5B,CAAE,UAAA2B,EAAW,WAAAP,CAAW,EAAIzB,EAC5B,CACJ,QAAAgE,EACA,KAAA7D,EAAO,KAAKP,EACd,EAAIK,EACEwC,KAAU,oBAAiBpC,EAAI,IAAI,EACzC,IAAIqB,EAAU,IAAI,IAElB,GAAI,qBAAmB,KAAKe,CAAO,EAAG,CACpC,IAAIqB,EACJ,GAAI,KAAK7E,GAAO,IAAIoB,CAAG,EACrByD,EAAU,KAAK7E,GAAO,IAAIoB,CAAG,MACxB,CACL,MAAMK,KAAW,WAAQL,CAAG,EACtBgE,EAAY,CAAC,EACbN,EAAe,CAAC,EACtB,SAAW,CAAC,GAAGjD,CAAM,IAAKJ,EAAU,CAClC,UAAW6C,KAAQzC,EAAQ,CACzB,MAAMwD,KAAM,eAAYf,CAAI,EAC5Bc,EAAU,KAAKC,CAAG,CACpB,CACA,MAAM1D,EAAS,CAAC,EACV2D,EAAY,IAAI,IACtB,IAAI1D,EAAOC,EAAO,MAAM,EACxB,KAAOD,GAUL,GATIA,EAAK,OAAS,cAChBD,EAAO,KAAK,CACV,MAAOC,EACP,OAAQ,CAAC,GAAG0D,CAAS,CACvB,CAAC,EACDA,EAAU,MAAM,GACP1D,GACT0D,EAAU,IAAI1D,CAAI,EAEhBC,EAAO,OACTD,EAAOC,EAAO,MAAM,MACf,CACLF,EAAO,KAAK,CACV,MAAO,KACP,OAAQ,CAAC,GAAG2D,CAAS,CACvB,CAAC,EACDA,EAAU,MAAM,EAChB,KACF,CAEFR,EAAa,KAAKnD,CAAM,CAC1B,CACAkD,EAAU,CACR,QAAArB,EACA,SAAA/B,EACA,aAAAqD,EACA,SAAUM,EAAU,KAAK,GAAG,CAC9B,EACA,KAAKpF,GAAO,IAAIoB,EAAKyD,CAAO,CAC9B,CACA,MAAMnB,EAAM,KAAK,wBAAwBmB,EAAS9D,EAAMC,CAAG,EACvD0C,GACFjB,EAAQ,IAAIiB,CAAG,CAEnB,SAAW,MAAM,QAAQyB,CAAW,EAAG,CACrC,KAAM,CAACxD,CAAM,EAAIwD,EAEjB,GAAI,oCAAoC,KAAK3B,CAAO,EAAG,CACrD,MAAMrC,EAAQ,KAAK,cAAcQ,EAAQZ,EAAMyC,EAASxC,CAAG,EACvDG,EAAM,OACRsB,EAAUtB,EAGd,SAAWqC,IAAY,MAAO,CAC5B,MAAME,EAAM,KAAK,2BAA2B/B,EAAQZ,CAAI,EACpD2C,GACFjB,EAAQ,IAAIiB,CAAG,CAGnB,SAAWF,IAAY,OAAQ,CAC7B,MAAME,EAAM,KAAK,0BAA0B/B,EAAQZ,CAAI,EACnD2C,GACFjB,EAAQ,IAAIiB,CAAG,CAEnB,KACE,QAAQF,EAAS,CACf,IAAK,UACL,IAAK,UACL,IAAK,eAAgB,CACnB,GAAItC,EAAM,CACR,MAAMa,EAAM,6BAA6ByB,CAAO,KAChD,MAAM,IAAI,aAAazB,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,IAAK,OACL,IAAK,eAEH,MAEF,QACE,GAAI,CAACgD,EAAS,CACZ,MAAMhD,EAAM,yBAAyByB,CAAO,KAC5C,MAAM,IAAI,aAAazB,EAAK,YAAU,CACxC,CAEJ,CAEJ,KAAO,CACL,MAAMwD,EAAY,cACZC,EACJ,iEACIC,EAAkB,6CAClBC,EAAc,sBACdC,EAAe,uBACfC,EAAc,4CACdC,EACJ,2DACIC,EAAc,oDACpB,OAAQtC,EAAS,CACf,IAAK,WACL,IAAK,OAAQ,CACP+B,EAAU,KAAKxC,CAAS,GAAKhC,EAAK,aAAa,MAAM,GACvD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,aAAc,CACjB,GAAIwE,EAAU,KAAKxC,CAAS,GAAKhC,EAAK,aAAa,MAAM,EAAG,CAC1D,KAAM,CAAE,KAAAgF,EAAM,OAAAC,EAAQ,SAAAC,CAAS,EAAI,IAAI,IAAI,KAAKhG,GAAU,GAAG,EACvDiG,EAAU,IAAI,IAAInF,EAAK,aAAa,MAAM,EAAGgF,CAAI,EACnDG,EAAQ,SAAWF,GAAUE,EAAQ,WAAaD,GACpDxD,EAAQ,IAAI1B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAEH,MAEF,IAAK,SAAU,CACb,KAAM,CAAE,KAAAoF,CAAK,EAAI,IAAI,IAAI,KAAKlG,GAAU,GAAG,EACvCc,EAAK,IAAMoF,IAAS,IAAIpF,EAAK,EAAE,IAC/B,KAAKd,GAAU,SAASc,CAAI,GAC9B0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,KAAM,CAAE,KAAAoF,CAAK,EAAI,IAAI,IAAI,KAAKlG,GAAU,GAAG,EAC3C,GAAIkG,EAAM,CACR,MAAMC,EAAKD,EAAK,QAAQ,KAAM,EAAE,EAChC,IAAIjE,EAAU,KAAKjC,GAAU,eAAemG,CAAE,EAC9C,KAAOlE,GAAS,CACd,GAAIA,IAAYnB,EAAM,CACpB0B,EAAQ,IAAI1B,CAAI,EAChB,KACF,CACAmB,EAAUA,EAAQ,UACpB,CACF,CACA,KACF,CACA,IAAK,QAAS,CACR,KAAK/B,GAAM,WAAa,eACtBY,IAAS,KAAKZ,IAChBsC,EAAQ,IAAI1B,CAAI,EAETA,IAAS,KAAKd,GAAU,iBACjCwC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,QAAS,CACRA,IAAS,KAAKd,GAAU,eACxB,KAAKW,GAAQ,iBAAiBG,CAAI,EAAE,UAAY,QAClD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,IAAImB,EAAU,KAAKjC,GAAU,cAC7B,KAAOiC,GAAS,CACd,GAAIA,IAAYnB,EAAM,CAChB,KAAKH,GAAQ,iBAAiBG,CAAI,EAAE,UAAY,QAClD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACAmB,EAAUA,EAAQ,UACpB,CACA,KACF,CACA,IAAK,OAAQ,CACPwD,EAAY,KAAK3C,CAAS,GAAKhC,EAAK,aAAa,MAAM,GACzD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,SAAU,CACT2E,EAAY,KAAK3C,CAAS,GAAK,CAAChC,EAAK,aAAa,MAAM,GAC1D0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,GAAIyE,EAAY,KAAKzC,CAAS,MAAK,EAAAsD,SAAoBtD,CAAS,EAC9D,GAAIhC,EAAK,UAAYA,EAAK,aAAa,UAAU,EAC/C0B,EAAQ,IAAI1B,CAAI,MACX,CACL,IAAI4C,EAASnB,EACb,KAAOmB,GACDA,EAAO,YAAc,YAGzBA,EAASA,EAAO,WAEdA,GAAUnB,EAAW,YAAc,UACnCmB,EAAO,aAAa,UAAU,GAChClB,EAAQ,IAAI1B,CAAI,CAEpB,CAEF,KACF,CACA,IAAK,UAAW,EACTyE,EAAY,KAAKzC,CAAS,MAAK,EAAAsD,SAAoBtD,CAAS,IAC7D,EAAEhC,EAAK,UAAYA,EAAK,aAAa,UAAU,IACjD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,YAAa,CAChB,OAAQgC,EAAW,CACjB,IAAK,WAAY,EACXhC,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,QAAS,EACP,CAACA,EAAK,MAAQ6E,EAAY,KAAK7E,EAAK,IAAI,GACxC+E,EAAY,KAAK/E,EAAK,IAAI,KAC1BA,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAChD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,WACO,qBAAkBA,CAAI,GACzB0B,EAAQ,IAAI1B,CAAI,CAGtB,CACA,KACF,CACA,IAAK,aAAc,CACjB,OAAQgC,EAAW,CACjB,IAAK,WAAY,CACThC,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,GACjD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,QAAS,EACP,CAACA,EAAK,MAAQ6E,EAAY,KAAK7E,EAAK,IAAI,GACxC+E,EAAY,KAAK/E,EAAK,IAAI,IAC3B,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,IACjD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,WACM,qBAAkBA,CAAI,GACxB0B,EAAQ,IAAI1B,CAAI,CAGtB,CACA,KACF,CACA,IAAK,oBAAqB,CACxB,IAAIuF,EACAvD,IAAc,WAChBuD,EAAavF,EACJgC,IAAc,UACnBhC,EAAK,aAAa,MAAM,EACtB+E,EAAY,KAAK/E,EAAK,aAAa,MAAM,CAAC,IAC5CuF,EAAavF,GAGfuF,EAAavF,GAGbuF,GAAcvF,EAAK,QAAU,IAC7BA,EAAK,aAAa,aAAa,GAC/BA,EAAK,aAAa,aAAa,EAAE,KAAK,EAAE,QAC1C0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,UAAW,EACTA,EAAK,SAAWgC,IAAc,SAC9BhC,EAAK,aAAa,MAAM,GACxB4E,EAAa,KAAK5E,EAAK,aAAa,MAAM,CAAC,GAC3CA,EAAK,UAAYgC,IAAc,WAClCN,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,GAAKA,EAAK,eAAiBgC,IAAc,SACpChC,EAAK,OAAS,YACdgC,IAAc,YAAc,CAAChC,EAAK,aAAa,OAAO,EACzD0B,EAAQ,IAAI1B,CAAI,UACPgC,IAAc,SAAWhC,EAAK,OAAS,SACvC,CAACA,EAAK,aAAa,SAAS,EAAG,CACxC,MAAMwF,EAAWxF,EAAK,KACtB,IAAI4C,EAAS5C,EAAK,WAClB,KAAO4C,GACDA,EAAO,YAAc,QAGzBA,EAASA,EAAO,WAEbA,IACHA,EAAS,KAAK1D,GAAU,iBAE1B,IAAIuG,EACJ,MAAM9E,EAAQiC,EAAO,qBAAqB,OAAO,EAC3CrC,EAAII,EAAM,OAChB,GAAIJ,EACF,QAASC,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMK,EAAOF,EAAMH,CAAC,EACpB,GAAIK,EAAK,aAAa,MAAM,IAAM,UAC5B2E,EACE3E,EAAK,aAAa,MAAM,IAAM2E,IAChCC,EAAU,CAAC,CAAC5E,EAAK,SAETA,EAAK,aAAa,MAAM,IAClC4E,EAAU,CAAC,CAAC5E,EAAK,SAEf4E,GACF,KAGN,CAEGA,GACH/D,EAAQ,IAAI1B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAAW,CACd,MAAM0F,EAAe,qBACfC,EAAgB,qBAEtB,GAAK3D,IAAc,UACd,EAAEhC,EAAK,aAAa,MAAM,GACxB0F,EAAa,KAAK1F,EAAK,aAAa,MAAM,CAAC,IAC7CgC,IAAc,SAAWhC,EAAK,aAAa,MAAM,GACjD2F,EAAc,KAAK3F,EAAK,aAAa,MAAM,CAAC,EAAI,CACnD,IAAI4F,EAAO5F,EAAK,WAChB,KAAO4F,GACDA,EAAK,YAAc,QAGvBA,EAAOA,EAAK,WAEd,GAAIA,EAAM,CACR,MAAM1E,EACJ,KAAKhC,GAAU,iBAAiB0G,EAAM,cAAY,EACpD,IAAI/B,EAAW3C,EAAO,WAAW,EACjC,KAAO2C,GAAU,CACf,MAAM2B,EAAW3B,EAAS,UAC1B,IAAIzB,EAQJ,GAPIoD,IAAa,SACfpD,EAAI,EAAEyB,EAAS,aAAa,MAAM,GAChC6B,EAAa,KAAK7B,EAAS,aAAa,MAAM,CAAC,GACxC2B,IAAa,UACtBpD,EAAIyB,EAAS,aAAa,MAAM,GAC9B8B,EAAc,KAAK9B,EAAS,aAAa,MAAM,CAAC,GAEhDzB,EAAG,CACDyB,IAAa7D,GACf0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA6D,EAAW3C,EAAO,SAAS,CAC7B,CACF,CAEF,SAAWc,IAAc,SAAWhC,EAAK,aAAa,MAAM,GACjD4E,EAAa,KAAK5E,EAAK,aAAa,MAAM,CAAC,IAC1CA,EAAK,SAAWA,EAAK,aAAa,SAAS,GACrD0B,EAAQ,IAAI1B,CAAI,UAEPgC,IAAc,SAAU,CACjC,IAAI6D,EAAa,GACbjD,EAASnB,EACb,KAAOmB,GACDA,EAAO,YAAc,YADZ,CAGN,GAAIA,EAAO,YAAc,SAAU,EACpCA,EAAO,UAAYA,EAAO,aAAa,UAAU,KACnDiD,EAAa,IAEf,KACF,CACAjD,EAASA,EAAO,UAClB,CACA,GAAIiD,GACE7F,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C0B,EAAQ,IAAI1B,CAAI,MAEb,CACL,MAAM8F,EAAa,IAAI,IACjB5E,EACJ,KAAKhC,GAAU,iBAAiBuC,EAAY,cAAY,EAC1D,IAAIL,EAAUF,EAAO,WAAW,EAChC,KAAOE,GAAS,CACd,GAAIA,EAAQ,UAAYA,EAAQ,aAAa,UAAU,EAAG,CACxD0E,EAAW,IAAI1E,CAAO,EACtB,KACF,CACAA,EAAUF,EAAO,YAAY,CAC/B,CACI4E,EAAW,MACTA,EAAW,IAAI9F,CAAI,GACrB0B,EAAQ,IAAI1B,CAAI,CAGtB,CACF,CACA,KACF,CACA,IAAK,QAAS,CACZ,GAAI0E,EAAgB,KAAK1C,CAAS,EAC5BhC,EAAK,cAAc,GACrB0B,EAAQ,IAAI1B,CAAI,UAETgC,IAAc,WAAY,CACnC,IAAIH,EACJ,MAAMX,EAAS,KAAKhC,GAAU,iBAAiBc,EAAM,cAAY,EACjE,IAAIoB,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACD,EAAAsD,EAAgB,KAAKtD,EAAQ,SAAS,IACxCS,EAAOT,EAAQ,cAAc,EACzB,CAACS,KAIPT,EAAUF,EAAO,SAAS,EAExBW,GACFH,EAAQ,IAAI1B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAAW,CACd,GAAI0E,EAAgB,KAAK1C,CAAS,EAC3BhC,EAAK,cAAc,GACtB0B,EAAQ,IAAI1B,CAAI,UAETgC,IAAc,WAAY,CACnC,IAAIH,EACJ,MAAMX,EAAS,KAAKhC,GAAU,iBAAiBc,EAAM,cAAY,EACjE,IAAIoB,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACD,EAAAsD,EAAgB,KAAKtD,EAAQ,SAAS,IACxCS,EAAOT,EAAQ,cAAc,EACzB,CAACS,KAIPT,EAAUF,EAAO,SAAS,EAEvBW,GACHH,EAAQ,IAAI1B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,WAAY,CACXgC,IAAc,SACd,EAAEhC,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CA,EAAK,aAAa,MAAM,GACxB8E,EAAa,KAAK9E,EAAK,aAAa,MAAM,CAAC,GAC3C,EAAEA,EAAK,SAAS,gBACdA,EAAK,SAAS,iBACfA,EAAK,aAAa,KAAK,GAAKA,EAAK,aAAa,KAAK,GACnDA,EAAK,aAAa,MAAM,IAAM,UACjC0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACfgC,IAAc,SACd,EAAEhC,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CA,EAAK,aAAa,MAAM,GACxB8E,EAAa,KAAK9E,EAAK,aAAa,MAAM,CAAC,IAC1CA,EAAK,SAAS,gBAAkBA,EAAK,SAAS,gBACjD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,IAAIuF,EACJ,GAAI,wBAAwB,KAAKvD,CAAS,EACxCuD,EAAavF,UACJgC,IAAc,QACvB,GAAIhC,EAAK,aAAa,MAAM,EAAG,CAC7B,MAAM+F,EAAY/F,EAAK,aAAa,MAAM,GACtC+F,IAAc,QAAUnB,EAAa,KAAKmB,CAAS,GACnDlB,EAAY,KAAKkB,CAAS,GAAKhB,EAAY,KAAKgB,CAAS,KAC3DR,EAAavF,EAEjB,MACEuF,EAAavF,EAGbuF,IACCvF,EAAK,UAAYA,EAAK,aAAa,UAAU,IAChD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,IAAIuF,EACJ,GAAI,wBAAwB,KAAKvD,CAAS,EACxCuD,EAAavF,UACJgC,IAAc,QACvB,GAAIhC,EAAK,aAAa,MAAM,EAAG,CAC7B,MAAM+F,EAAY/F,EAAK,aAAa,MAAM,GACtC+F,IAAc,QAAUnB,EAAa,KAAKmB,CAAS,GACnDlB,EAAY,KAAKkB,CAAS,GAAKhB,EAAY,KAAKgB,CAAS,KAC3DR,EAAavF,EAEjB,MACEuF,EAAavF,EAGbuF,GACA,EAAEvF,EAAK,UAAYA,EAAK,aAAa,UAAU,IACjD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,OAAQ,CACPA,IAAS,KAAKd,GAAU,iBAC1BwC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,QAAS,CACZ,GAAIA,EAAK,cAAc,EAAG,CACxB,IAAI6B,EACJ,MAAMX,EAAS,KAAKhC,GAAU,iBAAiBc,EAAM,UAAQ,EAC7D,IAAIoB,EAAUF,EAAO,WAAW,EAChC,KAAOE,IACLS,EAAOT,EAAQ,WAAa,gBAC1BA,EAAQ,WAAa,YACnB,EAACS,IAGLT,EAAUF,EAAO,YAAY,EAE3BW,GACFH,EAAQ,IAAI1B,CAAI,CAEpB,MACE0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,cAAe,EACbyB,GAAczB,IAASyB,EAAW,mBACnCzB,IAAS,KAAKR,KAChBkC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,aAAc,EACZyB,GAAczB,IAASyB,EAAW,kBACnCzB,IAAS,KAAKR,KAChBkC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,aAAc,EACZyB,GAAczB,IAASyB,EAAW,mBAClCzB,IAASyB,EAAW,kBAAqBzB,IAAS,KAAKR,KAC1DkC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,GAAIyB,EAAY,CACd,KAAM,CAACuE,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,CACL,EAAGhG,CAAI,EACHgG,GACFtE,EAAQ,IAAIsE,CAAK,CAErB,MAAWhG,IAAS,KAAKR,IACvBkC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,GAAIyB,EAAY,CACd,KAAM,CAACuE,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,EACH,QAAS,EACX,EAAGhG,CAAI,EACHgG,GACFtE,EAAQ,IAAIsE,CAAK,CAErB,MAAWhG,IAAS,KAAKR,IACvBkC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,GAAIyB,EAAY,CACd,KAAM,CAACuE,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,CACL,EAAGhG,CAAI,EACP,GAAIgG,IAAUhG,EAAM,CAClB,KAAM,CAACiG,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,EACH,QAAS,EACX,EAAGjG,CAAI,EACHiG,IAAUjG,GACZ0B,EAAQ,IAAI1B,CAAI,CAEpB,CACF,MAAWA,IAAS,KAAKR,IACvBkC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,OACL,IAAK,eAEH,MAGF,IAAK,QACL,IAAK,SACL,IAAK,eACL,IAAK,aAAc,CACjB,GAAIG,EAAM,CACR,MAAMa,EAAM,gCAAgCyB,CAAO,GACnD,MAAM,IAAI,aAAazB,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,IAAK,SACL,IAAK,WACL,IAAK,QACL,IAAK,YACL,IAAK,UACL,IAAK,UACL,IAAK,gBACL,IAAK,aACL,IAAK,SACL,IAAK,QACL,IAAK,QACL,IAAK,QACL,IAAK,OACL,IAAK,SACL,IAAK,qBACL,IAAK,UACL,IAAK,UACL,IAAK,UACL,IAAK,eACL,IAAK,aACL,IAAK,gBACL,IAAK,mBAAoB,CACvB,GAAIb,EAAM,CACR,MAAMa,EAAM,6BAA6ByB,CAAO,GAChD,MAAM,IAAI,aAAazB,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,QACE,GAAIyB,EAAQ,WAAW,UAAU,GAC/B,GAAItC,EAAM,CACR,MAAMa,EAAM,6BAA6ByB,CAAO,GAChD,MAAM,IAAI,aAAazB,EAAK,mBAAiB,CAC/C,UACS,CAACgD,EAAS,CACnB,MAAMhD,EAAM,yBAAyByB,CAAO,GAC5C,MAAM,IAAI,aAAazB,EAAK,YAAU,CACxC,CAEJ,CACF,CACA,OAAOU,CACT,CASA,4BAA4BrB,EAAKL,EAAM,CACrC,KAAM,CAAE,SAAUoE,CAAY,EAAI/D,EAC5BoC,KAAU,oBAAiBpC,EAAI,IAAI,EACzC,IAAIsC,EACJ,GAAI,MAAM,QAAQyB,CAAW,EAAG,CAC9B,KAAM,CAACxD,CAAM,KAAI,WAAQwD,EAAY,CAAC,CAAC,EACjC,CAAC,GAAGtD,CAAM,EAAIF,EACd,CAAE,KAAAsF,CAAK,EAAIlG,EACjB,GAAIyC,IAAY,OAAQ,CACtB,IAAIZ,EACJ,UAAW0B,KAAQzC,EAAQ,CACzB,KAAM,CAAE,KAAM0C,CAAS,EAAID,EAC3B,GAAIC,IAAa,aAAY,CAE3B,MAAMxC,EAAM,uBADA,eAAYX,CAAG,CACQ,GACnC,MAAM,IAAI,aAAaW,EAAK,YAAU,CACxC,CAEA,GADAa,EAAO,KAAK,eAAe0B,EAAM2C,CAAI,EAAE,IAAIA,CAAI,EAC3C,CAACrE,EACH,KAEJ,CACIA,IACFc,EAAM3C,EAEV,SAAWyC,IAAY,eAAgB,CACrC,IAAIZ,EACAe,EAASsD,EACb,KAAOtD,GAAQ,CACb,UAAWW,KAAQzC,EAAQ,CACzB,KAAM,CAAE,KAAM0C,CAAS,EAAID,EAC3B,GAAIC,IAAa,aAAY,CAE3B,MAAMxC,EAAM,uBADA,eAAYX,CAAG,CACQ,GACnC,MAAM,IAAI,aAAaW,EAAK,YAAU,CACxC,CAEA,GADAa,EAAO,KAAK,eAAe0B,EAAMX,CAAM,EAAE,IAAIA,CAAM,EAC/C,CAACf,EACH,KAEJ,CACA,GAAIA,EACF,MAEAe,EAASA,EAAO,UAEpB,CACIf,IACFc,EAAM3C,EAEV,CACF,SAAWyC,IAAY,OACrBE,EAAM3C,MACD,CACL,MAAMgB,EAAM,qBAAqByB,CAAO,GACxC,MAAM,IAAI,aAAazB,EAAK,YAAU,CACxC,CACA,OAAO2B,GAAO,IAChB,CAUA,eAAetC,EAAKL,EAAMC,EAAK,CAC7B,KAAM,CAAE,KAAMkG,CAAQ,EAAI9F,EACpBoC,KAAU,oBAAiBpC,EAAI,IAAI,EACzC,IAAIqB,EAAU,IAAI,IAClB,GAAI1B,EAAK,WAAa,eACpB,OAAQmG,EAAS,CACf,KAAK,wBAAuB,CAC1B,MAAM/F,EAAQ,KAAK,0BAA0BC,EAAKL,EAAMC,CAAG,EACvDG,EAAM,OACRsB,EAAUtB,GAEZ,KACF,CACA,KAAK,0BAAyB,IAC5B,8BAA2BqC,EAASxC,CAAG,EACvC,KACF,CACA,QAAS,CACP,MAAM0C,KAAM,iBAActC,EAAKL,EAAMC,CAAG,EACpC0C,GACFjB,EAAQ,IAAIiB,CAAG,CAEnB,CACF,SACS,KAAKlD,IAAW0G,IAAY,yBAC5BnG,EAAK,WAAa,0BAC3B,GAAIyC,IAAY,OAAS,qBAAmB,KAAKA,CAAO,EAAG,CACzD,MAAMrC,EAAQ,KAAK,0BAA0BC,EAAKL,EAAMC,CAAG,EACvDG,EAAM,OACRsB,EAAUtB,EAEd,SAAW,kBAAgB,KAAKqC,CAAO,EAAG,CACxC,MAAME,EAAM,KAAK,4BAA4BtC,EAAKL,EAAMC,CAAG,EACvD0C,GACFjB,EAAQ,IAAIiB,CAAG,CAEnB,EAEF,OAAOjB,CACT,CAUA,aAAaZ,EAAQd,EAAMC,EAAK,CAC9B,IAAI4B,EACJ,GAAI,KAAKtC,GAAS,IAAIuB,CAAM,EAAG,CAC7B,MAAMsF,EAAS,KAAK7G,GAAS,IAAIuB,CAAM,EACvC,GAAIsF,EAAO,IAAIpG,CAAI,EACjB6B,EAAOuE,EAAO,IAAIpG,CAAI,MACjB,CACL,UAAWuD,KAAQzC,EAEjB,GADAe,EAAO,KAAK,eAAe0B,EAAMvD,EAAMC,CAAG,EAAE,IAAID,CAAI,EAChD,CAAC6B,EACH,MAGJuE,EAAO,IAAIpG,EAAM6B,CAAI,EACrB,KAAKtC,GAAS,IAAIuB,EAAQsF,CAAM,CAClC,CACF,KAAO,CACL,UAAW7C,KAAQzC,EAEjB,GADAe,EAAO,KAAK,eAAe0B,EAAMvD,EAAMC,CAAG,EAAE,IAAID,CAAI,EAChD,CAAC6B,EACH,MAGJ,MAAMuE,EAAS,IAAI,QACnBA,EAAO,IAAIpG,EAAM6B,CAAI,EACrB,KAAKtC,GAAS,IAAIuB,EAAQsF,CAAM,CAClC,CACA,MAAO,CAAC,CAACvE,CACX,CASA,qBAAqBlB,EAAOV,EAAM,CAAC,EAAG,CACpC,KAAM,CAAE,SAAAoG,EAAU,aAAAC,CAAa,EAAIrG,EACnC,IAAIG,EAAQ,IAAI,IAChB,MAAMG,EAAII,EAAM,OAChB,GAAIJ,EACF,GAAI8F,EACF,QAAS7F,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMK,EAAOF,EAAMH,CAAC,EACP,KAAK,aAAa8F,EAAczF,EAAMZ,CAAG,GAEpDG,EAAM,IAAIS,CAAI,CAElB,KACK,CACL,MAAMsD,EAAM,CAAC,EAAE,MAAM,KAAKxD,CAAK,EAC/BP,EAAQ,IAAI,IAAI+D,CAAG,CACrB,CAEF,OAAO/D,CACT,CAUA,qBAAqBU,EAAQyF,EAAUtG,EAAK,CAC1C,KAAM,CAACsD,EAAM,GAAG+C,CAAY,EAAIxF,EAC1B,CAAE,KAAM0C,CAAS,EAAID,EACrBiD,KAAW,oBAAiBjD,EAAK,IAAI,EACrC8C,EAAWC,EAAa,OAAS,EACvC,IAAIlG,EAAQ,IAAI,IACZqG,EAAU,GACd,GAAI,KAAKhH,GACPgH,EAAU,OAEV,QAAQjD,EAAU,CAChB,KAAK,0BAAyB,IAC5B,8BAA2BgD,EAAUvG,CAAG,EACxC,KACF,CACA,KAAK,cAAa,CAChB,GAAI,KAAKT,GAAM,WAAa,eAC1BiH,EAAU,OACL,CACL,MAAMzG,EAAO,KAAKR,GAAM,eAAegH,CAAQ,EAC3CxG,GAAQA,IAASuG,GAAYA,EAAS,SAASvG,CAAI,IACjDqG,EACW,KAAK,aAAaC,EAActG,EAAMC,CAAG,GAEpDG,EAAM,IAAIJ,CAAI,EAGhBI,EAAM,IAAIJ,CAAI,EAGpB,CACA,KACF,CACA,KAAK,iBAAgB,CACnB,MAAMW,EAAQ4F,EAAS,uBAAuBC,CAAQ,EACtDpG,EAAQ,KAAK,qBAAqBO,EAAO,CACvC,SAAA0F,EACA,aAAAC,CACF,CAAC,EACD,KACF,CACA,KAAK,gBAAe,CAClB,GAAI,KAAKpH,GAAU,cAAgB,aAC/B,CAAC,OAAO,KAAKsH,CAAQ,EAAG,CAC1B,MAAM7F,EAAQ4F,EAAS,qBAAqBC,CAAQ,EACpDpG,EAAQ,KAAK,qBAAqBO,EAAO,CACvC,SAAA0F,EACA,aAAAC,CACF,CAAC,CACH,MACEG,EAAU,GAEZ,KACF,CACA,QACEA,EAAU,EAEd,CAEF,MAAO,CACL,MAAArG,EACA,QAAAqG,CACF,CACF,CAUA,iBAAiB7C,EAAM5D,EAAMC,EAAM,CAAC,EAAG,CACrC,KAAM,CAAE,MAAAwD,EAAO,OAAA3C,CAAO,EAAI8C,EACpB,CAAE,KAAM8C,CAAU,EAAIjD,EACtB,CAAE,IAAAf,CAAI,EAAIzC,EAChB,IAAIyB,EAAU,IAAI,IAClB,GAAIgB,IAAQjE,EACV,OAAQiI,EAAW,CACjB,IAAK,IAAK,CACR,MAAMtF,EAAUpB,EAAK,mBACjBoB,GACW,KAAK,aAAaN,EAAQM,EAASnB,CAAG,GAEjDyB,EAAQ,IAAIN,CAAO,EAGvB,KACF,CACA,IAAK,IAAK,CACR,KAAM,CAAE,WAAAK,CAAW,EAAIzB,EACvB,GAAIyB,EAAY,CACd,MAAMP,EACJ,KAAKhC,GAAU,iBAAiBuC,EAAY,cAAY,EAC1D,IAAIL,EAAU,KAAK,UAAUpB,EAAMkB,CAAM,EAIzC,IAHIE,IAAYpB,IACdoB,EAAUF,EAAO,YAAY,GAExBE,GACQ,KAAK,aAAaN,EAAQM,EAASnB,CAAG,GAEjDyB,EAAQ,IAAIN,CAAO,EAErBA,EAAUF,EAAO,YAAY,CAEjC,CACA,KACF,CACA,IAAK,IAAK,CACR,MAAMA,EAAS,KAAKhC,GAAU,iBAAiBc,EAAM,cAAY,EACjE,IAAIoB,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACQ,KAAK,aAAaN,EAAQM,EAASnB,CAAG,GAEjDyB,EAAQ,IAAIN,CAAO,EAErBA,EAAUF,EAAO,YAAY,EAE/B,KACF,CACA,IAAK,IACL,QAAS,CACP,KAAM,CAAE,MAAAd,EAAO,QAAAqG,CAAQ,EAAI,KAAK,qBAAqB3F,EAAQd,CAAI,EACjE,GAAII,EAAM,KACRsB,EAAUtB,UACDqG,EAAS,CAClB,MAAMvF,EAAS,KAAKhC,GAAU,iBAAiBc,EAAM,cAAY,EACjE,IAAIoB,EAAUF,EAAO,SAAS,EAC9B,KAAOE,GACQ,KAAK,aAAaN,EAAQM,EAASnB,CAAG,GAEjDyB,EAAQ,IAAIN,CAAO,EAErBA,EAAUF,EAAO,SAAS,CAE9B,CACF,CACF,KAEA,QAAQwF,EAAW,CACjB,IAAK,IAAK,CACR,MAAMtF,EAAUpB,EAAK,uBACjBoB,GACW,KAAK,aAAaN,EAAQM,EAASnB,CAAG,GAEjDyB,EAAQ,IAAIN,CAAO,EAGvB,KACF,CACA,IAAK,IAAK,CACR,MAAMF,EACJ,KAAKhC,GAAU,iBAAiBc,EAAK,WAAY,cAAY,EAC/D,IAAIoB,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACDA,IAAYpB,GAGD,KAAK,aAAac,EAAQM,EAASnB,CAAG,GAEjDyB,EAAQ,IAAIN,CAAO,EAGvBA,EAAUF,EAAO,YAAY,EAE/B,KACF,CACA,IAAK,IAAK,CACR,MAAME,EAAUpB,EAAK,WACjBoB,GACW,KAAK,aAAaN,EAAQM,EAASnB,CAAG,GAEjDyB,EAAQ,IAAIN,CAAO,EAGvB,KACF,CACA,IAAK,IACL,QAAS,CACP,MAAM+C,EAAM,CAAC,EACb,IAAI/C,EAAUpB,EAAK,WACnB,KAAOoB,GACQ,KAAK,aAAaN,EAAQM,EAASnB,CAAG,GAEjDkE,EAAI,KAAK/C,CAAO,EAElBA,EAAUA,EAAQ,WAEhB+C,EAAI,SACNzC,EAAU,IAAI,IAAIyC,EAAI,QAAQ,CAAC,EAEnC,CACF,CAEF,OAAOzC,CACT,CAUA,UAAUZ,EAAQb,EAAM,CAAC,EAAG,CAC1B,KAAM,CAAE,KAAAD,CAAK,EAAIC,EACjB,IAAI0G,EACAvF,EAAU,KAAK,UAAUpB,EAAM,KAAKb,EAAO,EAC/C,GAAIiC,EAQF,IAPIA,EAAQ,WAAa,eACvBA,EAAU,KAAKjC,GAAQ,SAAS,EACvBiC,IAAYpB,GACjBoB,IAAY,KAAK5B,KACnB4B,EAAU,KAAKjC,GAAQ,SAAS,GAG7BiC,GAAS,CACd,IAAIS,EAUJ,GATI,KAAKzC,GAAM,WAAa,eACtBgC,IAAY,KAAKhC,GACnByC,EAAO,GAEPA,EAAO,KAAKzC,GAAM,SAASgC,CAAO,EAGpCS,EAAO,GAELA,GACc,KAAK,aAAaf,EAAQM,EAAS,CACjD,KAAM,KAAKxB,EACb,CAAC,EACY,CACX+G,EAAcvF,EACd,KACF,CAEFA,EAAU,KAAKjC,GAAQ,SAAS,CAClC,CAEF,OAAOwH,GAAe,IACxB,CAQA,WAAW7F,EAAQ,CACjB,MAAMV,EAAQ,CAAC,EACf,IAAIwG,EAAW,GAEf,OADa,KAAK,aAAa9F,EAAQ,KAAK1B,EAAK,IAE/CgB,EAAM,KAAK,KAAKhB,EAAK,EACrBwH,EAAW,IAEN,CAACxG,EAAOwG,CAAQ,CACzB,CASA,YAAYrD,EAAMtD,EAAM,CAAC,EAAG,CAC1B,KAAM,CAAE,QAAA4G,EAAS,SAAAR,EAAU,aAAAC,CAAa,EAAIrG,EACtCG,EAAQ,CAAC,EACf,IAAIwG,EAAW,GACX/E,EAAO,KAAK,aAAa,CAAC0B,CAAI,EAAG,KAAKnE,EAAK,EAa/C,GAZIyC,GAAQ,CAACgF,IACPR,GACFxE,EAAO,KAAK,aAAayE,EAAc,KAAKlH,EAAK,EAC7CyC,IACFzB,EAAM,KAAK,KAAKhB,EAAK,EACrBwH,EAAW,MAGbxG,EAAM,KAAK,KAAKhB,EAAK,EACrBwH,EAAW,KAGX,CAAC/E,GAAQgF,EAAS,CAChBhF,IACFzB,EAAM,KAAK,KAAKhB,EAAK,EAChBiH,IACHO,EAAW,KAGf,IAAIxF,EAAU,KAAKhC,GAAM,WACzB,KAAOgC,IACLS,EAAO,KAAK,aAAa,CAAC0B,CAAI,EAAGnC,CAAO,EACpCS,IACFzB,EAAM,KAAKgB,CAAO,EACbiF,IACHO,EAAW,KAGXxF,EAAQ,aACVA,EAAUA,EAAQ,UAKxB,CACA,MAAO,CAAChB,EAAOwG,CAAQ,CACzB,CAQA,WAAW9F,EAAQ,CACjB,MAAMV,EAAQ,CAAC,EACf,IAAIwG,EAAW,GACf,MAAM5G,EAAO,KAAK,UAAUc,EAAQ,CAClC,KAAM,KAAK1B,EACb,CAAC,EACD,OAAIY,IACFI,EAAM,KAAKJ,CAAI,EACf4G,EAAW,IAEN,CAACxG,EAAOwG,CAAQ,CACzB,CAWA,wBAAwBjG,EAAOV,EAAM,CAAC,EAAG,CACvC,KAAM,CAAE,SAAAoG,EAAU,aAAAC,CAAa,EAAIrG,EACnC,IAAIG,EAAQ,CAAC,EACTwG,EAAW,GACf,MAAMrG,EAAII,EAAM,OAChB,GAAIJ,EACF,GAAI,KAAKnB,GAAM,WAAa,eAC1B,QAASoB,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMR,EAAOW,EAAMH,CAAC,GAChBR,IAAS,KAAKZ,OAAS,eAAYY,EAAM,KAAKZ,EAAK,KACjDiH,EACW,KAAK,aAAaC,EAActG,EAAM,CACjD,KAAM,KAAKJ,EACb,CAAC,IAECQ,EAAM,KAAKJ,CAAI,EACf4G,EAAW,KAGbxG,EAAM,KAAKJ,CAAI,EACf4G,EAAW,IAGjB,SACSP,EACT,QAAS7F,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMR,EAAOW,EAAMH,CAAC,EACP,KAAK,aAAa8F,EAActG,EAAM,CACjD,KAAM,KAAKJ,EACb,CAAC,IAECQ,EAAM,KAAKJ,CAAI,EACf4G,EAAW,GAEf,MAEAxG,EAAQ,CAAC,EAAE,MAAM,KAAKO,CAAK,EAC3BiG,EAAW,GAGf,MAAO,CAACxG,EAAOwG,CAAQ,CACzB,CAUA,gBAAgBhD,EAAMkD,EAAYD,EAAS,CACzC,KAAM,CAAE,OAAA/F,CAAO,EAAI8C,EACb,CAACL,EAAM,GAAG+C,CAAY,EAAIxF,EAC1B,CAAE,KAAM0C,CAAS,EAAID,EACrBiD,KAAW,oBAAiBjD,EAAK,IAAI,EACrC8C,EAAWC,EAAa,OAAS,EACvC,IAAIlG,EAAQ,CAAC,EACTwG,EAAW,GACXH,EAAU,GACd,OAAQjD,EAAU,CAChB,KAAK,0BAAyB,IAC5B,8BAA2BgD,EAAU,CACnC,KAAM,KAAK5G,EACb,CAAC,EACD,KACF,CACA,KAAK,cAAa,CAChB,GAAIkH,IAAehI,EACjB,CAACsB,EAAOwG,CAAQ,EAAI,KAAK,WAAW9F,CAAM,UACjCgG,IAAejI,EACxB,CAACuB,EAAOwG,CAAQ,EAAI,KAAK,YAAYrD,EAAM,CACzC,QAAAsD,EACA,SAAAR,EACA,aAAAC,CACF,CAAC,UACQQ,IAAelI,GACf,KAAKY,GAAM,WAAa,eAAc,CAC/C,MAAMQ,EAAO,KAAKR,GAAM,eAAegH,CAAQ,EAC3CxG,IACEqG,EACW,KAAK,aAAaC,EAActG,EAAM,CACjD,KAAM,KAAKJ,EACb,CAAC,IAECQ,EAAM,KAAKJ,CAAI,EACf4G,EAAW,KAGbxG,EAAM,KAAKJ,CAAI,EACf4G,EAAW,IAGjB,MACEH,EAAU,GAEZ,KACF,CACA,KAAK,iBAAgB,CACnB,GAAIK,IAAehI,EACjB,CAACsB,EAAOwG,CAAQ,EAAI,KAAK,WAAW9F,CAAM,UACjCgG,IAAejI,EACxB,CAACuB,EAAOwG,CAAQ,EAAI,KAAK,YAAYrD,EAAM,CACzC,QAAAsD,EACA,SAAAR,EACA,aAAAC,CACF,CAAC,UACQQ,IAAelI,EACxB,CAACwB,EAAOwG,CAAQ,EAAI,KAAK,WAAW9F,CAAM,UACjC,KAAKtB,GAAM,WAAa,gBAAe,CAChD,MAAMmB,EAAQ,KAAKnB,GAAM,uBAAuBgH,CAAQ,EACxD,CAACpG,EAAOwG,CAAQ,EAAI,KAAK,wBAAwBjG,EAAO,CACtD,SAAA0F,EACA,aAAAC,CACF,CAAC,CACH,MACEG,EAAU,GAEZ,KACF,CACA,KAAK,gBAAe,CAClB,GAAIK,IAAehI,EACjB,CAACsB,EAAOwG,CAAQ,EAAI,KAAK,WAAW9F,CAAM,UACjCgG,IAAejI,EACxB,CAACuB,EAAOwG,CAAQ,EAAI,KAAK,YAAYrD,EAAM,CACzC,QAAAsD,EACA,SAAAR,EACA,aAAAC,CACF,CAAC,UACQ,KAAKpH,GAAU,cAAgB,aAC/B,KAAKM,GAAM,WAAa,iBACxB,CAAC,OAAO,KAAKgH,CAAQ,EAAG,CACjC,MAAM7F,EAAQ,KAAKnB,GAAM,qBAAqBgH,CAAQ,EACtD,CAACpG,EAAOwG,CAAQ,EAAI,KAAK,wBAAwBjG,EAAO,CACtD,SAAA0F,EACA,aAAAC,CACF,CAAC,CACH,MACEG,EAAU,GAEZ,KACF,CACA,QACE,GAAIK,IAAejI,GAAiB,kBAAgB,KAAK2H,CAAQ,GAC/D,GAAI,KAAK/G,IACL,KAAKL,GAAM,WAAa,yBAAwB,CAClD,MAAMY,EAAO,KAAK,4BAA4BuD,EAAM,KAAKnE,EAAK,EAC1DY,IACFI,EAAM,KAAKJ,CAAI,EACf4G,EAAW,GAEf,OACSE,IAAehI,EACxB,CAACsB,EAAOwG,CAAQ,EAAI,KAAK,WAAW9F,CAAM,EACjCgG,IAAejI,EACxB,CAACuB,EAAOwG,CAAQ,EAAI,KAAK,YAAYrD,EAAM,CACzC,QAAAsD,EACA,SAAAR,EACA,aAAAC,CACF,CAAC,EACQQ,IAAelI,EACxB,CAACwB,EAAOwG,CAAQ,EAAI,KAAK,WAAW9F,CAAM,EAE1C2F,EAAU,EAGhB,CACA,MAAO,CACL,SAAAJ,EACA,SAAAO,EACA,MAAAxG,EACA,QAAAqG,CACF,CACF,CASA,cAAc7F,EAAQkG,EAAY,CAChC,MAAMC,EAAYnG,EAAO,OACnBiG,EAAUE,EAAY,EACtBC,EAAYpG,EAAO,CAAC,EAC1B,IAAI8B,EACAkB,EACJ,GAAIiD,EAAS,CACX,KAAM,CACJ,MAAOI,EACP,OAAQ,CAAC,CACP,KAAMC,EACN,KAAMC,CACR,CAAC,CACH,EAAIH,EACEI,EAAWxG,EAAOmG,EAAY,CAAC,EAC/B,CACJ,OAAQ,CAAC,CACP,KAAMM,EACN,KAAMC,CACR,CAAC,CACH,EAAIF,EACJ,GAAIE,IAAa,2BAA2BA,IAAa,cACvD5E,EAAMhE,EACNkF,EAAOwD,UACED,IAAc,2BACdA,IAAc,cACvBzE,EAAMjE,EACNmF,EAAOoD,UACEF,IAAenI,EACxB,GAAIuI,IAAc,KAAOC,IAAc,gBACrCzE,EAAMhE,EACNkF,EAAOwD,UACEC,IAAa,KAAOC,IAAa,gBAC1C5E,EAAMjE,EACNmF,EAAOoD,UACED,IAAc,EAAG,CAC1B,KAAM,CAAE,KAAML,CAAU,EAAIO,EACxB,SAAS,KAAKP,CAAS,GACzBhE,EAAMhE,EACNkF,EAAOwD,IAEP1E,EAAMjE,EACNmF,EAAOoD,EAEX,MACEtE,EAAMjE,EACNmF,EAAOoD,UAEAK,IAAa,KAAOC,IAAa,gBAC1C5E,EAAMjE,EACNmF,EAAOoD,UACEE,IAAc,KAAOC,IAAc,gBAC5CzE,EAAMhE,EACNkF,EAAOwD,MACF,CACL,IAAIvF,EACA0F,EACJ,SAAW,CAAE,MAAA9D,EAAO,OAAQ,CAACF,CAAI,CAAE,IAAK3C,EAAQ,CAC9C,KAAM,CAAE,KAAM4C,CAAS,EAAID,EACrBiD,KAAW,oBAAiBjD,EAAK,IAAI,EAC3C,GAAIC,IAAa,yBAAyBgD,IAAa,MAAO,CAC5D3E,EAAO,GACP,KACF,CACA,GAAI4B,GAAS,CAAC8D,EAAS,CACrB,KAAM,CAAE,KAAMb,CAAU,EAAIjD,EACxB,SAAS,KAAKiD,CAAS,IACzB7E,EAAO,GACP0F,EAAU,GAEd,CACF,CACI1F,GACFa,EAAMjE,EACNmF,EAAOoD,IAEPtE,EAAMhE,EACNkF,EAAOwD,EAEX,CACF,MACE1E,EAAMhE,EACNkF,EAAOoD,EAET,MAAO,CACL,QAAAH,EACA,IAAAnE,EACA,KAAAkB,CACF,CACF,CAQA,cAAckD,EAAY,CACxB,MAAMzG,EAAM,KAAKrB,GAAK,OAAO,EAC7B,GAAI8H,IAAenI,GAAcmI,IAAelI,EAAc,CAC5D,MAAM4I,EAAe,IAAI,IACzB,IAAI,EAAI,EACR,SAAW,CAAE,OAAA5G,CAAO,IAAKP,EAAK,CAC5B,KAAM,CAAE,QAAAwG,EAAS,IAAAnE,EAAK,KAAAkB,CAAK,EAAI,KAAK,cAAchD,EAAQkG,CAAU,EAC9D,CACJ,SAAAT,EAAU,SAAAO,EAAU,MAAAxG,EAAO,QAAAqG,CAC7B,EAAI,KAAK,gBAAgB7C,EAAMkD,EAAYD,CAAO,EAC9CzG,EAAM,QACR,KAAKpB,GAAK,CAAC,EAAE,KAAO,GACpB,KAAKK,GAAO,CAAC,EAAIe,GACRqG,GACTe,EAAa,IAAI,IAAI,IAAI,CACvB,CAAC,QAAS,CAAC,EACX,CAAC,OAAQ5D,CAAI,CACf,CAAC,CAAC,EAEJ,KAAK5E,GAAK,CAAC,EAAE,IAAM0D,EACnB,KAAK1D,GAAK,CAAC,EAAE,SAAW4H,GAAY,CAACP,EACrC,GACF,CACA,GAAImB,EAAa,KAAM,CACrB,IAAIxH,EACAkB,EACA,KAAK9B,KAAU,KAAKI,IAAS,KAAKJ,GAAM,WAAa,gBACvDY,EAAO,KAAKZ,GACZ8B,EAAS,KAAK/B,KAEda,EAAO,KAAKR,GACZ0B,EAAS,KAAKvB,IAEhB,IAAIkE,EAAW,KAAK,UAAU7D,EAAMkB,CAAM,EAC1C,KAAO2C,GAAU,CACf,IAAIhC,EAAO,GAUX,GATI,KAAKzC,GAAM,WAAa,eACtByE,IAAa,KAAKzE,GACpByC,EAAO,GAEPA,EAAO,KAAKzC,GAAM,SAASyE,CAAQ,EAGrChC,EAAO,GAELA,EACF,UAAW4F,KAAeD,EAAc,CACtC,KAAM,CAAE,OAAA1G,CAAO,EAAI2G,EAAY,IAAI,MAAM,EAIzC,GAHgB,KAAK,aAAa3G,EAAQ+C,EAAU,CAClD,KAAM,KAAKjE,EACb,CAAC,EACY,CACX,MAAM8H,EAAQD,EAAY,IAAI,OAAO,EACrC,KAAKzI,GAAK0I,CAAK,EAAE,SAAW,GAC5B,KAAK1I,GAAK0I,CAAK,EAAE,KAAO,GACxB,KAAKrI,GAAOqI,CAAK,EAAE,KAAK7D,CAAQ,CAClC,CACF,CAEFA,EAAW3C,EAAO,SAAS,CAC7B,CACF,CACF,KAAO,CACL,IAAIV,EAAI,EACR,SAAW,CAAE,OAAAI,CAAO,IAAKP,EAAK,CAC5B,MAAMuD,EAAOhD,EAAOA,EAAO,OAAS,CAAC,EAC/BiG,EAAUjG,EAAO,OAAS,EAC1B,CACJ,SAAAyF,EAAU,SAAAO,EAAU,MAAAxG,CACtB,EAAI,KAAK,gBAAgBwD,EAAMkD,EAAYD,CAAO,EAC9CzG,EAAM,SACR,KAAKpB,GAAKwB,CAAC,EAAE,KAAO,GACpB,KAAKnB,GAAOmB,CAAC,EAAIJ,GAEnB,KAAKpB,GAAKwB,CAAC,EAAE,IAAM9B,EACnB,KAAKM,GAAKwB,CAAC,EAAE,SAAWoG,GAAY,CAACP,EACrC7F,GACF,CACF,CACA,MAAO,CACL,KAAKxB,GACL,KAAKK,EACP,CACF,CAQA,YAAYyH,EAAY,CACtB,KAAM,CAAC,GAAGpG,CAAQ,EAAI,KAAK1B,GACrBuB,EAAIG,EAAS,OACnB,IAAIN,EAAQ,IAAI,IAChB,QAASI,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,KAAM,CAAE,OAAAI,EAAQ,IAAA8B,EAAK,SAAAkE,EAAU,KAAAe,CAAK,EAAIjH,EAASF,CAAC,EAC5CuG,EAAYnG,EAAO,OACzB,GAAImG,GAAaY,EAAM,CACrB,MAAMC,EAAa,KAAKvI,GAAOmB,CAAC,EAC1BqH,EAAgBD,EAAW,OAC3B3D,EAAY8C,EAAY,EAC9B,GAAI9C,IAAc,EAAG,CACnB,KAAM,CAAE,OAAQ,CAAC,CAAE,GAAGqC,CAAY,CAAE,EAAI1F,EAAO,CAAC,EAChD,IAAKkG,IAAenI,GAAcmI,IAAelI,IAC7C,KAAKQ,GAAM,WAAa,eAC1B,QAAS2C,EAAI,EAAGA,EAAI8F,EAAe9F,IAAK,CACtC,MAAM/B,EAAO4H,EAAW7F,CAAC,EACzB,GAAI/B,IAAS,KAAKZ,IAAS,KAAKA,GAAM,SAASY,CAAI,IACjDI,EAAM,IAAIJ,CAAI,EACV8G,IAAenI,GACjB,KAGN,SACS2H,EAAa,OACtB,QAASvE,EAAI,EAAGA,EAAI8F,EAAe9F,IAAK,CACtC,MAAM/B,EAAO4H,EAAW7F,CAAC,EAIzB,IAHa6E,GAAY,KAAK,aAAaN,EAActG,EAAM,CAC7D,KAAM,KAAKJ,EACb,CAAC,KAECQ,EAAM,IAAIJ,CAAI,EACV8G,IAAenI,GACjB,KAGN,SACSmI,IAAenI,EACxB,GAAIyB,EAAM,KAAM,CACd,MAAM0H,EAAI,CAAC,GAAG1H,CAAK,EACnBA,EAAQ,IAAI,IAAI,CAAC,GAAG0H,EAAG,GAAGF,CAAU,CAAC,EACrC,KAAKlI,GAAQ,EACf,MACEU,EAAQ,IAAI,IAAI,CAAC,GAAGwH,CAAU,CAAC,MAE5B,CACL,KAAM,CAAC5H,CAAI,EAAI,CAAC,GAAG4H,CAAU,EAC7BxH,EAAM,IAAIJ,CAAI,CAChB,CACF,SAAW0C,IAAQjE,EAAU,CAC3B,GAAI,CAAE,MAAAgF,EAAO,OAAQsE,CAAY,EAAInH,EAAO,CAAC,EACzCc,EACJ,QAASK,EAAI,EAAGA,EAAI8F,EAAe9F,IAAK,CACtC,MAAM/B,EAAO4H,EAAW7F,CAAC,EACzB,IAAImC,EAAY,IAAI,IAAI,CAAClE,CAAI,CAAC,EAC9B,QAAS+B,EAAI,EAAGA,EAAIgF,EAAWhF,IAAK,CAClC,KAAM,CAAE,MAAOiG,EAAW,OAAAlH,CAAO,EAAIF,EAAOmB,CAAC,EACvCoC,EAAM,CAAC,EACb,UAAWN,KAAYK,EAAW,CAChC,MAAMN,EAAO,CACX,MAAAH,EACA,OAAA3C,CACF,EACMsB,EAAI,KAAK,iBAAiBwB,EAAMC,EAAU,CAC9C,IAAAnB,EACA,KAAM,KAAK9C,EACb,CAAC,EACGwC,EAAE,MACJ+B,EAAI,KAAK,GAAG/B,CAAC,CAEjB,CACA,GAAI+B,EAAI,OACN,GAAIpC,IAAMkC,EAAW,CACnB,GAAI6C,IAAenI,EAAY,CAC7B,GAAIyB,EAAM,KAAM,CACd,MAAM0H,EAAI,CAAC,GAAG1H,CAAK,EACnBA,EAAQ,IAAI,IAAI,CAAC,GAAG0H,EAAG,GAAG3D,CAAG,CAAC,CAChC,MACE/D,EAAQ,IAAI,IAAI,CAAC,GAAG+D,CAAG,CAAC,EAE1B,KAAKzE,GAAQ,EACf,KAAO,CACL,KAAM,CAACM,CAAI,KAAI,aAAUmE,CAAG,EAC5B/D,EAAM,IAAIJ,CAAI,CAChB,CACA0B,EAAU,EACZ,MACE+B,EAAQuE,EACR9D,EAAY,IAAI,IAAIC,CAAG,EACvBzC,EAAU,OAEP,CACLA,EAAU,GACV,KACF,CACF,CACA,GAAIA,GAAWoF,IAAenI,EAC5B,KAEJ,CACA,GAAI,CAAC+C,GAAWoF,IAAelI,EAAc,CAC3C,KAAM,CAACqJ,CAAS,EAAI,CAAC,GAAGL,CAAU,EAClC,IAAIxG,EAAU,KAAK,UAAU2G,EAAa,CACxC,KAAME,CACR,CAAC,EACD,KAAO7G,GAAS,CACd,IAAI8C,EAAY,IAAI,IAAI,CAAC9C,CAAO,CAAC,EACjC,QAASW,EAAI,EAAGA,EAAIgF,EAAWhF,IAAK,CAClC,KAAM,CAAE,MAAOiG,EAAW,OAAAlH,CAAO,EAAIF,EAAOmB,CAAC,EACvCoC,EAAM,CAAC,EACb,UAAWN,KAAYK,EAAW,CAChC,MAAMN,EAAO,CACX,MAAAH,EACA,OAAA3C,CACF,EACMsB,EAAI,KAAK,iBAAiBwB,EAAMC,EAAU,CAC9C,IAAAnB,EACA,KAAM,KAAK9C,EACb,CAAC,EACGwC,EAAE,MACJ+B,EAAI,KAAK,GAAG/B,CAAC,CAEjB,CACA,GAAI+B,EAAI,OACN,GAAIpC,IAAMkC,EAAW,CACnB,KAAM,CAACjE,CAAI,KAAI,aAAUmE,CAAG,EAC5B/D,EAAM,IAAIJ,CAAI,EACd0B,EAAU,EACZ,MACE+B,EAAQuE,EACR9D,EAAY,IAAI,IAAIC,CAAG,EACvBzC,EAAU,OAEP,CACLA,EAAU,GACV,KACF,CACF,CACA,GAAIA,EACF,MAEFN,EAAU,KAAK,UAAU2G,EAAa,CACpC,KAAM3G,CACR,CAAC,EACD8C,EAAY,IAAI,IAAI,CAAC9C,CAAO,CAAC,CAC/B,CACF,CACF,KAAO,CACL,KAAM,CAAE,OAAQ2G,CAAY,EAAInH,EAAOqD,CAAS,EAChD,IAAIvC,EACJ,QAASK,EAAI,EAAGA,EAAI8F,EAAe9F,IAAK,CACtC,MAAM/B,EAAO4H,EAAW7F,CAAC,EACzB,IAAImC,EAAY,IAAI,IAAI,CAAClE,CAAI,CAAC,EAC9B,QAAS+B,EAAIkC,EAAY,EAAGlC,GAAK,EAAGA,IAAK,CACvC,MAAM6B,EAAOhD,EAAOmB,CAAC,EACfoC,EAAM,CAAC,EACb,UAAWN,KAAYK,EAAW,CAChC,MAAM9B,EAAI,KAAK,iBAAiBwB,EAAMC,EAAU,CAC9C,IAAAnB,EACA,KAAM,KAAK9C,EACb,CAAC,EACGwC,EAAE,MACJ+B,EAAI,KAAK,GAAG/B,CAAC,CAEjB,CACA,GAAI+B,EAAI,OACFpC,IAAM,GACR3B,EAAM,IAAIJ,CAAI,EACd0B,EAAU,GACNoF,IAAenI,GACfoI,EAAY,GAAK3G,EAAM,KAAO,IAChC,KAAKV,GAAQ,MAGfwE,EAAY,IAAI,IAAIC,CAAG,EACvBzC,EAAU,QAEP,CACLA,EAAU,GACV,KACF,CACF,CACA,GAAIA,GAAWoF,IAAenI,EAC5B,KAEJ,CACA,GAAI,CAAC+C,GAAWoF,IAAelI,EAAc,CAC3C,KAAM,CAACqJ,CAAS,EAAI,CAAC,GAAGL,CAAU,EAClC,IAAIxG,EAAU,KAAK,UAAU2G,EAAa,CACxC,KAAME,CACR,CAAC,EACD,KAAO7G,GAAS,CACd,IAAI8C,EAAY,IAAI,IAAI,CAAC9C,CAAO,CAAC,EACjC,QAASW,EAAIkC,EAAY,EAAGlC,GAAK,EAAGA,IAAK,CACvC,MAAM6B,EAAOhD,EAAOmB,CAAC,EACfoC,EAAM,CAAC,EACb,UAAWN,KAAYK,EAAW,CAChC,MAAM9B,EAAI,KAAK,iBAAiBwB,EAAMC,EAAU,CAC9C,IAAAnB,EACA,KAAM,KAAK9C,EACb,CAAC,EACGwC,EAAE,MACJ+B,EAAI,KAAK,GAAG/B,CAAC,CAEjB,CACA,GAAI+B,EAAI,OACFpC,IAAM,GACR3B,EAAM,IAAIgB,CAAO,EACjBM,EAAU,KAEVwC,EAAY,IAAI,IAAIC,CAAG,EACvBzC,EAAU,QAEP,CACLA,EAAU,GACV,KACF,CACF,CACA,GAAIA,EACF,MAEFN,EAAU,KAAK,UAAU2G,EAAa,CACpC,KAAM3G,CACR,CAAC,EACD8C,EAAY,IAAI,IAAI,CAAC9C,CAAO,CAAC,CAC/B,CACF,CACF,CACF,CACF,CACA,OAAOhB,CACT,CAQA,MAAM0G,EAAY,CAChB,YAAK,cAAcA,CAAU,EACf,KAAK,YAAYA,CAAU,CAE3C,CASA,QAAQ/G,EAAUC,EAAMC,EAAK,CAC3B,IAAI0C,EACJ,GAAI,CAEF,GADA,KAAKvD,GAAQ,KAAK,OAAOW,EAAUC,EAAMC,CAAG,EACxCD,EAAK,WAAa,eAAc,CAClC,MAAMgB,EAAM,mBAAmBhB,EAAK,QAAQ,GAC5C,MAAM,IAAI,UAAUgB,CAAG,CACzB,CAEA2B,EADc,KAAK,MAAM7D,CAAW,EACxB,IACd,OAASgB,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,MAAO,CAAC,CAAC6C,CACX,CASA,QAAQ5C,EAAUC,EAAMC,EAAK,CAC3B,IAAI0C,EACJ,GAAI,CAEF,GADA,KAAKvD,GAAQ,KAAK,OAAOW,EAAUC,EAAMC,CAAG,EACxCD,EAAK,WAAa,eAAc,CAClC,MAAMgB,EAAM,mBAAmBhB,EAAK,QAAQ,GAC5C,MAAM,IAAI,UAAUgB,CAAG,CACzB,CACA,MAAMZ,EAAQ,KAAK,MAAMvB,CAAa,EACtC,GAAIuB,EAAM,KAAM,CACd,IAAIgB,EAAU,KAAKhC,GACnB,KAAOgC,GAAS,CACd,GAAIhB,EAAM,IAAIgB,CAAO,EAAG,CACtBuB,EAAMvB,EACN,KACF,CACAA,EAAUA,EAAQ,UACpB,CACF,CACF,OAAStB,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,OAAO6C,GAAO,IAChB,CASA,cAAc5C,EAAUC,EAAMC,EAAK,CACjC,IAAI0C,EACJ,GAAI,CACF,KAAKvD,GAAQ,KAAK,OAAOW,EAAUC,EAAMC,CAAG,EAC5C,KAAK,oBAAoBD,CAAI,EAC7B,MAAMI,EAAQ,KAAK,MAAMxB,CAAY,EACrCwB,EAAM,OAAO,KAAKhB,EAAK,EACnBgB,EAAM,OACR,CAACuC,CAAG,KAAI,aAAUvC,CAAK,EAE3B,OAASN,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,OAAO6C,GAAO,IAChB,CAUA,iBAAiB5C,EAAUC,EAAMC,EAAK,CACpC,IAAI0C,EACJ,GAAI,CACF,KAAKvD,GAAQ,KAAK,OAAOW,EAAUC,EAAMC,CAAG,EAC5C,KAAK,oBAAoBD,CAAI,EAC7B,MAAMI,EAAQ,KAAK,MAAMzB,CAAU,EACnCyB,EAAM,OAAO,KAAKhB,EAAK,EACnBgB,EAAM,OACJ,KAAKV,GACPiD,KAAM,aAAUvC,CAAK,EAErBuC,EAAM,CAAC,GAAGvC,CAAK,EAGrB,OAASN,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,OAAO6C,GAAO,CAAC,CACjB,CACF",
+  "names": ["finder_exports", "__export", "Finder", "__toCommonJS", "import_is_potential_custom_element_name", "import_dom_util", "import_matcher", "import_parser", "import_constant", "DIR_NEXT", "DIR_PREV", "TARGET_ALL", "TARGET_FIRST", "TARGET_LINEAL", "TARGET_SELF", "WALKER_FILTER", "#ast", "#cache", "#document", "#finder", "#node", "#nodes", "#noexcept", "#results", "#root", "#shadow", "#sort", "#tree", "#warn", "#window", "e", "selector", "node", "opt", "noexcept", "warn", "nodes", "ast", "cachedItem", "l", "i", "cssAst", "branches", "items", "branch", "item", "leaves", "nextItem", "msg", "itemName", "walker", "current", "refNode", "anb", "a", "b", "reverse", "parentNode", "matched", "selectorBranches", "selectorNodes", "bool", "nth", "j", "localName", "prefix", "itemLocalName", "itemPrefix", "m", "nthName", "nthIdentName", "identName", "anbMap", "astName", "dir", "res", "parent", "langPart", "regExtendedLang", "langMain", "langSub", "langRest", "extendedMain", "extendedSub", "len", "extendedRest", "value", "leaf", "leafType", "combo", "twigLeaves", "itemType", "twig", "nextNode", "astData", "twigBranches", "forgive", "lastIndex", "nextNodes", "arr", "astChildren", "selectors", "css", "leavesSet", "regAnchor", "regFormCtrl", "regFormValidity", "regInteract", "regTypeCheck", "regTypeDate", "regTypeRange", "regTypeText", "href", "origin", "pathname", "attrURL", "hash", "id", "isCustomElementName", "targetNode", "nodeName", "checked", "regTypeReset", "regTypeSubmit", "form", "isMultiple", "defaultOpt", "inputType", "node1", "node2", "host", "astType", "result", "compound", "filterLeaves", "baseNode", "leafName", "pending", "comboName", "matchedNode", "filtered", "complex", "targetType", "branchLen", "firstTwig", "firstCombo", "firstName", "firstType", "lastTwig", "lastName", "lastType", "sibling", "pendingItems", "pendingItem", "index", "find", "entryNodes", "entryNodesLen", "n", "entryLeaves", "nextCombo", "entryNode"]
 }

package/package.json

@@ -31,16 +31,16 @@
     "@types/css-tree": "^2.3.5",
     "benchmark": "^2.1.4",
     "c8": "^9.1.0",
-    "chai": "^5.0.0",
+    "chai": "^5.0.3",
     "commander": "^11.1.0",
-    "esbuild": "^0.19.12",
+    "esbuild": "^0.20.0",
     "eslint": "^8.56.0",
     "eslint-config-standard": "^17.1.0",
     "eslint-plugin-import": "^2.29.1",
-    "eslint-plugin-jsdoc": "^48.0.2",
+    "eslint-plugin-jsdoc": "^48.0.4",
     "eslint-plugin-regexp": "^2.2.0",
     "eslint-plugin-unicorn": "^50.0.1",
-    "happy-dom": "^13.3.1",
+    "happy-dom": "^13.3.5",
     "jsdom": "24.0.0",
     "linkedom": "^0.16.8",
     "mocha": "^10.2.0",
@@ -59,5 +59,5 @@
     "tsc": "npx tsc",
     "update-wpt": "git submodule update --init --recursive --remote"
   },
-  "version": "3.0.1"
+  "version": "3.0.2"
 }

package/src/js/finder.js

@@ -180,6 +180,20 @@ export class Finder {
               });
               leaves.clear();
             } else if (item) {
+              let { name: itemName } = item;
+              if (itemName) {
+                if (Object.prototype.hasOwnProperty.call(itemName, 'name')) {
+                  itemName = unescapeSelector(itemName.name);
+                  if (/[|:]/.test(itemName)) {
+                    item.namespace = true;
+                  }
+                } else if (typeof itemName === 'string') {
+                  itemName = unescapeSelector(itemName);
+                  if (/[|:]/.test(itemName)) {
+                    item.namespace = true;
+                  }
+                }
+              }
               leaves.add(item);
             }
             if (items.length) {
@@ -1022,7 +1036,8 @@ export class Finder {
           break;
         }
         case 'focus': {
-          if (node === this.#document.activeElement) {
+          if (node === this.#document.activeElement &&
+              this.#window.getComputedStyle(node).display !== 'none') {
             matched.add(node);
           }
           break;
@@ -1031,7 +1046,9 @@ export class Finder {
           let current = this.#document.activeElement;
           while (current) {
             if (current === node) {
-              matched.add(node);
+              if (this.#window.getComputedStyle(node).display !== 'none') {
+                matched.add(node);
+              }
               break;
             }
             current = current.parentNode;
@@ -1760,6 +1777,10 @@ export class Finder {
       pending = true;
     } else {
       switch (leafType) {
+        case SELECTOR_PSEUDO_ELEMENT: {
+          matchPseudoElementSelector(leafName, opt);
+          break;
+        }
         case SELECTOR_ID: {
           if (this.#root.nodeType === ELEMENT_NODE) {
             pending = true;
@@ -1799,10 +1820,6 @@ export class Finder {
           }
           break;
         }
-        case SELECTOR_PSEUDO_ELEMENT: {
-          matchPseudoElementSelector(leafName, opt);
-          break;
-        }
         default: {
           pending = true;
         }
@@ -2022,12 +2039,14 @@ export class Finder {
     const nodes = [];
     let filtered = false;
     let bool = this._matchLeaves([leaf], this.#node);
-    if (bool && !compound && !complex) {
-      nodes.push(this.#node);
-      filtered = true;
-    } else if (bool && compound && !complex) {
-      bool = this._matchLeaves(filterLeaves, this.#node);
-      if (bool) {
+    if (bool && !complex) {
+      if (compound) {
+        bool = this._matchLeaves(filterLeaves, this.#node);
+        if (bool) {
+          nodes.push(this.#node);
+          filtered = true;
+        }
+      } else {
         nodes.push(this.#node);
         filtered = true;
       }
@@ -2110,11 +2129,20 @@ export class Finder {
             }
           }
         }
+      } else if (compound) {
+        for (let i = 0; i < l; i++) {
+          const node = items[i];
+          const bool = this._matchLeaves(filterLeaves, node, {
+            warn: this.#warn
+          });
+          if (bool) {
+            nodes.push(node);
+            filtered = true;
+          }
+        }
       } else {
         nodes = [].slice.call(items);
-        if (!compound) {
-          filtered = true;
-        }
+        filtered = true;
       }
     }
     return [nodes, filtered];
@@ -2498,58 +2526,50 @@ export class Finder {
           }
         } else if (dir === DIR_NEXT) {
           let { combo, leaves: entryLeaves } = branch[0];
-          const [, ...filterLeaves] = entryLeaves;
           let matched;
           for (let j = 0; j < entryNodesLen; j++) {
             const node = entryNodes[j];
-            const bool = filtered || this._matchLeaves(filterLeaves, node, {
-              warn: this.#warn
-            });
-            if (bool) {
-              let nextNodes = new Set([node]);
-              for (let j = 1; j < branchLen; j++) {
-                const { combo: nextCombo, leaves } = branch[j];
-                const arr = [];
-                for (const nextNode of nextNodes) {
-                  const twig = {
-                    combo,
-                    leaves
-                  };
-                  const m = this._matchCombinator(twig, nextNode, {
-                    dir,
-                    warn: this.#warn
-                  });
-                  if (m.size) {
-                    arr.push(...m);
-                  }
+            let nextNodes = new Set([node]);
+            for (let j = 1; j < branchLen; j++) {
+              const { combo: nextCombo, leaves } = branch[j];
+              const arr = [];
+              for (const nextNode of nextNodes) {
+                const twig = {
+                  combo,
+                  leaves
+                };
+                const m = this._matchCombinator(twig, nextNode, {
+                  dir,
+                  warn: this.#warn
+                });
+                if (m.size) {
+                  arr.push(...m);
                 }
-                if (arr.length) {
-                  if (j === lastIndex) {
-                    if (targetType === TARGET_ALL) {
-                      if (nodes.size) {
-                        const n = [...nodes];
-                        nodes = new Set([...n, ...arr]);
-                      } else {
-                        nodes = new Set([...arr]);
-                      }
-                      this.#sort = true;
+              }
+              if (arr.length) {
+                if (j === lastIndex) {
+                  if (targetType === TARGET_ALL) {
+                    if (nodes.size) {
+                      const n = [...nodes];
+                      nodes = new Set([...n, ...arr]);
                     } else {
-                      const [node] = sortNodes(arr);
-                      nodes.add(node);
+                      nodes = new Set([...arr]);
                     }
-                    matched = true;
+                    this.#sort = true;
                   } else {
-                    combo = nextCombo;
-                    nextNodes = new Set(arr);
-                    matched = false;
+                    const [node] = sortNodes(arr);
+                    nodes.add(node);
                   }
+                  matched = true;
                 } else {
+                  combo = nextCombo;
+                  nextNodes = new Set(arr);
                   matched = false;
-                  break;
                 }
+              } else {
+                matched = false;
+                break;
               }
-            } else {
-              matched = false;
             }
             if (matched && targetType !== TARGET_ALL) {
               break;
@@ -2716,9 +2736,7 @@ export class Finder {
         throw new TypeError(msg);
       }
       const nodes = this._find(TARGET_SELF);
-      if (nodes.size) {
-        res = nodes.has(this.#node);
-      }
+      res = nodes.size;
     } catch (e) {
       this._onError(e);
     }
@@ -2741,16 +2759,14 @@ export class Finder {
         throw new TypeError(msg);
       }
       const nodes = this._find(TARGET_LINEAL);
-      let refNode = this.#node;
-      while (refNode) {
-        if (nodes.has(refNode)) {
-          res = refNode;
-          break;
-        }
-        if (refNode.parentNode) {
+      if (nodes.size) {
+        let refNode = this.#node;
+        while (refNode) {
+          if (nodes.has(refNode)) {
+            res = refNode;
+            break;
+          }
           refNode = refNode.parentNode;
-        } else {
-          break;
         }
       }
     } catch (e) {