@asamuzakjp/dom-selector 5.0.3 → 5.0.4
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/cjs/js/finder.js +1 -1
- package/dist/cjs/js/finder.js.map +3 -3
- package/dist/cjs/js/parser.js +2 -2
- package/dist/cjs/js/parser.js.map +2 -2
- package/package.json +1 -1
- package/src/js/finder.js +6 -2
- package/src/js/parser.js +3 -0
package/dist/cjs/js/finder.js
CHANGED
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
var T=Object.defineProperty;var D=Object.getOwnPropertyDescriptor;var I=Object.getOwnPropertyNames;var U=Object.prototype.hasOwnProperty;var $=(x,o)=>{for(var e in o)T(x,e,{get:o[e],enumerable:!0})},F=(x,o,e,h)=>{if(o&&typeof o=="object"||typeof o=="function")for(let n of I(o))!U.call(x,n)&&n!==e&&T(x,n,{get:()=>o[n],enumerable:!(h=D(o,n))||h.enumerable});return x};var G=x=>F(T({},"__esModule",{value:!0}),x);var H={};$(H,{Finder:()=>W});module.exports=G(H);var k=require("./dom-util.js"),L=require("./matcher.js"),g=require("./parser.js"),a=require("./constant.js");const v="next",S="prev";class W{#a;#c;#u;#t;#n;#h;#m;#e;#o;#w;#d;#p;#s;#f;#r;#b;#i;#l;constructor(o){this.#l=o,this.#c=new WeakMap,this.#n=new WeakMap,this.#p=new WeakMap}_onError(o){if(!this.#w)if(o instanceof DOMException||o instanceof this.#l.DOMException)if(o.name===a.NOT_SUPPORTED_ERR)this.#i&&console.warn(o.message);else throw new this.#l.DOMException(o.message,o.name);else throw o}_setup(o,e,h={}){const{event:n,noexcept:l,warn:r}=h;return this.#w=!!l,this.#i=!!r,this.#h=this._setEvent(n),this.#e=e,[this.#t,this.#s,this.#r]=(0,k.resolveContent)(e),this.#f=(0,k.isInShadowTree)(e),[this.#a,this.#o]=this._correspond(o),this.#b=new WeakMap,this.#m=!1,e}_setEvent(o){return o instanceof this.#l.KeyboardEvent||o instanceof this.#l.MouseEvent?o:null}_correspond(o){const e=[];this.#u=!1;let h;if(this.#n.has(this.#t)){const n=this.#n.get(this.#t);if(n&&n.has(`${o}`)){const l=n.get(`${o}`);h=l.ast,this.#u=l.descendant}}if(h){const n=h.length;for(let l=0;l<n;l++)h[l].collected=!1,h[l].dir=null,h[l].filtered=!1,h[l].find=!1,e[l]=[]}else{let n;try{n=(0,g.parseSelector)(o)}catch(d){this._onError(d)}const{branches:l}=(0,g.walkAST)(n);let r=!1,f=0;h=[];for(const[...d]of l){const i=[];let t=d.shift();if(t&&t.type!==a.COMBINATOR){const s=new Set;for(;t;){if(t.type===a.COMBINATOR){const[c]=d;if(c.type===a.COMBINATOR){const m=`Invalid selector ${o}`;throw new DOMException(m,a.SYNTAX_ERR)}const u=t.name;/^[\s>]$/.test(u)&&(r=!0),i.push({combo:t,leaves:(0,g.sortAST)(s)}),s.clear()}else if(t){let{name:c}=t;c&&typeof c=="string"&&(c=(0,g.unescapeSelector)(c),typeof c=="string"&&c!==t.name&&(t.name=c),/[|:]/.test(c)&&(t.namespace=!0)),s.add(t)}if(d.length)t=d.shift();else{i.push({combo:null,leaves:(0,g.sortAST)(s)}),s.clear();break}}}h.push({branch:i,collected:!1,dir:null,filtered:!1,find:!1}),e[f]=[],f++}let b;this.#n.has(this.#t)?b=this.#n.get(this.#t):b=new Map,b.set(`${o}`,{ast:h,descendant:r}),this.#n.set(this.#t,b),this.#u=r}return[h,e]}_createTreeWalker(o){let e;return this.#b.has(o)?e=this.#b.get(o):(e=this.#t.createTreeWalker(o,a.WALKER_FILTER),this.#b.set(o,e)),e}_prepareQuerySelectorWalker(){return this.#d=this._createTreeWalker(this.#e),this.#d}_collectNthChild(o,e,h){const{a:n,b:l,reverse:r,selector:f}=o,{parentNode:b}=e,d=new Set;let i;if(f)if(this.#c.has(f))i=this.#c.get(f);else{const{branches:t,info:s}=(0,g.walkAST)(f);i=t,this.#c.set(f,i),s.hasLogicalPseudoFunc&&(this.#m=!0)}if(b){const t=this.#r;let s=(0,k.traverseNode)(b,t);s=t.firstChild();let c=0;for(;s;)c++,s=t.nextSibling();const u=new Set;if(i)for(s=(0,k.traverseNode)(b,t),s=t.firstChild();s;){const{display:m,visibility:w}=this.#l.getComputedStyle(s);if(m!=="none"&&w!=="hidden"){let p;for(const N of i)if(p=this._matchLeaves(N,s,h),!p)break;p&&u.add(s)}s=t.nextSibling()}if(n===0){if(l>0&&l<=c){if(u.size){s=(0,k.traverseNode)(b,t),r?s=t.lastChild():s=t.firstChild();let m=0;for(;s;){if(u.has(s)){if(m===l-1){d.add(s);break}m++}r?s=t.previousSibling():s=t.nextSibling()}}else if(!f){s=(0,k.traverseNode)(b,t),r?s=t.lastChild():s=t.firstChild();let m=0;for(;s;){if(m===l-1){d.add(s);break}r?s=t.previousSibling():s=t.nextSibling(),m++}}}}else{let m=l-1;if(n>0)for(;m<0;)m+=n;if(m>=0&&m<c){s=(0,k.traverseNode)(b,t),r?s=t.lastChild():s=t.firstChild();let w=0,p=n>0?0:l-1;for(;s&&(s&&m>=0&&m<c);)u.size?u.has(s)&&(p===m&&(d.add(s),m+=n),n>0?p++:p--):w===m&&(f||d.add(s),m+=n),r?s=t.previousSibling():s=t.nextSibling(),w++}}if(r&&d.size>1){const m=[...d];return new Set(m.reverse())}}else if(e===this.#s&&n+l===1)if(i){let t;for(const s of i)if(t=this._matchLeaves(s,e,h),t)break;t&&d.add(e)}else d.add(e);return d}_collectNthOfType(o,e){const{a:h,b:n,reverse:l}=o,{localName:r,parentNode:f,prefix:b}=e,d=new Set;if(f){const i=this.#r;let t=(0,k.traverseNode)(f,i);t=i.firstChild();let s=0;for(;t;)s++,t=i.nextSibling();if(h===0){if(n>0&&n<=s){t=(0,k.traverseNode)(f,i),l?t=i.lastChild():t=i.firstChild();let c=0;for(;t;){const{localName:u,prefix:m}=t;if(u===r&&m===b){if(c===n-1){d.add(t);break}c++}l?t=i.previousSibling():t=i.nextSibling()}}}else{let c=n-1;if(h>0)for(;c<0;)c+=h;if(c>=0&&c<s){t=(0,k.traverseNode)(f,i),l?t=i.lastChild():t=i.firstChild();let u=h>0?0:n-1;for(;t;){const{localName:m,prefix:w}=t;if(m===r&&w===b){if(u===c&&(d.add(t),c+=h),c<0||c>=s)break;h>0?u++:u--}l?t=i.previousSibling():t=i.nextSibling()}}}if(l&&d.size>1){const c=[...d];return new Set(c.reverse())}}else e===this.#s&&h+n===1&&d.add(e);return d}_matchAnPlusB(o,e,h,n){const{nth:{a:l,b:r,name:f},selector:b}=o,d=new Map;if(f?(f==="even"?(d.set("a",2),d.set("b",0)):f==="odd"&&(d.set("a",2),d.set("b",1)),h.indexOf("last")>-1&&d.set("reverse",!0)):(typeof l=="string"&&/-?\d+/.test(l)?d.set("a",l*1):d.set("a",0),typeof r=="string"&&/-?\d+/.test(r)?d.set("b",r*1):d.set("b",0),h.indexOf("last")>-1&&d.set("reverse",!0)),/^nth-(?:last-)?child$/.test(h)){b&&d.set("selector",b);const i=Object.fromEntries(d);return this._collectNthChild(i,e,n)}else if(/^nth-(?:last-)?of-type$/.test(h)){const i=Object.fromEntries(d);return this._collectNthOfType(i,e)}return new Set}_matchHasPseudoFunc(o,e,h={}){let n;if(Array.isArray(o)&&o.length){const l=o.map(s=>s),[r]=l,{type:f}=r;let b;f===a.COMBINATOR?b=l.shift():b={name:" ",type:a.COMBINATOR};const d=[];for(;l.length;){const[s]=l,{type:c}=s;if(c===a.COMBINATOR)break;d.push(l.shift())}const i={combo:b,leaves:d};h.dir=v;const t=this._matchCombinator(i,e,h);if(t.size)if(l.length){for(const s of t)if(n=this._matchHasPseudoFunc(l,s,h),n)break}else n=!0}return!!n}_matchLogicalPseudoFunc(o,e,h={}){const{astName:n="",branches:l=[],selector:r="",twigBranches:f=[]}=o;let b;if(n==="has")if(r.includes(":has("))b=null;else{let d;for(const i of l)if(d=this._matchHasPseudoFunc(i,e,h),d)break;d&&(b=e)}else{const d=/^(?:is|where)$/.test(n);h.forgive=d;const i=f.length;let t;for(let s=0;s<i;s++){const c=f[s],u=c.length-1,{leaves:m}=c[u];if(t=this._matchLeaves(m,e,h),t&&u>0){let w=new Set([e]);for(let p=u-1;p>=0;p--){const N=c[p],_=[];h.dir=S;for(const y of w){const E=this._matchCombinator(N,y,h);E.size&&_.push(...E)}if(_.length)p===0?t=!0:w=new Set(_);else{t=!1;break}}}if(t)break}n==="not"?t||(b=e):t&&(b=e)}return b??null}_matchPseudoClassSelector(o,e,h={}){const{children:n,name:l}=o,{localName:r,parentNode:f}=e,{forgive:b,warn:d=this.#i}=h,i=new Set;if(a.REG_LOGICAL_PSEUDO.test(l)){let t;if(this.#c.has(o))t=this.#c.get(o);else{const{branches:c}=(0,g.walkAST)(o),u=[],m=[];for(const[...w]of c){for(const y of w){const E=(0,g.generateCSS)(y);u.push(E)}const p=[],N=new Set;let _=w.shift();for(;_;)if(_.type===a.COMBINATOR?(p.push({combo:_,leaves:[...N]}),N.clear()):_&&N.add(_),w.length)_=w.shift();else{p.push({combo:null,leaves:[...N]}),N.clear();break}m.push(p)}t={astName:l,branches:c,twigBranches:m,selector:u.join(",")},this.#c.set(o,t)}const s=this._matchLogicalPseudoFunc(t,e,h);s&&i.add(s)}else if(Array.isArray(n))if(/^nth-(?:last-)?(?:child|of-type)$/.test(l)){const[t]=n;return this._matchAnPlusB(t,e,l,h)}else switch(l){case"dir":case"lang":{const t=L.matcher.matchSelector(o,e);t&&i.add(t);break}case"state":{if((0,k.isCustomElement)(e)){const[{value:t}]=n;t&&e[t]&&i.add(e)}break}case"current":case"nth-col":case"nth-last-col":{if(d){const t=`Unsupported pseudo-class :${l}()`;throw new DOMException(t,a.NOT_SUPPORTED_ERR)}break}case"host":case"host-context":break;case"contains":{if(d){const t=`Unknown pseudo-class :${l}()`;throw new DOMException(t,a.NOT_SUPPORTED_ERR)}break}default:if(!b){const t=`Unknown pseudo-class :${l}()`;throw new DOMException(t,a.SYNTAX_ERR)}}else switch(l){case"any-link":case"link":{a.REG_ANCHOR.test(r)&&e.hasAttribute("href")&&i.add(e);break}case"local-link":{if(a.REG_ANCHOR.test(r)&&e.hasAttribute("href")){const{href:t,origin:s,pathname:c}=new URL(this.#t.URL),u=new URL(e.getAttribute("href"),t);u.origin===s&&u.pathname===c&&i.add(e)}break}case"visited":break;case"hover":{const{target:t,type:s}=this.#h??{};(s==="mouseover"||s==="pointerover")&&e.contains(t)&&i.add(e);break}case"active":{const{buttons:t,target:s,type:c}=this.#h??{};(c==="mousedown"||c==="pointerdown")&&t&a.BIT_01&&e.contains(s)&&i.add(e);break}case"target":{const{hash:t}=new URL(this.#t.URL);e.id&&t===`#${e.id}`&&this.#t.contains(e)&&i.add(e);break}case"target-within":{const{hash:t}=new URL(this.#t.URL);if(t){const s=t.replace(/^#/,"");let c=this.#t.getElementById(s);for(;c;){if(c===e){i.add(e);break}c=c.parentNode}}break}case"scope":{this.#e.nodeType===a.ELEMENT_NODE?!this.#f&&e===this.#e&&i.add(e):e===this.#t.documentElement&&i.add(e);break}case"focus":case"focus-visible":{const{target:t,type:s}=this.#h??{};if(e===this.#t.activeElement&&e.tabIndex>=0&&(l==="focus"||s==="keydown"&&e.contains(t))){let c=e,u=!0;for(;c;){if(c.disabled||c.hasAttribute("disabled")||c.hidden||c.hasAttribute("hidden")){u=!1;break}else{const{display:m,visibility:w}=this.#l.getComputedStyle(c);if(u=!(m==="none"||w==="hidden"),!u)break}if(c.parentNode&&c.parentNode.nodeType===a.ELEMENT_NODE)c=c.parentNode;else break}u&&i.add(e)}break}case"focus-within":{let t,s=this.#t.activeElement;if(s.tabIndex>=0)for(;s;){if(s===e){t=!0;break}s=s.parentNode}if(t){let c=e,u=!0;for(;c;){if(c.disabled||c.hasAttribute("disabled")||c.hidden||c.hasAttribute("hidden")){u=!1;break}else{const{display:m,visibility:w}=this.#l.getComputedStyle(c);if(u=!(m==="none"||w==="hidden"),!u)break}if(c.parentNode&&c.parentNode.nodeType===a.ELEMENT_NODE)c=c.parentNode;else break}u&&i.add(e)}break}case"open":{a.REG_INTERACT.test(r)&&e.hasAttribute("open")&&i.add(e);break}case"closed":{a.REG_INTERACT.test(r)&&!e.hasAttribute("open")&&i.add(e);break}case"disabled":{if(a.REG_FORM_CTRL.test(r)||(0,k.isCustomElement)(e,{formAssociated:!0})){if(e.disabled||e.hasAttribute("disabled"))i.add(e);else if(e.localName==="option")f.localName==="optgroup"&&(f.disabled||f.hasAttribute("disabled"))&&i.add(e);else if(e.localName!=="optgroup"){let t,s=f;for(;s;)if(s.localName==="fieldset"&&(s.disabled||s.hasAttribute("disabled"))){const c=this.#r;let u=(0,k.traverseNode)(s,c);for(u=c.firstChild();u&&u.localName!=="legend";)u=c.nextSibling();u&&u.contains(e)||(t=!0);break}else{if(s.localName==="form")break;if(s.parentNode?.nodeType===a.ELEMENT_NODE){if(s.parentNode.localName==="form")break;s=s.parentNode}else break}t&&i.add(e)}}break}case"enabled":{if((a.REG_FORM_CTRL.test(r)||(0,k.isCustomElement)(e,{formAssociated:!0}))&&!(e.disabled&&e.hasAttribute("disabled")))if(e.localName==="optgroup")i.add(e);else if(e.localName==="option")(f.localName!=="optgroup"||!(f.disabled||f.hasAttribute("disabled")))&&i.add(e);else{let t,s=f;for(;s;)if(s.localName==="fieldset"&&(s.disabled||s.hasAttribute("disabled"))){const c=this.#r;let u=(0,k.traverseNode)(s,c);for(u=c.firstChild();u&&u.localName!=="legend";)u=c.nextSibling();u&&u.contains(e)||(t=!0);break}else{if(s.localName==="form")break;if(s.parentNode?.nodeType===a.ELEMENT_NODE){if(s.parentNode.localName==="form")break;s=s.parentNode}else break}t||i.add(e)}break}case"read-only":{switch(r){case"textarea":{(e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled"))&&i.add(e);break}case"input":{(!e.type||a.REG_TYPE_DATE.test(e.type)||a.REG_TYPE_TEXT.test(e.type))&&(e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled"))&&i.add(e);break}default:(0,k.isContentEditable)(e)||i.add(e)}break}case"read-write":{switch(r){case"textarea":{e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled")||i.add(e);break}case"input":{(!e.type||a.REG_TYPE_DATE.test(e.type)||a.REG_TYPE_TEXT.test(e.type))&&!(e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled"))&&i.add(e);break}default:(0,k.isContentEditable)(e)&&i.add(e)}break}case"placeholder-shown":{let t;if(e.placeholder?t=e.placeholder:e.hasAttribute("placeholder")&&(t=e.getAttribute("placeholder")),typeof t=="string"&&!/[\r\n]/.test(t)){let s;r==="textarea"?s=e:r==="input"&&(e.hasAttribute("type")?a.REG_TYPE_TEXT.test(e.getAttribute("type"))&&(s=e):s=e),s&&e.value===""&&i.add(e)}break}case"checked":{(e.checked&&r==="input"&&e.hasAttribute("type")&&a.REG_TYPE_CHECK.test(e.getAttribute("type"))||e.selected&&r==="option")&&i.add(e);break}case"indeterminate":{if(e.indeterminate&&r==="input"&&e.type==="checkbox"||r==="progress"&&!e.hasAttribute("value"))i.add(e);else if(r==="input"&&e.type==="radio"&&!e.hasAttribute("checked")){const t=e.name;let s=e.parentNode;for(;s&&s.localName!=="form";)s=s.parentNode;s||(s=this.#t.documentElement);const c=s.getElementsByTagName("input"),u=c.length;let m;for(let w=0;w<u;w++){const p=c[w];if(p.getAttribute("type")==="radio"&&(t?p.getAttribute("name")===t&&(m=!!p.checked):p.hasAttribute("name")||(m=!!p.checked),m))break}m||i.add(e)}break}case"default":{if(r==="button"&&!(e.hasAttribute("type")&&a.REG_TYPE_RESET.test(e.getAttribute("type")))||r==="input"&&e.hasAttribute("type")&&a.REG_TYPE_SUBMIT.test(e.getAttribute("type"))){let t=e.parentNode;for(;t&&t.localName!=="form";)t=t.parentNode;if(t){const s=this.#r;let c=(0,k.traverseNode)(t,s);for(c=s.firstChild();c&&t.contains(c);){const u=c.localName;let m;if(u==="button"?m=!(c.hasAttribute("type")&&a.REG_TYPE_RESET.test(c.getAttribute("type"))):u==="input"&&(m=c.hasAttribute("type")&&a.REG_TYPE_SUBMIT.test(c.getAttribute("type"))),m){c===e&&i.add(e);break}c=s.nextNode()}}}else(r==="input"&&e.hasAttribute("type")&&a.REG_TYPE_CHECK.test(e.getAttribute("type"))&&e.hasAttribute("checked")||r==="option"&&e.hasAttribute("selected"))&&i.add(e);break}case"valid":{if(a.REG_FORM_VALID.test(r))e.checkValidity()&&(e.maxLength>=0?e.maxLength>=e.value.length&&i.add(e):i.add(e));else if(r==="fieldset"){const t=this.#r;let s=(0,k.traverseNode)(e,t);s=t.firstChild();let c;if(!s)c=!0;else for(;s&&e.contains(s)&&!(a.REG_FORM_VALID.test(s.localName)&&(s.checkValidity()?s.maxLength>=0?c=s.maxLength>=s.value.length:c=!0:c=!1,!c));)s=t.nextNode();c&&i.add(e)}break}case"invalid":{if(a.REG_FORM_VALID.test(r))e.checkValidity()?e.maxLength>=0&&e.maxLength<e.value.length&&i.add(e):i.add(e);else if(r==="fieldset"){const t=this.#r;let s=(0,k.traverseNode)(e,t);s=t.firstChild();let c;if(!s)c=!0;else for(;s&&e.contains(s)&&!(a.REG_FORM_VALID.test(s.localName)&&(s.checkValidity()?s.maxLength>=0?c=s.maxLength>=s.value.length:c=!0:c=!1,!c));)s=t.nextNode();c||i.add(e)}break}case"in-range":{r==="input"&&!(e.readonly||e.hasAttribute("readonly"))&&!(e.disabled||e.hasAttribute("disabled"))&&e.hasAttribute("type")&&a.REG_TYPE_RANGE.test(e.getAttribute("type"))&&!(e.validity.rangeUnderflow||e.validity.rangeOverflow)&&(e.hasAttribute("min")||e.hasAttribute("max")||e.getAttribute("type")==="range")&&i.add(e);break}case"out-of-range":{r==="input"&&!(e.readonly||e.hasAttribute("readonly"))&&!(e.disabled||e.hasAttribute("disabled"))&&e.hasAttribute("type")&&a.REG_TYPE_RANGE.test(e.getAttribute("type"))&&(e.validity.rangeUnderflow||e.validity.rangeOverflow)&&i.add(e);break}case"required":{let t;if(/^(?:select|textarea)$/.test(r))t=e;else if(r==="input")if(e.hasAttribute("type")){const s=e.getAttribute("type");(s==="file"||a.REG_TYPE_CHECK.test(s)||a.REG_TYPE_DATE.test(s)||a.REG_TYPE_TEXT.test(s))&&(t=e)}else t=e;t&&(e.required||e.hasAttribute("required"))&&i.add(e);break}case"optional":{let t;if(/^(?:select|textarea)$/.test(r))t=e;else if(r==="input")if(e.hasAttribute("type")){const s=e.getAttribute("type");(s==="file"||a.REG_TYPE_CHECK.test(s)||a.REG_TYPE_DATE.test(s)||a.REG_TYPE_TEXT.test(s))&&(t=e)}else t=e;t&&!(e.required||e.hasAttribute("required"))&&i.add(e);break}case"root":{e===this.#t.documentElement&&i.add(e);break}case"empty":{if(e.hasChildNodes()){const t=this.#t.createTreeWalker(e,a.SHOW_ALL);let s=t.firstChild(),c;for(;s&&(c=s.nodeType!==a.ELEMENT_NODE&&s.nodeType!==a.TEXT_NODE,!!c);)s=t.nextSibling();c&&i.add(e)}else i.add(e);break}case"first-child":{(f&&e===f.firstElementChild||e===this.#s)&&i.add(e);break}case"last-child":{(f&&e===f.lastElementChild||e===this.#s)&&i.add(e);break}case"only-child":{(f&&e===f.firstElementChild&&e===f.lastElementChild||e===this.#s)&&i.add(e);break}case"first-of-type":{if(f){const[t]=this._collectNthOfType({a:0,b:1},e);t&&i.add(t)}else e===this.#s&&i.add(e);break}case"last-of-type":{if(f){const[t]=this._collectNthOfType({a:0,b:1,reverse:!0},e);t&&i.add(t)}else e===this.#s&&i.add(e);break}case"only-of-type":{if(f){const[t]=this._collectNthOfType({a:0,b:1},e);if(t===e){const[s]=this._collectNthOfType({a:0,b:1,reverse:!0},e);s===e&&i.add(e)}}else e===this.#s&&i.add(e);break}case"defined":{e.hasAttribute("is")||r.includes("-")?(0,k.isCustomElement)(e)&&i.add(e):(e instanceof this.#l.HTMLElement||e instanceof this.#l.SVGElement)&&i.add(e);break}case"popover-open":{if(e.popover){const{display:t}=this.#l.getComputedStyle(e);t!=="none"&&i.add(e)}break}case"host":case"host-context":break;case"after":case"before":case"first-letter":case"first-line":{if(d){const t=`Unsupported pseudo-element ::${l}`;throw new DOMException(t,a.NOT_SUPPORTED_ERR)}break}case"autofill":case"blank":case"buffering":case"current":case"fullscreen":case"future":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(d){const t=`Unsupported pseudo-class :${l}`;throw new DOMException(t,a.NOT_SUPPORTED_ERR)}break}default:if(l.startsWith("-webkit-")){if(d){const t=`Unsupported pseudo-class :${l}`;throw new DOMException(t,a.NOT_SUPPORTED_ERR)}}else if(!b){const t=`Unknown pseudo-class :${l}`;throw new DOMException(t,a.SYNTAX_ERR)}}return i}_matchShadowHostPseudoClass(o,e){const{children:h,name:n}=o;let l;if(Array.isArray(h)){const{branches:r}=(0,g.walkAST)(h[0]),[f]=r,[...b]=f,{host:d}=e;if(n==="host"){let i;for(const t of b){const{type:s}=t;if(s===a.COMBINATOR){const u=`Invalid selector ${(0,g.generateCSS)(o)}`;throw new DOMException(u,a.SYNTAX_ERR)}if(i=this._matchSelector(t,d).has(d),!i)break}i&&(l=e)}else if(n==="host-context"){let i=d,t;for(;i;){for(const s of b){const{type:c}=s;if(c===a.COMBINATOR){const m=`Invalid selector ${(0,g.generateCSS)(o)}`;throw new DOMException(m,a.SYNTAX_ERR)}if(t=this._matchSelector(s,i).has(i),!t)break}if(t)break;i=i.parentNode}t&&(l=e)}}else if(n==="host")l=e;else{const r=`Invalid selector :${n}`;throw new DOMException(r,a.SYNTAX_ERR)}return l??null}_matchSelector(o,e,h){const{type:n}=o,l=new Set;if(o.name===a.EMPTY)return l;const r=(0,g.unescapeSelector)(o.name);if(typeof r=="string"&&r!==o.name&&(o.name=r),e.nodeType===a.ELEMENT_NODE)switch(n){case a.SELECTOR_PSEUDO_ELEMENT:{L.matcher.matchPseudoElementSelector(r,h);break}case a.SELECTOR_ID:{e.id===r&&l.add(e);break}case a.SELECTOR_CLASS:{e.classList.contains(r)&&l.add(e);break}case a.SELECTOR_PSEUDO_CLASS:return this._matchPseudoClassSelector(o,e,h);default:{const f=L.matcher.matchSelector(o,e,h);f&&l.add(f)}}else if(this.#f&&n===a.SELECTOR_PSEUDO_CLASS&&e.nodeType===a.DOCUMENT_FRAGMENT_NODE){if(r!=="has"&&a.REG_LOGICAL_PSEUDO.test(r))return this._matchPseudoClassSelector(o,e,h);if(a.REG_SHADOW_HOST.test(r)){const f=this._matchShadowHostPseudoClass(o,e,h);f&&l.add(f)}}return l}_matchLeaves(o,e,h){let n,l=this.#p.get(o);if(l&&l.has(e)){const{matched:r}=l.get(e);n=r}if(typeof n!="boolean"){let r=!0;e.nodeType===a.ELEMENT_NODE&&a.REG_FORM.test(e.localName)&&(r=!1);for(const f of o){switch(f.type){case a.SELECTOR_ATTR:case a.SELECTOR_ID:{r=!1;break}case a.SELECTOR_PSEUDO_CLASS:{a.REG_INVALIDATE_PSEUDO.test(f.name)&&(r=!1);break}default:}if(n=this._matchSelector(f,e,h).has(e),!n)break}r&&!this.#m&&(l||(l=new WeakMap),l.set(e,{matched:n}),this.#p.set(o,l))}return!!n}_matchHTMLCollection(o,e={}){const{compound:h,filterLeaves:n}=e,l=new Set,r=o.length;if(r)if(h)for(let f=0;f<r;f++){const b=o[f];this._matchLeaves(n,b,e)&&l.add(b)}else{const f=[].slice.call(o);return new Set(f)}return l}_findDescendantNodes(o,e,h){const[n,...l]=o,r=l.length>0,{type:f}=n,b=(0,g.unescapeSelector)(n.name);typeof b=="string"&&b!==n.name&&(n.name=b);let d=new Set,i=!1;if(this.#f)i=!0;else switch(f){case a.SELECTOR_PSEUDO_ELEMENT:{L.matcher.matchPseudoElementSelector(b,h);break}case a.SELECTOR_ID:{if(this.#s.nodeType===a.ELEMENT_NODE)i=!0;else{const t=this.#s.getElementById(b);t&&t!==e&&e.contains(t)&&(r?this._matchLeaves(l,t,h)&&d.add(t):d.add(t))}break}case a.SELECTOR_CLASS:{const t=e.getElementsByClassName(b);d=this._matchHTMLCollection(t,{compound:r,filterLeaves:l});break}case a.SELECTOR_TYPE:{if(this.#t.contentType==="text/html"&&!/[*|]/.test(b)){const t=e.getElementsByTagName(b);d=this._matchHTMLCollection(t,{compound:r,filterLeaves:l})}else i=!0;break}default:i=!0}return{nodes:d,pending:i}}_matchCombinator(o,e,h={}){const{combo:n,leaves:l}=o,{name:r}=n,{parentNode:f}=e,{dir:b}=h,d=new Set;if(b===v)switch(r){case"+":{const i=e.nextElementSibling;i&&this._matchLeaves(l,i,h)&&d.add(i);break}case"~":{if(f){const i=this._createTreeWalker(f);let t=(0,k.traverseNode)(e,i);for(t=i.nextSibling();t;)this._matchLeaves(l,t,h)&&d.add(t),t=i.nextSibling()}break}case">":{const i=this._createTreeWalker(e);let t=(0,k.traverseNode)(e,i);for(t=i.firstChild();t;)this._matchLeaves(l,t,h)&&d.add(t),t=i.nextSibling();break}case" ":default:{const{nodes:i,pending:t}=this._findDescendantNodes(l,e);if(i.size)return i;if(t){const s=this._createTreeWalker(e);let c=(0,k.traverseNode)(e,s);for(c=s.nextNode();c&&e.contains(c);)this._matchLeaves(l,c,h)&&d.add(c),c=s.nextNode()}}}else switch(r){case"+":{const i=e.previousElementSibling;i&&this._matchLeaves(l,i,h)&&d.add(i);break}case"~":{if(f){const i=this._createTreeWalker(f);let t=(0,k.traverseNode)(f,i);for(t=i.firstChild();t&&t!==e;)this._matchLeaves(l,t,h)&&d.add(t),t=i.nextSibling()}break}case">":{f&&this._matchLeaves(l,f,h)&&d.add(f);break}case" ":default:{const i=[];let t=f;for(;t;)this._matchLeaves(l,t,h)&&i.push(t),t=t.parentNode;if(i.length)return new Set(i.reverse())}}return d}_findNode(o,e){const{node:h}=e,n=this.#d;let l=(0,k.traverseNode)(h,n),r;if(l)for((l.nodeType!==a.ELEMENT_NODE||l===h&&l!==this.#s)&&(l=n.nextNode());l;){if(this._matchLeaves(o,l,{warn:this.#i})){r=l;break}l=n.nextNode()}return r??null}_matchSelf(o){const e=[],h=this._matchLeaves(o,this.#e,{warn:this.#i});let n=!1;return h&&(e.push(this.#e),n=!0),[e,n]}_findLineal(o,e={}){const{complex:h}=e,n=[];let l=this._matchLeaves(o,this.#e,{warn:this.#i}),r=!1;if(l&&(n.push(this.#e),r=!0),!l||h){let f=this.#e.parentNode;for(;f&&(l=this._matchLeaves(o,f,{warn:this.#i}),l&&(n.push(f),r=!0),f.parentNode);)f=f.parentNode}return[n,r]}_findFirst(o){const e=[],h=this._findNode(o,{node:this.#e});let n=!1;return h&&(e.push(h),n=!0),[e,n]}_findFromHTMLCollection(o,e={}){const{complex:h,compound:n,filterLeaves:l,targetType:r}=e;let f=[],b=!1,d=!1;const i=o.length;if(i)if(this.#e.nodeType===a.ELEMENT_NODE)for(let t=0;t<i;t++){const s=o[t];if(s!==this.#e&&(this.#e.contains(s)||s.contains(this.#e))){if(n){if(this._matchLeaves(l,s,{warn:this.#i})&&(f.push(s),b=!0,r===a.TARGET_FIRST))break}else if(f.push(s),b=!0,r===a.TARGET_FIRST)break}}else if(h)if(n)for(let t=0;t<i;t++){const s=o[t];if(this._matchLeaves(l,s,{warn:this.#i})&&(f.push(s),b=!0,r===a.TARGET_FIRST))break}else f=[].slice.call(o),b=!0,d=!0;else if(n)for(let t=0;t<i;t++){const s=o[t];if(this._matchLeaves(l,s,{warn:this.#i})&&(f.push(s),b=!0,r===a.TARGET_FIRST))break}else f=[].slice.call(o),b=!0,d=!0;return[f,b,d]}_findEntryNodes(o,e,h){const{leaves:n}=o,[l,...r]=n,f=r.length>0,{name:b,type:d}=l;let i=[],t=!1,s=!1,c=!1;switch(d){case a.SELECTOR_PSEUDO_ELEMENT:{L.matcher.matchPseudoElementSelector(b,{warn:this.#i});break}case a.SELECTOR_ID:{if(e===a.TARGET_SELF)[i,s]=this._matchSelf(n);else if(e===a.TARGET_LINEAL)[i,s]=this._findLineal(n,{complex:h});else if(e===a.TARGET_FIRST&&this.#s.nodeType!==a.ELEMENT_NODE){const u=this.#s.getElementById(b);u&&(f?this._matchLeaves(r,u,{warn:this.#i})&&(i.push(u),s=!0):(i.push(u),s=!0))}else e===a.TARGET_FIRST?[i,s]=this._findFirst(n):c=!0;break}case a.SELECTOR_CLASS:{if(e===a.TARGET_SELF)[i,s]=this._matchSelf(n);else if(e===a.TARGET_LINEAL)[i,s]=this._findLineal(n,{complex:h});else if(this.#s.nodeType===a.DOCUMENT_NODE){const u=this.#s.getElementsByClassName(b);u.length&&([i,s,t]=this._findFromHTMLCollection(u,{complex:h,compound:f,filterLeaves:r,targetType:e}))}else e===a.TARGET_FIRST?[i,s]=this._findFirst(n):c=!0;break}case a.SELECTOR_TYPE:{if(e===a.TARGET_SELF)[i,s]=this._matchSelf(n);else if(e===a.TARGET_LINEAL)[i,s]=this._findLineal(n,{complex:h});else if(this.#t.contentType==="text/html"&&this.#s.nodeType===a.DOCUMENT_NODE&&!/[*|]/.test(b)){const u=this.#s.getElementsByTagName(b);u.length&&([i,s,t]=this._findFromHTMLCollection(u,{complex:h,compound:f,filterLeaves:r,targetType:e}))}else e===a.TARGET_FIRST?[i,s]=this._findFirst(n):c=!0;break}default:if(e!==a.TARGET_LINEAL&&a.REG_SHADOW_HOST.test(b)){if(this.#f&&this.#e.nodeType===a.DOCUMENT_FRAGMENT_NODE){const u=this._matchShadowHostPseudoClass(l,this.#e);u&&(i.push(u),s=!0)}}else e===a.TARGET_SELF?[i,s]=this._matchSelf(n):e===a.TARGET_LINEAL?[i,s]=this._findLineal(n,{complex:h}):e===a.TARGET_FIRST?[i,s]=this._findFirst(n):c=!0}return{collected:t,compound:f,filtered:s,nodes:i,pending:c}}_collectNodes(o){const e=this.#a.values();if(o===a.TARGET_ALL||o===a.TARGET_FIRST){const h=new Set;let n=0;for(const{branch:l}of e){const r=l.length,f=r>1,b=l[0];let d,i;if(f){const{combo:w,leaves:[{name:p,type:N}]}=b,_=l[r-1],{leaves:[{name:y,type:E}]}=_;if(E===a.SELECTOR_PSEUDO_ELEMENT||E===a.SELECTOR_ID)d=S,i=_;else if(N===a.SELECTOR_PSEUDO_ELEMENT||N===a.SELECTOR_ID)d=v,i=b;else if(o===a.TARGET_ALL)if(p==="*"&&N===a.SELECTOR_TYPE)d=S,i=_;else if(y==="*"&&E===a.SELECTOR_TYPE)d=v,i=b;else if(r===2){const{name:A}=w;/^[+~]$/.test(A)?(d=S,i=_):(d=v,i=b)}else d=v,i=b;else if(y==="*"&&E===a.SELECTOR_TYPE)d=v,i=b;else if(p==="*"&&N===a.SELECTOR_TYPE)d=S,i=_;else{let A;for(const{combo:C,leaves:[O]}of l){const{name:R,type:M}=O;if(M===a.SELECTOR_PSEUDO_CLASS&&R==="dir"){A=!1;break}if(!A&&C){const{name:P}=C;/^[+~]$/.test(P)&&(A=!0)}}A?(d=v,i=b):(d=S,i=_)}}else d=S,i=b;const{collected:t,compound:s,filtered:c,nodes:u,pending:m}=this._findEntryNodes(i,o,f);u.length?(this.#a[n].find=!0,this.#o[n]=u):m&&h.add(new Map([["index",n],["twig",i]])),this.#a[n].collected=t,this.#a[n].dir=d,this.#a[n].filtered=c||!s,n++}if(h.size){let l,r;this.#e!==this.#s&&this.#e.nodeType===a.ELEMENT_NODE?(l=this.#e,r=this.#d):(l=this.#s,r=this.#r);let f=(0,k.traverseNode)(l,r);for(;f;){let b=!1;if(this.#e.nodeType===a.ELEMENT_NODE?f===this.#e?b=!0:b=this.#e.contains(f):b=!0,b)for(const d of h){const{leaves:i}=d.get("twig");if(this._matchLeaves(i,f,{warn:this.#i})){const s=d.get("index");this.#a[s].filtered=!0,this.#a[s].find=!0,this.#o[s].push(f)}}f!==r.currentNode&&(f=(0,k.traverseNode)(f,r)),f=r.nextNode()}}}else{let h=0;for(const{branch:n}of e){const l=n[n.length-1],r=n.length>1,{compound:f,filtered:b,nodes:d}=this._findEntryNodes(l,o,r);d.length&&(this.#a[h].find=!0,this.#o[h]=d),this.#a[h].dir=S,this.#a[h].filtered=b||!f,h++}}return[this.#a,this.#o]}_getCombinedNodes(o,e,h){const n=[];for(const l of e){const r=this._matchCombinator(o,l,{dir:h,warn:this.#i});r.size&&n.push(...r)}return n.length?new Set(n):new Set}_matchNodeNext(o,e,h){const{combo:n,index:l}=h,{combo:r,leaves:f}=o[l],b={combo:n,leaves:f},d=this._getCombinedNodes(b,e,v);let i;if(d.size)if(l===o.length-1){const[t]=(0,k.sortNodes)(d);i=t}else i=this._matchNodeNext(o,d,{combo:r,index:l+1});return i??null}_matchNodePrev(o,e,h){const{index:n}=h,l=o[n],r=new Set([e]),f=this._getCombinedNodes(l,r,S);let b;if(f.size){if(n===0)b=e;else for(const d of f)if(this._matchNodePrev(o,d,{index:n-1}))return e}return b??null}_find(o){(o===a.TARGET_ALL||o===a.TARGET_FIRST)&&this._prepareQuerySelectorWalker();const[[...e],h]=this._collectNodes(o),n=e.length;let l,r=new Set;for(let f=0;f<n;f++){const{branch:b,collected:d,dir:i,find:t}=e[f],s=b.length;if(s&&t){const c=h[f],u=c.length,m=s-1;if(m===0)if((o===a.TARGET_ALL||o===a.TARGET_FIRST)&&this.#e.nodeType===a.ELEMENT_NODE)for(let w=0;w<u;w++){const p=c[w];if(p!==this.#e&&this.#e.contains(p)&&(r.add(p),o!==a.TARGET_ALL))break}else if(o===a.TARGET_ALL)if(r.size){const w=[...r];r=new Set([...w,...c]),l=!0}else r=new Set(c);else{const[w]=c;r.add(w)}else if(o===a.TARGET_ALL)if(i===v){let{combo:w}=b[0];for(const p of c){let N=new Set([p]);for(let _=1;_<s;_++){const{combo:y,leaves:E}=b[_],A={combo:w,leaves:E};if(N=this._getCombinedNodes(A,N,i),N.size)if(_===m)if(r.size){const C=[...r];r=new Set([...C,...N]),l=!0}else r=N;else w=y;else break}}}else for(const w of c){let p=new Set([w]);for(let N=m-1;N>=0;N--){const _=b[N];if(p=this._getCombinedNodes(_,p,i),p.size)N===0&&(r.add(w),s>1&&r.size>1&&(l=!0));else break}}else if(o===a.TARGET_FIRST&&i===v){const{combo:w}=b[0];let p;for(const N of c)if(p=this._matchNodeNext(b,new Set([N]),{combo:w,index:1}),p){r.add(p);break}if(!p&&!d){const{leaves:N}=b[0],[_]=c;let y=this._findNode(N,{node:_});for(;y;){if(p=this._matchNodeNext(b,new Set([y]),{combo:w,index:1}),p){r.add(p);break}y=this._findNode(N,{node:y})}}}else{let w;for(const p of c)if(w=this._matchNodePrev(b,p,{index:m-1}),w){r.add(p);break}if(!w&&!d&&o===a.TARGET_FIRST){const{leaves:p}=b[m],[N]=c;let _=this._findNode(p,{node:N});for(;_;){if(w=this._matchNodePrev(b,_,{index:m-1}),w){r.add(_);break}_=this._findNode(p,{node:_})}}}}}return o===a.TARGET_ALL&&l&&(r=new Set((0,k.sortNodes)(r))),r}}0&&(module.exports={Finder});
|
|
1
|
+
var T=Object.defineProperty;var D=Object.getOwnPropertyDescriptor;var I=Object.getOwnPropertyNames;var U=Object.prototype.hasOwnProperty;var $=(x,o)=>{for(var e in o)T(x,e,{get:o[e],enumerable:!0})},F=(x,o,e,h)=>{if(o&&typeof o=="object"||typeof o=="function")for(let n of I(o))!U.call(x,n)&&n!==e&&T(x,n,{get:()=>o[n],enumerable:!(h=D(o,n))||h.enumerable});return x};var G=x=>F(T({},"__esModule",{value:!0}),x);var W={};$(W,{Finder:()=>H});module.exports=G(W);var k=require("./dom-util.js"),L=require("./matcher.js"),g=require("./parser.js"),a=require("./constant.js");const v="next",S="prev";class H{#a;#c;#m;#t;#n;#d;#o;#e;#f;#w;#b;#p;#s;#h;#r;#u;#i;#l;constructor(o){this.#l=o,this.#c=new WeakMap,this.#n=new WeakMap,this.#p=new WeakMap}_onError(o){if(!this.#w)if(o instanceof DOMException||o instanceof this.#l.DOMException)if(o.name===a.NOT_SUPPORTED_ERR)this.#i&&console.warn(o.message);else throw new this.#l.DOMException(o.message,o.name);else throw o}_setup(o,e,h={}){const{event:n,noexcept:r,warn:c}=h;return this.#w=!!r,this.#i=!!c,this.#d=this._setEvent(n),this.#e=e,[this.#t,this.#s,this.#r]=(0,k.resolveContent)(e),this.#h=(0,k.isInShadowTree)(e),[this.#a,this.#f]=this._correspond(o),this.#u=new WeakMap,this.#o=!1,e}_setEvent(o){return o instanceof this.#l.KeyboardEvent||o instanceof this.#l.MouseEvent?o:null}_correspond(o){const e=[];this.#m=!1;let h;if(this.#n.has(this.#t)){const n=this.#n.get(this.#t);if(n&&n.has(`${o}`)){const r=n.get(`${o}`);h=r.ast,this.#m=r.descendant,this.#o=r.invalidate}}if(h){const n=h.length;for(let r=0;r<n;r++)h[r].collected=!1,h[r].dir=null,h[r].filtered=!1,h[r].find=!1,e[r]=[]}else{let n;try{n=(0,g.parseSelector)(o)}catch(t){this._onError(t)}const{branches:r,info:{hasHasPseudo:c}}=(0,g.walkAST)(n),f=!!c;let b=!1,d=0;h=[];for(const[...t]of r){const s=[];let l=t.shift();if(l&&l.type!==a.COMBINATOR){const u=new Set;for(;l;){if(l.type===a.COMBINATOR){const[m]=t;if(m.type===a.COMBINATOR){const p=`Invalid selector ${o}`;throw new DOMException(p,a.SYNTAX_ERR)}const w=l.name;/^[\s>]$/.test(w)&&(b=!0),s.push({combo:l,leaves:(0,g.sortAST)(u)}),u.clear()}else if(l){let{name:m}=l;m&&typeof m=="string"&&(m=(0,g.unescapeSelector)(m),typeof m=="string"&&m!==l.name&&(l.name=m),/[|:]/.test(m)&&(l.namespace=!0)),u.add(l)}if(t.length)l=t.shift();else{s.push({combo:null,leaves:(0,g.sortAST)(u)}),u.clear();break}}}h.push({branch:s,collected:!1,dir:null,filtered:!1,find:!1}),e[d]=[],d++}let i;this.#n.has(this.#t)?i=this.#n.get(this.#t):i=new Map,i.set(`${o}`,{ast:h,descendant:b,invalidate:f}),this.#n.set(this.#t,i),this.#m=b,this.#o=f}return[h,e]}_createTreeWalker(o){let e;return this.#u.has(o)?e=this.#u.get(o):(e=this.#t.createTreeWalker(o,a.WALKER_FILTER),this.#u.set(o,e)),e}_prepareQuerySelectorWalker(){return this.#b=this._createTreeWalker(this.#e),this.#b}_collectNthChild(o,e,h){const{a:n,b:r,reverse:c,selector:f}=o,{parentNode:b}=e,d=new Set;let i;if(f)if(this.#c.has(f))i=this.#c.get(f);else{const{branches:t,info:s}=(0,g.walkAST)(f);i=t,this.#c.set(f,i),s.hasLogicalPseudoFunc&&(this.#o=!0)}if(b){const t=this.#r;let s=(0,k.traverseNode)(b,t);s=t.firstChild();let l=0;for(;s;)l++,s=t.nextSibling();const u=new Set;if(i)for(s=(0,k.traverseNode)(b,t),s=t.firstChild();s;){const{display:m,visibility:w}=this.#l.getComputedStyle(s);if(m!=="none"&&w!=="hidden"){let p;for(const N of i)if(p=this._matchLeaves(N,s,h),!p)break;p&&u.add(s)}s=t.nextSibling()}if(n===0){if(r>0&&r<=l){if(u.size){s=(0,k.traverseNode)(b,t),c?s=t.lastChild():s=t.firstChild();let m=0;for(;s;){if(u.has(s)){if(m===r-1){d.add(s);break}m++}c?s=t.previousSibling():s=t.nextSibling()}}else if(!f){s=(0,k.traverseNode)(b,t),c?s=t.lastChild():s=t.firstChild();let m=0;for(;s;){if(m===r-1){d.add(s);break}c?s=t.previousSibling():s=t.nextSibling(),m++}}}}else{let m=r-1;if(n>0)for(;m<0;)m+=n;if(m>=0&&m<l){s=(0,k.traverseNode)(b,t),c?s=t.lastChild():s=t.firstChild();let w=0,p=n>0?0:r-1;for(;s&&(s&&m>=0&&m<l);)u.size?u.has(s)&&(p===m&&(d.add(s),m+=n),n>0?p++:p--):w===m&&(f||d.add(s),m+=n),c?s=t.previousSibling():s=t.nextSibling(),w++}}if(c&&d.size>1){const m=[...d];return new Set(m.reverse())}}else if(e===this.#s&&n+r===1)if(i){let t;for(const s of i)if(t=this._matchLeaves(s,e,h),t)break;t&&d.add(e)}else d.add(e);return d}_collectNthOfType(o,e){const{a:h,b:n,reverse:r}=o,{localName:c,parentNode:f,prefix:b}=e,d=new Set;if(f){const i=this.#r;let t=(0,k.traverseNode)(f,i);t=i.firstChild();let s=0;for(;t;)s++,t=i.nextSibling();if(h===0){if(n>0&&n<=s){t=(0,k.traverseNode)(f,i),r?t=i.lastChild():t=i.firstChild();let l=0;for(;t;){const{localName:u,prefix:m}=t;if(u===c&&m===b){if(l===n-1){d.add(t);break}l++}r?t=i.previousSibling():t=i.nextSibling()}}}else{let l=n-1;if(h>0)for(;l<0;)l+=h;if(l>=0&&l<s){t=(0,k.traverseNode)(f,i),r?t=i.lastChild():t=i.firstChild();let u=h>0?0:n-1;for(;t;){const{localName:m,prefix:w}=t;if(m===c&&w===b){if(u===l&&(d.add(t),l+=h),l<0||l>=s)break;h>0?u++:u--}r?t=i.previousSibling():t=i.nextSibling()}}}if(r&&d.size>1){const l=[...d];return new Set(l.reverse())}}else e===this.#s&&h+n===1&&d.add(e);return d}_matchAnPlusB(o,e,h,n){const{nth:{a:r,b:c,name:f},selector:b}=o,d=new Map;if(f?(f==="even"?(d.set("a",2),d.set("b",0)):f==="odd"&&(d.set("a",2),d.set("b",1)),h.indexOf("last")>-1&&d.set("reverse",!0)):(typeof r=="string"&&/-?\d+/.test(r)?d.set("a",r*1):d.set("a",0),typeof c=="string"&&/-?\d+/.test(c)?d.set("b",c*1):d.set("b",0),h.indexOf("last")>-1&&d.set("reverse",!0)),/^nth-(?:last-)?child$/.test(h)){b&&d.set("selector",b);const i=Object.fromEntries(d);return this._collectNthChild(i,e,n)}else if(/^nth-(?:last-)?of-type$/.test(h)){const i=Object.fromEntries(d);return this._collectNthOfType(i,e)}return new Set}_matchHasPseudoFunc(o,e,h={}){let n;if(Array.isArray(o)&&o.length){const r=o.map(s=>s),[c]=r,{type:f}=c;let b;f===a.COMBINATOR?b=r.shift():b={name:" ",type:a.COMBINATOR};const d=[];for(;r.length;){const[s]=r,{type:l}=s;if(l===a.COMBINATOR)break;d.push(r.shift())}const i={combo:b,leaves:d};h.dir=v;const t=this._matchCombinator(i,e,h);if(t.size)if(r.length){for(const s of t)if(n=this._matchHasPseudoFunc(r,s,h),n)break}else n=!0}return!!n}_matchLogicalPseudoFunc(o,e,h={}){const{astName:n="",branches:r=[],selector:c="",twigBranches:f=[]}=o;let b;if(n==="has")if(c.includes(":has("))b=null;else{let d;for(const i of r)if(d=this._matchHasPseudoFunc(i,e,h),d)break;d&&(b=e)}else{const d=/^(?:is|where)$/.test(n);h.forgive=d;const i=f.length;let t;for(let s=0;s<i;s++){const l=f[s],u=l.length-1,{leaves:m}=l[u];if(t=this._matchLeaves(m,e,h),t&&u>0){let w=new Set([e]);for(let p=u-1;p>=0;p--){const N=l[p],_=[];h.dir=S;for(const y of w){const E=this._matchCombinator(N,y,h);E.size&&_.push(...E)}if(_.length)p===0?t=!0:w=new Set(_);else{t=!1;break}}}if(t)break}n==="not"?t||(b=e):t&&(b=e)}return b??null}_matchPseudoClassSelector(o,e,h={}){const{children:n,name:r}=o,{localName:c,parentNode:f}=e,{forgive:b,warn:d=this.#i}=h,i=new Set;if(a.REG_LOGICAL_PSEUDO.test(r)){let t;if(this.#c.has(o))t=this.#c.get(o);else{const{branches:l}=(0,g.walkAST)(o),u=[],m=[];for(const[...w]of l){for(const y of w){const E=(0,g.generateCSS)(y);u.push(E)}const p=[],N=new Set;let _=w.shift();for(;_;)if(_.type===a.COMBINATOR?(p.push({combo:_,leaves:[...N]}),N.clear()):_&&N.add(_),w.length)_=w.shift();else{p.push({combo:null,leaves:[...N]}),N.clear();break}m.push(p)}t={astName:r,branches:l,twigBranches:m,selector:u.join(",")},this.#c.set(o,t)}const s=this._matchLogicalPseudoFunc(t,e,h);s&&i.add(s)}else if(Array.isArray(n))if(/^nth-(?:last-)?(?:child|of-type)$/.test(r)){const[t]=n;return this._matchAnPlusB(t,e,r,h)}else switch(r){case"dir":case"lang":{const t=L.matcher.matchSelector(o,e);t&&i.add(t);break}case"state":{if((0,k.isCustomElement)(e)){const[{value:t}]=n;t&&e[t]&&i.add(e)}break}case"current":case"nth-col":case"nth-last-col":{if(d){const t=`Unsupported pseudo-class :${r}()`;throw new DOMException(t,a.NOT_SUPPORTED_ERR)}break}case"host":case"host-context":break;case"contains":{if(d){const t=`Unknown pseudo-class :${r}()`;throw new DOMException(t,a.NOT_SUPPORTED_ERR)}break}default:if(!b){const t=`Unknown pseudo-class :${r}()`;throw new DOMException(t,a.SYNTAX_ERR)}}else switch(r){case"any-link":case"link":{a.REG_ANCHOR.test(c)&&e.hasAttribute("href")&&i.add(e);break}case"local-link":{if(a.REG_ANCHOR.test(c)&&e.hasAttribute("href")){const{href:t,origin:s,pathname:l}=new URL(this.#t.URL),u=new URL(e.getAttribute("href"),t);u.origin===s&&u.pathname===l&&i.add(e)}break}case"visited":break;case"hover":{const{target:t,type:s}=this.#d??{};(s==="mouseover"||s==="pointerover")&&e.contains(t)&&i.add(e);break}case"active":{const{buttons:t,target:s,type:l}=this.#d??{};(l==="mousedown"||l==="pointerdown")&&t&a.BIT_01&&e.contains(s)&&i.add(e);break}case"target":{const{hash:t}=new URL(this.#t.URL);e.id&&t===`#${e.id}`&&this.#t.contains(e)&&i.add(e);break}case"target-within":{const{hash:t}=new URL(this.#t.URL);if(t){const s=t.replace(/^#/,"");let l=this.#t.getElementById(s);for(;l;){if(l===e){i.add(e);break}l=l.parentNode}}break}case"scope":{this.#e.nodeType===a.ELEMENT_NODE?!this.#h&&e===this.#e&&i.add(e):e===this.#t.documentElement&&i.add(e);break}case"focus":case"focus-visible":{const{target:t,type:s}=this.#d??{};if(e===this.#t.activeElement&&e.tabIndex>=0&&(r==="focus"||s==="keydown"&&e.contains(t))){let l=e,u=!0;for(;l;){if(l.disabled||l.hasAttribute("disabled")||l.hidden||l.hasAttribute("hidden")){u=!1;break}else{const{display:m,visibility:w}=this.#l.getComputedStyle(l);if(u=!(m==="none"||w==="hidden"),!u)break}if(l.parentNode&&l.parentNode.nodeType===a.ELEMENT_NODE)l=l.parentNode;else break}u&&i.add(e)}break}case"focus-within":{let t,s=this.#t.activeElement;if(s.tabIndex>=0)for(;s;){if(s===e){t=!0;break}s=s.parentNode}if(t){let l=e,u=!0;for(;l;){if(l.disabled||l.hasAttribute("disabled")||l.hidden||l.hasAttribute("hidden")){u=!1;break}else{const{display:m,visibility:w}=this.#l.getComputedStyle(l);if(u=!(m==="none"||w==="hidden"),!u)break}if(l.parentNode&&l.parentNode.nodeType===a.ELEMENT_NODE)l=l.parentNode;else break}u&&i.add(e)}break}case"open":{a.REG_INTERACT.test(c)&&e.hasAttribute("open")&&i.add(e);break}case"closed":{a.REG_INTERACT.test(c)&&!e.hasAttribute("open")&&i.add(e);break}case"disabled":{if(a.REG_FORM_CTRL.test(c)||(0,k.isCustomElement)(e,{formAssociated:!0})){if(e.disabled||e.hasAttribute("disabled"))i.add(e);else if(e.localName==="option")f.localName==="optgroup"&&(f.disabled||f.hasAttribute("disabled"))&&i.add(e);else if(e.localName!=="optgroup"){let t,s=f;for(;s;)if(s.localName==="fieldset"&&(s.disabled||s.hasAttribute("disabled"))){const l=this.#r;let u=(0,k.traverseNode)(s,l);for(u=l.firstChild();u&&u.localName!=="legend";)u=l.nextSibling();u&&u.contains(e)||(t=!0);break}else{if(s.localName==="form")break;if(s.parentNode?.nodeType===a.ELEMENT_NODE){if(s.parentNode.localName==="form")break;s=s.parentNode}else break}t&&i.add(e)}}break}case"enabled":{if((a.REG_FORM_CTRL.test(c)||(0,k.isCustomElement)(e,{formAssociated:!0}))&&!(e.disabled&&e.hasAttribute("disabled")))if(e.localName==="optgroup")i.add(e);else if(e.localName==="option")(f.localName!=="optgroup"||!(f.disabled||f.hasAttribute("disabled")))&&i.add(e);else{let t,s=f;for(;s;)if(s.localName==="fieldset"&&(s.disabled||s.hasAttribute("disabled"))){const l=this.#r;let u=(0,k.traverseNode)(s,l);for(u=l.firstChild();u&&u.localName!=="legend";)u=l.nextSibling();u&&u.contains(e)||(t=!0);break}else{if(s.localName==="form")break;if(s.parentNode?.nodeType===a.ELEMENT_NODE){if(s.parentNode.localName==="form")break;s=s.parentNode}else break}t||i.add(e)}break}case"read-only":{switch(c){case"textarea":{(e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled"))&&i.add(e);break}case"input":{(!e.type||a.REG_TYPE_DATE.test(e.type)||a.REG_TYPE_TEXT.test(e.type))&&(e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled"))&&i.add(e);break}default:(0,k.isContentEditable)(e)||i.add(e)}break}case"read-write":{switch(c){case"textarea":{e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled")||i.add(e);break}case"input":{(!e.type||a.REG_TYPE_DATE.test(e.type)||a.REG_TYPE_TEXT.test(e.type))&&!(e.readonly||e.hasAttribute("readonly")||e.disabled||e.hasAttribute("disabled"))&&i.add(e);break}default:(0,k.isContentEditable)(e)&&i.add(e)}break}case"placeholder-shown":{let t;if(e.placeholder?t=e.placeholder:e.hasAttribute("placeholder")&&(t=e.getAttribute("placeholder")),typeof t=="string"&&!/[\r\n]/.test(t)){let s;c==="textarea"?s=e:c==="input"&&(e.hasAttribute("type")?a.REG_TYPE_TEXT.test(e.getAttribute("type"))&&(s=e):s=e),s&&e.value===""&&i.add(e)}break}case"checked":{(e.checked&&c==="input"&&e.hasAttribute("type")&&a.REG_TYPE_CHECK.test(e.getAttribute("type"))||e.selected&&c==="option")&&i.add(e);break}case"indeterminate":{if(e.indeterminate&&c==="input"&&e.type==="checkbox"||c==="progress"&&!e.hasAttribute("value"))i.add(e);else if(c==="input"&&e.type==="radio"&&!e.hasAttribute("checked")){const t=e.name;let s=e.parentNode;for(;s&&s.localName!=="form";)s=s.parentNode;s||(s=this.#t.documentElement);const l=s.getElementsByTagName("input"),u=l.length;let m;for(let w=0;w<u;w++){const p=l[w];if(p.getAttribute("type")==="radio"&&(t?p.getAttribute("name")===t&&(m=!!p.checked):p.hasAttribute("name")||(m=!!p.checked),m))break}m||i.add(e)}break}case"default":{if(c==="button"&&!(e.hasAttribute("type")&&a.REG_TYPE_RESET.test(e.getAttribute("type")))||c==="input"&&e.hasAttribute("type")&&a.REG_TYPE_SUBMIT.test(e.getAttribute("type"))){let t=e.parentNode;for(;t&&t.localName!=="form";)t=t.parentNode;if(t){const s=this.#r;let l=(0,k.traverseNode)(t,s);for(l=s.firstChild();l&&t.contains(l);){const u=l.localName;let m;if(u==="button"?m=!(l.hasAttribute("type")&&a.REG_TYPE_RESET.test(l.getAttribute("type"))):u==="input"&&(m=l.hasAttribute("type")&&a.REG_TYPE_SUBMIT.test(l.getAttribute("type"))),m){l===e&&i.add(e);break}l=s.nextNode()}}}else(c==="input"&&e.hasAttribute("type")&&a.REG_TYPE_CHECK.test(e.getAttribute("type"))&&e.hasAttribute("checked")||c==="option"&&e.hasAttribute("selected"))&&i.add(e);break}case"valid":{if(a.REG_FORM_VALID.test(c))e.checkValidity()&&(e.maxLength>=0?e.maxLength>=e.value.length&&i.add(e):i.add(e));else if(c==="fieldset"){const t=this.#r;let s=(0,k.traverseNode)(e,t);s=t.firstChild();let l;if(!s)l=!0;else for(;s&&e.contains(s)&&!(a.REG_FORM_VALID.test(s.localName)&&(s.checkValidity()?s.maxLength>=0?l=s.maxLength>=s.value.length:l=!0:l=!1,!l));)s=t.nextNode();l&&i.add(e)}break}case"invalid":{if(a.REG_FORM_VALID.test(c))e.checkValidity()?e.maxLength>=0&&e.maxLength<e.value.length&&i.add(e):i.add(e);else if(c==="fieldset"){const t=this.#r;let s=(0,k.traverseNode)(e,t);s=t.firstChild();let l;if(!s)l=!0;else for(;s&&e.contains(s)&&!(a.REG_FORM_VALID.test(s.localName)&&(s.checkValidity()?s.maxLength>=0?l=s.maxLength>=s.value.length:l=!0:l=!1,!l));)s=t.nextNode();l||i.add(e)}break}case"in-range":{c==="input"&&!(e.readonly||e.hasAttribute("readonly"))&&!(e.disabled||e.hasAttribute("disabled"))&&e.hasAttribute("type")&&a.REG_TYPE_RANGE.test(e.getAttribute("type"))&&!(e.validity.rangeUnderflow||e.validity.rangeOverflow)&&(e.hasAttribute("min")||e.hasAttribute("max")||e.getAttribute("type")==="range")&&i.add(e);break}case"out-of-range":{c==="input"&&!(e.readonly||e.hasAttribute("readonly"))&&!(e.disabled||e.hasAttribute("disabled"))&&e.hasAttribute("type")&&a.REG_TYPE_RANGE.test(e.getAttribute("type"))&&(e.validity.rangeUnderflow||e.validity.rangeOverflow)&&i.add(e);break}case"required":{let t;if(/^(?:select|textarea)$/.test(c))t=e;else if(c==="input")if(e.hasAttribute("type")){const s=e.getAttribute("type");(s==="file"||a.REG_TYPE_CHECK.test(s)||a.REG_TYPE_DATE.test(s)||a.REG_TYPE_TEXT.test(s))&&(t=e)}else t=e;t&&(e.required||e.hasAttribute("required"))&&i.add(e);break}case"optional":{let t;if(/^(?:select|textarea)$/.test(c))t=e;else if(c==="input")if(e.hasAttribute("type")){const s=e.getAttribute("type");(s==="file"||a.REG_TYPE_CHECK.test(s)||a.REG_TYPE_DATE.test(s)||a.REG_TYPE_TEXT.test(s))&&(t=e)}else t=e;t&&!(e.required||e.hasAttribute("required"))&&i.add(e);break}case"root":{e===this.#t.documentElement&&i.add(e);break}case"empty":{if(e.hasChildNodes()){const t=this.#t.createTreeWalker(e,a.SHOW_ALL);let s=t.firstChild(),l;for(;s&&(l=s.nodeType!==a.ELEMENT_NODE&&s.nodeType!==a.TEXT_NODE,!!l);)s=t.nextSibling();l&&i.add(e)}else i.add(e);break}case"first-child":{(f&&e===f.firstElementChild||e===this.#s)&&i.add(e);break}case"last-child":{(f&&e===f.lastElementChild||e===this.#s)&&i.add(e);break}case"only-child":{(f&&e===f.firstElementChild&&e===f.lastElementChild||e===this.#s)&&i.add(e);break}case"first-of-type":{if(f){const[t]=this._collectNthOfType({a:0,b:1},e);t&&i.add(t)}else e===this.#s&&i.add(e);break}case"last-of-type":{if(f){const[t]=this._collectNthOfType({a:0,b:1,reverse:!0},e);t&&i.add(t)}else e===this.#s&&i.add(e);break}case"only-of-type":{if(f){const[t]=this._collectNthOfType({a:0,b:1},e);if(t===e){const[s]=this._collectNthOfType({a:0,b:1,reverse:!0},e);s===e&&i.add(e)}}else e===this.#s&&i.add(e);break}case"defined":{e.hasAttribute("is")||c.includes("-")?(0,k.isCustomElement)(e)&&i.add(e):(e instanceof this.#l.HTMLElement||e instanceof this.#l.SVGElement)&&i.add(e);break}case"popover-open":{if(e.popover){const{display:t}=this.#l.getComputedStyle(e);t!=="none"&&i.add(e)}break}case"host":case"host-context":break;case"after":case"before":case"first-letter":case"first-line":{if(d){const t=`Unsupported pseudo-element ::${r}`;throw new DOMException(t,a.NOT_SUPPORTED_ERR)}break}case"autofill":case"blank":case"buffering":case"current":case"fullscreen":case"future":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(d){const t=`Unsupported pseudo-class :${r}`;throw new DOMException(t,a.NOT_SUPPORTED_ERR)}break}default:if(r.startsWith("-webkit-")){if(d){const t=`Unsupported pseudo-class :${r}`;throw new DOMException(t,a.NOT_SUPPORTED_ERR)}}else if(!b){const t=`Unknown pseudo-class :${r}`;throw new DOMException(t,a.SYNTAX_ERR)}}return i}_matchShadowHostPseudoClass(o,e){const{children:h,name:n}=o;let r;if(Array.isArray(h)){const{branches:c}=(0,g.walkAST)(h[0]),[f]=c,[...b]=f,{host:d}=e;if(n==="host"){let i;for(const t of b){const{type:s}=t;if(s===a.COMBINATOR){const u=`Invalid selector ${(0,g.generateCSS)(o)}`;throw new DOMException(u,a.SYNTAX_ERR)}if(i=this._matchSelector(t,d).has(d),!i)break}i&&(r=e)}else if(n==="host-context"){let i=d,t;for(;i;){for(const s of b){const{type:l}=s;if(l===a.COMBINATOR){const m=`Invalid selector ${(0,g.generateCSS)(o)}`;throw new DOMException(m,a.SYNTAX_ERR)}if(t=this._matchSelector(s,i).has(i),!t)break}if(t)break;i=i.parentNode}t&&(r=e)}}else if(n==="host")r=e;else{const c=`Invalid selector :${n}`;throw new DOMException(c,a.SYNTAX_ERR)}return r??null}_matchSelector(o,e,h){const{type:n}=o,r=new Set;if(o.name===a.EMPTY)return r;const c=(0,g.unescapeSelector)(o.name);if(typeof c=="string"&&c!==o.name&&(o.name=c),e.nodeType===a.ELEMENT_NODE)switch(n){case a.SELECTOR_PSEUDO_ELEMENT:{L.matcher.matchPseudoElementSelector(c,h);break}case a.SELECTOR_ID:{e.id===c&&r.add(e);break}case a.SELECTOR_CLASS:{e.classList.contains(c)&&r.add(e);break}case a.SELECTOR_PSEUDO_CLASS:return this._matchPseudoClassSelector(o,e,h);default:{const f=L.matcher.matchSelector(o,e,h);f&&r.add(f)}}else if(this.#h&&n===a.SELECTOR_PSEUDO_CLASS&&e.nodeType===a.DOCUMENT_FRAGMENT_NODE){if(c!=="has"&&a.REG_LOGICAL_PSEUDO.test(c))return this._matchPseudoClassSelector(o,e,h);if(a.REG_SHADOW_HOST.test(c)){const f=this._matchShadowHostPseudoClass(o,e,h);f&&r.add(f)}}return r}_matchLeaves(o,e,h){let n,r=this.#p.get(o);if(r&&r.has(e)){const{matched:c}=r.get(e);n=c}if(typeof n!="boolean"){let c=!0;e.nodeType===a.ELEMENT_NODE&&a.REG_FORM.test(e.localName)&&(c=!1);for(const f of o){switch(f.type){case a.SELECTOR_ATTR:case a.SELECTOR_ID:{c=!1;break}case a.SELECTOR_PSEUDO_CLASS:{a.REG_INVALIDATE_PSEUDO.test(f.name)&&(c=!1);break}default:}if(n=this._matchSelector(f,e,h).has(e),!n)break}c&&!this.#o&&(r||(r=new WeakMap),r.set(e,{matched:n}),this.#p.set(o,r))}return!!n}_matchHTMLCollection(o,e={}){const{compound:h,filterLeaves:n}=e,r=new Set,c=o.length;if(c)if(h)for(let f=0;f<c;f++){const b=o[f];this._matchLeaves(n,b,e)&&r.add(b)}else{const f=[].slice.call(o);return new Set(f)}return r}_findDescendantNodes(o,e,h){const[n,...r]=o,c=r.length>0,{type:f}=n,b=(0,g.unescapeSelector)(n.name);typeof b=="string"&&b!==n.name&&(n.name=b);let d=new Set,i=!1;if(this.#h)i=!0;else switch(f){case a.SELECTOR_PSEUDO_ELEMENT:{L.matcher.matchPseudoElementSelector(b,h);break}case a.SELECTOR_ID:{if(this.#s.nodeType===a.ELEMENT_NODE)i=!0;else{const t=this.#s.getElementById(b);t&&t!==e&&e.contains(t)&&(c?this._matchLeaves(r,t,h)&&d.add(t):d.add(t))}break}case a.SELECTOR_CLASS:{const t=e.getElementsByClassName(b);d=this._matchHTMLCollection(t,{compound:c,filterLeaves:r});break}case a.SELECTOR_TYPE:{if(this.#t.contentType==="text/html"&&!/[*|]/.test(b)){const t=e.getElementsByTagName(b);d=this._matchHTMLCollection(t,{compound:c,filterLeaves:r})}else i=!0;break}default:i=!0}return{nodes:d,pending:i}}_matchCombinator(o,e,h={}){const{combo:n,leaves:r}=o,{name:c}=n,{parentNode:f}=e,{dir:b}=h,d=new Set;if(b===v)switch(c){case"+":{const i=e.nextElementSibling;i&&this._matchLeaves(r,i,h)&&d.add(i);break}case"~":{if(f){const i=this._createTreeWalker(f);let t=(0,k.traverseNode)(e,i);for(t=i.nextSibling();t;)this._matchLeaves(r,t,h)&&d.add(t),t=i.nextSibling()}break}case">":{const i=this._createTreeWalker(e);let t=(0,k.traverseNode)(e,i);for(t=i.firstChild();t;)this._matchLeaves(r,t,h)&&d.add(t),t=i.nextSibling();break}case" ":default:{const{nodes:i,pending:t}=this._findDescendantNodes(r,e);if(i.size)return i;if(t){const s=this._createTreeWalker(e);let l=(0,k.traverseNode)(e,s);for(l=s.nextNode();l&&e.contains(l);)this._matchLeaves(r,l,h)&&d.add(l),l=s.nextNode()}}}else switch(c){case"+":{const i=e.previousElementSibling;i&&this._matchLeaves(r,i,h)&&d.add(i);break}case"~":{if(f){const i=this._createTreeWalker(f);let t=(0,k.traverseNode)(f,i);for(t=i.firstChild();t&&t!==e;)this._matchLeaves(r,t,h)&&d.add(t),t=i.nextSibling()}break}case">":{f&&this._matchLeaves(r,f,h)&&d.add(f);break}case" ":default:{const i=[];let t=f;for(;t;)this._matchLeaves(r,t,h)&&i.push(t),t=t.parentNode;if(i.length)return new Set(i.reverse())}}return d}_findNode(o,e){const{node:h}=e,n=this.#b;let r=(0,k.traverseNode)(h,n),c;if(r)for((r.nodeType!==a.ELEMENT_NODE||r===h&&r!==this.#s)&&(r=n.nextNode());r;){if(this._matchLeaves(o,r,{warn:this.#i})){c=r;break}r=n.nextNode()}return c??null}_matchSelf(o){const e=[],h=this._matchLeaves(o,this.#e,{warn:this.#i});let n=!1;return h&&(e.push(this.#e),n=!0),[e,n]}_findLineal(o,e={}){const{complex:h}=e,n=[];let r=this._matchLeaves(o,this.#e,{warn:this.#i}),c=!1;if(r&&(n.push(this.#e),c=!0),!r||h){let f=this.#e.parentNode;for(;f&&(r=this._matchLeaves(o,f,{warn:this.#i}),r&&(n.push(f),c=!0),f.parentNode);)f=f.parentNode}return[n,c]}_findFirst(o){const e=[],h=this._findNode(o,{node:this.#e});let n=!1;return h&&(e.push(h),n=!0),[e,n]}_findFromHTMLCollection(o,e={}){const{complex:h,compound:n,filterLeaves:r,targetType:c}=e;let f=[],b=!1,d=!1;const i=o.length;if(i)if(this.#e.nodeType===a.ELEMENT_NODE)for(let t=0;t<i;t++){const s=o[t];if(s!==this.#e&&(this.#e.contains(s)||s.contains(this.#e))){if(n){if(this._matchLeaves(r,s,{warn:this.#i})&&(f.push(s),b=!0,c===a.TARGET_FIRST))break}else if(f.push(s),b=!0,c===a.TARGET_FIRST)break}}else if(h)if(n)for(let t=0;t<i;t++){const s=o[t];if(this._matchLeaves(r,s,{warn:this.#i})&&(f.push(s),b=!0,c===a.TARGET_FIRST))break}else f=[].slice.call(o),b=!0,d=!0;else if(n)for(let t=0;t<i;t++){const s=o[t];if(this._matchLeaves(r,s,{warn:this.#i})&&(f.push(s),b=!0,c===a.TARGET_FIRST))break}else f=[].slice.call(o),b=!0,d=!0;return[f,b,d]}_findEntryNodes(o,e,h){const{leaves:n}=o,[r,...c]=n,f=c.length>0,{name:b,type:d}=r;let i=[],t=!1,s=!1,l=!1;switch(d){case a.SELECTOR_PSEUDO_ELEMENT:{L.matcher.matchPseudoElementSelector(b,{warn:this.#i});break}case a.SELECTOR_ID:{if(e===a.TARGET_SELF)[i,s]=this._matchSelf(n);else if(e===a.TARGET_LINEAL)[i,s]=this._findLineal(n,{complex:h});else if(e===a.TARGET_FIRST&&this.#s.nodeType!==a.ELEMENT_NODE){const u=this.#s.getElementById(b);u&&(f?this._matchLeaves(c,u,{warn:this.#i})&&(i.push(u),s=!0):(i.push(u),s=!0))}else e===a.TARGET_FIRST?[i,s]=this._findFirst(n):l=!0;break}case a.SELECTOR_CLASS:{if(e===a.TARGET_SELF)[i,s]=this._matchSelf(n);else if(e===a.TARGET_LINEAL)[i,s]=this._findLineal(n,{complex:h});else if(this.#s.nodeType===a.DOCUMENT_NODE){const u=this.#s.getElementsByClassName(b);u.length&&([i,s,t]=this._findFromHTMLCollection(u,{complex:h,compound:f,filterLeaves:c,targetType:e}))}else e===a.TARGET_FIRST?[i,s]=this._findFirst(n):l=!0;break}case a.SELECTOR_TYPE:{if(e===a.TARGET_SELF)[i,s]=this._matchSelf(n);else if(e===a.TARGET_LINEAL)[i,s]=this._findLineal(n,{complex:h});else if(this.#t.contentType==="text/html"&&this.#s.nodeType===a.DOCUMENT_NODE&&!/[*|]/.test(b)){const u=this.#s.getElementsByTagName(b);u.length&&([i,s,t]=this._findFromHTMLCollection(u,{complex:h,compound:f,filterLeaves:c,targetType:e}))}else e===a.TARGET_FIRST?[i,s]=this._findFirst(n):l=!0;break}default:if(e!==a.TARGET_LINEAL&&a.REG_SHADOW_HOST.test(b)){if(this.#h&&this.#e.nodeType===a.DOCUMENT_FRAGMENT_NODE){const u=this._matchShadowHostPseudoClass(r,this.#e);u&&(i.push(u),s=!0)}}else e===a.TARGET_SELF?[i,s]=this._matchSelf(n):e===a.TARGET_LINEAL?[i,s]=this._findLineal(n,{complex:h}):e===a.TARGET_FIRST?[i,s]=this._findFirst(n):l=!0}return{collected:t,compound:f,filtered:s,nodes:i,pending:l}}_collectNodes(o){const e=this.#a.values();if(o===a.TARGET_ALL||o===a.TARGET_FIRST){const h=new Set;let n=0;for(const{branch:r}of e){const c=r.length,f=c>1,b=r[0];let d,i;if(f){const{combo:w,leaves:[{name:p,type:N}]}=b,_=r[c-1],{leaves:[{name:y,type:E}]}=_;if(E===a.SELECTOR_PSEUDO_ELEMENT||E===a.SELECTOR_ID)d=S,i=_;else if(N===a.SELECTOR_PSEUDO_ELEMENT||N===a.SELECTOR_ID)d=v,i=b;else if(o===a.TARGET_ALL)if(p==="*"&&N===a.SELECTOR_TYPE)d=S,i=_;else if(y==="*"&&E===a.SELECTOR_TYPE)d=v,i=b;else if(c===2){const{name:A}=w;/^[+~]$/.test(A)?(d=S,i=_):(d=v,i=b)}else d=v,i=b;else if(y==="*"&&E===a.SELECTOR_TYPE)d=v,i=b;else if(p==="*"&&N===a.SELECTOR_TYPE)d=S,i=_;else{let A;for(const{combo:C,leaves:[O]}of r){const{name:R,type:M}=O;if(M===a.SELECTOR_PSEUDO_CLASS&&R==="dir"){A=!1;break}if(!A&&C){const{name:P}=C;/^[+~]$/.test(P)&&(A=!0)}}A?(d=v,i=b):(d=S,i=_)}}else d=S,i=b;const{collected:t,compound:s,filtered:l,nodes:u,pending:m}=this._findEntryNodes(i,o,f);u.length?(this.#a[n].find=!0,this.#f[n]=u):m&&h.add(new Map([["index",n],["twig",i]])),this.#a[n].collected=t,this.#a[n].dir=d,this.#a[n].filtered=l||!s,n++}if(h.size){let r,c;this.#e!==this.#s&&this.#e.nodeType===a.ELEMENT_NODE?(r=this.#e,c=this.#b):(r=this.#s,c=this.#r);let f=(0,k.traverseNode)(r,c);for(;f;){let b=!1;if(this.#e.nodeType===a.ELEMENT_NODE?f===this.#e?b=!0:b=this.#e.contains(f):b=!0,b)for(const d of h){const{leaves:i}=d.get("twig");if(this._matchLeaves(i,f,{warn:this.#i})){const s=d.get("index");this.#a[s].filtered=!0,this.#a[s].find=!0,this.#f[s].push(f)}}f!==c.currentNode&&(f=(0,k.traverseNode)(f,c)),f=c.nextNode()}}}else{let h=0;for(const{branch:n}of e){const r=n[n.length-1],c=n.length>1,{compound:f,filtered:b,nodes:d}=this._findEntryNodes(r,o,c);d.length&&(this.#a[h].find=!0,this.#f[h]=d),this.#a[h].dir=S,this.#a[h].filtered=b||!f,h++}}return[this.#a,this.#f]}_getCombinedNodes(o,e,h){const n=[];for(const r of e){const c=this._matchCombinator(o,r,{dir:h,warn:this.#i});c.size&&n.push(...c)}return n.length?new Set(n):new Set}_matchNodeNext(o,e,h){const{combo:n,index:r}=h,{combo:c,leaves:f}=o[r],b={combo:n,leaves:f},d=this._getCombinedNodes(b,e,v);let i;if(d.size)if(r===o.length-1){const[t]=(0,k.sortNodes)(d);i=t}else i=this._matchNodeNext(o,d,{combo:c,index:r+1});return i??null}_matchNodePrev(o,e,h){const{index:n}=h,r=o[n],c=new Set([e]),f=this._getCombinedNodes(r,c,S);let b;if(f.size){if(n===0)b=e;else for(const d of f)if(this._matchNodePrev(o,d,{index:n-1}))return e}return b??null}_find(o){(o===a.TARGET_ALL||o===a.TARGET_FIRST)&&this._prepareQuerySelectorWalker();const[[...e],h]=this._collectNodes(o),n=e.length;let r,c=new Set;for(let f=0;f<n;f++){const{branch:b,collected:d,dir:i,find:t}=e[f],s=b.length;if(s&&t){const l=h[f],u=l.length,m=s-1;if(m===0)if((o===a.TARGET_ALL||o===a.TARGET_FIRST)&&this.#e.nodeType===a.ELEMENT_NODE)for(let w=0;w<u;w++){const p=l[w];if(p!==this.#e&&this.#e.contains(p)&&(c.add(p),o!==a.TARGET_ALL))break}else if(o===a.TARGET_ALL)if(c.size){const w=[...c];c=new Set([...w,...l]),r=!0}else c=new Set(l);else{const[w]=l;c.add(w)}else if(o===a.TARGET_ALL)if(i===v){let{combo:w}=b[0];for(const p of l){let N=new Set([p]);for(let _=1;_<s;_++){const{combo:y,leaves:E}=b[_],A={combo:w,leaves:E};if(N=this._getCombinedNodes(A,N,i),N.size)if(_===m)if(c.size){const C=[...c];c=new Set([...C,...N]),r=!0}else c=N;else w=y;else break}}}else for(const w of l){let p=new Set([w]);for(let N=m-1;N>=0;N--){const _=b[N];if(p=this._getCombinedNodes(_,p,i),p.size)N===0&&(c.add(w),s>1&&c.size>1&&(r=!0));else break}}else if(o===a.TARGET_FIRST&&i===v){const{combo:w}=b[0];let p;for(const N of l)if(p=this._matchNodeNext(b,new Set([N]),{combo:w,index:1}),p){c.add(p);break}if(!p&&!d){const{leaves:N}=b[0],[_]=l;let y=this._findNode(N,{node:_});for(;y;){if(p=this._matchNodeNext(b,new Set([y]),{combo:w,index:1}),p){c.add(p);break}y=this._findNode(N,{node:y})}}}else{let w;for(const p of l)if(w=this._matchNodePrev(b,p,{index:m-1}),w){c.add(p);break}if(!w&&!d&&o===a.TARGET_FIRST){const{leaves:p}=b[m],[N]=l;let _=this._findNode(p,{node:N});for(;_;){if(w=this._matchNodePrev(b,_,{index:m-1}),w){c.add(_);break}_=this._findNode(p,{node:_})}}}}}return o===a.TARGET_ALL&&r&&(c=new Set((0,k.sortNodes)(c))),c}}0&&(module.exports={Finder});
|
|
2
2
|
//# sourceMappingURL=finder.js.map
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"version": 3,
|
|
3
3
|
"sources": ["../../../src/js/finder.js"],
|
|
4
|
-
"sourcesContent": ["/**\n * finder.js\n */\n\n/* import */\nimport {\n isContentEditable, isCustomElement, isInShadowTree, resolveContent,\n sortNodes, traverseNode\n} from './dom-util.js';\nimport { matcher } from './matcher.js';\nimport {\n generateCSS, parseSelector, sortAST, unescapeSelector, walkAST\n} from './parser.js';\n\n/* constants */\nimport {\n BIT_01, COMBINATOR, DOCUMENT_FRAGMENT_NODE, DOCUMENT_NODE, ELEMENT_NODE,\n EMPTY, NOT_SUPPORTED_ERR, REG_ANCHOR, REG_FORM, REG_FORM_CTRL,\n REG_FORM_VALID, REG_INTERACT, REG_INVALIDATE_PSEUDO, REG_LOGICAL_PSEUDO,\n REG_SHADOW_HOST, REG_TYPE_CHECK, REG_TYPE_DATE, REG_TYPE_RANGE,\n REG_TYPE_RESET, REG_TYPE_SUBMIT, REG_TYPE_TEXT, SELECTOR_ATTR,\n SELECTOR_CLASS, SELECTOR_ID, SELECTOR_PSEUDO_CLASS, SELECTOR_PSEUDO_ELEMENT,\n SELECTOR_TYPE, SHOW_ALL, SYNTAX_ERR, TARGET_ALL, TARGET_FIRST, TARGET_LINEAL,\n TARGET_SELF, TEXT_NODE, WALKER_FILTER\n} from './constant.js';\nconst DIR_NEXT = 'next';\nconst DIR_PREV = 'prev';\n\n/**\n * Finder\n * NOTE: #ast[i] corresponds to #nodes[i]\n * #ast: Array<Ast | undefined>\n * #nodes: Array<Nodes>\n * Ast: {\n * branch: Array<Branch | undefined>,\n * collected: boolean,\n * dir: string | null,\n * filtered: boolean,\n * find: boolean\n * }\n * Branch: Array<Twig>\n * Twig: {\n * combo: Leaf | null,\n * leaves: Array<Leaf>\n * }\n * Leaf: {\n * children: Array<Leaf | undefined> | null,\n * loc: null,\n * type: string\n * }\n * Nodes: Array<HTMLElement | undefined>\n */\nexport class Finder {\n /* private fields */\n #ast;\n #astCache;\n #descendant;\n #document;\n #documentCache;\n #event;\n #invalidate;\n #node;\n #nodes;\n #noexcept;\n #qswalker;\n #results;\n #root;\n #shadow;\n #walker;\n #walkers;\n #warn;\n #window;\n\n /**\n * construct\n * @param {object} window - window\n */\n constructor(window) {\n this.#window = window;\n this.#astCache = new WeakMap();\n this.#documentCache = new WeakMap();\n this.#results = 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 e instanceof this.#window.DOMException) {\n if (e.name === NOT_SUPPORTED_ERR) {\n if (this.#warn) {\n console.warn(e.message);\n }\n } else {\n throw new this.#window.DOMException(e.message, e.name);\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 {object} [opt.event] - MouseEvent, KeyboardEvent\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 { event, noexcept, warn } = opt;\n this.#noexcept = !!noexcept;\n this.#warn = !!warn;\n this.#event = this._setEvent(event);\n this.#node = node;\n [this.#document, this.#root, this.#walker] = resolveContent(node);\n this.#shadow = isInShadowTree(node);\n [this.#ast, this.#nodes] = this._correspond(selector);\n this.#walkers = new WeakMap();\n this.#invalidate = false;\n return node;\n }\n\n /**\n * set event\n * @private\n * @param {object} event - instance of KeyboardEvent, MouseEvent\n * @returns {object} - result\n */\n _setEvent(event) {\n // NOTE: PointerEvent not implemented in jsdom\n return (event instanceof this.#window.KeyboardEvent ||\n event instanceof this.#window.MouseEvent)\n ? event\n : null;\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 this.#descendant = false;\n let ast;\n if (this.#documentCache.has(this.#document)) {\n const cachedItem = this.#documentCache.get(this.#document);\n if (cachedItem && cachedItem.has(`${selector}`)) {\n const item = cachedItem.get(`${selector}`);\n ast = item.ast;\n this.#descendant = item.descendant;\n }\n }\n if (ast) {\n const l = ast.length;\n for (let i = 0; i < l; i++) {\n ast[i].collected = false;\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 let descendant = false;\n let i = 0;\n ast = [];\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 const itemName = item.name;\n if (/^[\\s>]$/.test(itemName)) {\n descendant = true;\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 && typeof itemName === 'string') {\n itemName = unescapeSelector(itemName);\n if (typeof itemName === 'string' && itemName !== item.name) {\n item.name = itemName;\n }\n if (/[|:]/.test(itemName)) {\n item.namespace = true;\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 collected: false,\n dir: null,\n filtered: false,\n find: false\n });\n nodes[i] = [];\n i++;\n }\n let cachedItem;\n if (this.#documentCache.has(this.#document)) {\n cachedItem = this.#documentCache.get(this.#document);\n } else {\n cachedItem = new Map();\n }\n cachedItem.set(`${selector}`, {\n ast,\n descendant\n });\n this.#documentCache.set(this.#document, cachedItem);\n this.#descendant = descendant;\n }\n return [\n ast,\n nodes\n ];\n }\n\n /**\n * create tree walker\n * @private\n * @param {object} node - Document, DocumentFragment, Element node\n * @returns {object} - tree walker\n */\n _createTreeWalker(node) {\n let walker;\n if (this.#walkers.has(node)) {\n walker = this.#walkers.get(node);\n } else {\n walker = this.#document.createTreeWalker(node, WALKER_FILTER);\n this.#walkers.set(node, walker);\n }\n return walker;\n }\n\n /**\n * prepare querySelector walker\n * @private\n * @returns {object} - tree walker\n */\n _prepareQuerySelectorWalker() {\n this.#qswalker = this._createTreeWalker(this.#node);\n return this.#qswalker;\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 const matched = new Set();\n let selectorBranches;\n if (selector) {\n if (this.#astCache.has(selector)) {\n selectorBranches = this.#astCache.get(selector);\n } else {\n const { branches, info } = walkAST(selector);\n selectorBranches = branches;\n this.#astCache.set(selector, selectorBranches);\n if (info.hasLogicalPseudoFunc) {\n this.#invalidate = true;\n }\n }\n }\n if (parentNode) {\n const walker = this.#walker;\n let refNode = traverseNode(parentNode, walker);\n refNode = walker.firstChild();\n let l = 0;\n while (refNode) {\n l++;\n refNode = walker.nextSibling();\n }\n const selectorNodes = new Set();\n if (selectorBranches) {\n refNode = traverseNode(parentNode, walker);\n refNode = walker.firstChild();\n while (refNode) {\n const { display, visibility } =\n this.#window.getComputedStyle(refNode);\n if (display !== 'none' && visibility !== 'hidden') {\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 }\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 refNode = traverseNode(parentNode, walker);\n if (reverse) {\n refNode = walker.lastChild();\n } else {\n refNode = walker.firstChild();\n }\n let i = 0;\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 refNode = traverseNode(parentNode, walker);\n if (reverse) {\n refNode = walker.lastChild();\n } else {\n refNode = walker.firstChild();\n }\n let i = 0;\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 refNode = traverseNode(parentNode, walker);\n if (reverse) {\n refNode = walker.lastChild();\n } else {\n refNode = walker.firstChild();\n }\n let i = 0;\n let j = a > 0 ? 0 : b - 1;\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 return 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 const matched = new Set();\n if (parentNode) {\n const walker = this.#walker;\n let refNode = traverseNode(parentNode, walker);\n refNode = walker.firstChild();\n let l = 0;\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 refNode = traverseNode(parentNode, walker);\n if (reverse) {\n refNode = walker.lastChild();\n } else {\n refNode = walker.firstChild();\n }\n let j = 0;\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 refNode = traverseNode(parentNode, walker);\n if (reverse) {\n refNode = walker.lastChild();\n } else {\n refNode = walker.firstChild();\n }\n let j = a > 0 ? 0 : b - 1;\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 return 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 anbMap = new Map();\n if (nthIdentName) {\n if (nthIdentName === 'even') {\n anbMap.set('a', 2);\n anbMap.set('b', 0);\n } else if (nthIdentName === '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 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 return nodes;\n } else if (/^nth-(?:last-)?of-type$/.test(nthName)) {\n const anb = Object.fromEntries(anbMap);\n const nodes = this._collectNthOfType(anb, node);\n return nodes;\n }\n return new Set();\n }\n\n /**\n * match :has() pseudo-class function\n * @private\n * @param {Array.<object>} astLeaves - AST leaves\n * @param {object} node - Element node\n * @param {object} opt - options\n * @returns {boolean} - result\n */\n _matchHasPseudoFunc(astLeaves, node, opt = {}) {\n let bool;\n if (Array.isArray(astLeaves) && astLeaves.length) {\n const leaves = astLeaves.map(i => i);\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(leaves, 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(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, name: astName } = ast;\n const { localName, parentNode } = node;\n const {\n forgive,\n warn = this.#warn\n } = opt;\n const matched = new Set();\n // :has(), :is(), :not(), :where()\n if (REG_LOGICAL_PSEUDO.test(astName)) {\n let astData;\n if (this.#astCache.has(ast)) {\n astData = this.#astCache.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.#astCache.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 // :nth-child(), :nth-last-child(), nth-of-type(), :nth-last-of-type()\n if (/^nth-(?:last-)?(?:child|of-type)$/.test(astName)) {\n const [branch] = astChildren;\n const nodes = this._matchAnPlusB(branch, node, astName, opt);\n return nodes;\n } else {\n switch (astName) {\n // :dir(), :lang()\n case 'dir':\n case 'lang': {\n const res = matcher.matchSelector(ast, node);\n if (res) {\n matched.add(res);\n }\n break;\n }\n // :state()\n case 'state': {\n if (isCustomElement(node)) {\n const [{ value: stateValue }] = astChildren;\n if (stateValue && node[stateValue]) {\n matched.add(node);\n }\n }\n break;\n }\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 // dropped from CSS Selectors 3\n case 'contains': {\n if (warn) {\n const msg = `Unknown pseudo-class :${astName}()`;\n throw new DOMException(msg, NOT_SUPPORTED_ERR);\n }\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 switch (astName) {\n case 'any-link':\n case 'link': {\n if (REG_ANCHOR.test(localName) && node.hasAttribute('href')) {\n matched.add(node);\n }\n break;\n }\n case 'local-link': {\n if (REG_ANCHOR.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 'hover': {\n const { target, type } = this.#event ?? {};\n if ((type === 'mouseover' || type === 'pointerover') &&\n node.contains(target)) {\n matched.add(node);\n }\n break;\n }\n case 'active': {\n const { buttons, target, type } = this.#event ?? {};\n if ((type === 'mousedown' || type === 'pointerdown') &&\n buttons & BIT_01 && node.contains(target)) {\n matched.add(node);\n }\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 (!this.#shadow && 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 case 'focus-visible': {\n const { target, type } = this.#event ?? {};\n if (node === this.#document.activeElement && node.tabIndex >= 0 &&\n (astName === 'focus' ||\n (type === 'keydown' && node.contains(target)))) {\n let refNode = node;\n let focus = true;\n while (refNode) {\n if (refNode.disabled || refNode.hasAttribute('disabled') ||\n refNode.hidden || refNode.hasAttribute('hidden')) {\n focus = false;\n break;\n } else {\n const { display, visibility } =\n this.#window.getComputedStyle(refNode);\n focus = !(display === 'none' || visibility === 'hidden');\n if (!focus) {\n break;\n }\n }\n if (refNode.parentNode &&\n refNode.parentNode.nodeType === ELEMENT_NODE) {\n refNode = refNode.parentNode;\n } else {\n break;\n }\n }\n if (focus) {\n matched.add(node);\n }\n }\n break;\n }\n case 'focus-within': {\n let active;\n let current = this.#document.activeElement;\n if (current.tabIndex >= 0) {\n while (current) {\n if (current === node) {\n active = true;\n break;\n }\n current = current.parentNode;\n }\n }\n if (active) {\n let refNode = node;\n let focus = true;\n while (refNode) {\n if (refNode.disabled || refNode.hasAttribute('disabled') ||\n refNode.hidden || refNode.hasAttribute('hidden')) {\n focus = false;\n break;\n } else {\n const { display, visibility } =\n this.#window.getComputedStyle(refNode);\n focus = !(display === 'none' || visibility === 'hidden');\n if (!focus) {\n break;\n }\n }\n if (refNode.parentNode &&\n refNode.parentNode.nodeType === ELEMENT_NODE) {\n refNode = refNode.parentNode;\n } else {\n break;\n }\n }\n if (focus) {\n matched.add(node);\n }\n }\n break;\n }\n case 'open': {\n if (REG_INTERACT.test(localName) && node.hasAttribute('open')) {\n matched.add(node);\n }\n break;\n }\n case 'closed': {\n if (REG_INTERACT.test(localName) && !node.hasAttribute('open')) {\n matched.add(node);\n }\n break;\n }\n case 'disabled': {\n if (REG_FORM_CTRL.test(localName) ||\n isCustomElement(node, { formAssociated: true })) {\n if (node.disabled || node.hasAttribute('disabled')) {\n matched.add(node);\n } else if (node.localName === 'option') {\n if (parentNode.localName === 'optgroup' &&\n (parentNode.disabled ||\n parentNode.hasAttribute('disabled'))) {\n matched.add(node);\n }\n } else if (node.localName !== 'optgroup') {\n let bool;\n let parent = parentNode;\n while (parent) {\n if (parent.localName === 'fieldset' &&\n (parent.disabled || parent.hasAttribute('disabled'))) {\n const walker = this.#walker;\n let refNode = traverseNode(parent, walker);\n refNode = walker.firstChild();\n while (refNode) {\n if (refNode.localName === 'legend') {\n break;\n }\n refNode = walker.nextSibling();\n }\n if (refNode) {\n if (!refNode.contains(node)) {\n bool = true;\n }\n } else {\n bool = true;\n }\n break;\n } else if (parent.localName === 'form') {\n break;\n } else if (parent.parentNode?.nodeType === ELEMENT_NODE) {\n if (parent.parentNode.localName === 'form') {\n break;\n } else {\n parent = parent.parentNode;\n }\n } else {\n break;\n }\n }\n if (bool) {\n matched.add(node);\n }\n }\n }\n break;\n }\n case 'enabled': {\n if ((REG_FORM_CTRL.test(localName) ||\n isCustomElement(node, { formAssociated: true })) &&\n !(node.disabled && node.hasAttribute('disabled'))) {\n if (node.localName === 'optgroup') {\n matched.add(node);\n } else if (node.localName === 'option') {\n if (parentNode.localName !== 'optgroup' ||\n !(parentNode.disabled ||\n parentNode.hasAttribute('disabled'))) {\n matched.add(node);\n }\n } else {\n let bool;\n let parent = parentNode;\n while (parent) {\n if (parent.localName === 'fieldset' &&\n (parent.disabled || parent.hasAttribute('disabled'))) {\n const walker = this.#walker;\n let refNode = traverseNode(parent, walker);\n refNode = walker.firstChild();\n while (refNode) {\n if (refNode.localName === 'legend') {\n break;\n }\n refNode = walker.nextSibling();\n }\n if (refNode) {\n if (!refNode.contains(node)) {\n bool = true;\n }\n } else {\n bool = true;\n }\n break;\n } else if (parent.localName === 'form') {\n break;\n } else if (parent.parentNode?.nodeType === ELEMENT_NODE) {\n if (parent.parentNode.localName === 'form') {\n break;\n } else {\n parent = parent.parentNode;\n }\n } else {\n break;\n }\n }\n if (!bool) {\n matched.add(node);\n }\n }\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 || REG_TYPE_DATE.test(node.type) ||\n REG_TYPE_TEXT.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 || REG_TYPE_DATE.test(node.type) ||\n REG_TYPE_TEXT.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 placeholder;\n if (node.placeholder) {\n placeholder = node.placeholder;\n } else if (node.hasAttribute('placeholder')) {\n placeholder = node.getAttribute('placeholder');\n }\n if (typeof placeholder === 'string' && !/[\\r\\n]/.test(placeholder)) {\n let targetNode;\n if (localName === 'textarea') {\n targetNode = node;\n } else if (localName === 'input') {\n if (node.hasAttribute('type')) {\n if (REG_TYPE_TEXT.test(node.getAttribute('type'))) {\n targetNode = node;\n }\n } else {\n targetNode = node;\n }\n }\n if (targetNode && node.value === '') {\n matched.add(node);\n }\n }\n break;\n }\n case 'checked': {\n if ((node.checked && localName === 'input' &&\n node.hasAttribute('type') &&\n REG_TYPE_CHECK.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 const items = parent.getElementsByTagName('input');\n const l = items.length;\n let checked;\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 if (!checked) {\n matched.add(node);\n }\n }\n break;\n }\n case 'default': {\n // button[type=\"submit\"], input[type=\"submit\"], input[type=\"image\"]\n if ((localName === 'button' &&\n !(node.hasAttribute('type') &&\n REG_TYPE_RESET.test(node.getAttribute('type')))) ||\n (localName === 'input' && node.hasAttribute('type') &&\n REG_TYPE_SUBMIT.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 = this.#walker;\n let nextNode = traverseNode(form, walker);\n nextNode = walker.firstChild();\n while (nextNode && form.contains(nextNode)) {\n const nodeName = nextNode.localName;\n let m;\n if (nodeName === 'button') {\n m = !(nextNode.hasAttribute('type') &&\n REG_TYPE_RESET.test(nextNode.getAttribute('type')));\n } else if (nodeName === 'input') {\n m = nextNode.hasAttribute('type') &&\n REG_TYPE_SUBMIT.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 REG_TYPE_CHECK.test(node.getAttribute('type')) &&\n node.hasAttribute('checked')) {\n matched.add(node);\n // option\n } else if (localName === 'option' && node.hasAttribute('selected')) {\n matched.add(node);\n }\n break;\n }\n case 'valid': {\n if (REG_FORM_VALID.test(localName)) {\n if (node.checkValidity()) {\n if (node.maxLength >= 0) {\n if (node.maxLength >= node.value.length) {\n matched.add(node);\n }\n } else {\n matched.add(node);\n }\n }\n } else if (localName === 'fieldset') {\n const walker = this.#walker;\n let refNode = traverseNode(node, walker);\n refNode = walker.firstChild();\n let bool;\n if (!refNode) {\n bool = true;\n } else {\n while (refNode && node.contains(refNode)) {\n if (REG_FORM_VALID.test(refNode.localName)) {\n if (refNode.checkValidity()) {\n if (refNode.maxLength >= 0) {\n bool = refNode.maxLength >= refNode.value.length;\n } else {\n bool = true;\n }\n } else {\n bool = false;\n }\n if (!bool) {\n break;\n }\n }\n refNode = walker.nextNode();\n }\n }\n if (bool) {\n matched.add(node);\n }\n }\n break;\n }\n case 'invalid': {\n if (REG_FORM_VALID.test(localName)) {\n if (node.checkValidity()) {\n if (node.maxLength >= 0 && node.maxLength < node.value.length) {\n matched.add(node);\n }\n } else {\n matched.add(node);\n }\n } else if (localName === 'fieldset') {\n const walker = this.#walker;\n let refNode = traverseNode(node, walker);\n refNode = walker.firstChild();\n let bool;\n if (!refNode) {\n bool = true;\n } else {\n while (refNode && node.contains(refNode)) {\n if (REG_FORM_VALID.test(refNode.localName)) {\n if (refNode.checkValidity()) {\n if (refNode.maxLength >= 0) {\n bool = refNode.maxLength >= refNode.value.length;\n } else {\n bool = true;\n }\n } else {\n bool = false;\n }\n if (!bool) {\n break;\n }\n }\n refNode = walker.nextNode();\n }\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 REG_TYPE_RANGE.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 REG_TYPE_RANGE.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' || REG_TYPE_CHECK.test(inputType) ||\n REG_TYPE_DATE.test(inputType) ||\n REG_TYPE_TEXT.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' || REG_TYPE_CHECK.test(inputType) ||\n REG_TYPE_DATE.test(inputType) ||\n REG_TYPE_TEXT.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 const walker = this.#document.createTreeWalker(node, SHOW_ALL);\n let refNode = walker.firstChild();\n let bool;\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 'defined': {\n if (node.hasAttribute('is') || localName.includes('-')) {\n if (isCustomElement(node)) {\n matched.add(node);\n }\n // NOTE: MathMLElement not implemented in jsdom\n } else if (node instanceof this.#window.HTMLElement ||\n node instanceof this.#window.SVGElement) {\n matched.add(node);\n }\n break;\n }\n case 'popover-open': {\n if (node.popover) {\n const { display } = this.#window.getComputedStyle(node);\n if (display !== 'none') {\n matched.add(node);\n }\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 // not supported\n case 'autofill':\n case 'blank':\n case 'buffering':\n case 'current':\n case 'fullscreen':\n case 'future':\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, name: astName } = ast;\n let res;\n if (Array.isArray(astChildren)) {\n const { branches } = walkAST(astChildren[0]);\n const [branch] = branches;\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 parent = host;\n let bool;\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 matched = new Set();\n if (ast.name === EMPTY) {\n return matched;\n }\n const astName = unescapeSelector(ast.name);\n if (typeof astName === 'string' && astName !== ast.name) {\n ast.name = astName;\n }\n if (node.nodeType === ELEMENT_NODE) {\n switch (astType) {\n case SELECTOR_PSEUDO_ELEMENT: {\n matcher.matchPseudoElementSelector(astName, opt);\n break;\n }\n case SELECTOR_ID: {\n if (node.id === astName) {\n matched.add(node);\n }\n break;\n }\n case SELECTOR_CLASS: {\n if (node.classList.contains(astName)) {\n matched.add(node);\n }\n break;\n }\n case SELECTOR_PSEUDO_CLASS: {\n const nodes = this._matchPseudoClassSelector(ast, node, opt);\n return nodes;\n }\n default: {\n const res = matcher.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 return nodes;\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 let result = this.#results.get(leaves);\n if (result && result.has(node)) {\n const { matched } = result.get(node);\n bool = matched;\n }\n if (typeof bool !== 'boolean') {\n let cacheable = true;\n if (node.nodeType === ELEMENT_NODE && REG_FORM.test(node.localName)) {\n cacheable = false;\n }\n for (const leaf of leaves) {\n switch (leaf.type) {\n case SELECTOR_ATTR:\n case SELECTOR_ID: {\n cacheable = false;\n break;\n }\n case SELECTOR_PSEUDO_CLASS: {\n if (REG_INVALIDATE_PSEUDO.test(leaf.name)) {\n cacheable = false;\n }\n break;\n }\n default:\n }\n bool = this._matchSelector(leaf, node, opt).has(node);\n if (!bool) {\n break;\n }\n }\n if (cacheable && !this.#invalidate) {\n if (!result) {\n result = new WeakMap();\n }\n result.set(node, {\n matched: bool\n });\n this.#results.set(leaves, result);\n }\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 const 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 return 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 compound = filterLeaves.length > 0;\n const { type: leafType } = leaf;\n const leafName = unescapeSelector(leaf.name);\n if (typeof leafName === 'string' && leafName !== leaf.name) {\n leaf.name = leafName;\n }\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 matcher.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 { parentNode } = node;\n const { dir } = opt;\n const 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 if (parentNode) {\n const walker = this._createTreeWalker(parentNode);\n let refNode = traverseNode(node, walker);\n refNode = walker.nextSibling();\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._createTreeWalker(node);\n let refNode = traverseNode(node, walker);\n 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 return nodes;\n }\n if (pending) {\n const walker = this._createTreeWalker(node);\n let refNode = traverseNode(node, walker);\n refNode = walker.nextNode();\n while (refNode && node.contains(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 if (parentNode) {\n const walker = this._createTreeWalker(parentNode);\n let refNode = traverseNode(parentNode, walker);\n 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 }\n break;\n }\n case '>': {\n if (parentNode) {\n const bool = this._matchLeaves(leaves, parentNode, opt);\n if (bool) {\n matched.add(parentNode);\n }\n }\n break;\n }\n case ' ':\n default: {\n const arr = [];\n let refNode = 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 return new Set(arr.reverse());\n }\n }\n }\n }\n return matched;\n }\n\n /**\n * find matched node from #qswalker\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 const walker = this.#qswalker;\n let refNode = traverseNode(node, walker);\n let matchedNode;\n if (refNode) {\n if (refNode.nodeType !== ELEMENT_NODE) {\n refNode = walker.nextNode();\n } else if (refNode === node) {\n if (refNode !== this.#root) {\n refNode = walker.nextNode();\n }\n }\n while (refNode) {\n const matched = this._matchLeaves(leaves, refNode, {\n warn: this.#warn\n });\n if (matched) {\n matchedNode = refNode;\n break;\n }\n refNode = walker.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 const bool = this._matchLeaves(leaves, this.#node, {\n warn: this.#warn\n });\n let filtered = false;\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} leaves - AST leaves\n * @param {object} opt - options\n * @returns {Array} - [nodes, filtered]\n */\n _findLineal(leaves, opt = {}) {\n const { complex } = opt;\n const nodes = [];\n let bool = this._matchLeaves(leaves, this.#node, {\n warn: this.#warn\n });\n let filtered = false;\n if (bool) {\n nodes.push(this.#node);\n filtered = true;\n }\n if (!bool || complex) {\n let refNode = this.#node.parentNode;\n while (refNode) {\n bool = this._matchLeaves(leaves, refNode, {\n warn: this.#warn\n });\n if (bool) {\n nodes.push(refNode);\n filtered = true;\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 const node = this._findNode(leaves, {\n node: this.#node\n });\n let filtered = false;\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 { complex, compound, filterLeaves, targetType } = opt;\n let nodes = [];\n let filtered = false;\n let collected = 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 &&\n (this.#node.contains(node) || node.contains(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 if (targetType === TARGET_FIRST) {\n break;\n }\n }\n } else {\n nodes.push(node);\n filtered = true;\n if (targetType === TARGET_FIRST) {\n break;\n }\n }\n }\n }\n } else if (complex) {\n 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 if (targetType === TARGET_FIRST) {\n break;\n }\n }\n }\n } else {\n nodes = [].slice.call(items);\n filtered = true;\n collected = true;\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 if (targetType === TARGET_FIRST) {\n break;\n }\n }\n }\n } else {\n nodes = [].slice.call(items);\n filtered = true;\n collected = true;\n }\n }\n return [nodes, filtered, collected];\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 compound = filterLeaves.length > 0;\n const { name: leafName, type: leafType } = leaf;\n let nodes = [];\n let collected = false;\n let filtered = false;\n let pending = false;\n switch (leafType) {\n case SELECTOR_PSEUDO_ELEMENT: {\n matcher.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(leaves, {\n complex\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 if (targetType === TARGET_FIRST) {\n [nodes, filtered] = this._findFirst(leaves);\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(leaves, {\n complex\n });\n } else if (this.#root.nodeType === DOCUMENT_NODE) {\n const items = this.#root.getElementsByClassName(leafName);\n if (items.length) {\n [nodes, filtered, collected] = this._findFromHTMLCollection(items, {\n complex,\n compound,\n filterLeaves,\n targetType\n });\n }\n } else if (targetType === TARGET_FIRST) {\n [nodes, filtered] = this._findFirst(leaves);\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(leaves, {\n complex\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 if (items.length) {\n [nodes, filtered, collected] = this._findFromHTMLCollection(items, {\n complex,\n compound,\n filterLeaves,\n targetType\n });\n }\n } else if (targetType === TARGET_FIRST) {\n [nodes, filtered] = this._findFirst(leaves);\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(leaves, {\n complex\n });\n } else if (targetType === TARGET_FIRST) {\n [nodes, filtered] = this._findFirst(leaves);\n } else {\n pending = true;\n }\n }\n }\n return {\n collected,\n compound,\n filtered,\n nodes,\n pending\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 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 ||\n 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 for (const { combo, leaves: [leaf] } of branch) {\n const { name: leafName, type: leafType } = leaf;\n if (leafType === SELECTOR_PSEUDO_CLASS && leafName === 'dir') {\n bool = false;\n break;\n }\n if (!bool && combo) {\n const { name: comboName } = combo;\n if (/^[+~]$/.test(comboName)) {\n bool = 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 const {\n collected, 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].collected = collected;\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.#qswalker;\n } else {\n node = this.#root;\n walker = this.#walker;\n }\n let nextNode = traverseNode(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 if (nextNode !== walker.currentNode) {\n nextNode = traverseNode(nextNode, walker);\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 * get combined nodes\n * @private\n * @param {object} twig - twig\n * @param {object} nodes - collection of nodes\n * @param {string} dir - direction\n * @returns {Array.<object>} - collection of matched nodes\n */\n _getCombinedNodes(twig, nodes, dir) {\n const arr = [];\n for (const node of nodes) {\n const matched = this._matchCombinator(twig, node, {\n dir,\n warn: this.#warn\n });\n if (matched.size) {\n arr.push(...matched);\n }\n }\n if (arr.length) {\n return new Set(arr);\n }\n return new Set();\n }\n\n /**\n * match node to next direction\n * @private\n * @param {Array} branch - branch\n * @param {Set.<object>} nodes - collection of Element node\n * @param {object} opt - option\n * @param {object} opt.combo - combo\n * @returns {?object} - matched node\n */\n _matchNodeNext(branch, nodes, opt) {\n const { combo, index } = opt;\n const { combo: nextCombo, leaves } = branch[index];\n const twig = {\n combo,\n leaves\n };\n const nextNodes = this._getCombinedNodes(twig, nodes, DIR_NEXT);\n let res;\n if (nextNodes.size) {\n if (index === branch.length - 1) {\n const [nextNode] = sortNodes(nextNodes);\n res = nextNode;\n } else {\n res = this._matchNodeNext(branch, nextNodes, {\n combo: nextCombo,\n index: index + 1\n });\n }\n }\n return res ?? null;\n }\n\n /**\n * match node to previous direction\n * @private\n * @param {Array} branch - branch\n * @param {object} node - Element node\n * @param {object} opt - option\n * @param {number} opt.index - index\n * @returns {?object} - node\n */\n _matchNodePrev(branch, node, opt) {\n const { index } = opt;\n const twig = branch[index];\n const nodes = new Set([node]);\n const nextNodes = this._getCombinedNodes(twig, nodes, DIR_PREV);\n let res;\n if (nextNodes.size) {\n if (index === 0) {\n res = node;\n } else {\n for (const nextNode of nextNodes) {\n const matched = this._matchNodePrev(branch, nextNode, {\n index: index - 1\n });\n if (matched) {\n return node;\n }\n }\n }\n }\n return res ?? null;\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 if (targetType === TARGET_ALL || targetType === TARGET_FIRST) {\n this._prepareQuerySelectorWalker();\n }\n const [[...branches], collectedNodes] = this._collectNodes(targetType);\n const l = branches.length;\n let sort;\n let nodes = new Set();\n for (let i = 0; i < l; i++) {\n const { branch, collected, dir, find } = branches[i];\n const branchLen = branch.length;\n if (branchLen && find) {\n const entryNodes = collectedNodes[i];\n const entryNodesLen = entryNodes.length;\n const lastIndex = branchLen - 1;\n if (lastIndex === 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 (targetType === TARGET_ALL) {\n if (nodes.size) {\n const n = [...nodes];\n nodes = new Set([...n, ...entryNodes]);\n sort = true;\n } else {\n nodes = new Set(entryNodes);\n }\n } else {\n const [node] = entryNodes;\n nodes.add(node);\n }\n } else if (targetType === TARGET_ALL) {\n if (dir === DIR_NEXT) {\n let { combo } = branch[0];\n for (const node of entryNodes) {\n let nextNodes = new Set([node]);\n for (let j = 1; j < branchLen; j++) {\n const { combo: nextCombo, leaves } = branch[j];\n const twig = {\n combo,\n leaves\n };\n nextNodes = this._getCombinedNodes(twig, nextNodes, dir);\n if (nextNodes.size) {\n if (j === lastIndex) {\n if (nodes.size) {\n const n = [...nodes];\n nodes = new Set([...n, ...nextNodes]);\n sort = true;\n } else {\n nodes = nextNodes;\n }\n } else {\n combo = nextCombo;\n }\n } else {\n break;\n }\n }\n }\n } else {\n for (const node of entryNodes) {\n let nextNodes = new Set([node]);\n for (let j = lastIndex - 1; j >= 0; j--) {\n const twig = branch[j];\n nextNodes = this._getCombinedNodes(twig, nextNodes, dir);\n if (nextNodes.size) {\n if (j === 0) {\n nodes.add(node);\n if (branchLen > 1 && nodes.size > 1) {\n sort = true;\n }\n }\n } else {\n break;\n }\n }\n }\n }\n } else if (targetType === TARGET_FIRST && dir === DIR_NEXT) {\n const { combo: entryCombo } = branch[0];\n let matched;\n for (const node of entryNodes) {\n matched = this._matchNodeNext(branch, new Set([node]), {\n combo: entryCombo,\n index: 1\n });\n if (matched) {\n nodes.add(matched);\n break;\n }\n }\n if (!matched && !collected) {\n const { leaves: entryLeaves } = branch[0];\n const [entryNode] = entryNodes;\n let refNode = this._findNode(entryLeaves, {\n node: entryNode\n });\n while (refNode) {\n matched = this._matchNodeNext(branch, new Set([refNode]), {\n combo: entryCombo,\n index: 1\n });\n if (matched) {\n nodes.add(matched);\n break;\n }\n refNode = this._findNode(entryLeaves, {\n node: refNode\n });\n }\n }\n } else {\n let matched;\n for (const node of entryNodes) {\n matched = this._matchNodePrev(branch, node, {\n index: lastIndex - 1\n });\n if (matched) {\n nodes.add(node);\n break;\n }\n }\n if (!matched && !collected && targetType === TARGET_FIRST) {\n const { leaves: entryLeaves } = branch[lastIndex];\n const [entryNode] = entryNodes;\n let refNode = this._findNode(entryLeaves, {\n node: entryNode\n });\n while (refNode) {\n matched = this._matchNodePrev(branch, refNode, {\n index: lastIndex - 1\n });\n if (matched) {\n nodes.add(refNode);\n break;\n }\n refNode = this._findNode(entryLeaves, {\n node: refNode\n });\n }\n }\n }\n }\n }\n if (targetType === TARGET_ALL && sort) {\n nodes = new Set(sortNodes(nodes));\n }\n return nodes;\n }\n};\n"],
|
|
5
|
-
"mappings": "4ZAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,YAAAE,IAAA,eAAAC,EAAAH,GAKA,IAAAI,EAGO,yBACPC,EAAwB,wBACxBC,EAEO,uBAGPC,EASO,yBACP,MAAMC,EAAW,OACXC,EAAW,OA0BV,MAAMP,CAAO,CAElBQ,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAMA,YAAYC,EAAQ,CAClB,KAAKD,GAAUC,EACf,KAAKjB,GAAY,IAAI,QACrB,KAAKG,GAAiB,IAAI,QAC1B,KAAKO,GAAW,IAAI,OACtB,CASA,SAASQ,EAAG,CACV,GAAI,CAAC,KAAKV,GACR,GAAIU,aAAa,cACbA,aAAa,KAAKF,GAAQ,aAC5B,GAAIE,EAAE,OAAS,oBACT,KAAKH,IACP,QAAQ,KAAKG,EAAE,OAAO,MAGxB,OAAM,IAAI,KAAKF,GAAQ,aAAaE,EAAE,QAASA,EAAE,IAAI,MAGvD,OAAMA,CAGZ,CAaA,OAAOC,EAAUC,EAAMC,EAAM,CAAC,EAAG,CAC/B,KAAM,CAAE,MAAAC,EAAO,SAAAC,EAAU,KAAAC,CAAK,EAAIH,EAClC,YAAKb,GAAY,CAAC,CAACe,EACnB,KAAKR,GAAQ,CAAC,CAACS,EACf,KAAKpB,GAAS,KAAK,UAAUkB,CAAK,EAClC,KAAKhB,GAAQc,EACb,CAAC,KAAKlB,GAAW,KAAKS,GAAO,KAAKE,EAAO,KAAI,kBAAeO,CAAI,EAChE,KAAKR,MAAU,kBAAeQ,CAAI,EAClC,CAAC,KAAKrB,GAAM,KAAKQ,EAAM,EAAI,KAAK,YAAYY,CAAQ,EACpD,KAAKL,GAAW,IAAI,QACpB,KAAKT,GAAc,GACZe,CACT,CAQA,UAAUE,EAAO,CAEf,OAAQA,aAAiB,KAAKN,GAAQ,eAC9BM,aAAiB,KAAKN,GAAQ,WAClCM,EACA,IACN,CAQA,YAAYH,EAAU,CACpB,MAAMM,EAAQ,CAAC,EACf,KAAKxB,GAAc,GACnB,IAAIyB,EACJ,GAAI,KAAKvB,GAAe,IAAI,KAAKD,EAAS,EAAG,CAC3C,MAAMyB,EAAa,KAAKxB,GAAe,IAAI,KAAKD,EAAS,EACzD,GAAIyB,GAAcA,EAAW,IAAI,GAAGR,CAAQ,EAAE,EAAG,CAC/C,MAAMS,EAAOD,EAAW,IAAI,GAAGR,CAAQ,EAAE,EACzCO,EAAME,EAAK,IACX,KAAK3B,GAAc2B,EAAK,UAC1B,CACF,CACA,GAAIF,EAAK,CACP,MAAMG,EAAIH,EAAI,OACd,QAASI,EAAI,EAAGA,EAAID,EAAGC,IACrBJ,EAAII,CAAC,EAAE,UAAY,GACnBJ,EAAII,CAAC,EAAE,IAAM,KACbJ,EAAII,CAAC,EAAE,SAAW,GAClBJ,EAAII,CAAC,EAAE,KAAO,GACdL,EAAMK,CAAC,EAAI,CAAC,CAEhB,KAAO,CACL,IAAIC,EACJ,GAAI,CACFA,KAAS,iBAAcZ,CAAQ,CACjC,OAASD,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,KAAM,CAAE,SAAAc,CAAS,KAAI,WAAQD,CAAM,EACnC,IAAIE,EAAa,GACbH,EAAI,EACRJ,EAAM,CAAC,EACP,SAAW,CAAC,GAAGQ,CAAK,IAAKF,EAAU,CACjC,MAAMG,EAAS,CAAC,EAChB,IAAIP,EAAOM,EAAM,MAAM,EACvB,GAAIN,GAAQA,EAAK,OAAS,aAAY,CACpC,MAAMQ,EAAS,IAAI,IACnB,KAAOR,GAAM,CACX,GAAIA,EAAK,OAAS,aAAY,CAC5B,KAAM,CAACS,CAAQ,EAAIH,EACnB,GAAIG,EAAS,OAAS,aAAY,CAChC,MAAMC,EAAM,oBAAoBnB,CAAQ,GACxC,MAAM,IAAI,aAAamB,EAAK,YAAU,CACxC,CACA,MAAMC,EAAWX,EAAK,KAClB,UAAU,KAAKW,CAAQ,IACzBN,EAAa,IAEfE,EAAO,KAAK,CACV,MAAOP,EACP,UAAQ,WAAQQ,CAAM,CACxB,CAAC,EACDA,EAAO,MAAM,CACf,SAAWR,EAAM,CACf,GAAI,CAAE,KAAMW,CAAS,EAAIX,EACrBW,GAAY,OAAOA,GAAa,WAClCA,KAAW,oBAAiBA,CAAQ,EAChC,OAAOA,GAAa,UAAYA,IAAaX,EAAK,OACpDA,EAAK,KAAOW,GAEV,OAAO,KAAKA,CAAQ,IACtBX,EAAK,UAAY,KAGrBQ,EAAO,IAAIR,CAAI,CACjB,CACA,GAAIM,EAAM,OACRN,EAAOM,EAAM,MAAM,MACd,CACLC,EAAO,KAAK,CACV,MAAO,KACP,UAAQ,WAAQC,CAAM,CACxB,CAAC,EACDA,EAAO,MAAM,EACb,KACF,CACF,CACF,CACAV,EAAI,KAAK,CACP,OAAAS,EACA,UAAW,GACX,IAAK,KACL,SAAU,GACV,KAAM,EACR,CAAC,EACDV,EAAMK,CAAC,EAAI,CAAC,EACZA,GACF,CACA,IAAIH,EACA,KAAKxB,GAAe,IAAI,KAAKD,EAAS,EACxCyB,EAAa,KAAKxB,GAAe,IAAI,KAAKD,EAAS,EAEnDyB,EAAa,IAAI,IAEnBA,EAAW,IAAI,GAAGR,CAAQ,GAAI,CAC5B,IAAAO,EACA,WAAAO,CACF,CAAC,EACD,KAAK9B,GAAe,IAAI,KAAKD,GAAWyB,CAAU,EAClD,KAAK1B,GAAcgC,CACrB,CACA,MAAO,CACLP,EACAD,CACF,CACF,CAQA,kBAAkBL,EAAM,CACtB,IAAIoB,EACJ,OAAI,KAAK1B,GAAS,IAAIM,CAAI,EACxBoB,EAAS,KAAK1B,GAAS,IAAIM,CAAI,GAE/BoB,EAAS,KAAKtC,GAAU,iBAAiBkB,EAAM,eAAa,EAC5D,KAAKN,GAAS,IAAIM,EAAMoB,CAAM,GAEzBA,CACT,CAOA,6BAA8B,CAC5B,YAAK/B,GAAY,KAAK,kBAAkB,KAAKH,EAAK,EAC3C,KAAKG,EACd,CAcA,iBAAiBgC,EAAKrB,EAAMC,EAAK,CAC/B,KAAM,CAAE,EAAAqB,EAAG,EAAAC,EAAG,QAAAC,EAAS,SAAAzB,CAAS,EAAIsB,EAC9B,CAAE,WAAAI,CAAW,EAAIzB,EACjB0B,EAAU,IAAI,IACpB,IAAIC,EACJ,GAAI5B,EACF,GAAI,KAAKnB,GAAU,IAAImB,CAAQ,EAC7B4B,EAAmB,KAAK/C,GAAU,IAAImB,CAAQ,MACzC,CACL,KAAM,CAAE,SAAAa,EAAU,KAAAgB,CAAK,KAAI,WAAQ7B,CAAQ,EAC3C4B,EAAmBf,EACnB,KAAKhC,GAAU,IAAImB,EAAU4B,CAAgB,EACzCC,EAAK,uBACP,KAAK3C,GAAc,GAEvB,CAEF,GAAIwC,EAAY,CACd,MAAML,EAAS,KAAK3B,GACpB,IAAIoC,KAAU,gBAAaJ,EAAYL,CAAM,EAC7CS,EAAUT,EAAO,WAAW,EAC5B,IAAIX,EAAI,EACR,KAAOoB,GACLpB,IACAoB,EAAUT,EAAO,YAAY,EAE/B,MAAMU,EAAgB,IAAI,IAC1B,GAAIH,EAGF,IAFAE,KAAU,gBAAaJ,EAAYL,CAAM,EACzCS,EAAUT,EAAO,WAAW,EACrBS,GAAS,CACd,KAAM,CAAE,QAAAE,EAAS,WAAAC,CAAW,EAC1B,KAAKpC,GAAQ,iBAAiBiC,CAAO,EACvC,GAAIE,IAAY,QAAUC,IAAe,SAAU,CACjD,IAAIC,EACJ,UAAWjB,KAAUW,EAEnB,GADAM,EAAO,KAAK,aAAajB,EAAQa,EAAS5B,CAAG,EACzC,CAACgC,EACH,MAGAA,GACFH,EAAc,IAAID,CAAO,CAE7B,CACAA,EAAUT,EAAO,YAAY,CAC/B,CAGF,GAAIE,IAAM,GACR,GAAIC,EAAI,GAAKA,GAAKd,GAChB,GAAIqB,EAAc,KAAM,CACtBD,KAAU,gBAAaJ,EAAYL,CAAM,EACrCI,EACFK,EAAUT,EAAO,UAAU,EAE3BS,EAAUT,EAAO,WAAW,EAE9B,IAAIV,EAAI,EACR,KAAOmB,GAAS,CACd,GAAIC,EAAc,IAAID,CAAO,EAAG,CAC9B,GAAInB,IAAMa,EAAI,EAAG,CACfG,EAAQ,IAAIG,CAAO,EACnB,KACF,CACAnB,GACF,CACIc,EACFK,EAAUT,EAAO,gBAAgB,EAEjCS,EAAUT,EAAO,YAAY,CAEjC,CACF,SAAW,CAACrB,EAAU,CACpB8B,KAAU,gBAAaJ,EAAYL,CAAM,EACrCI,EACFK,EAAUT,EAAO,UAAU,EAE3BS,EAAUT,EAAO,WAAW,EAE9B,IAAIV,EAAI,EACR,KAAOmB,GAAS,CACd,GAAInB,IAAMa,EAAI,EAAG,CACfG,EAAQ,IAAIG,CAAO,EACnB,KACF,CACIL,EACFK,EAAUT,EAAO,gBAAgB,EAEjCS,EAAUT,EAAO,YAAY,EAE/BV,GACF,CACF,OAGG,CACL,IAAIwB,EAAMX,EAAI,EACd,GAAID,EAAI,EACN,KAAOY,EAAM,GACXA,GAAOZ,EAGX,GAAIY,GAAO,GAAKA,EAAMzB,EAAG,CACvBoB,KAAU,gBAAaJ,EAAYL,CAAM,EACrCI,EACFK,EAAUT,EAAO,UAAU,EAE3BS,EAAUT,EAAO,WAAW,EAE9B,IAAIV,EAAI,EACJyB,EAAIb,EAAI,EAAI,EAAIC,EAAI,EACxB,KAAOM,IACDA,GAAWK,GAAO,GAAKA,EAAMzB,IAC3BqB,EAAc,KACZA,EAAc,IAAID,CAAO,IACvBM,IAAMD,IACRR,EAAQ,IAAIG,CAAO,EACnBK,GAAOZ,GAELA,EAAI,EACNa,IAEAA,KAGKzB,IAAMwB,IACVnC,GACH2B,EAAQ,IAAIG,CAAO,EAErBK,GAAOZ,GAELE,EACFK,EAAUT,EAAO,gBAAgB,EAEjCS,EAAUT,EAAO,YAAY,EAE/BV,GAKN,CACF,CACA,GAAIc,GAAWE,EAAQ,KAAO,EAAG,CAC/B,MAAM,EAAI,CAAC,GAAGA,CAAO,EACrB,OAAO,IAAI,IAAI,EAAE,QAAQ,CAAC,CAC5B,CACF,SAAW1B,IAAS,KAAKT,IAAU+B,EAAIC,IAAO,EAC5C,GAAII,EAAkB,CACpB,IAAIM,EACJ,UAAWjB,KAAUW,EAEnB,GADAM,EAAO,KAAK,aAAajB,EAAQhB,EAAMC,CAAG,EACtCgC,EACF,MAGAA,GACFP,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,UAAAe,EAAW,WAAAX,EAAY,OAAAY,CAAO,EAAIrC,EACpC0B,EAAU,IAAI,IACpB,GAAID,EAAY,CACd,MAAML,EAAS,KAAK3B,GACpB,IAAIoC,KAAU,gBAAaJ,EAAYL,CAAM,EAC7CS,EAAUT,EAAO,WAAW,EAC5B,IAAIX,EAAI,EACR,KAAOoB,GACLpB,IACAoB,EAAUT,EAAO,YAAY,EAG/B,GAAIE,IAAM,GACR,GAAIC,EAAI,GAAKA,GAAKd,EAAG,CACnBoB,KAAU,gBAAaJ,EAAYL,CAAM,EACrCI,EACFK,EAAUT,EAAO,UAAU,EAE3BS,EAAUT,EAAO,WAAW,EAE9B,IAAIe,EAAI,EACR,KAAON,GAAS,CACd,KAAM,CAAE,UAAWS,EAAe,OAAQC,CAAW,EAAIV,EACzD,GAAIS,IAAkBF,GAAaG,IAAeF,EAAQ,CACxD,GAAIF,IAAMZ,EAAI,EAAG,CACfG,EAAQ,IAAIG,CAAO,EACnB,KACF,CACAM,GACF,CACIX,EACFK,EAAUT,EAAO,gBAAgB,EAEjCS,EAAUT,EAAO,YAAY,CAEjC,CACF,MAEK,CACL,IAAIc,EAAMX,EAAI,EACd,GAAID,EAAI,EACN,KAAOY,EAAM,GACXA,GAAOZ,EAGX,GAAIY,GAAO,GAAKA,EAAMzB,EAAG,CACvBoB,KAAU,gBAAaJ,EAAYL,CAAM,EACrCI,EACFK,EAAUT,EAAO,UAAU,EAE3BS,EAAUT,EAAO,WAAW,EAE9B,IAAIe,EAAIb,EAAI,EAAI,EAAIC,EAAI,EACxB,KAAOM,GAAS,CACd,KAAM,CAAE,UAAWS,EAAe,OAAQC,CAAW,EAAIV,EACzD,GAAIS,IAAkBF,GAAaG,IAAeF,EAAQ,CAKxD,GAJIF,IAAMD,IACRR,EAAQ,IAAIG,CAAO,EACnBK,GAAOZ,GAELY,EAAM,GAAKA,GAAOzB,EACpB,MACSa,EAAI,EACba,IAEAA,GAEJ,CACIX,EACFK,EAAUT,EAAO,gBAAgB,EAEjCS,EAAUT,EAAO,YAAY,CAEjC,CACF,CACF,CACA,GAAII,GAAWE,EAAQ,KAAO,EAAG,CAC/B,MAAMc,EAAI,CAAC,GAAGd,CAAO,EACrB,OAAO,IAAI,IAAIc,EAAE,QAAQ,CAAC,CAC5B,CACF,MAAWxC,IAAS,KAAKT,IAAU+B,EAAIC,IAAO,GAC5CG,EAAQ,IAAI1B,CAAI,EAElB,OAAO0B,CACT,CAWA,cAAcpB,EAAKN,EAAMyC,EAASxC,EAAK,CACrC,KAAM,CACJ,IAAK,CACH,EAAAqB,EACA,EAAAC,EACA,KAAMmB,CACR,EACA,SAAA3C,CACF,EAAIO,EACEqC,EAAS,IAAI,IA2BnB,GA1BID,GACEA,IAAiB,QACnBC,EAAO,IAAI,IAAK,CAAC,EACjBA,EAAO,IAAI,IAAK,CAAC,GACRD,IAAiB,QAC1BC,EAAO,IAAI,IAAK,CAAC,EACjBA,EAAO,IAAI,IAAK,CAAC,GAEfF,EAAQ,QAAQ,MAAM,EAAI,IAC5BE,EAAO,IAAI,UAAW,EAAI,IAGxB,OAAOrB,GAAM,UAAY,QAAQ,KAAKA,CAAC,EACzCqB,EAAO,IAAI,IAAKrB,EAAI,CAAC,EAErBqB,EAAO,IAAI,IAAK,CAAC,EAEf,OAAOpB,GAAM,UAAY,QAAQ,KAAKA,CAAC,EACzCoB,EAAO,IAAI,IAAKpB,EAAI,CAAC,EAErBoB,EAAO,IAAI,IAAK,CAAC,EAEfF,EAAQ,QAAQ,MAAM,EAAI,IAC5BE,EAAO,IAAI,UAAW,EAAI,GAG1B,wBAAwB,KAAKF,CAAO,EAAG,CACrC1C,GACF4C,EAAO,IAAI,WAAY5C,CAAQ,EAEjC,MAAMsB,EAAM,OAAO,YAAYsB,CAAM,EAErC,OADc,KAAK,iBAAiBtB,EAAKrB,EAAMC,CAAG,CAEpD,SAAW,0BAA0B,KAAKwC,CAAO,EAAG,CAClD,MAAMpB,EAAM,OAAO,YAAYsB,CAAM,EAErC,OADc,KAAK,kBAAkBtB,EAAKrB,CAAI,CAEhD,CACA,OAAO,IAAI,GACb,CAUA,oBAAoB4C,EAAW5C,EAAMC,EAAM,CAAC,EAAG,CAC7C,IAAIgC,EACJ,GAAI,MAAM,QAAQW,CAAS,GAAKA,EAAU,OAAQ,CAChD,MAAM5B,EAAS4B,EAAU,IAAIlC,GAAKA,CAAC,EAC7B,CAACmC,CAAI,EAAI7B,EACT,CAAE,KAAM8B,CAAS,EAAID,EAC3B,IAAIE,EACAD,IAAa,aACfC,EAAQ/B,EAAO,MAAM,EAErB+B,EAAQ,CACN,KAAM,IACN,KAAM,YACR,EAEF,MAAMC,EAAa,CAAC,EACpB,KAAOhC,EAAO,QAAQ,CACpB,KAAM,CAACR,CAAI,EAAIQ,EACT,CAAE,KAAMiC,CAAS,EAAIzC,EAC3B,GAAIyC,IAAa,aACf,MAEAD,EAAW,KAAKhC,EAAO,MAAM,CAAC,CAElC,CACA,MAAMkC,EAAO,CACX,MAAAH,EACA,OAAQC,CACV,EACA/C,EAAI,IAAMxB,EACV,MAAM4B,EAAQ,KAAK,iBAAiB6C,EAAMlD,EAAMC,CAAG,EACnD,GAAII,EAAM,KACR,GAAIW,EAAO,QACT,UAAWmC,KAAY9C,EAErB,GADA4B,EAAO,KAAK,oBAAoBjB,EAAQmC,EAAUlD,CAAG,EACjDgC,EACF,WAIJA,EAAO,EAGb,CACA,MAAO,CAAC,CAACA,CACX,CAUA,wBAAwBmB,EAASpD,EAAMC,EAAM,CAAC,EAAG,CAC/C,KAAM,CACJ,QAAAoD,EAAU,GAAI,SAAAzC,EAAW,CAAC,EAAG,SAAAb,EAAW,GAAI,aAAAuD,EAAe,CAAC,CAC9D,EAAIF,EACJ,IAAIG,EACJ,GAAIF,IAAY,MACd,GAAItD,EAAS,SAAS,OAAO,EAC3BwD,EAAM,SACD,CACL,IAAItB,EACJ,UAAWjB,KAAUJ,EAEnB,GADAqB,EAAO,KAAK,oBAAoBjB,EAAQhB,EAAMC,CAAG,EAC7CgC,EACF,MAGAA,IACFsB,EAAMvD,EAEV,KACK,CACL,MAAMwD,EAAU,iBAAiB,KAAKH,CAAO,EAC7CpD,EAAI,QAAUuD,EACd,MAAM/C,EAAI6C,EAAa,OACvB,IAAIrB,EACJ,QAASvB,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMK,EAASuC,EAAa5C,CAAC,EACvB+C,EAAY1C,EAAO,OAAS,EAC5B,CAAE,OAAAC,CAAO,EAAID,EAAO0C,CAAS,EAEnC,GADAxB,EAAO,KAAK,aAAajB,EAAQhB,EAAMC,CAAG,EACtCgC,GAAQwB,EAAY,EAAG,CACzB,IAAIC,EAAY,IAAI,IAAI,CAAC1D,CAAI,CAAC,EAC9B,QAASmC,EAAIsB,EAAY,EAAGtB,GAAK,EAAGA,IAAK,CACvC,MAAMe,EAAOnC,EAAOoB,CAAC,EACfwB,EAAM,CAAC,EACb1D,EAAI,IAAMvB,EACV,UAAWyE,KAAYO,EAAW,CAChC,MAAMlB,EAAI,KAAK,iBAAiBU,EAAMC,EAAUlD,CAAG,EAC/CuC,EAAE,MACJmB,EAAI,KAAK,GAAGnB,CAAC,CAEjB,CACA,GAAImB,EAAI,OACFxB,IAAM,EACRF,EAAO,GAEPyB,EAAY,IAAI,IAAIC,CAAG,MAEpB,CACL1B,EAAO,GACP,KACF,CACF,CACF,CACA,GAAIA,EACF,KAEJ,CACIoB,IAAY,MACTpB,IACHsB,EAAMvD,GAECiC,IACTsB,EAAMvD,EAEV,CACA,OAAOuD,GAAO,IAChB,CAaA,0BAA0BjD,EAAKN,EAAMC,EAAM,CAAC,EAAG,CAC7C,KAAM,CAAE,SAAU2D,EAAa,KAAMP,CAAQ,EAAI/C,EAC3C,CAAE,UAAA8B,EAAW,WAAAX,CAAW,EAAIzB,EAC5B,CACJ,QAAAwD,EACA,KAAApD,EAAO,KAAKT,EACd,EAAIM,EACEyB,EAAU,IAAI,IAEpB,GAAI,qBAAmB,KAAK2B,CAAO,EAAG,CACpC,IAAID,EACJ,GAAI,KAAKxE,GAAU,IAAI0B,CAAG,EACxB8C,EAAU,KAAKxE,GAAU,IAAI0B,CAAG,MAC3B,CACL,KAAM,CAAE,SAAAM,CAAS,KAAI,WAAQN,CAAG,EAC1BuD,EAAY,CAAC,EACbP,EAAe,CAAC,EACtB,SAAW,CAAC,GAAGtC,CAAM,IAAKJ,EAAU,CAClC,UAAWiC,KAAQ7B,EAAQ,CACzB,MAAM8C,KAAM,eAAYjB,CAAI,EAC5BgB,EAAU,KAAKC,CAAG,CACpB,CACA,MAAM/C,EAAS,CAAC,EACVgD,EAAY,IAAI,IACtB,IAAIvD,EAAOQ,EAAO,MAAM,EACxB,KAAOR,GAUL,GATIA,EAAK,OAAS,cAChBO,EAAO,KAAK,CACV,MAAOP,EACP,OAAQ,CAAC,GAAGuD,CAAS,CACvB,CAAC,EACDA,EAAU,MAAM,GACPvD,GACTuD,EAAU,IAAIvD,CAAI,EAEhBQ,EAAO,OACTR,EAAOQ,EAAO,MAAM,MACf,CACLD,EAAO,KAAK,CACV,MAAO,KACP,OAAQ,CAAC,GAAGgD,CAAS,CACvB,CAAC,EACDA,EAAU,MAAM,EAChB,KACF,CAEFT,EAAa,KAAKvC,CAAM,CAC1B,CACAqC,EAAU,CACR,QAAAC,EACA,SAAAzC,EACA,aAAA0C,EACA,SAAUO,EAAU,KAAK,GAAG,CAC9B,EACA,KAAKjF,GAAU,IAAI0B,EAAK8C,CAAO,CACjC,CACA,MAAMG,EAAM,KAAK,wBAAwBH,EAASpD,EAAMC,CAAG,EACvDsD,GACF7B,EAAQ,IAAI6B,CAAG,CAEnB,SAAW,MAAM,QAAQK,CAAW,EAElC,GAAI,oCAAoC,KAAKP,CAAO,EAAG,CACrD,KAAM,CAACtC,CAAM,EAAI6C,EAEjB,OADc,KAAK,cAAc7C,EAAQf,EAAMqD,EAASpD,CAAG,CAE7D,KACE,QAAQoD,EAAS,CAEf,IAAK,MACL,IAAK,OAAQ,CACX,MAAME,EAAM,UAAQ,cAAcjD,EAAKN,CAAI,EACvCuD,GACF7B,EAAQ,IAAI6B,CAAG,EAEjB,KACF,CAEA,IAAK,QAAS,CACZ,MAAI,mBAAgBvD,CAAI,EAAG,CACzB,KAAM,CAAC,CAAE,MAAOgE,CAAW,CAAC,EAAIJ,EAC5BI,GAAchE,EAAKgE,CAAU,GAC/BtC,EAAQ,IAAI1B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UACL,IAAK,UACL,IAAK,eAAgB,CACnB,GAAII,EAAM,CACR,MAAMc,EAAM,6BAA6BmC,CAAO,KAChD,MAAM,IAAI,aAAanC,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,IAAK,OACL,IAAK,eAEH,MAGF,IAAK,WAAY,CACf,GAAId,EAAM,CACR,MAAMc,EAAM,yBAAyBmC,CAAO,KAC5C,MAAM,IAAI,aAAanC,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,QACE,GAAI,CAACsC,EAAS,CACZ,MAAMtC,EAAM,yBAAyBmC,CAAO,KAC5C,MAAM,IAAI,aAAanC,EAAK,YAAU,CACxC,CAEJ,KAGF,QAAQmC,EAAS,CACf,IAAK,WACL,IAAK,OAAQ,CACP,aAAW,KAAKjB,CAAS,GAAKpC,EAAK,aAAa,MAAM,GACxD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,aAAc,CACjB,GAAI,aAAW,KAAKoC,CAAS,GAAKpC,EAAK,aAAa,MAAM,EAAG,CAC3D,KAAM,CAAE,KAAAiE,EAAM,OAAAC,EAAQ,SAAAC,CAAS,EAAI,IAAI,IAAI,KAAKrF,GAAU,GAAG,EACvDsF,EAAU,IAAI,IAAIpE,EAAK,aAAa,MAAM,EAAGiE,CAAI,EACnDG,EAAQ,SAAWF,GAAUE,EAAQ,WAAaD,GACpDzC,EAAQ,IAAI1B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAEH,MAEF,IAAK,QAAS,CACZ,KAAM,CAAE,OAAAqE,EAAQ,KAAAC,CAAK,EAAI,KAAKtF,IAAU,CAAC,GACpCsF,IAAS,aAAeA,IAAS,gBAClCtE,EAAK,SAASqE,CAAM,GACtB3C,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,SAAU,CACb,KAAM,CAAE,QAAAuE,EAAS,OAAAF,EAAQ,KAAAC,CAAK,EAAI,KAAKtF,IAAU,CAAC,GAC7CsF,IAAS,aAAeA,IAAS,gBAClCC,EAAU,UAAUvE,EAAK,SAASqE,CAAM,GAC1C3C,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,SAAU,CACb,KAAM,CAAE,KAAAwE,CAAK,EAAI,IAAI,IAAI,KAAK1F,GAAU,GAAG,EACvCkB,EAAK,IAAMwE,IAAS,IAAIxE,EAAK,EAAE,IAC/B,KAAKlB,GAAU,SAASkB,CAAI,GAC9B0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,KAAM,CAAE,KAAAwE,CAAK,EAAI,IAAI,IAAI,KAAK1F,GAAU,GAAG,EAC3C,GAAI0F,EAAM,CACR,MAAMC,EAAKD,EAAK,QAAQ,KAAM,EAAE,EAChC,IAAIE,EAAU,KAAK5F,GAAU,eAAe2F,CAAE,EAC9C,KAAOC,GAAS,CACd,GAAIA,IAAY1E,EAAM,CACpB0B,EAAQ,IAAI1B,CAAI,EAChB,KACF,CACA0E,EAAUA,EAAQ,UACpB,CACF,CACA,KACF,CACA,IAAK,QAAS,CACR,KAAKxF,GAAM,WAAa,eACtB,CAAC,KAAKM,IAAWQ,IAAS,KAAKd,IACjCwC,EAAQ,IAAI1B,CAAI,EAETA,IAAS,KAAKlB,GAAU,iBACjC4C,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,QACL,IAAK,gBAAiB,CACpB,KAAM,CAAE,OAAAqE,EAAQ,KAAAC,CAAK,EAAI,KAAKtF,IAAU,CAAC,EACzC,GAAIgB,IAAS,KAAKlB,GAAU,eAAiBkB,EAAK,UAAY,IACzDqD,IAAY,SACXiB,IAAS,WAAatE,EAAK,SAASqE,CAAM,GAAK,CACnD,IAAIxC,EAAU7B,EACV2E,EAAQ,GACZ,KAAO9C,GAAS,CACd,GAAIA,EAAQ,UAAYA,EAAQ,aAAa,UAAU,GACnDA,EAAQ,QAAUA,EAAQ,aAAa,QAAQ,EAAG,CACpD8C,EAAQ,GACR,KACF,KAAO,CACL,KAAM,CAAE,QAAA5C,EAAS,WAAAC,CAAW,EAC1B,KAAKpC,GAAQ,iBAAiBiC,CAAO,EAEvC,GADA8C,EAAQ,EAAE5C,IAAY,QAAUC,IAAe,UAC3C,CAAC2C,EACH,KAEJ,CACA,GAAI9C,EAAQ,YACRA,EAAQ,WAAW,WAAa,eAClCA,EAAUA,EAAQ,eAElB,MAEJ,CACI8C,GACFjD,EAAQ,IAAI1B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,eAAgB,CACnB,IAAI4E,EACAF,EAAU,KAAK5F,GAAU,cAC7B,GAAI4F,EAAQ,UAAY,EACtB,KAAOA,GAAS,CACd,GAAIA,IAAY1E,EAAM,CACpB4E,EAAS,GACT,KACF,CACAF,EAAUA,EAAQ,UACpB,CAEF,GAAIE,EAAQ,CACV,IAAI/C,EAAU7B,EACV2E,EAAQ,GACZ,KAAO9C,GAAS,CACd,GAAIA,EAAQ,UAAYA,EAAQ,aAAa,UAAU,GACnDA,EAAQ,QAAUA,EAAQ,aAAa,QAAQ,EAAG,CACpD8C,EAAQ,GACR,KACF,KAAO,CACL,KAAM,CAAE,QAAA5C,EAAS,WAAAC,CAAW,EAC1B,KAAKpC,GAAQ,iBAAiBiC,CAAO,EAEvC,GADA8C,EAAQ,EAAE5C,IAAY,QAAUC,IAAe,UAC3C,CAAC2C,EACH,KAEJ,CACA,GAAI9C,EAAQ,YACRA,EAAQ,WAAW,WAAa,eAClCA,EAAUA,EAAQ,eAElB,MAEJ,CACI8C,GACFjD,EAAQ,IAAI1B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,OAAQ,CACP,eAAa,KAAKoC,CAAS,GAAKpC,EAAK,aAAa,MAAM,GAC1D0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,SAAU,CACT,eAAa,KAAKoC,CAAS,GAAK,CAACpC,EAAK,aAAa,MAAM,GAC3D0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,GAAI,gBAAc,KAAKoC,CAAS,MAC5B,mBAAgBpC,EAAM,CAAE,eAAgB,EAAK,CAAC,GAChD,GAAIA,EAAK,UAAYA,EAAK,aAAa,UAAU,EAC/C0B,EAAQ,IAAI1B,CAAI,UACPA,EAAK,YAAc,SACxByB,EAAW,YAAc,aACxBA,EAAW,UACXA,EAAW,aAAa,UAAU,IACrCC,EAAQ,IAAI1B,CAAI,UAETA,EAAK,YAAc,WAAY,CACxC,IAAIiC,EACA4C,EAASpD,EACb,KAAOoD,GACL,GAAIA,EAAO,YAAc,aACpBA,EAAO,UAAYA,EAAO,aAAa,UAAU,GAAI,CACxD,MAAMzD,EAAS,KAAK3B,GACpB,IAAIoC,KAAU,gBAAagD,EAAQzD,CAAM,EAEzC,IADAS,EAAUT,EAAO,WAAW,EACrBS,GACDA,EAAQ,YAAc,UAG1BA,EAAUT,EAAO,YAAY,EAE3BS,GACGA,EAAQ,SAAS7B,CAAI,IACxBiC,EAAO,IAKX,KACF,KAAO,IAAI4C,EAAO,YAAc,OAC9B,MACK,GAAIA,EAAO,YAAY,WAAa,eAAc,CACvD,GAAIA,EAAO,WAAW,YAAc,OAClC,MAEAA,EAASA,EAAO,UAEpB,KACE,OAGA5C,GACFP,EAAQ,IAAI1B,CAAI,CAEpB,EAEF,KACF,CACA,IAAK,UAAW,CACd,IAAK,gBAAc,KAAKoC,CAAS,MAC5B,mBAAgBpC,EAAM,CAAE,eAAgB,EAAK,CAAC,IAC/C,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,GACjD,GAAIA,EAAK,YAAc,WACrB0B,EAAQ,IAAI1B,CAAI,UACPA,EAAK,YAAc,UACxByB,EAAW,YAAc,YACzB,EAAEA,EAAW,UACXA,EAAW,aAAa,UAAU,KACtCC,EAAQ,IAAI1B,CAAI,MAEb,CACL,IAAIiC,EACA4C,EAASpD,EACb,KAAOoD,GACL,GAAIA,EAAO,YAAc,aACpBA,EAAO,UAAYA,EAAO,aAAa,UAAU,GAAI,CACxD,MAAMzD,EAAS,KAAK3B,GACpB,IAAIoC,KAAU,gBAAagD,EAAQzD,CAAM,EAEzC,IADAS,EAAUT,EAAO,WAAW,EACrBS,GACDA,EAAQ,YAAc,UAG1BA,EAAUT,EAAO,YAAY,EAE3BS,GACGA,EAAQ,SAAS7B,CAAI,IACxBiC,EAAO,IAKX,KACF,KAAO,IAAI4C,EAAO,YAAc,OAC9B,MACK,GAAIA,EAAO,YAAY,WAAa,eAAc,CACvD,GAAIA,EAAO,WAAW,YAAc,OAClC,MAEAA,EAASA,EAAO,UAEpB,KACE,OAGC5C,GACHP,EAAQ,IAAI1B,CAAI,CAEpB,CAEF,KACF,CACA,IAAK,YAAa,CAChB,OAAQoC,EAAW,CACjB,IAAK,WAAY,EACXpC,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,QAAS,EACP,CAACA,EAAK,MAAQ,gBAAc,KAAKA,EAAK,IAAI,GAC1C,gBAAc,KAAKA,EAAK,IAAI,KAC5BA,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,OAAQoC,EAAW,CACjB,IAAK,WAAY,CACTpC,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,GACjD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,QAAS,EACP,CAACA,EAAK,MAAQ,gBAAc,KAAKA,EAAK,IAAI,GAC1C,gBAAc,KAAKA,EAAK,IAAI,IAC7B,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,IAAI8E,EAMJ,GALI9E,EAAK,YACP8E,EAAc9E,EAAK,YACVA,EAAK,aAAa,aAAa,IACxC8E,EAAc9E,EAAK,aAAa,aAAa,GAE3C,OAAO8E,GAAgB,UAAY,CAAC,SAAS,KAAKA,CAAW,EAAG,CAClE,IAAIC,EACA3C,IAAc,WAChB2C,EAAa/E,EACJoC,IAAc,UACnBpC,EAAK,aAAa,MAAM,EACtB,gBAAc,KAAKA,EAAK,aAAa,MAAM,CAAC,IAC9C+E,EAAa/E,GAGf+E,EAAa/E,GAGb+E,GAAc/E,EAAK,QAAU,IAC/B0B,EAAQ,IAAI1B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAAW,EACTA,EAAK,SAAWoC,IAAc,SAC9BpC,EAAK,aAAa,MAAM,GACxB,iBAAe,KAAKA,EAAK,aAAa,MAAM,CAAC,GAC7CA,EAAK,UAAYoC,IAAc,WAClCV,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,GAAKA,EAAK,eAAiBoC,IAAc,SACpCpC,EAAK,OAAS,YACdoC,IAAc,YAAc,CAACpC,EAAK,aAAa,OAAO,EACzD0B,EAAQ,IAAI1B,CAAI,UACPoC,IAAc,SAAWpC,EAAK,OAAS,SACvC,CAACA,EAAK,aAAa,SAAS,EAAG,CACxC,MAAMgF,EAAWhF,EAAK,KACtB,IAAI6E,EAAS7E,EAAK,WAClB,KAAO6E,GACDA,EAAO,YAAc,QAGzBA,EAASA,EAAO,WAEbA,IACHA,EAAS,KAAK/F,GAAU,iBAE1B,MAAMgC,EAAQ+D,EAAO,qBAAqB,OAAO,EAC3CpE,EAAIK,EAAM,OAChB,IAAImE,EACJ,QAASvE,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMF,EAAOM,EAAMJ,CAAC,EACpB,GAAIF,EAAK,aAAa,MAAM,IAAM,UAC5BwE,EACExE,EAAK,aAAa,MAAM,IAAMwE,IAChCC,EAAU,CAAC,CAACzE,EAAK,SAETA,EAAK,aAAa,MAAM,IAClCyE,EAAU,CAAC,CAACzE,EAAK,SAEfyE,GACF,KAGN,CACKA,GACHvD,EAAQ,IAAI1B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAAW,CAEd,GAAKoC,IAAc,UACd,EAAEpC,EAAK,aAAa,MAAM,GACxB,iBAAe,KAAKA,EAAK,aAAa,MAAM,CAAC,IAC/CoC,IAAc,SAAWpC,EAAK,aAAa,MAAM,GACjD,kBAAgB,KAAKA,EAAK,aAAa,MAAM,CAAC,EAAI,CACrD,IAAIkF,EAAOlF,EAAK,WAChB,KAAOkF,GACDA,EAAK,YAAc,QAGvBA,EAAOA,EAAK,WAEd,GAAIA,EAAM,CACR,MAAM9D,EAAS,KAAK3B,GACpB,IAAI0D,KAAW,gBAAa+B,EAAM9D,CAAM,EAExC,IADA+B,EAAW/B,EAAO,WAAW,EACtB+B,GAAY+B,EAAK,SAAS/B,CAAQ,GAAG,CAC1C,MAAM6B,EAAW7B,EAAS,UAC1B,IAAI,EAQJ,GAPI6B,IAAa,SACf,EAAI,EAAE7B,EAAS,aAAa,MAAM,GAChC,iBAAe,KAAKA,EAAS,aAAa,MAAM,CAAC,GAC1C6B,IAAa,UACtB,EAAI7B,EAAS,aAAa,MAAM,GAC9B,kBAAgB,KAAKA,EAAS,aAAa,MAAM,CAAC,GAElD,EAAG,CACDA,IAAanD,GACf0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACAmD,EAAW/B,EAAO,SAAS,CAC7B,CACF,CAEF,MAAWgB,IAAc,SAAWpC,EAAK,aAAa,MAAM,GACjD,iBAAe,KAAKA,EAAK,aAAa,MAAM,CAAC,GAC7CA,EAAK,aAAa,SAAS,GAG3BoC,IAAc,UAAYpC,EAAK,aAAa,UAAU,IAC/D0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,QAAS,CACZ,GAAI,iBAAe,KAAKoC,CAAS,EAC3BpC,EAAK,cAAc,IACjBA,EAAK,WAAa,EAChBA,EAAK,WAAaA,EAAK,MAAM,QAC/B0B,EAAQ,IAAI1B,CAAI,EAGlB0B,EAAQ,IAAI1B,CAAI,WAGXoC,IAAc,WAAY,CACnC,MAAMhB,EAAS,KAAK3B,GACpB,IAAIoC,KAAU,gBAAa7B,EAAMoB,CAAM,EACvCS,EAAUT,EAAO,WAAW,EAC5B,IAAIa,EACJ,GAAI,CAACJ,EACHI,EAAO,OAEP,MAAOJ,GAAW7B,EAAK,SAAS6B,CAAO,GACjC,mBAAe,KAAKA,EAAQ,SAAS,IACnCA,EAAQ,cAAc,EACpBA,EAAQ,WAAa,EACvBI,EAAOJ,EAAQ,WAAaA,EAAQ,MAAM,OAE1CI,EAAO,GAGTA,EAAO,GAEL,CAACA,KAIPJ,EAAUT,EAAO,SAAS,EAG1Ba,GACFP,EAAQ,IAAI1B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAAW,CACd,GAAI,iBAAe,KAAKoC,CAAS,EAC3BpC,EAAK,cAAc,EACjBA,EAAK,WAAa,GAAKA,EAAK,UAAYA,EAAK,MAAM,QACrD0B,EAAQ,IAAI1B,CAAI,EAGlB0B,EAAQ,IAAI1B,CAAI,UAEToC,IAAc,WAAY,CACnC,MAAMhB,EAAS,KAAK3B,GACpB,IAAIoC,KAAU,gBAAa7B,EAAMoB,CAAM,EACvCS,EAAUT,EAAO,WAAW,EAC5B,IAAIa,EACJ,GAAI,CAACJ,EACHI,EAAO,OAEP,MAAOJ,GAAW7B,EAAK,SAAS6B,CAAO,GACjC,mBAAe,KAAKA,EAAQ,SAAS,IACnCA,EAAQ,cAAc,EACpBA,EAAQ,WAAa,EACvBI,EAAOJ,EAAQ,WAAaA,EAAQ,MAAM,OAE1CI,EAAO,GAGTA,EAAO,GAEL,CAACA,KAIPJ,EAAUT,EAAO,SAAS,EAGzBa,GACHP,EAAQ,IAAI1B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,WAAY,CACXoC,IAAc,SACd,EAAEpC,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CA,EAAK,aAAa,MAAM,GACxB,iBAAe,KAAKA,EAAK,aAAa,MAAM,CAAC,GAC7C,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,CACfoC,IAAc,SACd,EAAEpC,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CA,EAAK,aAAa,MAAM,GACxB,iBAAe,KAAKA,EAAK,aAAa,MAAM,CAAC,IAC5CA,EAAK,SAAS,gBAAkBA,EAAK,SAAS,gBACjD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,IAAI+E,EACJ,GAAI,wBAAwB,KAAK3C,CAAS,EACxC2C,EAAa/E,UACJoC,IAAc,QACvB,GAAIpC,EAAK,aAAa,MAAM,EAAG,CAC7B,MAAMmF,EAAYnF,EAAK,aAAa,MAAM,GACtCmF,IAAc,QAAU,iBAAe,KAAKA,CAAS,GACrD,gBAAc,KAAKA,CAAS,GAC5B,gBAAc,KAAKA,CAAS,KAC9BJ,EAAa/E,EAEjB,MACE+E,EAAa/E,EAGb+E,IACC/E,EAAK,UAAYA,EAAK,aAAa,UAAU,IAChD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,IAAI+E,EACJ,GAAI,wBAAwB,KAAK3C,CAAS,EACxC2C,EAAa/E,UACJoC,IAAc,QACvB,GAAIpC,EAAK,aAAa,MAAM,EAAG,CAC7B,MAAMmF,EAAYnF,EAAK,aAAa,MAAM,GACtCmF,IAAc,QAAU,iBAAe,KAAKA,CAAS,GACrD,gBAAc,KAAKA,CAAS,GAC5B,gBAAc,KAAKA,CAAS,KAC9BJ,EAAa/E,EAEjB,MACE+E,EAAa/E,EAGb+E,GACA,EAAE/E,EAAK,UAAYA,EAAK,aAAa,UAAU,IACjD0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,OAAQ,CACPA,IAAS,KAAKlB,GAAU,iBAC1B4C,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,QAAS,CACZ,GAAIA,EAAK,cAAc,EAAG,CACxB,MAAMoB,EAAS,KAAKtC,GAAU,iBAAiBkB,EAAM,UAAQ,EAC7D,IAAI6B,EAAUT,EAAO,WAAW,EAC5Ba,EACJ,KAAOJ,IACLI,EAAOJ,EAAQ,WAAa,gBAC1BA,EAAQ,WAAa,YACnB,EAACI,IAGLJ,EAAUT,EAAO,YAAY,EAE3Ba,GACFP,EAAQ,IAAI1B,CAAI,CAEpB,MACE0B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,cAAe,EACbyB,GAAczB,IAASyB,EAAW,mBACnCzB,IAAS,KAAKT,KAChBmC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,aAAc,EACZyB,GAAczB,IAASyB,EAAW,kBACnCzB,IAAS,KAAKT,KAChBmC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,aAAc,EACZyB,GAAczB,IAASyB,EAAW,mBAClCzB,IAASyB,EAAW,kBAAqBzB,IAAS,KAAKT,KAC1DmC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,GAAIyB,EAAY,CACd,KAAM,CAAC2D,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,CACL,EAAGpF,CAAI,EACHoF,GACF1D,EAAQ,IAAI0D,CAAK,CAErB,MAAWpF,IAAS,KAAKT,IACvBmC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,GAAIyB,EAAY,CACd,KAAM,CAAC2D,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,EACH,QAAS,EACX,EAAGpF,CAAI,EACHoF,GACF1D,EAAQ,IAAI0D,CAAK,CAErB,MAAWpF,IAAS,KAAKT,IACvBmC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,GAAIyB,EAAY,CACd,KAAM,CAAC2D,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,CACL,EAAGpF,CAAI,EACP,GAAIoF,IAAUpF,EAAM,CAClB,KAAM,CAACqF,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,EACH,QAAS,EACX,EAAGrF,CAAI,EACHqF,IAAUrF,GACZ0B,EAAQ,IAAI1B,CAAI,CAEpB,CACF,MAAWA,IAAS,KAAKT,IACvBmC,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,UAAW,CACVA,EAAK,aAAa,IAAI,GAAKoC,EAAU,SAAS,GAAG,KAC/C,mBAAgBpC,CAAI,GACtB0B,EAAQ,IAAI1B,CAAI,GAGTA,aAAgB,KAAKJ,GAAQ,aAC7BI,aAAgB,KAAKJ,GAAQ,aACtC8B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,GAAIA,EAAK,QAAS,CAChB,KAAM,CAAE,QAAA+B,CAAQ,EAAI,KAAKnC,GAAQ,iBAAiBI,CAAI,EAClD+B,IAAY,QACdL,EAAQ,IAAI1B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,OACL,IAAK,eAEH,MAGF,IAAK,QACL,IAAK,SACL,IAAK,eACL,IAAK,aAAc,CACjB,GAAII,EAAM,CACR,MAAMc,EAAM,gCAAgCmC,CAAO,GACnD,MAAM,IAAI,aAAanC,EAAK,mBAAiB,CAC/C,CACA,KACF,CAEA,IAAK,WACL,IAAK,QACL,IAAK,YACL,IAAK,UACL,IAAK,aACL,IAAK,SACL,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,GAAId,EAAM,CACR,MAAMc,EAAM,6BAA6BmC,CAAO,GAChD,MAAM,IAAI,aAAanC,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,QACE,GAAImC,EAAQ,WAAW,UAAU,GAC/B,GAAIjD,EAAM,CACR,MAAMc,EAAM,6BAA6BmC,CAAO,GAChD,MAAM,IAAI,aAAanC,EAAK,mBAAiB,CAC/C,UACS,CAACsC,EAAS,CACnB,MAAMtC,EAAM,yBAAyBmC,CAAO,GAC5C,MAAM,IAAI,aAAanC,EAAK,YAAU,CACxC,CAEJ,CAEF,OAAOQ,CACT,CASA,4BAA4BpB,EAAKN,EAAM,CACrC,KAAM,CAAE,SAAU4D,EAAa,KAAMP,CAAQ,EAAI/C,EACjD,IAAIiD,EACJ,GAAI,MAAM,QAAQK,CAAW,EAAG,CAC9B,KAAM,CAAE,SAAAhD,CAAS,KAAI,WAAQgD,EAAY,CAAC,CAAC,EACrC,CAAC7C,CAAM,EAAIH,EACX,CAAC,GAAGI,CAAM,EAAID,EACd,CAAE,KAAAuE,CAAK,EAAItF,EACjB,GAAIqD,IAAY,OAAQ,CACtB,IAAIpB,EACJ,UAAWY,KAAQ7B,EAAQ,CACzB,KAAM,CAAE,KAAM8B,CAAS,EAAID,EAC3B,GAAIC,IAAa,aAAY,CAE3B,MAAM5B,EAAM,uBADA,eAAYZ,CAAG,CACQ,GACnC,MAAM,IAAI,aAAaY,EAAK,YAAU,CACxC,CAEA,GADAe,EAAO,KAAK,eAAeY,EAAMyC,CAAI,EAAE,IAAIA,CAAI,EAC3C,CAACrD,EACH,KAEJ,CACIA,IACFsB,EAAMvD,EAEV,SAAWqD,IAAY,eAAgB,CACrC,IAAIwB,EAASS,EACTrD,EACJ,KAAO4C,GAAQ,CACb,UAAWhC,KAAQ7B,EAAQ,CACzB,KAAM,CAAE,KAAM8B,CAAS,EAAID,EAC3B,GAAIC,IAAa,aAAY,CAE3B,MAAM5B,EAAM,uBADA,eAAYZ,CAAG,CACQ,GACnC,MAAM,IAAI,aAAaY,EAAK,YAAU,CACxC,CAEA,GADAe,EAAO,KAAK,eAAeY,EAAMgC,CAAM,EAAE,IAAIA,CAAM,EAC/C,CAAC5C,EACH,KAEJ,CACA,GAAIA,EACF,MAEA4C,EAASA,EAAO,UAEpB,CACI5C,IACFsB,EAAMvD,EAEV,CACF,SAAWqD,IAAY,OACrBE,EAAMvD,MACD,CACL,MAAMkB,EAAM,qBAAqBmC,CAAO,GACxC,MAAM,IAAI,aAAanC,EAAK,YAAU,CACxC,CACA,OAAOqC,GAAO,IAChB,CAUA,eAAejD,EAAKN,EAAMC,EAAK,CAC7B,KAAM,CAAE,KAAMsF,CAAQ,EAAIjF,EACpBoB,EAAU,IAAI,IACpB,GAAIpB,EAAI,OAAS,QACf,OAAOoB,EAET,MAAM2B,KAAU,oBAAiB/C,EAAI,IAAI,EAIzC,GAHI,OAAO+C,GAAY,UAAYA,IAAY/C,EAAI,OACjDA,EAAI,KAAO+C,GAETrD,EAAK,WAAa,eACpB,OAAQuF,EAAS,CACf,KAAK,0BAAyB,CAC5B,UAAQ,2BAA2BlC,EAASpD,CAAG,EAC/C,KACF,CACA,KAAK,cAAa,CACZD,EAAK,KAAOqD,GACd3B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,KAAK,iBAAgB,CACfA,EAAK,UAAU,SAASqD,CAAO,GACjC3B,EAAQ,IAAI1B,CAAI,EAElB,KACF,CACA,KAAK,wBAEH,OADc,KAAK,0BAA0BM,EAAKN,EAAMC,CAAG,EAG7D,QAAS,CACP,MAAMsD,EAAM,UAAQ,cAAcjD,EAAKN,EAAMC,CAAG,EAC5CsD,GACF7B,EAAQ,IAAI6B,CAAG,CAEnB,CACF,SACS,KAAK/D,IAAW+F,IAAY,yBAC5BvF,EAAK,WAAa,yBAAwB,CACnD,GAAIqD,IAAY,OAAS,qBAAmB,KAAKA,CAAO,EAEtD,OADc,KAAK,0BAA0B/C,EAAKN,EAAMC,CAAG,EAEtD,GAAI,kBAAgB,KAAKoD,CAAO,EAAG,CACxC,MAAME,EAAM,KAAK,4BAA4BjD,EAAKN,EAAMC,CAAG,EACvDsD,GACF7B,EAAQ,IAAI6B,CAAG,CAEnB,CACF,CACA,OAAO7B,CACT,CAUA,aAAaV,EAAQhB,EAAMC,EAAK,CAC9B,IAAIgC,EACAuD,EAAS,KAAKlG,GAAS,IAAI0B,CAAM,EACrC,GAAIwE,GAAUA,EAAO,IAAIxF,CAAI,EAAG,CAC9B,KAAM,CAAE,QAAA0B,CAAQ,EAAI8D,EAAO,IAAIxF,CAAI,EACnCiC,EAAOP,CACT,CACA,GAAI,OAAOO,GAAS,UAAW,CAC7B,IAAIwD,EAAY,GACZzF,EAAK,WAAa,gBAAgB,WAAS,KAAKA,EAAK,SAAS,IAChEyF,EAAY,IAEd,UAAW5C,KAAQ7B,EAAQ,CACzB,OAAQ6B,EAAK,KAAM,CACjB,KAAK,gBACL,KAAK,cAAa,CAChB4C,EAAY,GACZ,KACF,CACA,KAAK,wBAAuB,CACtB,wBAAsB,KAAK5C,EAAK,IAAI,IACtC4C,EAAY,IAEd,KACF,CACA,QACF,CAEA,GADAxD,EAAO,KAAK,eAAeY,EAAM7C,EAAMC,CAAG,EAAE,IAAID,CAAI,EAChD,CAACiC,EACH,KAEJ,CACIwD,GAAa,CAAC,KAAKxG,KAChBuG,IACHA,EAAS,IAAI,SAEfA,EAAO,IAAIxF,EAAM,CACf,QAASiC,CACX,CAAC,EACD,KAAK3C,GAAS,IAAI0B,EAAQwE,CAAM,EAEpC,CACA,MAAO,CAAC,CAACvD,CACX,CASA,qBAAqBnB,EAAOb,EAAM,CAAC,EAAG,CACpC,KAAM,CAAE,SAAAyF,EAAU,aAAAC,CAAa,EAAI1F,EAC7BI,EAAQ,IAAI,IACZI,EAAIK,EAAM,OAChB,GAAIL,EACF,GAAIiF,EACF,QAAShF,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMF,EAAOM,EAAMJ,CAAC,EACP,KAAK,aAAaiF,EAAcnF,EAAMP,CAAG,GAEpDI,EAAM,IAAIG,CAAI,CAElB,KACK,CACL,MAAMmD,EAAM,CAAC,EAAE,MAAM,KAAK7C,CAAK,EAC/B,OAAO,IAAI,IAAI6C,CAAG,CACpB,CAEF,OAAOtD,CACT,CAUA,qBAAqBW,EAAQ4E,EAAU3F,EAAK,CAC1C,KAAM,CAAC4C,EAAM,GAAG8C,CAAY,EAAI3E,EAC1B0E,EAAWC,EAAa,OAAS,EACjC,CAAE,KAAM7C,CAAS,EAAID,EACrBgD,KAAW,oBAAiBhD,EAAK,IAAI,EACvC,OAAOgD,GAAa,UAAYA,IAAahD,EAAK,OACpDA,EAAK,KAAOgD,GAEd,IAAIxF,EAAQ,IAAI,IACZyF,EAAU,GACd,GAAI,KAAKtG,GACPsG,EAAU,OAEV,QAAQhD,EAAU,CAChB,KAAK,0BAAyB,CAC5B,UAAQ,2BAA2B+C,EAAU5F,CAAG,EAChD,KACF,CACA,KAAK,cAAa,CAChB,GAAI,KAAKV,GAAM,WAAa,eAC1BuG,EAAU,OACL,CACL,MAAM9F,EAAO,KAAKT,GAAM,eAAesG,CAAQ,EAC3C7F,GAAQA,IAAS4F,GAAYA,EAAS,SAAS5F,CAAI,IACjD0F,EACW,KAAK,aAAaC,EAAc3F,EAAMC,CAAG,GAEpDI,EAAM,IAAIL,CAAI,EAGhBK,EAAM,IAAIL,CAAI,EAGpB,CACA,KACF,CACA,KAAK,iBAAgB,CACnB,MAAMc,EAAQ8E,EAAS,uBAAuBC,CAAQ,EACtDxF,EAAQ,KAAK,qBAAqBS,EAAO,CACvC,SAAA4E,EACA,aAAAC,CACF,CAAC,EACD,KACF,CACA,KAAK,gBAAe,CAClB,GAAI,KAAK7G,GAAU,cAAgB,aAC/B,CAAC,OAAO,KAAK+G,CAAQ,EAAG,CAC1B,MAAM/E,EAAQ8E,EAAS,qBAAqBC,CAAQ,EACpDxF,EAAQ,KAAK,qBAAqBS,EAAO,CACvC,SAAA4E,EACA,aAAAC,CACF,CAAC,CACH,MACEG,EAAU,GAEZ,KACF,CACA,QACEA,EAAU,EAEd,CAEF,MAAO,CACL,MAAAzF,EACA,QAAAyF,CACF,CACF,CAUA,iBAAiB5C,EAAMlD,EAAMC,EAAM,CAAC,EAAG,CACrC,KAAM,CAAE,MAAA8C,EAAO,OAAA/B,CAAO,EAAIkC,EACpB,CAAE,KAAM6C,CAAU,EAAIhD,EACtB,CAAE,WAAAtB,CAAW,EAAIzB,EACjB,CAAE,IAAAgG,CAAI,EAAI/F,EACVyB,EAAU,IAAI,IACpB,GAAIsE,IAAQvH,EACV,OAAQsH,EAAW,CACjB,IAAK,IAAK,CACR,MAAMlE,EAAU7B,EAAK,mBACjB6B,GACW,KAAK,aAAab,EAAQa,EAAS5B,CAAG,GAEjDyB,EAAQ,IAAIG,CAAO,EAGvB,KACF,CACA,IAAK,IAAK,CACR,GAAIJ,EAAY,CACd,MAAML,EAAS,KAAK,kBAAkBK,CAAU,EAChD,IAAII,KAAU,gBAAa7B,EAAMoB,CAAM,EAEvC,IADAS,EAAUT,EAAO,YAAY,EACtBS,GACQ,KAAK,aAAab,EAAQa,EAAS5B,CAAG,GAEjDyB,EAAQ,IAAIG,CAAO,EAErBA,EAAUT,EAAO,YAAY,CAEjC,CACA,KACF,CACA,IAAK,IAAK,CACR,MAAMA,EAAS,KAAK,kBAAkBpB,CAAI,EAC1C,IAAI6B,KAAU,gBAAa7B,EAAMoB,CAAM,EAEvC,IADAS,EAAUT,EAAO,WAAW,EACrBS,GACQ,KAAK,aAAab,EAAQa,EAAS5B,CAAG,GAEjDyB,EAAQ,IAAIG,CAAO,EAErBA,EAAUT,EAAO,YAAY,EAE/B,KACF,CACA,IAAK,IACL,QAAS,CACP,KAAM,CAAE,MAAAf,EAAO,QAAAyF,CAAQ,EAAI,KAAK,qBAAqB9E,EAAQhB,CAAI,EACjE,GAAIK,EAAM,KACR,OAAOA,EAET,GAAIyF,EAAS,CACX,MAAM1E,EAAS,KAAK,kBAAkBpB,CAAI,EAC1C,IAAI6B,KAAU,gBAAa7B,EAAMoB,CAAM,EAEvC,IADAS,EAAUT,EAAO,SAAS,EACnBS,GAAW7B,EAAK,SAAS6B,CAAO,GACxB,KAAK,aAAab,EAAQa,EAAS5B,CAAG,GAEjDyB,EAAQ,IAAIG,CAAO,EAErBA,EAAUT,EAAO,SAAS,CAE9B,CACF,CACF,KAEA,QAAQ2E,EAAW,CACjB,IAAK,IAAK,CACR,MAAMlE,EAAU7B,EAAK,uBACjB6B,GACW,KAAK,aAAab,EAAQa,EAAS5B,CAAG,GAEjDyB,EAAQ,IAAIG,CAAO,EAGvB,KACF,CACA,IAAK,IAAK,CACR,GAAIJ,EAAY,CACd,MAAML,EAAS,KAAK,kBAAkBK,CAAU,EAChD,IAAII,KAAU,gBAAaJ,EAAYL,CAAM,EAE7C,IADAS,EAAUT,EAAO,WAAW,EACrBS,GACDA,IAAY7B,GAGD,KAAK,aAAagB,EAAQa,EAAS5B,CAAG,GAEjDyB,EAAQ,IAAIG,CAAO,EAGvBA,EAAUT,EAAO,YAAY,CAEjC,CACA,KACF,CACA,IAAK,IAAK,CACJK,GACW,KAAK,aAAaT,EAAQS,EAAYxB,CAAG,GAEpDyB,EAAQ,IAAID,CAAU,EAG1B,KACF,CACA,IAAK,IACL,QAAS,CACP,MAAMkC,EAAM,CAAC,EACb,IAAI9B,EAAUJ,EACd,KAAOI,GACQ,KAAK,aAAab,EAAQa,EAAS5B,CAAG,GAEjD0D,EAAI,KAAK9B,CAAO,EAElBA,EAAUA,EAAQ,WAEpB,GAAI8B,EAAI,OACN,OAAO,IAAI,IAAIA,EAAI,QAAQ,CAAC,CAEhC,CACF,CAEF,OAAOjC,CACT,CAUA,UAAUV,EAAQf,EAAK,CACrB,KAAM,CAAE,KAAAD,CAAK,EAAIC,EACXmB,EAAS,KAAK/B,GACpB,IAAIwC,KAAU,gBAAa7B,EAAMoB,CAAM,EACnC6E,EACJ,GAAIpE,EAQF,KAPIA,EAAQ,WAAa,gBAEdA,IAAY7B,GACjB6B,IAAY,KAAKtC,MACnBsC,EAAUT,EAAO,SAAS,GAGvBS,GAAS,CAId,GAHgB,KAAK,aAAab,EAAQa,EAAS,CACjD,KAAM,KAAKlC,EACb,CAAC,EACY,CACXsG,EAAcpE,EACd,KACF,CACAA,EAAUT,EAAO,SAAS,CAC5B,CAEF,OAAO6E,GAAe,IACxB,CAQA,WAAWjF,EAAQ,CACjB,MAAMX,EAAQ,CAAC,EACT4B,EAAO,KAAK,aAAajB,EAAQ,KAAK9B,GAAO,CACjD,KAAM,KAAKS,EACb,CAAC,EACD,IAAIuG,EAAW,GACf,OAAIjE,IACF5B,EAAM,KAAK,KAAKnB,EAAK,EACrBgH,EAAW,IAEN,CAAC7F,EAAO6F,CAAQ,CACzB,CASA,YAAYlF,EAAQf,EAAM,CAAC,EAAG,CAC5B,KAAM,CAAE,QAAAkG,CAAQ,EAAIlG,EACdI,EAAQ,CAAC,EACf,IAAI4B,EAAO,KAAK,aAAajB,EAAQ,KAAK9B,GAAO,CAC/C,KAAM,KAAKS,EACb,CAAC,EACGuG,EAAW,GAKf,GAJIjE,IACF5B,EAAM,KAAK,KAAKnB,EAAK,EACrBgH,EAAW,IAET,CAACjE,GAAQkE,EAAS,CACpB,IAAItE,EAAU,KAAK3C,GAAM,WACzB,KAAO2C,IACLI,EAAO,KAAK,aAAajB,EAAQa,EAAS,CACxC,KAAM,KAAKlC,EACb,CAAC,EACGsC,IACF5B,EAAM,KAAKwB,CAAO,EAClBqE,EAAW,IAETrE,EAAQ,aACVA,EAAUA,EAAQ,UAKxB,CACA,MAAO,CAACxB,EAAO6F,CAAQ,CACzB,CAQA,WAAWlF,EAAQ,CACjB,MAAMX,EAAQ,CAAC,EACTL,EAAO,KAAK,UAAUgB,EAAQ,CAClC,KAAM,KAAK9B,EACb,CAAC,EACD,IAAIgH,EAAW,GACf,OAAIlG,IACFK,EAAM,KAAKL,CAAI,EACfkG,EAAW,IAEN,CAAC7F,EAAO6F,CAAQ,CACzB,CAWA,wBAAwBpF,EAAOb,EAAM,CAAC,EAAG,CACvC,KAAM,CAAE,QAAAkG,EAAS,SAAAT,EAAU,aAAAC,EAAc,WAAAS,CAAW,EAAInG,EACxD,IAAII,EAAQ,CAAC,EACT6F,EAAW,GACXG,EAAY,GAChB,MAAM5F,EAAIK,EAAM,OAChB,GAAIL,EACF,GAAI,KAAKvB,GAAM,WAAa,eAC1B,QAASwB,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMV,EAAOc,EAAMJ,CAAC,EACpB,GAAIV,IAAS,KAAKd,KACb,KAAKA,GAAM,SAASc,CAAI,GAAKA,EAAK,SAAS,KAAKd,EAAK,IACxD,GAAIwG,GAIF,GAHa,KAAK,aAAaC,EAAc3F,EAAM,CACjD,KAAM,KAAKL,EACb,CAAC,IAECU,EAAM,KAAKL,CAAI,EACfkG,EAAW,GACPE,IAAe,gBACjB,cAIJ/F,EAAM,KAAKL,CAAI,EACfkG,EAAW,GACPE,IAAe,eACjB,MAIR,SACSD,EACT,GAAIT,EACF,QAAShF,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMV,EAAOc,EAAMJ,CAAC,EAIpB,GAHa,KAAK,aAAaiF,EAAc3F,EAAM,CACjD,KAAM,KAAKL,EACb,CAAC,IAECU,EAAM,KAAKL,CAAI,EACfkG,EAAW,GACPE,IAAe,gBACjB,KAGN,MAEA/F,EAAQ,CAAC,EAAE,MAAM,KAAKS,CAAK,EAC3BoF,EAAW,GACXG,EAAY,WAELX,EACT,QAAShF,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMV,EAAOc,EAAMJ,CAAC,EAIpB,GAHa,KAAK,aAAaiF,EAAc3F,EAAM,CACjD,KAAM,KAAKL,EACb,CAAC,IAECU,EAAM,KAAKL,CAAI,EACfkG,EAAW,GACPE,IAAe,gBACjB,KAGN,MAEA/F,EAAQ,CAAC,EAAE,MAAM,KAAKS,CAAK,EAC3BoF,EAAW,GACXG,EAAY,GAGhB,MAAO,CAAChG,EAAO6F,EAAUG,CAAS,CACpC,CAUA,gBAAgBnD,EAAMkD,EAAYD,EAAS,CACzC,KAAM,CAAE,OAAAnF,CAAO,EAAIkC,EACb,CAACL,EAAM,GAAG8C,CAAY,EAAI3E,EAC1B0E,EAAWC,EAAa,OAAS,EACjC,CAAE,KAAME,EAAU,KAAM/C,CAAS,EAAID,EAC3C,IAAIxC,EAAQ,CAAC,EACTgG,EAAY,GACZH,EAAW,GACXJ,EAAU,GACd,OAAQhD,EAAU,CAChB,KAAK,0BAAyB,CAC5B,UAAQ,2BAA2B+C,EAAU,CAC3C,KAAM,KAAKlG,EACb,CAAC,EACD,KACF,CACA,KAAK,cAAa,CAChB,GAAIyG,IAAe,cACjB,CAAC/F,EAAO6F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,UACjCoF,IAAe,gBACxB,CAAC/F,EAAO6F,CAAQ,EAAI,KAAK,YAAYlF,EAAQ,CAC3C,QAAAmF,CACF,CAAC,UACQC,IAAe,gBACf,KAAK7G,GAAM,WAAa,eAAc,CAC/C,MAAMS,EAAO,KAAKT,GAAM,eAAesG,CAAQ,EAC3C7F,IACE0F,EACW,KAAK,aAAaC,EAAc3F,EAAM,CACjD,KAAM,KAAKL,EACb,CAAC,IAECU,EAAM,KAAKL,CAAI,EACfkG,EAAW,KAGb7F,EAAM,KAAKL,CAAI,EACfkG,EAAW,IAGjB,MAAWE,IAAe,eACxB,CAAC/F,EAAO6F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,EAE1C8E,EAAU,GAEZ,KACF,CACA,KAAK,iBAAgB,CACnB,GAAIM,IAAe,cACjB,CAAC/F,EAAO6F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,UACjCoF,IAAe,gBACxB,CAAC/F,EAAO6F,CAAQ,EAAI,KAAK,YAAYlF,EAAQ,CAC3C,QAAAmF,CACF,CAAC,UACQ,KAAK5G,GAAM,WAAa,gBAAe,CAChD,MAAMuB,EAAQ,KAAKvB,GAAM,uBAAuBsG,CAAQ,EACpD/E,EAAM,SACR,CAACT,EAAO6F,EAAUG,CAAS,EAAI,KAAK,wBAAwBvF,EAAO,CACjE,QAAAqF,EACA,SAAAT,EACA,aAAAC,EACA,WAAAS,CACF,CAAC,EAEL,MAAWA,IAAe,eACxB,CAAC/F,EAAO6F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,EAE1C8E,EAAU,GAEZ,KACF,CACA,KAAK,gBAAe,CAClB,GAAIM,IAAe,cACjB,CAAC/F,EAAO6F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,UACjCoF,IAAe,gBACxB,CAAC/F,EAAO6F,CAAQ,EAAI,KAAK,YAAYlF,EAAQ,CAC3C,QAAAmF,CACF,CAAC,UACQ,KAAKrH,GAAU,cAAgB,aAC/B,KAAKS,GAAM,WAAa,iBACxB,CAAC,OAAO,KAAKsG,CAAQ,EAAG,CACjC,MAAM/E,EAAQ,KAAKvB,GAAM,qBAAqBsG,CAAQ,EAClD/E,EAAM,SACR,CAACT,EAAO6F,EAAUG,CAAS,EAAI,KAAK,wBAAwBvF,EAAO,CACjE,QAAAqF,EACA,SAAAT,EACA,aAAAC,EACA,WAAAS,CACF,CAAC,EAEL,MAAWA,IAAe,eACxB,CAAC/F,EAAO6F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,EAE1C8E,EAAU,GAEZ,KACF,CACA,QACE,GAAIM,IAAe,iBAAiB,kBAAgB,KAAKP,CAAQ,GAC/D,GAAI,KAAKrG,IACL,KAAKN,GAAM,WAAa,yBAAwB,CAClD,MAAMc,EAAO,KAAK,4BAA4B6C,EAAM,KAAK3D,EAAK,EAC1Dc,IACFK,EAAM,KAAKL,CAAI,EACfkG,EAAW,GAEf,OACSE,IAAe,cACxB,CAAC/F,EAAO6F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,EACjCoF,IAAe,gBACxB,CAAC/F,EAAO6F,CAAQ,EAAI,KAAK,YAAYlF,EAAQ,CAC3C,QAAAmF,CACF,CAAC,EACQC,IAAe,eACxB,CAAC/F,EAAO6F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,EAE1C8E,EAAU,EAGhB,CACA,MAAO,CACL,UAAAO,EACA,SAAAX,EACA,SAAAQ,EACA,MAAA7F,EACA,QAAAyF,CACF,CACF,CAQA,cAAcM,EAAY,CACxB,MAAM9F,EAAM,KAAK3B,GAAK,OAAO,EAC7B,GAAIyH,IAAe,cAAcA,IAAe,eAAc,CAC5D,MAAME,EAAe,IAAI,IACzB,IAAI5F,EAAI,EACR,SAAW,CAAE,OAAAK,CAAO,IAAKT,EAAK,CAC5B,MAAMiG,EAAYxF,EAAO,OACnBoF,EAAUI,EAAY,EACtBC,EAAYzF,EAAO,CAAC,EAC1B,IAAIiF,EACA9C,EACJ,GAAIiD,EAAS,CACX,KAAM,CACJ,MAAOM,EACP,OAAQ,CAAC,CACP,KAAMC,EACN,KAAMC,CACR,CAAC,CACH,EAAIH,EACEI,EAAW7F,EAAOwF,EAAY,CAAC,EAC/B,CACJ,OAAQ,CAAC,CACP,KAAMM,EACN,KAAMC,CACR,CAAC,CACH,EAAIF,EACJ,GAAIE,IAAa,2BACbA,IAAa,cACfd,EAAMtH,EACNwE,EAAO0D,UACED,IAAc,2BACdA,IAAc,cACvBX,EAAMvH,EACNyE,EAAOsD,UACEJ,IAAe,aACxB,GAAIM,IAAc,KAAOC,IAAc,gBACrCX,EAAMtH,EACNwE,EAAO0D,UACEC,IAAa,KAAOC,IAAa,gBAC1Cd,EAAMvH,EACNyE,EAAOsD,UACED,IAAc,EAAG,CAC1B,KAAM,CAAE,KAAMR,CAAU,EAAIU,EACxB,SAAS,KAAKV,CAAS,GACzBC,EAAMtH,EACNwE,EAAO0D,IAEPZ,EAAMvH,EACNyE,EAAOsD,EAEX,MACER,EAAMvH,EACNyE,EAAOsD,UAEAK,IAAa,KAAOC,IAAa,gBAC1Cd,EAAMvH,EACNyE,EAAOsD,UACEE,IAAc,KAAOC,IAAc,gBAC5CX,EAAMtH,EACNwE,EAAO0D,MACF,CACL,IAAI3E,EACJ,SAAW,CAAE,MAAAc,EAAO,OAAQ,CAACF,CAAI,CAAE,IAAK9B,EAAQ,CAC9C,KAAM,CAAE,KAAM8E,EAAU,KAAM/C,CAAS,EAAID,EAC3C,GAAIC,IAAa,yBAAyB+C,IAAa,MAAO,CAC5D5D,EAAO,GACP,KACF,CACA,GAAI,CAACA,GAAQc,EAAO,CAClB,KAAM,CAAE,KAAMgD,CAAU,EAAIhD,EACxB,SAAS,KAAKgD,CAAS,IACzB9D,EAAO,GAEX,CACF,CACIA,GACF+D,EAAMvH,EACNyE,EAAOsD,IAEPR,EAAMtH,EACNwE,EAAO0D,EAEX,CACF,MACEZ,EAAMtH,EACNwE,EAAOsD,EAET,KAAM,CACJ,UAAAH,EAAW,SAAAX,EAAU,SAAAQ,EAAU,MAAA7F,EAAO,QAAAyF,CACxC,EAAI,KAAK,gBAAgB5C,EAAMkD,EAAYD,CAAO,EAC9C9F,EAAM,QACR,KAAK1B,GAAK+B,CAAC,EAAE,KAAO,GACpB,KAAKvB,GAAOuB,CAAC,EAAIL,GACRyF,GACTQ,EAAa,IAAI,IAAI,IAAI,CACvB,CAAC,QAAS5F,CAAC,EACX,CAAC,OAAQwC,CAAI,CACf,CAAC,CAAC,EAEJ,KAAKvE,GAAK+B,CAAC,EAAE,UAAY2F,EACzB,KAAK1H,GAAK+B,CAAC,EAAE,IAAMsF,EACnB,KAAKrH,GAAK+B,CAAC,EAAE,SAAWwF,GAAY,CAACR,EACrChF,GACF,CACA,GAAI4F,EAAa,KAAM,CACrB,IAAItG,EACAoB,EACA,KAAKlC,KAAU,KAAKK,IAAS,KAAKL,GAAM,WAAa,gBACvDc,EAAO,KAAKd,GACZkC,EAAS,KAAK/B,KAEdW,EAAO,KAAKT,GACZ6B,EAAS,KAAK3B,IAEhB,IAAI0D,KAAW,gBAAanD,EAAMoB,CAAM,EACxC,KAAO+B,GAAU,CACf,IAAIlB,EAAO,GAUX,GATI,KAAK/C,GAAM,WAAa,eACtBiE,IAAa,KAAKjE,GACpB+C,EAAO,GAEPA,EAAO,KAAK/C,GAAM,SAASiE,CAAQ,EAGrClB,EAAO,GAELA,EACF,UAAW8E,KAAeT,EAAc,CACtC,KAAM,CAAE,OAAAtF,CAAO,EAAI+F,EAAY,IAAI,MAAM,EAIzC,GAHgB,KAAK,aAAa/F,EAAQmC,EAAU,CAClD,KAAM,KAAKxD,EACb,CAAC,EACY,CACX,MAAMqH,EAAQD,EAAY,IAAI,OAAO,EACrC,KAAKpI,GAAKqI,CAAK,EAAE,SAAW,GAC5B,KAAKrI,GAAKqI,CAAK,EAAE,KAAO,GACxB,KAAK7H,GAAO6H,CAAK,EAAE,KAAK7D,CAAQ,CAClC,CACF,CAEEA,IAAa/B,EAAO,cACtB+B,KAAW,gBAAaA,EAAU/B,CAAM,GAE1C+B,EAAW/B,EAAO,SAAS,CAC7B,CACF,CACF,KAAO,CACL,IAAIV,EAAI,EACR,SAAW,CAAE,OAAAK,CAAO,IAAKT,EAAK,CAC5B,MAAM4C,EAAOnC,EAAOA,EAAO,OAAS,CAAC,EAC/BoF,EAAUpF,EAAO,OAAS,EAC1B,CACJ,SAAA2E,EAAU,SAAAQ,EAAU,MAAA7F,CACtB,EAAI,KAAK,gBAAgB6C,EAAMkD,EAAYD,CAAO,EAC9C9F,EAAM,SACR,KAAK1B,GAAK+B,CAAC,EAAE,KAAO,GACpB,KAAKvB,GAAOuB,CAAC,EAAIL,GAEnB,KAAK1B,GAAK+B,CAAC,EAAE,IAAMhC,EACnB,KAAKC,GAAK+B,CAAC,EAAE,SAAWwF,GAAY,CAACR,EACrChF,GACF,CACF,CACA,MAAO,CACL,KAAK/B,GACL,KAAKQ,EACP,CACF,CAUA,kBAAkB+D,EAAM7C,EAAO2F,EAAK,CAClC,MAAMrC,EAAM,CAAC,EACb,UAAW3D,KAAQK,EAAO,CACxB,MAAMqB,EAAU,KAAK,iBAAiBwB,EAAMlD,EAAM,CAChD,IAAAgG,EACA,KAAM,KAAKrG,EACb,CAAC,EACG+B,EAAQ,MACViC,EAAI,KAAK,GAAGjC,CAAO,CAEvB,CACA,OAAIiC,EAAI,OACC,IAAI,IAAIA,CAAG,EAEb,IAAI,GACb,CAWA,eAAe5C,EAAQV,EAAOJ,EAAK,CACjC,KAAM,CAAE,MAAA8C,EAAO,MAAAiE,CAAM,EAAI/G,EACnB,CAAE,MAAOgH,EAAW,OAAAjG,CAAO,EAAID,EAAOiG,CAAK,EAC3C9D,EAAO,CACX,MAAAH,EACA,OAAA/B,CACF,EACM0C,EAAY,KAAK,kBAAkBR,EAAM7C,EAAO5B,CAAQ,EAC9D,IAAI8E,EACJ,GAAIG,EAAU,KACZ,GAAIsD,IAAUjG,EAAO,OAAS,EAAG,CAC/B,KAAM,CAACoC,CAAQ,KAAI,aAAUO,CAAS,EACtCH,EAAMJ,CACR,MACEI,EAAM,KAAK,eAAexC,EAAQ2C,EAAW,CAC3C,MAAOuD,EACP,MAAOD,EAAQ,CACjB,CAAC,EAGL,OAAOzD,GAAO,IAChB,CAWA,eAAexC,EAAQf,EAAMC,EAAK,CAChC,KAAM,CAAE,MAAA+G,CAAM,EAAI/G,EACZiD,EAAOnC,EAAOiG,CAAK,EACnB3G,EAAQ,IAAI,IAAI,CAACL,CAAI,CAAC,EACtB0D,EAAY,KAAK,kBAAkBR,EAAM7C,EAAO3B,CAAQ,EAC9D,IAAI6E,EACJ,GAAIG,EAAU,MACZ,GAAIsD,IAAU,EACZzD,EAAMvD,MAEN,WAAWmD,KAAYO,EAIrB,GAHgB,KAAK,eAAe3C,EAAQoC,EAAU,CACpD,MAAO6D,EAAQ,CACjB,CAAC,EAEC,OAAOhH,EAKf,OAAOuD,GAAO,IAChB,CAQA,MAAM6C,EAAY,EACZA,IAAe,cAAcA,IAAe,iBAC9C,KAAK,4BAA4B,EAEnC,KAAM,CAAC,CAAC,GAAGxF,CAAQ,EAAGsG,CAAc,EAAI,KAAK,cAAcd,CAAU,EAC/D3F,EAAIG,EAAS,OACnB,IAAIuG,EACA9G,EAAQ,IAAI,IAChB,QAASK,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,KAAM,CAAE,OAAAK,EAAQ,UAAAsF,EAAW,IAAAL,EAAK,KAAAoB,CAAK,EAAIxG,EAASF,CAAC,EAC7C6F,EAAYxF,EAAO,OACzB,GAAIwF,GAAaa,EAAM,CACrB,MAAMC,EAAaH,EAAexG,CAAC,EAC7B4G,EAAgBD,EAAW,OAC3B5D,EAAY8C,EAAY,EAC9B,GAAI9C,IAAc,EAChB,IAAK2C,IAAe,cAAcA,IAAe,iBAC7C,KAAKlH,GAAM,WAAa,eAC1B,QAASiD,EAAI,EAAGA,EAAImF,EAAenF,IAAK,CACtC,MAAMnC,EAAOqH,EAAWlF,CAAC,EACzB,GAAInC,IAAS,KAAKd,IAAS,KAAKA,GAAM,SAASc,CAAI,IACjDK,EAAM,IAAIL,CAAI,EACVoG,IAAe,cACjB,KAGN,SACSA,IAAe,aACxB,GAAI/F,EAAM,KAAM,CACd,MAAMkH,EAAI,CAAC,GAAGlH,CAAK,EACnBA,EAAQ,IAAI,IAAI,CAAC,GAAGkH,EAAG,GAAGF,CAAU,CAAC,EACrCF,EAAO,EACT,MACE9G,EAAQ,IAAI,IAAIgH,CAAU,MAEvB,CACL,KAAM,CAACrH,CAAI,EAAIqH,EACfhH,EAAM,IAAIL,CAAI,CAChB,SACSoG,IAAe,aACxB,GAAIJ,IAAQvH,EAAU,CACpB,GAAI,CAAE,MAAAsE,CAAM,EAAIhC,EAAO,CAAC,EACxB,UAAWf,KAAQqH,EAAY,CAC7B,IAAI3D,EAAY,IAAI,IAAI,CAAC1D,CAAI,CAAC,EAC9B,QAASmC,EAAI,EAAGA,EAAIoE,EAAWpE,IAAK,CAClC,KAAM,CAAE,MAAO8E,EAAW,OAAAjG,CAAO,EAAID,EAAOoB,CAAC,EACvCe,EAAO,CACX,MAAAH,EACA,OAAA/B,CACF,EAEA,GADA0C,EAAY,KAAK,kBAAkBR,EAAMQ,EAAWsC,CAAG,EACnDtC,EAAU,KACZ,GAAIvB,IAAMsB,EACR,GAAIpD,EAAM,KAAM,CACd,MAAMkH,EAAI,CAAC,GAAGlH,CAAK,EACnBA,EAAQ,IAAI,IAAI,CAAC,GAAGkH,EAAG,GAAG7D,CAAS,CAAC,EACpCyD,EAAO,EACT,MACE9G,EAAQqD,OAGVX,EAAQkE,MAGV,MAEJ,CACF,CACF,KACE,WAAWjH,KAAQqH,EAAY,CAC7B,IAAI3D,EAAY,IAAI,IAAI,CAAC1D,CAAI,CAAC,EAC9B,QAASmC,EAAIsB,EAAY,EAAGtB,GAAK,EAAGA,IAAK,CACvC,MAAMe,EAAOnC,EAAOoB,CAAC,EAErB,GADAuB,EAAY,KAAK,kBAAkBR,EAAMQ,EAAWsC,CAAG,EACnDtC,EAAU,KACRvB,IAAM,IACR9B,EAAM,IAAIL,CAAI,EACVuG,EAAY,GAAKlG,EAAM,KAAO,IAChC8G,EAAO,SAIX,MAEJ,CACF,SAEOf,IAAe,gBAAgBJ,IAAQvH,EAAU,CAC1D,KAAM,CAAE,MAAO+I,CAAW,EAAIzG,EAAO,CAAC,EACtC,IAAIW,EACJ,UAAW1B,KAAQqH,EAKjB,GAJA3F,EAAU,KAAK,eAAeX,EAAQ,IAAI,IAAI,CAACf,CAAI,CAAC,EAAG,CACrD,MAAOwH,EACP,MAAO,CACT,CAAC,EACG9F,EAAS,CACXrB,EAAM,IAAIqB,CAAO,EACjB,KACF,CAEF,GAAI,CAACA,GAAW,CAAC2E,EAAW,CAC1B,KAAM,CAAE,OAAQoB,CAAY,EAAI1G,EAAO,CAAC,EAClC,CAAC2G,CAAS,EAAIL,EACpB,IAAIxF,EAAU,KAAK,UAAU4F,EAAa,CACxC,KAAMC,CACR,CAAC,EACD,KAAO7F,GAAS,CAKd,GAJAH,EAAU,KAAK,eAAeX,EAAQ,IAAI,IAAI,CAACc,CAAO,CAAC,EAAG,CACxD,MAAO2F,EACP,MAAO,CACT,CAAC,EACG9F,EAAS,CACXrB,EAAM,IAAIqB,CAAO,EACjB,KACF,CACAG,EAAU,KAAK,UAAU4F,EAAa,CACpC,KAAM5F,CACR,CAAC,CACH,CACF,CACF,KAAO,CACL,IAAIH,EACJ,UAAW1B,KAAQqH,EAIjB,GAHA3F,EAAU,KAAK,eAAeX,EAAQf,EAAM,CAC1C,MAAOyD,EAAY,CACrB,CAAC,EACG/B,EAAS,CACXrB,EAAM,IAAIL,CAAI,EACd,KACF,CAEF,GAAI,CAAC0B,GAAW,CAAC2E,GAAaD,IAAe,eAAc,CACzD,KAAM,CAAE,OAAQqB,CAAY,EAAI1G,EAAO0C,CAAS,EAC1C,CAACiE,CAAS,EAAIL,EACpB,IAAIxF,EAAU,KAAK,UAAU4F,EAAa,CACxC,KAAMC,CACR,CAAC,EACD,KAAO7F,GAAS,CAId,GAHAH,EAAU,KAAK,eAAeX,EAAQc,EAAS,CAC7C,MAAO4B,EAAY,CACrB,CAAC,EACG/B,EAAS,CACXrB,EAAM,IAAIwB,CAAO,EACjB,KACF,CACAA,EAAU,KAAK,UAAU4F,EAAa,CACpC,KAAM5F,CACR,CAAC,CACH,CACF,CACF,CACF,CACF,CACA,OAAIuE,IAAe,cAAce,IAC/B9G,EAAQ,IAAI,OAAI,aAAUA,CAAK,CAAC,GAE3BA,CACT,CACF",
|
|
6
|
-
"names": ["finder_exports", "__export", "Finder", "__toCommonJS", "import_dom_util", "import_matcher", "import_parser", "import_constant", "DIR_NEXT", "DIR_PREV", "#ast", "#astCache", "#descendant", "#document", "#documentCache", "#event", "#invalidate", "#node", "#nodes", "#noexcept", "#qswalker", "#results", "#root", "#shadow", "#walker", "#walkers", "#warn", "#window", "window", "e", "selector", "node", "opt", "event", "noexcept", "warn", "nodes", "ast", "cachedItem", "item", "l", "i", "cssAst", "branches", "descendant", "items", "branch", "leaves", "nextItem", "msg", "itemName", "walker", "anb", "a", "b", "reverse", "parentNode", "matched", "selectorBranches", "info", "refNode", "selectorNodes", "display", "visibility", "bool", "nth", "j", "localName", "prefix", "itemLocalName", "itemPrefix", "m", "nthName", "nthIdentName", "anbMap", "astLeaves", "leaf", "leafType", "combo", "twigLeaves", "itemType", "twig", "nextNode", "astData", "astName", "twigBranches", "res", "forgive", "lastIndex", "nextNodes", "arr", "astChildren", "selectors", "css", "leavesSet", "stateValue", "href", "origin", "pathname", "attrURL", "target", "type", "buttons", "hash", "id", "current", "focus", "active", "parent", "placeholder", "targetNode", "nodeName", "checked", "form", "inputType", "node1", "node2", "host", "astType", "result", "cacheable", "compound", "filterLeaves", "baseNode", "leafName", "pending", "comboName", "dir", "matchedNode", "filtered", "complex", "targetType", "collected", "pendingItems", "branchLen", "firstTwig", "firstCombo", "firstName", "firstType", "lastTwig", "lastName", "lastType", "pendingItem", "index", "nextCombo", "collectedNodes", "sort", "find", "entryNodes", "entryNodesLen", "n", "entryCombo", "entryLeaves", "entryNode"]
|
|
4
|
+
"sourcesContent": ["/**\n * finder.js\n */\n\n/* import */\nimport {\n isContentEditable, isCustomElement, isInShadowTree, resolveContent,\n sortNodes, traverseNode\n} from './dom-util.js';\nimport { matcher } from './matcher.js';\nimport {\n generateCSS, parseSelector, sortAST, unescapeSelector, walkAST\n} from './parser.js';\n\n/* constants */\nimport {\n BIT_01, COMBINATOR, DOCUMENT_FRAGMENT_NODE, DOCUMENT_NODE, ELEMENT_NODE,\n EMPTY, NOT_SUPPORTED_ERR, REG_ANCHOR, REG_FORM, REG_FORM_CTRL,\n REG_FORM_VALID, REG_INTERACT, REG_INVALIDATE_PSEUDO, REG_LOGICAL_PSEUDO,\n REG_SHADOW_HOST, REG_TYPE_CHECK, REG_TYPE_DATE, REG_TYPE_RANGE,\n REG_TYPE_RESET, REG_TYPE_SUBMIT, REG_TYPE_TEXT, SELECTOR_ATTR,\n SELECTOR_CLASS, SELECTOR_ID, SELECTOR_PSEUDO_CLASS, SELECTOR_PSEUDO_ELEMENT,\n SELECTOR_TYPE, SHOW_ALL, SYNTAX_ERR, TARGET_ALL, TARGET_FIRST, TARGET_LINEAL,\n TARGET_SELF, TEXT_NODE, WALKER_FILTER\n} from './constant.js';\nconst DIR_NEXT = 'next';\nconst DIR_PREV = 'prev';\n\n/**\n * Finder\n * NOTE: #ast[i] corresponds to #nodes[i]\n * #ast: Array<Ast | undefined>\n * #nodes: Array<Nodes>\n * Ast: {\n * branch: Array<Branch | undefined>,\n * collected: boolean,\n * dir: string | null,\n * filtered: boolean,\n * find: boolean\n * }\n * Branch: Array<Twig>\n * Twig: {\n * combo: Leaf | null,\n * leaves: Array<Leaf>\n * }\n * Leaf: {\n * children: Array<Leaf | undefined> | null,\n * loc: null,\n * type: string\n * }\n * Nodes: Array<HTMLElement | undefined>\n */\nexport class Finder {\n /* private fields */\n #ast;\n #astCache;\n #descendant;\n #document;\n #documentCache;\n #event;\n #invalidate;\n #node;\n #nodes;\n #noexcept;\n #qswalker;\n #results;\n #root;\n #shadow;\n #walker;\n #walkers;\n #warn;\n #window;\n\n /**\n * construct\n * @param {object} window - window\n */\n constructor(window) {\n this.#window = window;\n this.#astCache = new WeakMap();\n this.#documentCache = new WeakMap();\n this.#results = 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 e instanceof this.#window.DOMException) {\n if (e.name === NOT_SUPPORTED_ERR) {\n if (this.#warn) {\n console.warn(e.message);\n }\n } else {\n throw new this.#window.DOMException(e.message, e.name);\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 {object} [opt.event] - MouseEvent, KeyboardEvent\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 { event, noexcept, warn } = opt;\n this.#noexcept = !!noexcept;\n this.#warn = !!warn;\n this.#event = this._setEvent(event);\n this.#node = node;\n [this.#document, this.#root, this.#walker] = resolveContent(node);\n this.#shadow = isInShadowTree(node);\n [this.#ast, this.#nodes] = this._correspond(selector);\n this.#walkers = new WeakMap();\n this.#invalidate = false;\n return node;\n }\n\n /**\n * set event\n * @private\n * @param {object} event - instance of KeyboardEvent, MouseEvent\n * @returns {object} - result\n */\n _setEvent(event) {\n // NOTE: PointerEvent not implemented in jsdom\n return (event instanceof this.#window.KeyboardEvent ||\n event instanceof this.#window.MouseEvent)\n ? event\n : null;\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 this.#descendant = false;\n let ast;\n if (this.#documentCache.has(this.#document)) {\n const cachedItem = this.#documentCache.get(this.#document);\n if (cachedItem && cachedItem.has(`${selector}`)) {\n const item = cachedItem.get(`${selector}`);\n ast = item.ast;\n this.#descendant = item.descendant;\n this.#invalidate = item.invalidate;\n }\n }\n if (ast) {\n const l = ast.length;\n for (let i = 0; i < l; i++) {\n ast[i].collected = false;\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, info: { hasHasPseudo } } = walkAST(cssAst);\n const invalidate = !!hasHasPseudo;\n let descendant = false;\n let i = 0;\n ast = [];\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 const itemName = item.name;\n if (/^[\\s>]$/.test(itemName)) {\n descendant = true;\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 && typeof itemName === 'string') {\n itemName = unescapeSelector(itemName);\n if (typeof itemName === 'string' && itemName !== item.name) {\n item.name = itemName;\n }\n if (/[|:]/.test(itemName)) {\n item.namespace = true;\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 collected: false,\n dir: null,\n filtered: false,\n find: false\n });\n nodes[i] = [];\n i++;\n }\n let cachedItem;\n if (this.#documentCache.has(this.#document)) {\n cachedItem = this.#documentCache.get(this.#document);\n } else {\n cachedItem = new Map();\n }\n cachedItem.set(`${selector}`, {\n ast,\n descendant,\n invalidate\n });\n this.#documentCache.set(this.#document, cachedItem);\n this.#descendant = descendant;\n this.#invalidate = invalidate;\n }\n return [\n ast,\n nodes\n ];\n }\n\n /**\n * create tree walker\n * @private\n * @param {object} node - Document, DocumentFragment, Element node\n * @returns {object} - tree walker\n */\n _createTreeWalker(node) {\n let walker;\n if (this.#walkers.has(node)) {\n walker = this.#walkers.get(node);\n } else {\n walker = this.#document.createTreeWalker(node, WALKER_FILTER);\n this.#walkers.set(node, walker);\n }\n return walker;\n }\n\n /**\n * prepare querySelector walker\n * @private\n * @returns {object} - tree walker\n */\n _prepareQuerySelectorWalker() {\n this.#qswalker = this._createTreeWalker(this.#node);\n return this.#qswalker;\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 const matched = new Set();\n let selectorBranches;\n if (selector) {\n if (this.#astCache.has(selector)) {\n selectorBranches = this.#astCache.get(selector);\n } else {\n const { branches, info } = walkAST(selector);\n selectorBranches = branches;\n this.#astCache.set(selector, selectorBranches);\n if (info.hasLogicalPseudoFunc) {\n this.#invalidate = true;\n }\n }\n }\n if (parentNode) {\n const walker = this.#walker;\n let refNode = traverseNode(parentNode, walker);\n refNode = walker.firstChild();\n let l = 0;\n while (refNode) {\n l++;\n refNode = walker.nextSibling();\n }\n const selectorNodes = new Set();\n if (selectorBranches) {\n refNode = traverseNode(parentNode, walker);\n refNode = walker.firstChild();\n while (refNode) {\n const { display, visibility } =\n this.#window.getComputedStyle(refNode);\n if (display !== 'none' && visibility !== 'hidden') {\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 }\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 refNode = traverseNode(parentNode, walker);\n if (reverse) {\n refNode = walker.lastChild();\n } else {\n refNode = walker.firstChild();\n }\n let i = 0;\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 refNode = traverseNode(parentNode, walker);\n if (reverse) {\n refNode = walker.lastChild();\n } else {\n refNode = walker.firstChild();\n }\n let i = 0;\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 refNode = traverseNode(parentNode, walker);\n if (reverse) {\n refNode = walker.lastChild();\n } else {\n refNode = walker.firstChild();\n }\n let i = 0;\n let j = a > 0 ? 0 : b - 1;\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 return 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 const matched = new Set();\n if (parentNode) {\n const walker = this.#walker;\n let refNode = traverseNode(parentNode, walker);\n refNode = walker.firstChild();\n let l = 0;\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 refNode = traverseNode(parentNode, walker);\n if (reverse) {\n refNode = walker.lastChild();\n } else {\n refNode = walker.firstChild();\n }\n let j = 0;\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 refNode = traverseNode(parentNode, walker);\n if (reverse) {\n refNode = walker.lastChild();\n } else {\n refNode = walker.firstChild();\n }\n let j = a > 0 ? 0 : b - 1;\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 return 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 anbMap = new Map();\n if (nthIdentName) {\n if (nthIdentName === 'even') {\n anbMap.set('a', 2);\n anbMap.set('b', 0);\n } else if (nthIdentName === '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 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 return nodes;\n } else if (/^nth-(?:last-)?of-type$/.test(nthName)) {\n const anb = Object.fromEntries(anbMap);\n const nodes = this._collectNthOfType(anb, node);\n return nodes;\n }\n return new Set();\n }\n\n /**\n * match :has() pseudo-class function\n * @private\n * @param {Array.<object>} astLeaves - AST leaves\n * @param {object} node - Element node\n * @param {object} opt - options\n * @returns {boolean} - result\n */\n _matchHasPseudoFunc(astLeaves, node, opt = {}) {\n let bool;\n if (Array.isArray(astLeaves) && astLeaves.length) {\n const leaves = astLeaves.map(i => i);\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(leaves, 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(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, name: astName } = ast;\n const { localName, parentNode } = node;\n const {\n forgive,\n warn = this.#warn\n } = opt;\n const matched = new Set();\n // :has(), :is(), :not(), :where()\n if (REG_LOGICAL_PSEUDO.test(astName)) {\n let astData;\n if (this.#astCache.has(ast)) {\n astData = this.#astCache.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.#astCache.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 // :nth-child(), :nth-last-child(), nth-of-type(), :nth-last-of-type()\n if (/^nth-(?:last-)?(?:child|of-type)$/.test(astName)) {\n const [branch] = astChildren;\n const nodes = this._matchAnPlusB(branch, node, astName, opt);\n return nodes;\n } else {\n switch (astName) {\n // :dir(), :lang()\n case 'dir':\n case 'lang': {\n const res = matcher.matchSelector(ast, node);\n if (res) {\n matched.add(res);\n }\n break;\n }\n // :state()\n case 'state': {\n if (isCustomElement(node)) {\n const [{ value: stateValue }] = astChildren;\n if (stateValue && node[stateValue]) {\n matched.add(node);\n }\n }\n break;\n }\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 // dropped from CSS Selectors 3\n case 'contains': {\n if (warn) {\n const msg = `Unknown pseudo-class :${astName}()`;\n throw new DOMException(msg, NOT_SUPPORTED_ERR);\n }\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 switch (astName) {\n case 'any-link':\n case 'link': {\n if (REG_ANCHOR.test(localName) && node.hasAttribute('href')) {\n matched.add(node);\n }\n break;\n }\n case 'local-link': {\n if (REG_ANCHOR.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 'hover': {\n const { target, type } = this.#event ?? {};\n if ((type === 'mouseover' || type === 'pointerover') &&\n node.contains(target)) {\n matched.add(node);\n }\n break;\n }\n case 'active': {\n const { buttons, target, type } = this.#event ?? {};\n if ((type === 'mousedown' || type === 'pointerdown') &&\n buttons & BIT_01 && node.contains(target)) {\n matched.add(node);\n }\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 (!this.#shadow && 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 case 'focus-visible': {\n const { target, type } = this.#event ?? {};\n if (node === this.#document.activeElement && node.tabIndex >= 0 &&\n (astName === 'focus' ||\n (type === 'keydown' && node.contains(target)))) {\n let refNode = node;\n let focus = true;\n while (refNode) {\n if (refNode.disabled || refNode.hasAttribute('disabled') ||\n refNode.hidden || refNode.hasAttribute('hidden')) {\n focus = false;\n break;\n } else {\n const { display, visibility } =\n this.#window.getComputedStyle(refNode);\n focus = !(display === 'none' || visibility === 'hidden');\n if (!focus) {\n break;\n }\n }\n if (refNode.parentNode &&\n refNode.parentNode.nodeType === ELEMENT_NODE) {\n refNode = refNode.parentNode;\n } else {\n break;\n }\n }\n if (focus) {\n matched.add(node);\n }\n }\n break;\n }\n case 'focus-within': {\n let active;\n let current = this.#document.activeElement;\n if (current.tabIndex >= 0) {\n while (current) {\n if (current === node) {\n active = true;\n break;\n }\n current = current.parentNode;\n }\n }\n if (active) {\n let refNode = node;\n let focus = true;\n while (refNode) {\n if (refNode.disabled || refNode.hasAttribute('disabled') ||\n refNode.hidden || refNode.hasAttribute('hidden')) {\n focus = false;\n break;\n } else {\n const { display, visibility } =\n this.#window.getComputedStyle(refNode);\n focus = !(display === 'none' || visibility === 'hidden');\n if (!focus) {\n break;\n }\n }\n if (refNode.parentNode &&\n refNode.parentNode.nodeType === ELEMENT_NODE) {\n refNode = refNode.parentNode;\n } else {\n break;\n }\n }\n if (focus) {\n matched.add(node);\n }\n }\n break;\n }\n case 'open': {\n if (REG_INTERACT.test(localName) && node.hasAttribute('open')) {\n matched.add(node);\n }\n break;\n }\n case 'closed': {\n if (REG_INTERACT.test(localName) && !node.hasAttribute('open')) {\n matched.add(node);\n }\n break;\n }\n case 'disabled': {\n if (REG_FORM_CTRL.test(localName) ||\n isCustomElement(node, { formAssociated: true })) {\n if (node.disabled || node.hasAttribute('disabled')) {\n matched.add(node);\n } else if (node.localName === 'option') {\n if (parentNode.localName === 'optgroup' &&\n (parentNode.disabled ||\n parentNode.hasAttribute('disabled'))) {\n matched.add(node);\n }\n } else if (node.localName !== 'optgroup') {\n let bool;\n let parent = parentNode;\n while (parent) {\n if (parent.localName === 'fieldset' &&\n (parent.disabled || parent.hasAttribute('disabled'))) {\n const walker = this.#walker;\n let refNode = traverseNode(parent, walker);\n refNode = walker.firstChild();\n while (refNode) {\n if (refNode.localName === 'legend') {\n break;\n }\n refNode = walker.nextSibling();\n }\n if (refNode) {\n if (!refNode.contains(node)) {\n bool = true;\n }\n } else {\n bool = true;\n }\n break;\n } else if (parent.localName === 'form') {\n break;\n } else if (parent.parentNode?.nodeType === ELEMENT_NODE) {\n if (parent.parentNode.localName === 'form') {\n break;\n } else {\n parent = parent.parentNode;\n }\n } else {\n break;\n }\n }\n if (bool) {\n matched.add(node);\n }\n }\n }\n break;\n }\n case 'enabled': {\n if ((REG_FORM_CTRL.test(localName) ||\n isCustomElement(node, { formAssociated: true })) &&\n !(node.disabled && node.hasAttribute('disabled'))) {\n if (node.localName === 'optgroup') {\n matched.add(node);\n } else if (node.localName === 'option') {\n if (parentNode.localName !== 'optgroup' ||\n !(parentNode.disabled ||\n parentNode.hasAttribute('disabled'))) {\n matched.add(node);\n }\n } else {\n let bool;\n let parent = parentNode;\n while (parent) {\n if (parent.localName === 'fieldset' &&\n (parent.disabled || parent.hasAttribute('disabled'))) {\n const walker = this.#walker;\n let refNode = traverseNode(parent, walker);\n refNode = walker.firstChild();\n while (refNode) {\n if (refNode.localName === 'legend') {\n break;\n }\n refNode = walker.nextSibling();\n }\n if (refNode) {\n if (!refNode.contains(node)) {\n bool = true;\n }\n } else {\n bool = true;\n }\n break;\n } else if (parent.localName === 'form') {\n break;\n } else if (parent.parentNode?.nodeType === ELEMENT_NODE) {\n if (parent.parentNode.localName === 'form') {\n break;\n } else {\n parent = parent.parentNode;\n }\n } else {\n break;\n }\n }\n if (!bool) {\n matched.add(node);\n }\n }\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 || REG_TYPE_DATE.test(node.type) ||\n REG_TYPE_TEXT.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 || REG_TYPE_DATE.test(node.type) ||\n REG_TYPE_TEXT.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 placeholder;\n if (node.placeholder) {\n placeholder = node.placeholder;\n } else if (node.hasAttribute('placeholder')) {\n placeholder = node.getAttribute('placeholder');\n }\n if (typeof placeholder === 'string' && !/[\\r\\n]/.test(placeholder)) {\n let targetNode;\n if (localName === 'textarea') {\n targetNode = node;\n } else if (localName === 'input') {\n if (node.hasAttribute('type')) {\n if (REG_TYPE_TEXT.test(node.getAttribute('type'))) {\n targetNode = node;\n }\n } else {\n targetNode = node;\n }\n }\n if (targetNode && node.value === '') {\n matched.add(node);\n }\n }\n break;\n }\n case 'checked': {\n if ((node.checked && localName === 'input' &&\n node.hasAttribute('type') &&\n REG_TYPE_CHECK.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 const items = parent.getElementsByTagName('input');\n const l = items.length;\n let checked;\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 if (!checked) {\n matched.add(node);\n }\n }\n break;\n }\n case 'default': {\n // button[type=\"submit\"], input[type=\"submit\"], input[type=\"image\"]\n if ((localName === 'button' &&\n !(node.hasAttribute('type') &&\n REG_TYPE_RESET.test(node.getAttribute('type')))) ||\n (localName === 'input' && node.hasAttribute('type') &&\n REG_TYPE_SUBMIT.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 = this.#walker;\n let nextNode = traverseNode(form, walker);\n nextNode = walker.firstChild();\n while (nextNode && form.contains(nextNode)) {\n const nodeName = nextNode.localName;\n let m;\n if (nodeName === 'button') {\n m = !(nextNode.hasAttribute('type') &&\n REG_TYPE_RESET.test(nextNode.getAttribute('type')));\n } else if (nodeName === 'input') {\n m = nextNode.hasAttribute('type') &&\n REG_TYPE_SUBMIT.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 REG_TYPE_CHECK.test(node.getAttribute('type')) &&\n node.hasAttribute('checked')) {\n matched.add(node);\n // option\n } else if (localName === 'option' && node.hasAttribute('selected')) {\n matched.add(node);\n }\n break;\n }\n case 'valid': {\n if (REG_FORM_VALID.test(localName)) {\n if (node.checkValidity()) {\n if (node.maxLength >= 0) {\n if (node.maxLength >= node.value.length) {\n matched.add(node);\n }\n } else {\n matched.add(node);\n }\n }\n } else if (localName === 'fieldset') {\n const walker = this.#walker;\n let refNode = traverseNode(node, walker);\n refNode = walker.firstChild();\n let bool;\n if (!refNode) {\n bool = true;\n } else {\n while (refNode && node.contains(refNode)) {\n if (REG_FORM_VALID.test(refNode.localName)) {\n if (refNode.checkValidity()) {\n if (refNode.maxLength >= 0) {\n bool = refNode.maxLength >= refNode.value.length;\n } else {\n bool = true;\n }\n } else {\n bool = false;\n }\n if (!bool) {\n break;\n }\n }\n refNode = walker.nextNode();\n }\n }\n if (bool) {\n matched.add(node);\n }\n }\n break;\n }\n case 'invalid': {\n if (REG_FORM_VALID.test(localName)) {\n if (node.checkValidity()) {\n if (node.maxLength >= 0 && node.maxLength < node.value.length) {\n matched.add(node);\n }\n } else {\n matched.add(node);\n }\n } else if (localName === 'fieldset') {\n const walker = this.#walker;\n let refNode = traverseNode(node, walker);\n refNode = walker.firstChild();\n let bool;\n if (!refNode) {\n bool = true;\n } else {\n while (refNode && node.contains(refNode)) {\n if (REG_FORM_VALID.test(refNode.localName)) {\n if (refNode.checkValidity()) {\n if (refNode.maxLength >= 0) {\n bool = refNode.maxLength >= refNode.value.length;\n } else {\n bool = true;\n }\n } else {\n bool = false;\n }\n if (!bool) {\n break;\n }\n }\n refNode = walker.nextNode();\n }\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 REG_TYPE_RANGE.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 REG_TYPE_RANGE.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' || REG_TYPE_CHECK.test(inputType) ||\n REG_TYPE_DATE.test(inputType) ||\n REG_TYPE_TEXT.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' || REG_TYPE_CHECK.test(inputType) ||\n REG_TYPE_DATE.test(inputType) ||\n REG_TYPE_TEXT.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 const walker = this.#document.createTreeWalker(node, SHOW_ALL);\n let refNode = walker.firstChild();\n let bool;\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 'defined': {\n if (node.hasAttribute('is') || localName.includes('-')) {\n if (isCustomElement(node)) {\n matched.add(node);\n }\n // NOTE: MathMLElement not implemented in jsdom\n } else if (node instanceof this.#window.HTMLElement ||\n node instanceof this.#window.SVGElement) {\n matched.add(node);\n }\n break;\n }\n case 'popover-open': {\n if (node.popover) {\n const { display } = this.#window.getComputedStyle(node);\n if (display !== 'none') {\n matched.add(node);\n }\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 // not supported\n case 'autofill':\n case 'blank':\n case 'buffering':\n case 'current':\n case 'fullscreen':\n case 'future':\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, name: astName } = ast;\n let res;\n if (Array.isArray(astChildren)) {\n const { branches } = walkAST(astChildren[0]);\n const [branch] = branches;\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 parent = host;\n let bool;\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 matched = new Set();\n if (ast.name === EMPTY) {\n return matched;\n }\n const astName = unescapeSelector(ast.name);\n if (typeof astName === 'string' && astName !== ast.name) {\n ast.name = astName;\n }\n if (node.nodeType === ELEMENT_NODE) {\n switch (astType) {\n case SELECTOR_PSEUDO_ELEMENT: {\n matcher.matchPseudoElementSelector(astName, opt);\n break;\n }\n case SELECTOR_ID: {\n if (node.id === astName) {\n matched.add(node);\n }\n break;\n }\n case SELECTOR_CLASS: {\n if (node.classList.contains(astName)) {\n matched.add(node);\n }\n break;\n }\n case SELECTOR_PSEUDO_CLASS: {\n const nodes = this._matchPseudoClassSelector(ast, node, opt);\n return nodes;\n }\n default: {\n const res = matcher.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 return nodes;\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 let result = this.#results.get(leaves);\n if (result && result.has(node)) {\n const { matched } = result.get(node);\n bool = matched;\n }\n if (typeof bool !== 'boolean') {\n let cacheable = true;\n if (node.nodeType === ELEMENT_NODE && REG_FORM.test(node.localName)) {\n cacheable = false;\n }\n for (const leaf of leaves) {\n switch (leaf.type) {\n case SELECTOR_ATTR:\n case SELECTOR_ID: {\n cacheable = false;\n break;\n }\n case SELECTOR_PSEUDO_CLASS: {\n if (REG_INVALIDATE_PSEUDO.test(leaf.name)) {\n cacheable = false;\n }\n break;\n }\n default:\n }\n bool = this._matchSelector(leaf, node, opt).has(node);\n if (!bool) {\n break;\n }\n }\n if (cacheable && !this.#invalidate) {\n if (!result) {\n result = new WeakMap();\n }\n result.set(node, {\n matched: bool\n });\n this.#results.set(leaves, result);\n }\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 const 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 return 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 compound = filterLeaves.length > 0;\n const { type: leafType } = leaf;\n const leafName = unescapeSelector(leaf.name);\n if (typeof leafName === 'string' && leafName !== leaf.name) {\n leaf.name = leafName;\n }\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 matcher.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 { parentNode } = node;\n const { dir } = opt;\n const 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 if (parentNode) {\n const walker = this._createTreeWalker(parentNode);\n let refNode = traverseNode(node, walker);\n refNode = walker.nextSibling();\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._createTreeWalker(node);\n let refNode = traverseNode(node, walker);\n 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 return nodes;\n }\n if (pending) {\n const walker = this._createTreeWalker(node);\n let refNode = traverseNode(node, walker);\n refNode = walker.nextNode();\n while (refNode && node.contains(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 if (parentNode) {\n const walker = this._createTreeWalker(parentNode);\n let refNode = traverseNode(parentNode, walker);\n 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 }\n break;\n }\n case '>': {\n if (parentNode) {\n const bool = this._matchLeaves(leaves, parentNode, opt);\n if (bool) {\n matched.add(parentNode);\n }\n }\n break;\n }\n case ' ':\n default: {\n const arr = [];\n let refNode = 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 return new Set(arr.reverse());\n }\n }\n }\n }\n return matched;\n }\n\n /**\n * find matched node from #qswalker\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 const walker = this.#qswalker;\n let refNode = traverseNode(node, walker);\n let matchedNode;\n if (refNode) {\n if (refNode.nodeType !== ELEMENT_NODE) {\n refNode = walker.nextNode();\n } else if (refNode === node) {\n if (refNode !== this.#root) {\n refNode = walker.nextNode();\n }\n }\n while (refNode) {\n const matched = this._matchLeaves(leaves, refNode, {\n warn: this.#warn\n });\n if (matched) {\n matchedNode = refNode;\n break;\n }\n refNode = walker.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 const bool = this._matchLeaves(leaves, this.#node, {\n warn: this.#warn\n });\n let filtered = false;\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} leaves - AST leaves\n * @param {object} opt - options\n * @returns {Array} - [nodes, filtered]\n */\n _findLineal(leaves, opt = {}) {\n const { complex } = opt;\n const nodes = [];\n let bool = this._matchLeaves(leaves, this.#node, {\n warn: this.#warn\n });\n let filtered = false;\n if (bool) {\n nodes.push(this.#node);\n filtered = true;\n }\n if (!bool || complex) {\n let refNode = this.#node.parentNode;\n while (refNode) {\n bool = this._matchLeaves(leaves, refNode, {\n warn: this.#warn\n });\n if (bool) {\n nodes.push(refNode);\n filtered = true;\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 const node = this._findNode(leaves, {\n node: this.#node\n });\n let filtered = false;\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 { complex, compound, filterLeaves, targetType } = opt;\n let nodes = [];\n let filtered = false;\n let collected = 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 &&\n (this.#node.contains(node) || node.contains(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 if (targetType === TARGET_FIRST) {\n break;\n }\n }\n } else {\n nodes.push(node);\n filtered = true;\n if (targetType === TARGET_FIRST) {\n break;\n }\n }\n }\n }\n } else if (complex) {\n 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 if (targetType === TARGET_FIRST) {\n break;\n }\n }\n }\n } else {\n nodes = [].slice.call(items);\n filtered = true;\n collected = true;\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 if (targetType === TARGET_FIRST) {\n break;\n }\n }\n }\n } else {\n nodes = [].slice.call(items);\n filtered = true;\n collected = true;\n }\n }\n return [nodes, filtered, collected];\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 compound = filterLeaves.length > 0;\n const { name: leafName, type: leafType } = leaf;\n let nodes = [];\n let collected = false;\n let filtered = false;\n let pending = false;\n switch (leafType) {\n case SELECTOR_PSEUDO_ELEMENT: {\n matcher.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(leaves, {\n complex\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 if (targetType === TARGET_FIRST) {\n [nodes, filtered] = this._findFirst(leaves);\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(leaves, {\n complex\n });\n } else if (this.#root.nodeType === DOCUMENT_NODE) {\n const items = this.#root.getElementsByClassName(leafName);\n if (items.length) {\n [nodes, filtered, collected] = this._findFromHTMLCollection(items, {\n complex,\n compound,\n filterLeaves,\n targetType\n });\n }\n } else if (targetType === TARGET_FIRST) {\n [nodes, filtered] = this._findFirst(leaves);\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(leaves, {\n complex\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 if (items.length) {\n [nodes, filtered, collected] = this._findFromHTMLCollection(items, {\n complex,\n compound,\n filterLeaves,\n targetType\n });\n }\n } else if (targetType === TARGET_FIRST) {\n [nodes, filtered] = this._findFirst(leaves);\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(leaves, {\n complex\n });\n } else if (targetType === TARGET_FIRST) {\n [nodes, filtered] = this._findFirst(leaves);\n } else {\n pending = true;\n }\n }\n }\n return {\n collected,\n compound,\n filtered,\n nodes,\n pending\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 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 ||\n 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 for (const { combo, leaves: [leaf] } of branch) {\n const { name: leafName, type: leafType } = leaf;\n if (leafType === SELECTOR_PSEUDO_CLASS && leafName === 'dir') {\n bool = false;\n break;\n }\n if (!bool && combo) {\n const { name: comboName } = combo;\n if (/^[+~]$/.test(comboName)) {\n bool = 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 const {\n collected, 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].collected = collected;\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.#qswalker;\n } else {\n node = this.#root;\n walker = this.#walker;\n }\n let nextNode = traverseNode(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 if (nextNode !== walker.currentNode) {\n nextNode = traverseNode(nextNode, walker);\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 * get combined nodes\n * @private\n * @param {object} twig - twig\n * @param {object} nodes - collection of nodes\n * @param {string} dir - direction\n * @returns {Array.<object>} - collection of matched nodes\n */\n _getCombinedNodes(twig, nodes, dir) {\n const arr = [];\n for (const node of nodes) {\n const matched = this._matchCombinator(twig, node, {\n dir,\n warn: this.#warn\n });\n if (matched.size) {\n arr.push(...matched);\n }\n }\n if (arr.length) {\n return new Set(arr);\n }\n return new Set();\n }\n\n /**\n * match node to next direction\n * @private\n * @param {Array} branch - branch\n * @param {Set.<object>} nodes - collection of Element node\n * @param {object} opt - option\n * @param {object} opt.combo - combo\n * @returns {?object} - matched node\n */\n _matchNodeNext(branch, nodes, opt) {\n const { combo, index } = opt;\n const { combo: nextCombo, leaves } = branch[index];\n const twig = {\n combo,\n leaves\n };\n const nextNodes = this._getCombinedNodes(twig, nodes, DIR_NEXT);\n let res;\n if (nextNodes.size) {\n if (index === branch.length - 1) {\n const [nextNode] = sortNodes(nextNodes);\n res = nextNode;\n } else {\n res = this._matchNodeNext(branch, nextNodes, {\n combo: nextCombo,\n index: index + 1\n });\n }\n }\n return res ?? null;\n }\n\n /**\n * match node to previous direction\n * @private\n * @param {Array} branch - branch\n * @param {object} node - Element node\n * @param {object} opt - option\n * @param {number} opt.index - index\n * @returns {?object} - node\n */\n _matchNodePrev(branch, node, opt) {\n const { index } = opt;\n const twig = branch[index];\n const nodes = new Set([node]);\n const nextNodes = this._getCombinedNodes(twig, nodes, DIR_PREV);\n let res;\n if (nextNodes.size) {\n if (index === 0) {\n res = node;\n } else {\n for (const nextNode of nextNodes) {\n const matched = this._matchNodePrev(branch, nextNode, {\n index: index - 1\n });\n if (matched) {\n return node;\n }\n }\n }\n }\n return res ?? null;\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 if (targetType === TARGET_ALL || targetType === TARGET_FIRST) {\n this._prepareQuerySelectorWalker();\n }\n const [[...branches], collectedNodes] = this._collectNodes(targetType);\n const l = branches.length;\n let sort;\n let nodes = new Set();\n for (let i = 0; i < l; i++) {\n const { branch, collected, dir, find } = branches[i];\n const branchLen = branch.length;\n if (branchLen && find) {\n const entryNodes = collectedNodes[i];\n const entryNodesLen = entryNodes.length;\n const lastIndex = branchLen - 1;\n if (lastIndex === 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 (targetType === TARGET_ALL) {\n if (nodes.size) {\n const n = [...nodes];\n nodes = new Set([...n, ...entryNodes]);\n sort = true;\n } else {\n nodes = new Set(entryNodes);\n }\n } else {\n const [node] = entryNodes;\n nodes.add(node);\n }\n } else if (targetType === TARGET_ALL) {\n if (dir === DIR_NEXT) {\n let { combo } = branch[0];\n for (const node of entryNodes) {\n let nextNodes = new Set([node]);\n for (let j = 1; j < branchLen; j++) {\n const { combo: nextCombo, leaves } = branch[j];\n const twig = {\n combo,\n leaves\n };\n nextNodes = this._getCombinedNodes(twig, nextNodes, dir);\n if (nextNodes.size) {\n if (j === lastIndex) {\n if (nodes.size) {\n const n = [...nodes];\n nodes = new Set([...n, ...nextNodes]);\n sort = true;\n } else {\n nodes = nextNodes;\n }\n } else {\n combo = nextCombo;\n }\n } else {\n break;\n }\n }\n }\n } else {\n for (const node of entryNodes) {\n let nextNodes = new Set([node]);\n for (let j = lastIndex - 1; j >= 0; j--) {\n const twig = branch[j];\n nextNodes = this._getCombinedNodes(twig, nextNodes, dir);\n if (nextNodes.size) {\n if (j === 0) {\n nodes.add(node);\n if (branchLen > 1 && nodes.size > 1) {\n sort = true;\n }\n }\n } else {\n break;\n }\n }\n }\n }\n } else if (targetType === TARGET_FIRST && dir === DIR_NEXT) {\n const { combo: entryCombo } = branch[0];\n let matched;\n for (const node of entryNodes) {\n matched = this._matchNodeNext(branch, new Set([node]), {\n combo: entryCombo,\n index: 1\n });\n if (matched) {\n nodes.add(matched);\n break;\n }\n }\n if (!matched && !collected) {\n const { leaves: entryLeaves } = branch[0];\n const [entryNode] = entryNodes;\n let refNode = this._findNode(entryLeaves, {\n node: entryNode\n });\n while (refNode) {\n matched = this._matchNodeNext(branch, new Set([refNode]), {\n combo: entryCombo,\n index: 1\n });\n if (matched) {\n nodes.add(matched);\n break;\n }\n refNode = this._findNode(entryLeaves, {\n node: refNode\n });\n }\n }\n } else {\n let matched;\n for (const node of entryNodes) {\n matched = this._matchNodePrev(branch, node, {\n index: lastIndex - 1\n });\n if (matched) {\n nodes.add(node);\n break;\n }\n }\n if (!matched && !collected && targetType === TARGET_FIRST) {\n const { leaves: entryLeaves } = branch[lastIndex];\n const [entryNode] = entryNodes;\n let refNode = this._findNode(entryLeaves, {\n node: entryNode\n });\n while (refNode) {\n matched = this._matchNodePrev(branch, refNode, {\n index: lastIndex - 1\n });\n if (matched) {\n nodes.add(refNode);\n break;\n }\n refNode = this._findNode(entryLeaves, {\n node: refNode\n });\n }\n }\n }\n }\n }\n if (targetType === TARGET_ALL && sort) {\n nodes = new Set(sortNodes(nodes));\n }\n return nodes;\n }\n};\n"],
|
|
5
|
+
"mappings": "4ZAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,YAAAE,IAAA,eAAAC,EAAAH,GAKA,IAAAI,EAGO,yBACPC,EAAwB,wBACxBC,EAEO,uBAGPC,EASO,yBACP,MAAMC,EAAW,OACXC,EAAW,OA0BV,MAAMP,CAAO,CAElBQ,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAMA,YAAYC,EAAQ,CAClB,KAAKD,GAAUC,EACf,KAAKjB,GAAY,IAAI,QACrB,KAAKG,GAAiB,IAAI,QAC1B,KAAKO,GAAW,IAAI,OACtB,CASA,SAASQ,EAAG,CACV,GAAI,CAAC,KAAKV,GACR,GAAIU,aAAa,cACbA,aAAa,KAAKF,GAAQ,aAC5B,GAAIE,EAAE,OAAS,oBACT,KAAKH,IACP,QAAQ,KAAKG,EAAE,OAAO,MAGxB,OAAM,IAAI,KAAKF,GAAQ,aAAaE,EAAE,QAASA,EAAE,IAAI,MAGvD,OAAMA,CAGZ,CAaA,OAAOC,EAAUC,EAAMC,EAAM,CAAC,EAAG,CAC/B,KAAM,CAAE,MAAAC,EAAO,SAAAC,EAAU,KAAAC,CAAK,EAAIH,EAClC,YAAKb,GAAY,CAAC,CAACe,EACnB,KAAKR,GAAQ,CAAC,CAACS,EACf,KAAKpB,GAAS,KAAK,UAAUkB,CAAK,EAClC,KAAKhB,GAAQc,EACb,CAAC,KAAKlB,GAAW,KAAKS,GAAO,KAAKE,EAAO,KAAI,kBAAeO,CAAI,EAChE,KAAKR,MAAU,kBAAeQ,CAAI,EAClC,CAAC,KAAKrB,GAAM,KAAKQ,EAAM,EAAI,KAAK,YAAYY,CAAQ,EACpD,KAAKL,GAAW,IAAI,QACpB,KAAKT,GAAc,GACZe,CACT,CAQA,UAAUE,EAAO,CAEf,OAAQA,aAAiB,KAAKN,GAAQ,eAC9BM,aAAiB,KAAKN,GAAQ,WAClCM,EACA,IACN,CAQA,YAAYH,EAAU,CACpB,MAAMM,EAAQ,CAAC,EACf,KAAKxB,GAAc,GACnB,IAAIyB,EACJ,GAAI,KAAKvB,GAAe,IAAI,KAAKD,EAAS,EAAG,CAC3C,MAAMyB,EAAa,KAAKxB,GAAe,IAAI,KAAKD,EAAS,EACzD,GAAIyB,GAAcA,EAAW,IAAI,GAAGR,CAAQ,EAAE,EAAG,CAC/C,MAAMS,EAAOD,EAAW,IAAI,GAAGR,CAAQ,EAAE,EACzCO,EAAME,EAAK,IACX,KAAK3B,GAAc2B,EAAK,WACxB,KAAKvB,GAAcuB,EAAK,UAC1B,CACF,CACA,GAAIF,EAAK,CACP,MAAMG,EAAIH,EAAI,OACd,QAASI,EAAI,EAAGA,EAAID,EAAGC,IACrBJ,EAAII,CAAC,EAAE,UAAY,GACnBJ,EAAII,CAAC,EAAE,IAAM,KACbJ,EAAII,CAAC,EAAE,SAAW,GAClBJ,EAAII,CAAC,EAAE,KAAO,GACdL,EAAMK,CAAC,EAAI,CAAC,CAEhB,KAAO,CACL,IAAIC,EACJ,GAAI,CACFA,KAAS,iBAAcZ,CAAQ,CACjC,OAASD,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,KAAM,CAAE,SAAAc,EAAU,KAAM,CAAE,aAAAC,CAAa,CAAE,KAAI,WAAQF,CAAM,EACrDG,EAAa,CAAC,CAACD,EACrB,IAAIE,EAAa,GACbL,EAAI,EACRJ,EAAM,CAAC,EACP,SAAW,CAAC,GAAGU,CAAK,IAAKJ,EAAU,CACjC,MAAMK,EAAS,CAAC,EAChB,IAAIT,EAAOQ,EAAM,MAAM,EACvB,GAAIR,GAAQA,EAAK,OAAS,aAAY,CACpC,MAAMU,EAAS,IAAI,IACnB,KAAOV,GAAM,CACX,GAAIA,EAAK,OAAS,aAAY,CAC5B,KAAM,CAACW,CAAQ,EAAIH,EACnB,GAAIG,EAAS,OAAS,aAAY,CAChC,MAAMC,EAAM,oBAAoBrB,CAAQ,GACxC,MAAM,IAAI,aAAaqB,EAAK,YAAU,CACxC,CACA,MAAMC,EAAWb,EAAK,KAClB,UAAU,KAAKa,CAAQ,IACzBN,EAAa,IAEfE,EAAO,KAAK,CACV,MAAOT,EACP,UAAQ,WAAQU,CAAM,CACxB,CAAC,EACDA,EAAO,MAAM,CACf,SAAWV,EAAM,CACf,GAAI,CAAE,KAAMa,CAAS,EAAIb,EACrBa,GAAY,OAAOA,GAAa,WAClCA,KAAW,oBAAiBA,CAAQ,EAChC,OAAOA,GAAa,UAAYA,IAAab,EAAK,OACpDA,EAAK,KAAOa,GAEV,OAAO,KAAKA,CAAQ,IACtBb,EAAK,UAAY,KAGrBU,EAAO,IAAIV,CAAI,CACjB,CACA,GAAIQ,EAAM,OACRR,EAAOQ,EAAM,MAAM,MACd,CACLC,EAAO,KAAK,CACV,MAAO,KACP,UAAQ,WAAQC,CAAM,CACxB,CAAC,EACDA,EAAO,MAAM,EACb,KACF,CACF,CACF,CACAZ,EAAI,KAAK,CACP,OAAAW,EACA,UAAW,GACX,IAAK,KACL,SAAU,GACV,KAAM,EACR,CAAC,EACDZ,EAAMK,CAAC,EAAI,CAAC,EACZA,GACF,CACA,IAAIH,EACA,KAAKxB,GAAe,IAAI,KAAKD,EAAS,EACxCyB,EAAa,KAAKxB,GAAe,IAAI,KAAKD,EAAS,EAEnDyB,EAAa,IAAI,IAEnBA,EAAW,IAAI,GAAGR,CAAQ,GAAI,CAC5B,IAAAO,EACA,WAAAS,EACA,WAAAD,CACF,CAAC,EACD,KAAK/B,GAAe,IAAI,KAAKD,GAAWyB,CAAU,EAClD,KAAK1B,GAAckC,EACnB,KAAK9B,GAAc6B,CACrB,CACA,MAAO,CACLR,EACAD,CACF,CACF,CAQA,kBAAkBL,EAAM,CACtB,IAAIsB,EACJ,OAAI,KAAK5B,GAAS,IAAIM,CAAI,EACxBsB,EAAS,KAAK5B,GAAS,IAAIM,CAAI,GAE/BsB,EAAS,KAAKxC,GAAU,iBAAiBkB,EAAM,eAAa,EAC5D,KAAKN,GAAS,IAAIM,EAAMsB,CAAM,GAEzBA,CACT,CAOA,6BAA8B,CAC5B,YAAKjC,GAAY,KAAK,kBAAkB,KAAKH,EAAK,EAC3C,KAAKG,EACd,CAcA,iBAAiBkC,EAAKvB,EAAMC,EAAK,CAC/B,KAAM,CAAE,EAAAuB,EAAG,EAAAC,EAAG,QAAAC,EAAS,SAAA3B,CAAS,EAAIwB,EAC9B,CAAE,WAAAI,CAAW,EAAI3B,EACjB4B,EAAU,IAAI,IACpB,IAAIC,EACJ,GAAI9B,EACF,GAAI,KAAKnB,GAAU,IAAImB,CAAQ,EAC7B8B,EAAmB,KAAKjD,GAAU,IAAImB,CAAQ,MACzC,CACL,KAAM,CAAE,SAAAa,EAAU,KAAAkB,CAAK,KAAI,WAAQ/B,CAAQ,EAC3C8B,EAAmBjB,EACnB,KAAKhC,GAAU,IAAImB,EAAU8B,CAAgB,EACzCC,EAAK,uBACP,KAAK7C,GAAc,GAEvB,CAEF,GAAI0C,EAAY,CACd,MAAML,EAAS,KAAK7B,GACpB,IAAIsC,KAAU,gBAAaJ,EAAYL,CAAM,EAC7CS,EAAUT,EAAO,WAAW,EAC5B,IAAI,EAAI,EACR,KAAOS,GACL,IACAA,EAAUT,EAAO,YAAY,EAE/B,MAAMU,EAAgB,IAAI,IAC1B,GAAIH,EAGF,IAFAE,KAAU,gBAAaJ,EAAYL,CAAM,EACzCS,EAAUT,EAAO,WAAW,EACrBS,GAAS,CACd,KAAM,CAAE,QAAAE,EAAS,WAAAC,CAAW,EAC1B,KAAKtC,GAAQ,iBAAiBmC,CAAO,EACvC,GAAIE,IAAY,QAAUC,IAAe,SAAU,CACjD,IAAIC,EACJ,UAAWjB,KAAUW,EAEnB,GADAM,EAAO,KAAK,aAAajB,EAAQa,EAAS9B,CAAG,EACzC,CAACkC,EACH,MAGAA,GACFH,EAAc,IAAID,CAAO,CAE7B,CACAA,EAAUT,EAAO,YAAY,CAC/B,CAGF,GAAIE,IAAM,GACR,GAAIC,EAAI,GAAKA,GAAK,GAChB,GAAIO,EAAc,KAAM,CACtBD,KAAU,gBAAaJ,EAAYL,CAAM,EACrCI,EACFK,EAAUT,EAAO,UAAU,EAE3BS,EAAUT,EAAO,WAAW,EAE9B,IAAIZ,EAAI,EACR,KAAOqB,GAAS,CACd,GAAIC,EAAc,IAAID,CAAO,EAAG,CAC9B,GAAIrB,IAAMe,EAAI,EAAG,CACfG,EAAQ,IAAIG,CAAO,EACnB,KACF,CACArB,GACF,CACIgB,EACFK,EAAUT,EAAO,gBAAgB,EAEjCS,EAAUT,EAAO,YAAY,CAEjC,CACF,SAAW,CAACvB,EAAU,CACpBgC,KAAU,gBAAaJ,EAAYL,CAAM,EACrCI,EACFK,EAAUT,EAAO,UAAU,EAE3BS,EAAUT,EAAO,WAAW,EAE9B,IAAIZ,EAAI,EACR,KAAOqB,GAAS,CACd,GAAIrB,IAAMe,EAAI,EAAG,CACfG,EAAQ,IAAIG,CAAO,EACnB,KACF,CACIL,EACFK,EAAUT,EAAO,gBAAgB,EAEjCS,EAAUT,EAAO,YAAY,EAE/BZ,GACF,CACF,OAGG,CACL,IAAI0B,EAAMX,EAAI,EACd,GAAID,EAAI,EACN,KAAOY,EAAM,GACXA,GAAOZ,EAGX,GAAIY,GAAO,GAAKA,EAAM,EAAG,CACvBL,KAAU,gBAAaJ,EAAYL,CAAM,EACrCI,EACFK,EAAUT,EAAO,UAAU,EAE3BS,EAAUT,EAAO,WAAW,EAE9B,IAAIZ,EAAI,EACJ2B,EAAIb,EAAI,EAAI,EAAIC,EAAI,EACxB,KAAOM,IACDA,GAAWK,GAAO,GAAKA,EAAM,IAC3BJ,EAAc,KACZA,EAAc,IAAID,CAAO,IACvBM,IAAMD,IACRR,EAAQ,IAAIG,CAAO,EACnBK,GAAOZ,GAELA,EAAI,EACNa,IAEAA,KAGK3B,IAAM0B,IACVrC,GACH6B,EAAQ,IAAIG,CAAO,EAErBK,GAAOZ,GAELE,EACFK,EAAUT,EAAO,gBAAgB,EAEjCS,EAAUT,EAAO,YAAY,EAE/BZ,GAKN,CACF,CACA,GAAIgB,GAAWE,EAAQ,KAAO,EAAG,CAC/B,MAAM,EAAI,CAAC,GAAGA,CAAO,EACrB,OAAO,IAAI,IAAI,EAAE,QAAQ,CAAC,CAC5B,CACF,SAAW5B,IAAS,KAAKT,IAAUiC,EAAIC,IAAO,EAC5C,GAAII,EAAkB,CACpB,IAAIM,EACJ,UAAWjB,KAAUW,EAEnB,GADAM,EAAO,KAAK,aAAajB,EAAQlB,EAAMC,CAAG,EACtCkC,EACF,MAGAA,GACFP,EAAQ,IAAI5B,CAAI,CAEpB,MACE4B,EAAQ,IAAI5B,CAAI,EAGpB,OAAO4B,CACT,CAYA,kBAAkBL,EAAKvB,EAAM,CAC3B,KAAM,CAAE,EAAAwB,EAAG,EAAAC,EAAG,QAAAC,CAAQ,EAAIH,EACpB,CAAE,UAAAe,EAAW,WAAAX,EAAY,OAAAY,CAAO,EAAIvC,EACpC4B,EAAU,IAAI,IACpB,GAAID,EAAY,CACd,MAAML,EAAS,KAAK7B,GACpB,IAAIsC,KAAU,gBAAaJ,EAAYL,CAAM,EAC7CS,EAAUT,EAAO,WAAW,EAC5B,IAAIb,EAAI,EACR,KAAOsB,GACLtB,IACAsB,EAAUT,EAAO,YAAY,EAG/B,GAAIE,IAAM,GACR,GAAIC,EAAI,GAAKA,GAAKhB,EAAG,CACnBsB,KAAU,gBAAaJ,EAAYL,CAAM,EACrCI,EACFK,EAAUT,EAAO,UAAU,EAE3BS,EAAUT,EAAO,WAAW,EAE9B,IAAIe,EAAI,EACR,KAAON,GAAS,CACd,KAAM,CAAE,UAAWS,EAAe,OAAQC,CAAW,EAAIV,EACzD,GAAIS,IAAkBF,GAAaG,IAAeF,EAAQ,CACxD,GAAIF,IAAMZ,EAAI,EAAG,CACfG,EAAQ,IAAIG,CAAO,EACnB,KACF,CACAM,GACF,CACIX,EACFK,EAAUT,EAAO,gBAAgB,EAEjCS,EAAUT,EAAO,YAAY,CAEjC,CACF,MAEK,CACL,IAAIc,EAAMX,EAAI,EACd,GAAID,EAAI,EACN,KAAOY,EAAM,GACXA,GAAOZ,EAGX,GAAIY,GAAO,GAAKA,EAAM3B,EAAG,CACvBsB,KAAU,gBAAaJ,EAAYL,CAAM,EACrCI,EACFK,EAAUT,EAAO,UAAU,EAE3BS,EAAUT,EAAO,WAAW,EAE9B,IAAIe,EAAIb,EAAI,EAAI,EAAIC,EAAI,EACxB,KAAOM,GAAS,CACd,KAAM,CAAE,UAAWS,EAAe,OAAQC,CAAW,EAAIV,EACzD,GAAIS,IAAkBF,GAAaG,IAAeF,EAAQ,CAKxD,GAJIF,IAAMD,IACRR,EAAQ,IAAIG,CAAO,EACnBK,GAAOZ,GAELY,EAAM,GAAKA,GAAO3B,EACpB,MACSe,EAAI,EACba,IAEAA,GAEJ,CACIX,EACFK,EAAUT,EAAO,gBAAgB,EAEjCS,EAAUT,EAAO,YAAY,CAEjC,CACF,CACF,CACA,GAAII,GAAWE,EAAQ,KAAO,EAAG,CAC/B,MAAMc,EAAI,CAAC,GAAGd,CAAO,EACrB,OAAO,IAAI,IAAIc,EAAE,QAAQ,CAAC,CAC5B,CACF,MAAW1C,IAAS,KAAKT,IAAUiC,EAAIC,IAAO,GAC5CG,EAAQ,IAAI5B,CAAI,EAElB,OAAO4B,CACT,CAWA,cAActB,EAAKN,EAAM2C,EAAS1C,EAAK,CACrC,KAAM,CACJ,IAAK,CACH,EAAAuB,EACA,EAAAC,EACA,KAAMmB,CACR,EACA,SAAA7C,CACF,EAAIO,EACEuC,EAAS,IAAI,IA2BnB,GA1BID,GACEA,IAAiB,QACnBC,EAAO,IAAI,IAAK,CAAC,EACjBA,EAAO,IAAI,IAAK,CAAC,GACRD,IAAiB,QAC1BC,EAAO,IAAI,IAAK,CAAC,EACjBA,EAAO,IAAI,IAAK,CAAC,GAEfF,EAAQ,QAAQ,MAAM,EAAI,IAC5BE,EAAO,IAAI,UAAW,EAAI,IAGxB,OAAOrB,GAAM,UAAY,QAAQ,KAAKA,CAAC,EACzCqB,EAAO,IAAI,IAAKrB,EAAI,CAAC,EAErBqB,EAAO,IAAI,IAAK,CAAC,EAEf,OAAOpB,GAAM,UAAY,QAAQ,KAAKA,CAAC,EACzCoB,EAAO,IAAI,IAAKpB,EAAI,CAAC,EAErBoB,EAAO,IAAI,IAAK,CAAC,EAEfF,EAAQ,QAAQ,MAAM,EAAI,IAC5BE,EAAO,IAAI,UAAW,EAAI,GAG1B,wBAAwB,KAAKF,CAAO,EAAG,CACrC5C,GACF8C,EAAO,IAAI,WAAY9C,CAAQ,EAEjC,MAAMwB,EAAM,OAAO,YAAYsB,CAAM,EAErC,OADc,KAAK,iBAAiBtB,EAAKvB,EAAMC,CAAG,CAEpD,SAAW,0BAA0B,KAAK0C,CAAO,EAAG,CAClD,MAAMpB,EAAM,OAAO,YAAYsB,CAAM,EAErC,OADc,KAAK,kBAAkBtB,EAAKvB,CAAI,CAEhD,CACA,OAAO,IAAI,GACb,CAUA,oBAAoB8C,EAAW9C,EAAMC,EAAM,CAAC,EAAG,CAC7C,IAAIkC,EACJ,GAAI,MAAM,QAAQW,CAAS,GAAKA,EAAU,OAAQ,CAChD,MAAM5B,EAAS4B,EAAU,IAAIpC,GAAKA,CAAC,EAC7B,CAACqC,CAAI,EAAI7B,EACT,CAAE,KAAM8B,CAAS,EAAID,EAC3B,IAAIE,EACAD,IAAa,aACfC,EAAQ/B,EAAO,MAAM,EAErB+B,EAAQ,CACN,KAAM,IACN,KAAM,YACR,EAEF,MAAMC,EAAa,CAAC,EACpB,KAAOhC,EAAO,QAAQ,CACpB,KAAM,CAACV,CAAI,EAAIU,EACT,CAAE,KAAMiC,CAAS,EAAI3C,EAC3B,GAAI2C,IAAa,aACf,MAEAD,EAAW,KAAKhC,EAAO,MAAM,CAAC,CAElC,CACA,MAAMkC,EAAO,CACX,MAAAH,EACA,OAAQC,CACV,EACAjD,EAAI,IAAMxB,EACV,MAAM4B,EAAQ,KAAK,iBAAiB+C,EAAMpD,EAAMC,CAAG,EACnD,GAAII,EAAM,KACR,GAAIa,EAAO,QACT,UAAWmC,KAAYhD,EAErB,GADA8B,EAAO,KAAK,oBAAoBjB,EAAQmC,EAAUpD,CAAG,EACjDkC,EACF,WAIJA,EAAO,EAGb,CACA,MAAO,CAAC,CAACA,CACX,CAUA,wBAAwBmB,EAAStD,EAAMC,EAAM,CAAC,EAAG,CAC/C,KAAM,CACJ,QAAAsD,EAAU,GAAI,SAAA3C,EAAW,CAAC,EAAG,SAAAb,EAAW,GAAI,aAAAyD,EAAe,CAAC,CAC9D,EAAIF,EACJ,IAAIG,EACJ,GAAIF,IAAY,MACd,GAAIxD,EAAS,SAAS,OAAO,EAC3B0D,EAAM,SACD,CACL,IAAItB,EACJ,UAAWjB,KAAUN,EAEnB,GADAuB,EAAO,KAAK,oBAAoBjB,EAAQlB,EAAMC,CAAG,EAC7CkC,EACF,MAGAA,IACFsB,EAAMzD,EAEV,KACK,CACL,MAAM0D,EAAU,iBAAiB,KAAKH,CAAO,EAC7CtD,EAAI,QAAUyD,EACd,MAAMjD,EAAI+C,EAAa,OACvB,IAAIrB,EACJ,QAASzB,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMO,EAASuC,EAAa9C,CAAC,EACvBiD,EAAY1C,EAAO,OAAS,EAC5B,CAAE,OAAAC,CAAO,EAAID,EAAO0C,CAAS,EAEnC,GADAxB,EAAO,KAAK,aAAajB,EAAQlB,EAAMC,CAAG,EACtCkC,GAAQwB,EAAY,EAAG,CACzB,IAAIC,EAAY,IAAI,IAAI,CAAC5D,CAAI,CAAC,EAC9B,QAASqC,EAAIsB,EAAY,EAAGtB,GAAK,EAAGA,IAAK,CACvC,MAAMe,EAAOnC,EAAOoB,CAAC,EACfwB,EAAM,CAAC,EACb5D,EAAI,IAAMvB,EACV,UAAW2E,KAAYO,EAAW,CAChC,MAAMlB,EAAI,KAAK,iBAAiBU,EAAMC,EAAUpD,CAAG,EAC/CyC,EAAE,MACJmB,EAAI,KAAK,GAAGnB,CAAC,CAEjB,CACA,GAAImB,EAAI,OACFxB,IAAM,EACRF,EAAO,GAEPyB,EAAY,IAAI,IAAIC,CAAG,MAEpB,CACL1B,EAAO,GACP,KACF,CACF,CACF,CACA,GAAIA,EACF,KAEJ,CACIoB,IAAY,MACTpB,IACHsB,EAAMzD,GAECmC,IACTsB,EAAMzD,EAEV,CACA,OAAOyD,GAAO,IAChB,CAaA,0BAA0BnD,EAAKN,EAAMC,EAAM,CAAC,EAAG,CAC7C,KAAM,CAAE,SAAU6D,EAAa,KAAMP,CAAQ,EAAIjD,EAC3C,CAAE,UAAAgC,EAAW,WAAAX,CAAW,EAAI3B,EAC5B,CACJ,QAAA0D,EACA,KAAAtD,EAAO,KAAKT,EACd,EAAIM,EACE2B,EAAU,IAAI,IAEpB,GAAI,qBAAmB,KAAK2B,CAAO,EAAG,CACpC,IAAID,EACJ,GAAI,KAAK1E,GAAU,IAAI0B,CAAG,EACxBgD,EAAU,KAAK1E,GAAU,IAAI0B,CAAG,MAC3B,CACL,KAAM,CAAE,SAAAM,CAAS,KAAI,WAAQN,CAAG,EAC1ByD,EAAY,CAAC,EACbP,EAAe,CAAC,EACtB,SAAW,CAAC,GAAGtC,CAAM,IAAKN,EAAU,CAClC,UAAWmC,KAAQ7B,EAAQ,CACzB,MAAM8C,KAAM,eAAYjB,CAAI,EAC5BgB,EAAU,KAAKC,CAAG,CACpB,CACA,MAAM/C,EAAS,CAAC,EACVgD,EAAY,IAAI,IACtB,IAAIzD,EAAOU,EAAO,MAAM,EACxB,KAAOV,GAUL,GATIA,EAAK,OAAS,cAChBS,EAAO,KAAK,CACV,MAAOT,EACP,OAAQ,CAAC,GAAGyD,CAAS,CACvB,CAAC,EACDA,EAAU,MAAM,GACPzD,GACTyD,EAAU,IAAIzD,CAAI,EAEhBU,EAAO,OACTV,EAAOU,EAAO,MAAM,MACf,CACLD,EAAO,KAAK,CACV,MAAO,KACP,OAAQ,CAAC,GAAGgD,CAAS,CACvB,CAAC,EACDA,EAAU,MAAM,EAChB,KACF,CAEFT,EAAa,KAAKvC,CAAM,CAC1B,CACAqC,EAAU,CACR,QAAAC,EACA,SAAA3C,EACA,aAAA4C,EACA,SAAUO,EAAU,KAAK,GAAG,CAC9B,EACA,KAAKnF,GAAU,IAAI0B,EAAKgD,CAAO,CACjC,CACA,MAAMG,EAAM,KAAK,wBAAwBH,EAAStD,EAAMC,CAAG,EACvDwD,GACF7B,EAAQ,IAAI6B,CAAG,CAEnB,SAAW,MAAM,QAAQK,CAAW,EAElC,GAAI,oCAAoC,KAAKP,CAAO,EAAG,CACrD,KAAM,CAACtC,CAAM,EAAI6C,EAEjB,OADc,KAAK,cAAc7C,EAAQjB,EAAMuD,EAAStD,CAAG,CAE7D,KACE,QAAQsD,EAAS,CAEf,IAAK,MACL,IAAK,OAAQ,CACX,MAAME,EAAM,UAAQ,cAAcnD,EAAKN,CAAI,EACvCyD,GACF7B,EAAQ,IAAI6B,CAAG,EAEjB,KACF,CAEA,IAAK,QAAS,CACZ,MAAI,mBAAgBzD,CAAI,EAAG,CACzB,KAAM,CAAC,CAAE,MAAOkE,CAAW,CAAC,EAAIJ,EAC5BI,GAAclE,EAAKkE,CAAU,GAC/BtC,EAAQ,IAAI5B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UACL,IAAK,UACL,IAAK,eAAgB,CACnB,GAAII,EAAM,CACR,MAAMgB,EAAM,6BAA6BmC,CAAO,KAChD,MAAM,IAAI,aAAanC,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,IAAK,OACL,IAAK,eAEH,MAGF,IAAK,WAAY,CACf,GAAIhB,EAAM,CACR,MAAMgB,EAAM,yBAAyBmC,CAAO,KAC5C,MAAM,IAAI,aAAanC,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,QACE,GAAI,CAACsC,EAAS,CACZ,MAAMtC,EAAM,yBAAyBmC,CAAO,KAC5C,MAAM,IAAI,aAAanC,EAAK,YAAU,CACxC,CAEJ,KAGF,QAAQmC,EAAS,CACf,IAAK,WACL,IAAK,OAAQ,CACP,aAAW,KAAKjB,CAAS,GAAKtC,EAAK,aAAa,MAAM,GACxD4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,aAAc,CACjB,GAAI,aAAW,KAAKsC,CAAS,GAAKtC,EAAK,aAAa,MAAM,EAAG,CAC3D,KAAM,CAAE,KAAAmE,EAAM,OAAAC,EAAQ,SAAAC,CAAS,EAAI,IAAI,IAAI,KAAKvF,GAAU,GAAG,EACvDwF,EAAU,IAAI,IAAItE,EAAK,aAAa,MAAM,EAAGmE,CAAI,EACnDG,EAAQ,SAAWF,GAAUE,EAAQ,WAAaD,GACpDzC,EAAQ,IAAI5B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAEH,MAEF,IAAK,QAAS,CACZ,KAAM,CAAE,OAAAuE,EAAQ,KAAAC,CAAK,EAAI,KAAKxF,IAAU,CAAC,GACpCwF,IAAS,aAAeA,IAAS,gBAClCxE,EAAK,SAASuE,CAAM,GACtB3C,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,SAAU,CACb,KAAM,CAAE,QAAAyE,EAAS,OAAAF,EAAQ,KAAAC,CAAK,EAAI,KAAKxF,IAAU,CAAC,GAC7CwF,IAAS,aAAeA,IAAS,gBAClCC,EAAU,UAAUzE,EAAK,SAASuE,CAAM,GAC1C3C,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,SAAU,CACb,KAAM,CAAE,KAAA0E,CAAK,EAAI,IAAI,IAAI,KAAK5F,GAAU,GAAG,EACvCkB,EAAK,IAAM0E,IAAS,IAAI1E,EAAK,EAAE,IAC/B,KAAKlB,GAAU,SAASkB,CAAI,GAC9B4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,KAAM,CAAE,KAAA0E,CAAK,EAAI,IAAI,IAAI,KAAK5F,GAAU,GAAG,EAC3C,GAAI4F,EAAM,CACR,MAAMC,EAAKD,EAAK,QAAQ,KAAM,EAAE,EAChC,IAAIE,EAAU,KAAK9F,GAAU,eAAe6F,CAAE,EAC9C,KAAOC,GAAS,CACd,GAAIA,IAAY5E,EAAM,CACpB4B,EAAQ,IAAI5B,CAAI,EAChB,KACF,CACA4E,EAAUA,EAAQ,UACpB,CACF,CACA,KACF,CACA,IAAK,QAAS,CACR,KAAK1F,GAAM,WAAa,eACtB,CAAC,KAAKM,IAAWQ,IAAS,KAAKd,IACjC0C,EAAQ,IAAI5B,CAAI,EAETA,IAAS,KAAKlB,GAAU,iBACjC8C,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,QACL,IAAK,gBAAiB,CACpB,KAAM,CAAE,OAAAuE,EAAQ,KAAAC,CAAK,EAAI,KAAKxF,IAAU,CAAC,EACzC,GAAIgB,IAAS,KAAKlB,GAAU,eAAiBkB,EAAK,UAAY,IACzDuD,IAAY,SACXiB,IAAS,WAAaxE,EAAK,SAASuE,CAAM,GAAK,CACnD,IAAIxC,EAAU/B,EACV6E,EAAQ,GACZ,KAAO9C,GAAS,CACd,GAAIA,EAAQ,UAAYA,EAAQ,aAAa,UAAU,GACnDA,EAAQ,QAAUA,EAAQ,aAAa,QAAQ,EAAG,CACpD8C,EAAQ,GACR,KACF,KAAO,CACL,KAAM,CAAE,QAAA5C,EAAS,WAAAC,CAAW,EAC1B,KAAKtC,GAAQ,iBAAiBmC,CAAO,EAEvC,GADA8C,EAAQ,EAAE5C,IAAY,QAAUC,IAAe,UAC3C,CAAC2C,EACH,KAEJ,CACA,GAAI9C,EAAQ,YACRA,EAAQ,WAAW,WAAa,eAClCA,EAAUA,EAAQ,eAElB,MAEJ,CACI8C,GACFjD,EAAQ,IAAI5B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,eAAgB,CACnB,IAAI8E,EACAF,EAAU,KAAK9F,GAAU,cAC7B,GAAI8F,EAAQ,UAAY,EACtB,KAAOA,GAAS,CACd,GAAIA,IAAY5E,EAAM,CACpB8E,EAAS,GACT,KACF,CACAF,EAAUA,EAAQ,UACpB,CAEF,GAAIE,EAAQ,CACV,IAAI/C,EAAU/B,EACV6E,EAAQ,GACZ,KAAO9C,GAAS,CACd,GAAIA,EAAQ,UAAYA,EAAQ,aAAa,UAAU,GACnDA,EAAQ,QAAUA,EAAQ,aAAa,QAAQ,EAAG,CACpD8C,EAAQ,GACR,KACF,KAAO,CACL,KAAM,CAAE,QAAA5C,EAAS,WAAAC,CAAW,EAC1B,KAAKtC,GAAQ,iBAAiBmC,CAAO,EAEvC,GADA8C,EAAQ,EAAE5C,IAAY,QAAUC,IAAe,UAC3C,CAAC2C,EACH,KAEJ,CACA,GAAI9C,EAAQ,YACRA,EAAQ,WAAW,WAAa,eAClCA,EAAUA,EAAQ,eAElB,MAEJ,CACI8C,GACFjD,EAAQ,IAAI5B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,OAAQ,CACP,eAAa,KAAKsC,CAAS,GAAKtC,EAAK,aAAa,MAAM,GAC1D4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,SAAU,CACT,eAAa,KAAKsC,CAAS,GAAK,CAACtC,EAAK,aAAa,MAAM,GAC3D4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,GAAI,gBAAc,KAAKsC,CAAS,MAC5B,mBAAgBtC,EAAM,CAAE,eAAgB,EAAK,CAAC,GAChD,GAAIA,EAAK,UAAYA,EAAK,aAAa,UAAU,EAC/C4B,EAAQ,IAAI5B,CAAI,UACPA,EAAK,YAAc,SACxB2B,EAAW,YAAc,aACxBA,EAAW,UACXA,EAAW,aAAa,UAAU,IACrCC,EAAQ,IAAI5B,CAAI,UAETA,EAAK,YAAc,WAAY,CACxC,IAAImC,EACA4C,EAASpD,EACb,KAAOoD,GACL,GAAIA,EAAO,YAAc,aACpBA,EAAO,UAAYA,EAAO,aAAa,UAAU,GAAI,CACxD,MAAMzD,EAAS,KAAK7B,GACpB,IAAIsC,KAAU,gBAAagD,EAAQzD,CAAM,EAEzC,IADAS,EAAUT,EAAO,WAAW,EACrBS,GACDA,EAAQ,YAAc,UAG1BA,EAAUT,EAAO,YAAY,EAE3BS,GACGA,EAAQ,SAAS/B,CAAI,IACxBmC,EAAO,IAKX,KACF,KAAO,IAAI4C,EAAO,YAAc,OAC9B,MACK,GAAIA,EAAO,YAAY,WAAa,eAAc,CACvD,GAAIA,EAAO,WAAW,YAAc,OAClC,MAEAA,EAASA,EAAO,UAEpB,KACE,OAGA5C,GACFP,EAAQ,IAAI5B,CAAI,CAEpB,EAEF,KACF,CACA,IAAK,UAAW,CACd,IAAK,gBAAc,KAAKsC,CAAS,MAC5B,mBAAgBtC,EAAM,CAAE,eAAgB,EAAK,CAAC,IAC/C,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,GACjD,GAAIA,EAAK,YAAc,WACrB4B,EAAQ,IAAI5B,CAAI,UACPA,EAAK,YAAc,UACxB2B,EAAW,YAAc,YACzB,EAAEA,EAAW,UACXA,EAAW,aAAa,UAAU,KACtCC,EAAQ,IAAI5B,CAAI,MAEb,CACL,IAAImC,EACA4C,EAASpD,EACb,KAAOoD,GACL,GAAIA,EAAO,YAAc,aACpBA,EAAO,UAAYA,EAAO,aAAa,UAAU,GAAI,CACxD,MAAMzD,EAAS,KAAK7B,GACpB,IAAIsC,KAAU,gBAAagD,EAAQzD,CAAM,EAEzC,IADAS,EAAUT,EAAO,WAAW,EACrBS,GACDA,EAAQ,YAAc,UAG1BA,EAAUT,EAAO,YAAY,EAE3BS,GACGA,EAAQ,SAAS/B,CAAI,IACxBmC,EAAO,IAKX,KACF,KAAO,IAAI4C,EAAO,YAAc,OAC9B,MACK,GAAIA,EAAO,YAAY,WAAa,eAAc,CACvD,GAAIA,EAAO,WAAW,YAAc,OAClC,MAEAA,EAASA,EAAO,UAEpB,KACE,OAGC5C,GACHP,EAAQ,IAAI5B,CAAI,CAEpB,CAEF,KACF,CACA,IAAK,YAAa,CAChB,OAAQsC,EAAW,CACjB,IAAK,WAAY,EACXtC,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,QAAS,EACP,CAACA,EAAK,MAAQ,gBAAc,KAAKA,EAAK,IAAI,GAC1C,gBAAc,KAAKA,EAAK,IAAI,KAC5BA,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAChD4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,WACO,qBAAkBA,CAAI,GACzB4B,EAAQ,IAAI5B,CAAI,CAGtB,CACA,KACF,CACA,IAAK,aAAc,CACjB,OAAQsC,EAAW,CACjB,IAAK,WAAY,CACTtC,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,GACjD4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,QAAS,EACP,CAACA,EAAK,MAAQ,gBAAc,KAAKA,EAAK,IAAI,GAC1C,gBAAc,KAAKA,EAAK,IAAI,IAC7B,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,IACjD4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,WACM,qBAAkBA,CAAI,GACxB4B,EAAQ,IAAI5B,CAAI,CAGtB,CACA,KACF,CACA,IAAK,oBAAqB,CACxB,IAAIgF,EAMJ,GALIhF,EAAK,YACPgF,EAAchF,EAAK,YACVA,EAAK,aAAa,aAAa,IACxCgF,EAAchF,EAAK,aAAa,aAAa,GAE3C,OAAOgF,GAAgB,UAAY,CAAC,SAAS,KAAKA,CAAW,EAAG,CAClE,IAAIC,EACA3C,IAAc,WAChB2C,EAAajF,EACJsC,IAAc,UACnBtC,EAAK,aAAa,MAAM,EACtB,gBAAc,KAAKA,EAAK,aAAa,MAAM,CAAC,IAC9CiF,EAAajF,GAGfiF,EAAajF,GAGbiF,GAAcjF,EAAK,QAAU,IAC/B4B,EAAQ,IAAI5B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAAW,EACTA,EAAK,SAAWsC,IAAc,SAC9BtC,EAAK,aAAa,MAAM,GACxB,iBAAe,KAAKA,EAAK,aAAa,MAAM,CAAC,GAC7CA,EAAK,UAAYsC,IAAc,WAClCV,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,GAAKA,EAAK,eAAiBsC,IAAc,SACpCtC,EAAK,OAAS,YACdsC,IAAc,YAAc,CAACtC,EAAK,aAAa,OAAO,EACzD4B,EAAQ,IAAI5B,CAAI,UACPsC,IAAc,SAAWtC,EAAK,OAAS,SACvC,CAACA,EAAK,aAAa,SAAS,EAAG,CACxC,MAAMkF,EAAWlF,EAAK,KACtB,IAAI+E,EAAS/E,EAAK,WAClB,KAAO+E,GACDA,EAAO,YAAc,QAGzBA,EAASA,EAAO,WAEbA,IACHA,EAAS,KAAKjG,GAAU,iBAE1B,MAAMkC,EAAQ+D,EAAO,qBAAqB,OAAO,EAC3CtE,EAAIO,EAAM,OAChB,IAAImE,EACJ,QAASzE,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMF,EAAOQ,EAAMN,CAAC,EACpB,GAAIF,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,CACKA,GACHvD,EAAQ,IAAI5B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAAW,CAEd,GAAKsC,IAAc,UACd,EAAEtC,EAAK,aAAa,MAAM,GACxB,iBAAe,KAAKA,EAAK,aAAa,MAAM,CAAC,IAC/CsC,IAAc,SAAWtC,EAAK,aAAa,MAAM,GACjD,kBAAgB,KAAKA,EAAK,aAAa,MAAM,CAAC,EAAI,CACrD,IAAIoF,EAAOpF,EAAK,WAChB,KAAOoF,GACDA,EAAK,YAAc,QAGvBA,EAAOA,EAAK,WAEd,GAAIA,EAAM,CACR,MAAM9D,EAAS,KAAK7B,GACpB,IAAI4D,KAAW,gBAAa+B,EAAM9D,CAAM,EAExC,IADA+B,EAAW/B,EAAO,WAAW,EACtB+B,GAAY+B,EAAK,SAAS/B,CAAQ,GAAG,CAC1C,MAAM6B,EAAW7B,EAAS,UAC1B,IAAI,EAQJ,GAPI6B,IAAa,SACf,EAAI,EAAE7B,EAAS,aAAa,MAAM,GAChC,iBAAe,KAAKA,EAAS,aAAa,MAAM,CAAC,GAC1C6B,IAAa,UACtB,EAAI7B,EAAS,aAAa,MAAM,GAC9B,kBAAgB,KAAKA,EAAS,aAAa,MAAM,CAAC,GAElD,EAAG,CACDA,IAAarD,GACf4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACAqD,EAAW/B,EAAO,SAAS,CAC7B,CACF,CAEF,MAAWgB,IAAc,SAAWtC,EAAK,aAAa,MAAM,GACjD,iBAAe,KAAKA,EAAK,aAAa,MAAM,CAAC,GAC7CA,EAAK,aAAa,SAAS,GAG3BsC,IAAc,UAAYtC,EAAK,aAAa,UAAU,IAC/D4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,QAAS,CACZ,GAAI,iBAAe,KAAKsC,CAAS,EAC3BtC,EAAK,cAAc,IACjBA,EAAK,WAAa,EAChBA,EAAK,WAAaA,EAAK,MAAM,QAC/B4B,EAAQ,IAAI5B,CAAI,EAGlB4B,EAAQ,IAAI5B,CAAI,WAGXsC,IAAc,WAAY,CACnC,MAAMhB,EAAS,KAAK7B,GACpB,IAAIsC,KAAU,gBAAa/B,EAAMsB,CAAM,EACvCS,EAAUT,EAAO,WAAW,EAC5B,IAAIa,EACJ,GAAI,CAACJ,EACHI,EAAO,OAEP,MAAOJ,GAAW/B,EAAK,SAAS+B,CAAO,GACjC,mBAAe,KAAKA,EAAQ,SAAS,IACnCA,EAAQ,cAAc,EACpBA,EAAQ,WAAa,EACvBI,EAAOJ,EAAQ,WAAaA,EAAQ,MAAM,OAE1CI,EAAO,GAGTA,EAAO,GAEL,CAACA,KAIPJ,EAAUT,EAAO,SAAS,EAG1Ba,GACFP,EAAQ,IAAI5B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAAW,CACd,GAAI,iBAAe,KAAKsC,CAAS,EAC3BtC,EAAK,cAAc,EACjBA,EAAK,WAAa,GAAKA,EAAK,UAAYA,EAAK,MAAM,QACrD4B,EAAQ,IAAI5B,CAAI,EAGlB4B,EAAQ,IAAI5B,CAAI,UAETsC,IAAc,WAAY,CACnC,MAAMhB,EAAS,KAAK7B,GACpB,IAAIsC,KAAU,gBAAa/B,EAAMsB,CAAM,EACvCS,EAAUT,EAAO,WAAW,EAC5B,IAAIa,EACJ,GAAI,CAACJ,EACHI,EAAO,OAEP,MAAOJ,GAAW/B,EAAK,SAAS+B,CAAO,GACjC,mBAAe,KAAKA,EAAQ,SAAS,IACnCA,EAAQ,cAAc,EACpBA,EAAQ,WAAa,EACvBI,EAAOJ,EAAQ,WAAaA,EAAQ,MAAM,OAE1CI,EAAO,GAGTA,EAAO,GAEL,CAACA,KAIPJ,EAAUT,EAAO,SAAS,EAGzBa,GACHP,EAAQ,IAAI5B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,WAAY,CACXsC,IAAc,SACd,EAAEtC,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CA,EAAK,aAAa,MAAM,GACxB,iBAAe,KAAKA,EAAK,aAAa,MAAM,CAAC,GAC7C,EAAEA,EAAK,SAAS,gBACdA,EAAK,SAAS,iBACfA,EAAK,aAAa,KAAK,GAAKA,EAAK,aAAa,KAAK,GACnDA,EAAK,aAAa,MAAM,IAAM,UACjC4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACfsC,IAAc,SACd,EAAEtC,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CA,EAAK,aAAa,MAAM,GACxB,iBAAe,KAAKA,EAAK,aAAa,MAAM,CAAC,IAC5CA,EAAK,SAAS,gBAAkBA,EAAK,SAAS,gBACjD4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,IAAIiF,EACJ,GAAI,wBAAwB,KAAK3C,CAAS,EACxC2C,EAAajF,UACJsC,IAAc,QACvB,GAAItC,EAAK,aAAa,MAAM,EAAG,CAC7B,MAAMqF,EAAYrF,EAAK,aAAa,MAAM,GACtCqF,IAAc,QAAU,iBAAe,KAAKA,CAAS,GACrD,gBAAc,KAAKA,CAAS,GAC5B,gBAAc,KAAKA,CAAS,KAC9BJ,EAAajF,EAEjB,MACEiF,EAAajF,EAGbiF,IACCjF,EAAK,UAAYA,EAAK,aAAa,UAAU,IAChD4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,IAAIiF,EACJ,GAAI,wBAAwB,KAAK3C,CAAS,EACxC2C,EAAajF,UACJsC,IAAc,QACvB,GAAItC,EAAK,aAAa,MAAM,EAAG,CAC7B,MAAMqF,EAAYrF,EAAK,aAAa,MAAM,GACtCqF,IAAc,QAAU,iBAAe,KAAKA,CAAS,GACrD,gBAAc,KAAKA,CAAS,GAC5B,gBAAc,KAAKA,CAAS,KAC9BJ,EAAajF,EAEjB,MACEiF,EAAajF,EAGbiF,GACA,EAAEjF,EAAK,UAAYA,EAAK,aAAa,UAAU,IACjD4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,OAAQ,CACPA,IAAS,KAAKlB,GAAU,iBAC1B8C,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,QAAS,CACZ,GAAIA,EAAK,cAAc,EAAG,CACxB,MAAMsB,EAAS,KAAKxC,GAAU,iBAAiBkB,EAAM,UAAQ,EAC7D,IAAI+B,EAAUT,EAAO,WAAW,EAC5Ba,EACJ,KAAOJ,IACLI,EAAOJ,EAAQ,WAAa,gBAC1BA,EAAQ,WAAa,YACnB,EAACI,IAGLJ,EAAUT,EAAO,YAAY,EAE3Ba,GACFP,EAAQ,IAAI5B,CAAI,CAEpB,MACE4B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,cAAe,EACb2B,GAAc3B,IAAS2B,EAAW,mBACnC3B,IAAS,KAAKT,KAChBqC,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,aAAc,EACZ2B,GAAc3B,IAAS2B,EAAW,kBACnC3B,IAAS,KAAKT,KAChBqC,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,aAAc,EACZ2B,GAAc3B,IAAS2B,EAAW,mBAClC3B,IAAS2B,EAAW,kBAAqB3B,IAAS,KAAKT,KAC1DqC,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,GAAI2B,EAAY,CACd,KAAM,CAAC2D,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,CACL,EAAGtF,CAAI,EACHsF,GACF1D,EAAQ,IAAI0D,CAAK,CAErB,MAAWtF,IAAS,KAAKT,IACvBqC,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,GAAI2B,EAAY,CACd,KAAM,CAAC2D,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,EACH,QAAS,EACX,EAAGtF,CAAI,EACHsF,GACF1D,EAAQ,IAAI0D,CAAK,CAErB,MAAWtF,IAAS,KAAKT,IACvBqC,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,GAAI2B,EAAY,CACd,KAAM,CAAC2D,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,CACL,EAAGtF,CAAI,EACP,GAAIsF,IAAUtF,EAAM,CAClB,KAAM,CAACuF,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,EACH,QAAS,EACX,EAAGvF,CAAI,EACHuF,IAAUvF,GACZ4B,EAAQ,IAAI5B,CAAI,CAEpB,CACF,MAAWA,IAAS,KAAKT,IACvBqC,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,UAAW,CACVA,EAAK,aAAa,IAAI,GAAKsC,EAAU,SAAS,GAAG,KAC/C,mBAAgBtC,CAAI,GACtB4B,EAAQ,IAAI5B,CAAI,GAGTA,aAAgB,KAAKJ,GAAQ,aAC7BI,aAAgB,KAAKJ,GAAQ,aACtCgC,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,GAAIA,EAAK,QAAS,CAChB,KAAM,CAAE,QAAAiC,CAAQ,EAAI,KAAKrC,GAAQ,iBAAiBI,CAAI,EAClDiC,IAAY,QACdL,EAAQ,IAAI5B,CAAI,CAEpB,CACA,KACF,CACA,IAAK,OACL,IAAK,eAEH,MAGF,IAAK,QACL,IAAK,SACL,IAAK,eACL,IAAK,aAAc,CACjB,GAAII,EAAM,CACR,MAAMgB,EAAM,gCAAgCmC,CAAO,GACnD,MAAM,IAAI,aAAanC,EAAK,mBAAiB,CAC/C,CACA,KACF,CAEA,IAAK,WACL,IAAK,QACL,IAAK,YACL,IAAK,UACL,IAAK,aACL,IAAK,SACL,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,GAAIhB,EAAM,CACR,MAAMgB,EAAM,6BAA6BmC,CAAO,GAChD,MAAM,IAAI,aAAanC,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,QACE,GAAImC,EAAQ,WAAW,UAAU,GAC/B,GAAInD,EAAM,CACR,MAAMgB,EAAM,6BAA6BmC,CAAO,GAChD,MAAM,IAAI,aAAanC,EAAK,mBAAiB,CAC/C,UACS,CAACsC,EAAS,CACnB,MAAMtC,EAAM,yBAAyBmC,CAAO,GAC5C,MAAM,IAAI,aAAanC,EAAK,YAAU,CACxC,CAEJ,CAEF,OAAOQ,CACT,CASA,4BAA4BtB,EAAKN,EAAM,CACrC,KAAM,CAAE,SAAU8D,EAAa,KAAMP,CAAQ,EAAIjD,EACjD,IAAImD,EACJ,GAAI,MAAM,QAAQK,CAAW,EAAG,CAC9B,KAAM,CAAE,SAAAlD,CAAS,KAAI,WAAQkD,EAAY,CAAC,CAAC,EACrC,CAAC7C,CAAM,EAAIL,EACX,CAAC,GAAGM,CAAM,EAAID,EACd,CAAE,KAAAuE,CAAK,EAAIxF,EACjB,GAAIuD,IAAY,OAAQ,CACtB,IAAIpB,EACJ,UAAWY,KAAQ7B,EAAQ,CACzB,KAAM,CAAE,KAAM8B,CAAS,EAAID,EAC3B,GAAIC,IAAa,aAAY,CAE3B,MAAM5B,EAAM,uBADA,eAAYd,CAAG,CACQ,GACnC,MAAM,IAAI,aAAac,EAAK,YAAU,CACxC,CAEA,GADAe,EAAO,KAAK,eAAeY,EAAMyC,CAAI,EAAE,IAAIA,CAAI,EAC3C,CAACrD,EACH,KAEJ,CACIA,IACFsB,EAAMzD,EAEV,SAAWuD,IAAY,eAAgB,CACrC,IAAIwB,EAASS,EACTrD,EACJ,KAAO4C,GAAQ,CACb,UAAWhC,KAAQ7B,EAAQ,CACzB,KAAM,CAAE,KAAM8B,CAAS,EAAID,EAC3B,GAAIC,IAAa,aAAY,CAE3B,MAAM5B,EAAM,uBADA,eAAYd,CAAG,CACQ,GACnC,MAAM,IAAI,aAAac,EAAK,YAAU,CACxC,CAEA,GADAe,EAAO,KAAK,eAAeY,EAAMgC,CAAM,EAAE,IAAIA,CAAM,EAC/C,CAAC5C,EACH,KAEJ,CACA,GAAIA,EACF,MAEA4C,EAASA,EAAO,UAEpB,CACI5C,IACFsB,EAAMzD,EAEV,CACF,SAAWuD,IAAY,OACrBE,EAAMzD,MACD,CACL,MAAMoB,EAAM,qBAAqBmC,CAAO,GACxC,MAAM,IAAI,aAAanC,EAAK,YAAU,CACxC,CACA,OAAOqC,GAAO,IAChB,CAUA,eAAenD,EAAKN,EAAMC,EAAK,CAC7B,KAAM,CAAE,KAAMwF,CAAQ,EAAInF,EACpBsB,EAAU,IAAI,IACpB,GAAItB,EAAI,OAAS,QACf,OAAOsB,EAET,MAAM2B,KAAU,oBAAiBjD,EAAI,IAAI,EAIzC,GAHI,OAAOiD,GAAY,UAAYA,IAAYjD,EAAI,OACjDA,EAAI,KAAOiD,GAETvD,EAAK,WAAa,eACpB,OAAQyF,EAAS,CACf,KAAK,0BAAyB,CAC5B,UAAQ,2BAA2BlC,EAAStD,CAAG,EAC/C,KACF,CACA,KAAK,cAAa,CACZD,EAAK,KAAOuD,GACd3B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,KAAK,iBAAgB,CACfA,EAAK,UAAU,SAASuD,CAAO,GACjC3B,EAAQ,IAAI5B,CAAI,EAElB,KACF,CACA,KAAK,wBAEH,OADc,KAAK,0BAA0BM,EAAKN,EAAMC,CAAG,EAG7D,QAAS,CACP,MAAMwD,EAAM,UAAQ,cAAcnD,EAAKN,EAAMC,CAAG,EAC5CwD,GACF7B,EAAQ,IAAI6B,CAAG,CAEnB,CACF,SACS,KAAKjE,IAAWiG,IAAY,yBAC5BzF,EAAK,WAAa,yBAAwB,CACnD,GAAIuD,IAAY,OAAS,qBAAmB,KAAKA,CAAO,EAEtD,OADc,KAAK,0BAA0BjD,EAAKN,EAAMC,CAAG,EAEtD,GAAI,kBAAgB,KAAKsD,CAAO,EAAG,CACxC,MAAME,EAAM,KAAK,4BAA4BnD,EAAKN,EAAMC,CAAG,EACvDwD,GACF7B,EAAQ,IAAI6B,CAAG,CAEnB,CACF,CACA,OAAO7B,CACT,CAUA,aAAaV,EAAQlB,EAAMC,EAAK,CAC9B,IAAIkC,EACAuD,EAAS,KAAKpG,GAAS,IAAI4B,CAAM,EACrC,GAAIwE,GAAUA,EAAO,IAAI1F,CAAI,EAAG,CAC9B,KAAM,CAAE,QAAA4B,CAAQ,EAAI8D,EAAO,IAAI1F,CAAI,EACnCmC,EAAOP,CACT,CACA,GAAI,OAAOO,GAAS,UAAW,CAC7B,IAAIwD,EAAY,GACZ3F,EAAK,WAAa,gBAAgB,WAAS,KAAKA,EAAK,SAAS,IAChE2F,EAAY,IAEd,UAAW5C,KAAQ7B,EAAQ,CACzB,OAAQ6B,EAAK,KAAM,CACjB,KAAK,gBACL,KAAK,cAAa,CAChB4C,EAAY,GACZ,KACF,CACA,KAAK,wBAAuB,CACtB,wBAAsB,KAAK5C,EAAK,IAAI,IACtC4C,EAAY,IAEd,KACF,CACA,QACF,CAEA,GADAxD,EAAO,KAAK,eAAeY,EAAM/C,EAAMC,CAAG,EAAE,IAAID,CAAI,EAChD,CAACmC,EACH,KAEJ,CACIwD,GAAa,CAAC,KAAK1G,KAChByG,IACHA,EAAS,IAAI,SAEfA,EAAO,IAAI1F,EAAM,CACf,QAASmC,CACX,CAAC,EACD,KAAK7C,GAAS,IAAI4B,EAAQwE,CAAM,EAEpC,CACA,MAAO,CAAC,CAACvD,CACX,CASA,qBAAqBnB,EAAOf,EAAM,CAAC,EAAG,CACpC,KAAM,CAAE,SAAA2F,EAAU,aAAAC,CAAa,EAAI5F,EAC7BI,EAAQ,IAAI,IACZI,EAAIO,EAAM,OAChB,GAAIP,EACF,GAAImF,EACF,QAASlF,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMF,EAAOQ,EAAMN,CAAC,EACP,KAAK,aAAamF,EAAcrF,EAAMP,CAAG,GAEpDI,EAAM,IAAIG,CAAI,CAElB,KACK,CACL,MAAMqD,EAAM,CAAC,EAAE,MAAM,KAAK7C,CAAK,EAC/B,OAAO,IAAI,IAAI6C,CAAG,CACpB,CAEF,OAAOxD,CACT,CAUA,qBAAqBa,EAAQ4E,EAAU7F,EAAK,CAC1C,KAAM,CAAC8C,EAAM,GAAG8C,CAAY,EAAI3E,EAC1B0E,EAAWC,EAAa,OAAS,EACjC,CAAE,KAAM7C,CAAS,EAAID,EACrBgD,KAAW,oBAAiBhD,EAAK,IAAI,EACvC,OAAOgD,GAAa,UAAYA,IAAahD,EAAK,OACpDA,EAAK,KAAOgD,GAEd,IAAI1F,EAAQ,IAAI,IACZ2F,EAAU,GACd,GAAI,KAAKxG,GACPwG,EAAU,OAEV,QAAQhD,EAAU,CAChB,KAAK,0BAAyB,CAC5B,UAAQ,2BAA2B+C,EAAU9F,CAAG,EAChD,KACF,CACA,KAAK,cAAa,CAChB,GAAI,KAAKV,GAAM,WAAa,eAC1ByG,EAAU,OACL,CACL,MAAMhG,EAAO,KAAKT,GAAM,eAAewG,CAAQ,EAC3C/F,GAAQA,IAAS8F,GAAYA,EAAS,SAAS9F,CAAI,IACjD4F,EACW,KAAK,aAAaC,EAAc7F,EAAMC,CAAG,GAEpDI,EAAM,IAAIL,CAAI,EAGhBK,EAAM,IAAIL,CAAI,EAGpB,CACA,KACF,CACA,KAAK,iBAAgB,CACnB,MAAMgB,EAAQ8E,EAAS,uBAAuBC,CAAQ,EACtD1F,EAAQ,KAAK,qBAAqBW,EAAO,CACvC,SAAA4E,EACA,aAAAC,CACF,CAAC,EACD,KACF,CACA,KAAK,gBAAe,CAClB,GAAI,KAAK/G,GAAU,cAAgB,aAC/B,CAAC,OAAO,KAAKiH,CAAQ,EAAG,CAC1B,MAAM/E,EAAQ8E,EAAS,qBAAqBC,CAAQ,EACpD1F,EAAQ,KAAK,qBAAqBW,EAAO,CACvC,SAAA4E,EACA,aAAAC,CACF,CAAC,CACH,MACEG,EAAU,GAEZ,KACF,CACA,QACEA,EAAU,EAEd,CAEF,MAAO,CACL,MAAA3F,EACA,QAAA2F,CACF,CACF,CAUA,iBAAiB5C,EAAMpD,EAAMC,EAAM,CAAC,EAAG,CACrC,KAAM,CAAE,MAAAgD,EAAO,OAAA/B,CAAO,EAAIkC,EACpB,CAAE,KAAM6C,CAAU,EAAIhD,EACtB,CAAE,WAAAtB,CAAW,EAAI3B,EACjB,CAAE,IAAAkG,CAAI,EAAIjG,EACV2B,EAAU,IAAI,IACpB,GAAIsE,IAAQzH,EACV,OAAQwH,EAAW,CACjB,IAAK,IAAK,CACR,MAAMlE,EAAU/B,EAAK,mBACjB+B,GACW,KAAK,aAAab,EAAQa,EAAS9B,CAAG,GAEjD2B,EAAQ,IAAIG,CAAO,EAGvB,KACF,CACA,IAAK,IAAK,CACR,GAAIJ,EAAY,CACd,MAAML,EAAS,KAAK,kBAAkBK,CAAU,EAChD,IAAII,KAAU,gBAAa/B,EAAMsB,CAAM,EAEvC,IADAS,EAAUT,EAAO,YAAY,EACtBS,GACQ,KAAK,aAAab,EAAQa,EAAS9B,CAAG,GAEjD2B,EAAQ,IAAIG,CAAO,EAErBA,EAAUT,EAAO,YAAY,CAEjC,CACA,KACF,CACA,IAAK,IAAK,CACR,MAAMA,EAAS,KAAK,kBAAkBtB,CAAI,EAC1C,IAAI+B,KAAU,gBAAa/B,EAAMsB,CAAM,EAEvC,IADAS,EAAUT,EAAO,WAAW,EACrBS,GACQ,KAAK,aAAab,EAAQa,EAAS9B,CAAG,GAEjD2B,EAAQ,IAAIG,CAAO,EAErBA,EAAUT,EAAO,YAAY,EAE/B,KACF,CACA,IAAK,IACL,QAAS,CACP,KAAM,CAAE,MAAAjB,EAAO,QAAA2F,CAAQ,EAAI,KAAK,qBAAqB9E,EAAQlB,CAAI,EACjE,GAAIK,EAAM,KACR,OAAOA,EAET,GAAI2F,EAAS,CACX,MAAM1E,EAAS,KAAK,kBAAkBtB,CAAI,EAC1C,IAAI+B,KAAU,gBAAa/B,EAAMsB,CAAM,EAEvC,IADAS,EAAUT,EAAO,SAAS,EACnBS,GAAW/B,EAAK,SAAS+B,CAAO,GACxB,KAAK,aAAab,EAAQa,EAAS9B,CAAG,GAEjD2B,EAAQ,IAAIG,CAAO,EAErBA,EAAUT,EAAO,SAAS,CAE9B,CACF,CACF,KAEA,QAAQ2E,EAAW,CACjB,IAAK,IAAK,CACR,MAAMlE,EAAU/B,EAAK,uBACjB+B,GACW,KAAK,aAAab,EAAQa,EAAS9B,CAAG,GAEjD2B,EAAQ,IAAIG,CAAO,EAGvB,KACF,CACA,IAAK,IAAK,CACR,GAAIJ,EAAY,CACd,MAAML,EAAS,KAAK,kBAAkBK,CAAU,EAChD,IAAII,KAAU,gBAAaJ,EAAYL,CAAM,EAE7C,IADAS,EAAUT,EAAO,WAAW,EACrBS,GACDA,IAAY/B,GAGD,KAAK,aAAakB,EAAQa,EAAS9B,CAAG,GAEjD2B,EAAQ,IAAIG,CAAO,EAGvBA,EAAUT,EAAO,YAAY,CAEjC,CACA,KACF,CACA,IAAK,IAAK,CACJK,GACW,KAAK,aAAaT,EAAQS,EAAY1B,CAAG,GAEpD2B,EAAQ,IAAID,CAAU,EAG1B,KACF,CACA,IAAK,IACL,QAAS,CACP,MAAMkC,EAAM,CAAC,EACb,IAAI9B,EAAUJ,EACd,KAAOI,GACQ,KAAK,aAAab,EAAQa,EAAS9B,CAAG,GAEjD4D,EAAI,KAAK9B,CAAO,EAElBA,EAAUA,EAAQ,WAEpB,GAAI8B,EAAI,OACN,OAAO,IAAI,IAAIA,EAAI,QAAQ,CAAC,CAEhC,CACF,CAEF,OAAOjC,CACT,CAUA,UAAUV,EAAQjB,EAAK,CACrB,KAAM,CAAE,KAAAD,CAAK,EAAIC,EACXqB,EAAS,KAAKjC,GACpB,IAAI0C,KAAU,gBAAa/B,EAAMsB,CAAM,EACnC6E,EACJ,GAAIpE,EAQF,KAPIA,EAAQ,WAAa,gBAEdA,IAAY/B,GACjB+B,IAAY,KAAKxC,MACnBwC,EAAUT,EAAO,SAAS,GAGvBS,GAAS,CAId,GAHgB,KAAK,aAAab,EAAQa,EAAS,CACjD,KAAM,KAAKpC,EACb,CAAC,EACY,CACXwG,EAAcpE,EACd,KACF,CACAA,EAAUT,EAAO,SAAS,CAC5B,CAEF,OAAO6E,GAAe,IACxB,CAQA,WAAWjF,EAAQ,CACjB,MAAMb,EAAQ,CAAC,EACT8B,EAAO,KAAK,aAAajB,EAAQ,KAAKhC,GAAO,CACjD,KAAM,KAAKS,EACb,CAAC,EACD,IAAIyG,EAAW,GACf,OAAIjE,IACF9B,EAAM,KAAK,KAAKnB,EAAK,EACrBkH,EAAW,IAEN,CAAC/F,EAAO+F,CAAQ,CACzB,CASA,YAAYlF,EAAQjB,EAAM,CAAC,EAAG,CAC5B,KAAM,CAAE,QAAAoG,CAAQ,EAAIpG,EACdI,EAAQ,CAAC,EACf,IAAI8B,EAAO,KAAK,aAAajB,EAAQ,KAAKhC,GAAO,CAC/C,KAAM,KAAKS,EACb,CAAC,EACGyG,EAAW,GAKf,GAJIjE,IACF9B,EAAM,KAAK,KAAKnB,EAAK,EACrBkH,EAAW,IAET,CAACjE,GAAQkE,EAAS,CACpB,IAAItE,EAAU,KAAK7C,GAAM,WACzB,KAAO6C,IACLI,EAAO,KAAK,aAAajB,EAAQa,EAAS,CACxC,KAAM,KAAKpC,EACb,CAAC,EACGwC,IACF9B,EAAM,KAAK0B,CAAO,EAClBqE,EAAW,IAETrE,EAAQ,aACVA,EAAUA,EAAQ,UAKxB,CACA,MAAO,CAAC1B,EAAO+F,CAAQ,CACzB,CAQA,WAAWlF,EAAQ,CACjB,MAAMb,EAAQ,CAAC,EACTL,EAAO,KAAK,UAAUkB,EAAQ,CAClC,KAAM,KAAKhC,EACb,CAAC,EACD,IAAIkH,EAAW,GACf,OAAIpG,IACFK,EAAM,KAAKL,CAAI,EACfoG,EAAW,IAEN,CAAC/F,EAAO+F,CAAQ,CACzB,CAWA,wBAAwBpF,EAAOf,EAAM,CAAC,EAAG,CACvC,KAAM,CAAE,QAAAoG,EAAS,SAAAT,EAAU,aAAAC,EAAc,WAAAS,CAAW,EAAIrG,EACxD,IAAII,EAAQ,CAAC,EACT+F,EAAW,GACXG,EAAY,GAChB,MAAM9F,EAAIO,EAAM,OAChB,GAAIP,EACF,GAAI,KAAKvB,GAAM,WAAa,eAC1B,QAASwB,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMV,EAAOgB,EAAMN,CAAC,EACpB,GAAIV,IAAS,KAAKd,KACb,KAAKA,GAAM,SAASc,CAAI,GAAKA,EAAK,SAAS,KAAKd,EAAK,IACxD,GAAI0G,GAIF,GAHa,KAAK,aAAaC,EAAc7F,EAAM,CACjD,KAAM,KAAKL,EACb,CAAC,IAECU,EAAM,KAAKL,CAAI,EACfoG,EAAW,GACPE,IAAe,gBACjB,cAIJjG,EAAM,KAAKL,CAAI,EACfoG,EAAW,GACPE,IAAe,eACjB,MAIR,SACSD,EACT,GAAIT,EACF,QAASlF,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMV,EAAOgB,EAAMN,CAAC,EAIpB,GAHa,KAAK,aAAamF,EAAc7F,EAAM,CACjD,KAAM,KAAKL,EACb,CAAC,IAECU,EAAM,KAAKL,CAAI,EACfoG,EAAW,GACPE,IAAe,gBACjB,KAGN,MAEAjG,EAAQ,CAAC,EAAE,MAAM,KAAKW,CAAK,EAC3BoF,EAAW,GACXG,EAAY,WAELX,EACT,QAASlF,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMV,EAAOgB,EAAMN,CAAC,EAIpB,GAHa,KAAK,aAAamF,EAAc7F,EAAM,CACjD,KAAM,KAAKL,EACb,CAAC,IAECU,EAAM,KAAKL,CAAI,EACfoG,EAAW,GACPE,IAAe,gBACjB,KAGN,MAEAjG,EAAQ,CAAC,EAAE,MAAM,KAAKW,CAAK,EAC3BoF,EAAW,GACXG,EAAY,GAGhB,MAAO,CAAClG,EAAO+F,EAAUG,CAAS,CACpC,CAUA,gBAAgBnD,EAAMkD,EAAYD,EAAS,CACzC,KAAM,CAAE,OAAAnF,CAAO,EAAIkC,EACb,CAACL,EAAM,GAAG8C,CAAY,EAAI3E,EAC1B0E,EAAWC,EAAa,OAAS,EACjC,CAAE,KAAME,EAAU,KAAM/C,CAAS,EAAID,EAC3C,IAAI1C,EAAQ,CAAC,EACTkG,EAAY,GACZH,EAAW,GACXJ,EAAU,GACd,OAAQhD,EAAU,CAChB,KAAK,0BAAyB,CAC5B,UAAQ,2BAA2B+C,EAAU,CAC3C,KAAM,KAAKpG,EACb,CAAC,EACD,KACF,CACA,KAAK,cAAa,CAChB,GAAI2G,IAAe,cACjB,CAACjG,EAAO+F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,UACjCoF,IAAe,gBACxB,CAACjG,EAAO+F,CAAQ,EAAI,KAAK,YAAYlF,EAAQ,CAC3C,QAAAmF,CACF,CAAC,UACQC,IAAe,gBACf,KAAK/G,GAAM,WAAa,eAAc,CAC/C,MAAMS,EAAO,KAAKT,GAAM,eAAewG,CAAQ,EAC3C/F,IACE4F,EACW,KAAK,aAAaC,EAAc7F,EAAM,CACjD,KAAM,KAAKL,EACb,CAAC,IAECU,EAAM,KAAKL,CAAI,EACfoG,EAAW,KAGb/F,EAAM,KAAKL,CAAI,EACfoG,EAAW,IAGjB,MAAWE,IAAe,eACxB,CAACjG,EAAO+F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,EAE1C8E,EAAU,GAEZ,KACF,CACA,KAAK,iBAAgB,CACnB,GAAIM,IAAe,cACjB,CAACjG,EAAO+F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,UACjCoF,IAAe,gBACxB,CAACjG,EAAO+F,CAAQ,EAAI,KAAK,YAAYlF,EAAQ,CAC3C,QAAAmF,CACF,CAAC,UACQ,KAAK9G,GAAM,WAAa,gBAAe,CAChD,MAAMyB,EAAQ,KAAKzB,GAAM,uBAAuBwG,CAAQ,EACpD/E,EAAM,SACR,CAACX,EAAO+F,EAAUG,CAAS,EAAI,KAAK,wBAAwBvF,EAAO,CACjE,QAAAqF,EACA,SAAAT,EACA,aAAAC,EACA,WAAAS,CACF,CAAC,EAEL,MAAWA,IAAe,eACxB,CAACjG,EAAO+F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,EAE1C8E,EAAU,GAEZ,KACF,CACA,KAAK,gBAAe,CAClB,GAAIM,IAAe,cACjB,CAACjG,EAAO+F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,UACjCoF,IAAe,gBACxB,CAACjG,EAAO+F,CAAQ,EAAI,KAAK,YAAYlF,EAAQ,CAC3C,QAAAmF,CACF,CAAC,UACQ,KAAKvH,GAAU,cAAgB,aAC/B,KAAKS,GAAM,WAAa,iBACxB,CAAC,OAAO,KAAKwG,CAAQ,EAAG,CACjC,MAAM/E,EAAQ,KAAKzB,GAAM,qBAAqBwG,CAAQ,EAClD/E,EAAM,SACR,CAACX,EAAO+F,EAAUG,CAAS,EAAI,KAAK,wBAAwBvF,EAAO,CACjE,QAAAqF,EACA,SAAAT,EACA,aAAAC,EACA,WAAAS,CACF,CAAC,EAEL,MAAWA,IAAe,eACxB,CAACjG,EAAO+F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,EAE1C8E,EAAU,GAEZ,KACF,CACA,QACE,GAAIM,IAAe,iBAAiB,kBAAgB,KAAKP,CAAQ,GAC/D,GAAI,KAAKvG,IACL,KAAKN,GAAM,WAAa,yBAAwB,CAClD,MAAMc,EAAO,KAAK,4BAA4B+C,EAAM,KAAK7D,EAAK,EAC1Dc,IACFK,EAAM,KAAKL,CAAI,EACfoG,EAAW,GAEf,OACSE,IAAe,cACxB,CAACjG,EAAO+F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,EACjCoF,IAAe,gBACxB,CAACjG,EAAO+F,CAAQ,EAAI,KAAK,YAAYlF,EAAQ,CAC3C,QAAAmF,CACF,CAAC,EACQC,IAAe,eACxB,CAACjG,EAAO+F,CAAQ,EAAI,KAAK,WAAWlF,CAAM,EAE1C8E,EAAU,EAGhB,CACA,MAAO,CACL,UAAAO,EACA,SAAAX,EACA,SAAAQ,EACA,MAAA/F,EACA,QAAA2F,CACF,CACF,CAQA,cAAcM,EAAY,CACxB,MAAMhG,EAAM,KAAK3B,GAAK,OAAO,EAC7B,GAAI2H,IAAe,cAAcA,IAAe,eAAc,CAC5D,MAAME,EAAe,IAAI,IACzB,IAAI9F,EAAI,EACR,SAAW,CAAE,OAAAO,CAAO,IAAKX,EAAK,CAC5B,MAAMmG,EAAYxF,EAAO,OACnBoF,EAAUI,EAAY,EACtBC,EAAYzF,EAAO,CAAC,EAC1B,IAAIiF,EACA9C,EACJ,GAAIiD,EAAS,CACX,KAAM,CACJ,MAAOM,EACP,OAAQ,CAAC,CACP,KAAMC,EACN,KAAMC,CACR,CAAC,CACH,EAAIH,EACEI,EAAW7F,EAAOwF,EAAY,CAAC,EAC/B,CACJ,OAAQ,CAAC,CACP,KAAMM,EACN,KAAMC,CACR,CAAC,CACH,EAAIF,EACJ,GAAIE,IAAa,2BACbA,IAAa,cACfd,EAAMxH,EACN0E,EAAO0D,UACED,IAAc,2BACdA,IAAc,cACvBX,EAAMzH,EACN2E,EAAOsD,UACEJ,IAAe,aACxB,GAAIM,IAAc,KAAOC,IAAc,gBACrCX,EAAMxH,EACN0E,EAAO0D,UACEC,IAAa,KAAOC,IAAa,gBAC1Cd,EAAMzH,EACN2E,EAAOsD,UACED,IAAc,EAAG,CAC1B,KAAM,CAAE,KAAMR,CAAU,EAAIU,EACxB,SAAS,KAAKV,CAAS,GACzBC,EAAMxH,EACN0E,EAAO0D,IAEPZ,EAAMzH,EACN2E,EAAOsD,EAEX,MACER,EAAMzH,EACN2E,EAAOsD,UAEAK,IAAa,KAAOC,IAAa,gBAC1Cd,EAAMzH,EACN2E,EAAOsD,UACEE,IAAc,KAAOC,IAAc,gBAC5CX,EAAMxH,EACN0E,EAAO0D,MACF,CACL,IAAI3E,EACJ,SAAW,CAAE,MAAAc,EAAO,OAAQ,CAACF,CAAI,CAAE,IAAK9B,EAAQ,CAC9C,KAAM,CAAE,KAAM8E,EAAU,KAAM/C,CAAS,EAAID,EAC3C,GAAIC,IAAa,yBAAyB+C,IAAa,MAAO,CAC5D5D,EAAO,GACP,KACF,CACA,GAAI,CAACA,GAAQc,EAAO,CAClB,KAAM,CAAE,KAAMgD,CAAU,EAAIhD,EACxB,SAAS,KAAKgD,CAAS,IACzB9D,EAAO,GAEX,CACF,CACIA,GACF+D,EAAMzH,EACN2E,EAAOsD,IAEPR,EAAMxH,EACN0E,EAAO0D,EAEX,CACF,MACEZ,EAAMxH,EACN0E,EAAOsD,EAET,KAAM,CACJ,UAAAH,EAAW,SAAAX,EAAU,SAAAQ,EAAU,MAAA/F,EAAO,QAAA2F,CACxC,EAAI,KAAK,gBAAgB5C,EAAMkD,EAAYD,CAAO,EAC9ChG,EAAM,QACR,KAAK1B,GAAK+B,CAAC,EAAE,KAAO,GACpB,KAAKvB,GAAOuB,CAAC,EAAIL,GACR2F,GACTQ,EAAa,IAAI,IAAI,IAAI,CACvB,CAAC,QAAS9F,CAAC,EACX,CAAC,OAAQ0C,CAAI,CACf,CAAC,CAAC,EAEJ,KAAKzE,GAAK+B,CAAC,EAAE,UAAY6F,EACzB,KAAK5H,GAAK+B,CAAC,EAAE,IAAMwF,EACnB,KAAKvH,GAAK+B,CAAC,EAAE,SAAW0F,GAAY,CAACR,EACrClF,GACF,CACA,GAAI8F,EAAa,KAAM,CACrB,IAAIxG,EACAsB,EACA,KAAKpC,KAAU,KAAKK,IAAS,KAAKL,GAAM,WAAa,gBACvDc,EAAO,KAAKd,GACZoC,EAAS,KAAKjC,KAEdW,EAAO,KAAKT,GACZ+B,EAAS,KAAK7B,IAEhB,IAAI4D,KAAW,gBAAarD,EAAMsB,CAAM,EACxC,KAAO+B,GAAU,CACf,IAAIlB,EAAO,GAUX,GATI,KAAKjD,GAAM,WAAa,eACtBmE,IAAa,KAAKnE,GACpBiD,EAAO,GAEPA,EAAO,KAAKjD,GAAM,SAASmE,CAAQ,EAGrClB,EAAO,GAELA,EACF,UAAW8E,KAAeT,EAAc,CACtC,KAAM,CAAE,OAAAtF,CAAO,EAAI+F,EAAY,IAAI,MAAM,EAIzC,GAHgB,KAAK,aAAa/F,EAAQmC,EAAU,CAClD,KAAM,KAAK1D,EACb,CAAC,EACY,CACX,MAAMuH,EAAQD,EAAY,IAAI,OAAO,EACrC,KAAKtI,GAAKuI,CAAK,EAAE,SAAW,GAC5B,KAAKvI,GAAKuI,CAAK,EAAE,KAAO,GACxB,KAAK/H,GAAO+H,CAAK,EAAE,KAAK7D,CAAQ,CAClC,CACF,CAEEA,IAAa/B,EAAO,cACtB+B,KAAW,gBAAaA,EAAU/B,CAAM,GAE1C+B,EAAW/B,EAAO,SAAS,CAC7B,CACF,CACF,KAAO,CACL,IAAIZ,EAAI,EACR,SAAW,CAAE,OAAAO,CAAO,IAAKX,EAAK,CAC5B,MAAM8C,EAAOnC,EAAOA,EAAO,OAAS,CAAC,EAC/BoF,EAAUpF,EAAO,OAAS,EAC1B,CACJ,SAAA2E,EAAU,SAAAQ,EAAU,MAAA/F,CACtB,EAAI,KAAK,gBAAgB+C,EAAMkD,EAAYD,CAAO,EAC9ChG,EAAM,SACR,KAAK1B,GAAK+B,CAAC,EAAE,KAAO,GACpB,KAAKvB,GAAOuB,CAAC,EAAIL,GAEnB,KAAK1B,GAAK+B,CAAC,EAAE,IAAMhC,EACnB,KAAKC,GAAK+B,CAAC,EAAE,SAAW0F,GAAY,CAACR,EACrClF,GACF,CACF,CACA,MAAO,CACL,KAAK/B,GACL,KAAKQ,EACP,CACF,CAUA,kBAAkBiE,EAAM/C,EAAO6F,EAAK,CAClC,MAAMrC,EAAM,CAAC,EACb,UAAW7D,KAAQK,EAAO,CACxB,MAAMuB,EAAU,KAAK,iBAAiBwB,EAAMpD,EAAM,CAChD,IAAAkG,EACA,KAAM,KAAKvG,EACb,CAAC,EACGiC,EAAQ,MACViC,EAAI,KAAK,GAAGjC,CAAO,CAEvB,CACA,OAAIiC,EAAI,OACC,IAAI,IAAIA,CAAG,EAEb,IAAI,GACb,CAWA,eAAe5C,EAAQZ,EAAOJ,EAAK,CACjC,KAAM,CAAE,MAAAgD,EAAO,MAAAiE,CAAM,EAAIjH,EACnB,CAAE,MAAOkH,EAAW,OAAAjG,CAAO,EAAID,EAAOiG,CAAK,EAC3C9D,EAAO,CACX,MAAAH,EACA,OAAA/B,CACF,EACM0C,EAAY,KAAK,kBAAkBR,EAAM/C,EAAO5B,CAAQ,EAC9D,IAAIgF,EACJ,GAAIG,EAAU,KACZ,GAAIsD,IAAUjG,EAAO,OAAS,EAAG,CAC/B,KAAM,CAACoC,CAAQ,KAAI,aAAUO,CAAS,EACtCH,EAAMJ,CACR,MACEI,EAAM,KAAK,eAAexC,EAAQ2C,EAAW,CAC3C,MAAOuD,EACP,MAAOD,EAAQ,CACjB,CAAC,EAGL,OAAOzD,GAAO,IAChB,CAWA,eAAexC,EAAQjB,EAAMC,EAAK,CAChC,KAAM,CAAE,MAAAiH,CAAM,EAAIjH,EACZmD,EAAOnC,EAAOiG,CAAK,EACnB7G,EAAQ,IAAI,IAAI,CAACL,CAAI,CAAC,EACtB4D,EAAY,KAAK,kBAAkBR,EAAM/C,EAAO3B,CAAQ,EAC9D,IAAI+E,EACJ,GAAIG,EAAU,MACZ,GAAIsD,IAAU,EACZzD,EAAMzD,MAEN,WAAWqD,KAAYO,EAIrB,GAHgB,KAAK,eAAe3C,EAAQoC,EAAU,CACpD,MAAO6D,EAAQ,CACjB,CAAC,EAEC,OAAOlH,EAKf,OAAOyD,GAAO,IAChB,CAQA,MAAM6C,EAAY,EACZA,IAAe,cAAcA,IAAe,iBAC9C,KAAK,4BAA4B,EAEnC,KAAM,CAAC,CAAC,GAAG1F,CAAQ,EAAGwG,CAAc,EAAI,KAAK,cAAcd,CAAU,EAC/D7F,EAAIG,EAAS,OACnB,IAAIyG,EACAhH,EAAQ,IAAI,IAChB,QAASK,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,KAAM,CAAE,OAAAO,EAAQ,UAAAsF,EAAW,IAAAL,EAAK,KAAAoB,CAAK,EAAI1G,EAASF,CAAC,EAC7C+F,EAAYxF,EAAO,OACzB,GAAIwF,GAAaa,EAAM,CACrB,MAAMC,EAAaH,EAAe1G,CAAC,EAC7B8G,EAAgBD,EAAW,OAC3B5D,EAAY8C,EAAY,EAC9B,GAAI9C,IAAc,EAChB,IAAK2C,IAAe,cAAcA,IAAe,iBAC7C,KAAKpH,GAAM,WAAa,eAC1B,QAASmD,EAAI,EAAGA,EAAImF,EAAenF,IAAK,CACtC,MAAMrC,EAAOuH,EAAWlF,CAAC,EACzB,GAAIrC,IAAS,KAAKd,IAAS,KAAKA,GAAM,SAASc,CAAI,IACjDK,EAAM,IAAIL,CAAI,EACVsG,IAAe,cACjB,KAGN,SACSA,IAAe,aACxB,GAAIjG,EAAM,KAAM,CACd,MAAMoH,EAAI,CAAC,GAAGpH,CAAK,EACnBA,EAAQ,IAAI,IAAI,CAAC,GAAGoH,EAAG,GAAGF,CAAU,CAAC,EACrCF,EAAO,EACT,MACEhH,EAAQ,IAAI,IAAIkH,CAAU,MAEvB,CACL,KAAM,CAACvH,CAAI,EAAIuH,EACflH,EAAM,IAAIL,CAAI,CAChB,SACSsG,IAAe,aACxB,GAAIJ,IAAQzH,EAAU,CACpB,GAAI,CAAE,MAAAwE,CAAM,EAAIhC,EAAO,CAAC,EACxB,UAAWjB,KAAQuH,EAAY,CAC7B,IAAI3D,EAAY,IAAI,IAAI,CAAC5D,CAAI,CAAC,EAC9B,QAASqC,EAAI,EAAGA,EAAIoE,EAAWpE,IAAK,CAClC,KAAM,CAAE,MAAO8E,EAAW,OAAAjG,CAAO,EAAID,EAAOoB,CAAC,EACvCe,EAAO,CACX,MAAAH,EACA,OAAA/B,CACF,EAEA,GADA0C,EAAY,KAAK,kBAAkBR,EAAMQ,EAAWsC,CAAG,EACnDtC,EAAU,KACZ,GAAIvB,IAAMsB,EACR,GAAItD,EAAM,KAAM,CACd,MAAMoH,EAAI,CAAC,GAAGpH,CAAK,EACnBA,EAAQ,IAAI,IAAI,CAAC,GAAGoH,EAAG,GAAG7D,CAAS,CAAC,EACpCyD,EAAO,EACT,MACEhH,EAAQuD,OAGVX,EAAQkE,MAGV,MAEJ,CACF,CACF,KACE,WAAWnH,KAAQuH,EAAY,CAC7B,IAAI3D,EAAY,IAAI,IAAI,CAAC5D,CAAI,CAAC,EAC9B,QAASqC,EAAIsB,EAAY,EAAGtB,GAAK,EAAGA,IAAK,CACvC,MAAMe,EAAOnC,EAAOoB,CAAC,EAErB,GADAuB,EAAY,KAAK,kBAAkBR,EAAMQ,EAAWsC,CAAG,EACnDtC,EAAU,KACRvB,IAAM,IACRhC,EAAM,IAAIL,CAAI,EACVyG,EAAY,GAAKpG,EAAM,KAAO,IAChCgH,EAAO,SAIX,MAEJ,CACF,SAEOf,IAAe,gBAAgBJ,IAAQzH,EAAU,CAC1D,KAAM,CAAE,MAAOiJ,CAAW,EAAIzG,EAAO,CAAC,EACtC,IAAIW,EACJ,UAAW5B,KAAQuH,EAKjB,GAJA3F,EAAU,KAAK,eAAeX,EAAQ,IAAI,IAAI,CAACjB,CAAI,CAAC,EAAG,CACrD,MAAO0H,EACP,MAAO,CACT,CAAC,EACG9F,EAAS,CACXvB,EAAM,IAAIuB,CAAO,EACjB,KACF,CAEF,GAAI,CAACA,GAAW,CAAC2E,EAAW,CAC1B,KAAM,CAAE,OAAQoB,CAAY,EAAI1G,EAAO,CAAC,EAClC,CAAC2G,CAAS,EAAIL,EACpB,IAAIxF,EAAU,KAAK,UAAU4F,EAAa,CACxC,KAAMC,CACR,CAAC,EACD,KAAO7F,GAAS,CAKd,GAJAH,EAAU,KAAK,eAAeX,EAAQ,IAAI,IAAI,CAACc,CAAO,CAAC,EAAG,CACxD,MAAO2F,EACP,MAAO,CACT,CAAC,EACG9F,EAAS,CACXvB,EAAM,IAAIuB,CAAO,EACjB,KACF,CACAG,EAAU,KAAK,UAAU4F,EAAa,CACpC,KAAM5F,CACR,CAAC,CACH,CACF,CACF,KAAO,CACL,IAAIH,EACJ,UAAW5B,KAAQuH,EAIjB,GAHA3F,EAAU,KAAK,eAAeX,EAAQjB,EAAM,CAC1C,MAAO2D,EAAY,CACrB,CAAC,EACG/B,EAAS,CACXvB,EAAM,IAAIL,CAAI,EACd,KACF,CAEF,GAAI,CAAC4B,GAAW,CAAC2E,GAAaD,IAAe,eAAc,CACzD,KAAM,CAAE,OAAQqB,CAAY,EAAI1G,EAAO0C,CAAS,EAC1C,CAACiE,CAAS,EAAIL,EACpB,IAAIxF,EAAU,KAAK,UAAU4F,EAAa,CACxC,KAAMC,CACR,CAAC,EACD,KAAO7F,GAAS,CAId,GAHAH,EAAU,KAAK,eAAeX,EAAQc,EAAS,CAC7C,MAAO4B,EAAY,CACrB,CAAC,EACG/B,EAAS,CACXvB,EAAM,IAAI0B,CAAO,EACjB,KACF,CACAA,EAAU,KAAK,UAAU4F,EAAa,CACpC,KAAM5F,CACR,CAAC,CACH,CACF,CACF,CACF,CACF,CACA,OAAIuE,IAAe,cAAce,IAC/BhH,EAAQ,IAAI,OAAI,aAAUA,CAAK,CAAC,GAE3BA,CACT,CACF",
|
|
6
|
+
"names": ["finder_exports", "__export", "Finder", "__toCommonJS", "import_dom_util", "import_matcher", "import_parser", "import_constant", "DIR_NEXT", "DIR_PREV", "#ast", "#astCache", "#descendant", "#document", "#documentCache", "#event", "#invalidate", "#node", "#nodes", "#noexcept", "#qswalker", "#results", "#root", "#shadow", "#walker", "#walkers", "#warn", "#window", "window", "e", "selector", "node", "opt", "event", "noexcept", "warn", "nodes", "ast", "cachedItem", "item", "l", "i", "cssAst", "branches", "hasHasPseudo", "invalidate", "descendant", "items", "branch", "leaves", "nextItem", "msg", "itemName", "walker", "anb", "a", "b", "reverse", "parentNode", "matched", "selectorBranches", "info", "refNode", "selectorNodes", "display", "visibility", "bool", "nth", "j", "localName", "prefix", "itemLocalName", "itemPrefix", "m", "nthName", "nthIdentName", "anbMap", "astLeaves", "leaf", "leafType", "combo", "twigLeaves", "itemType", "twig", "nextNode", "astData", "astName", "twigBranches", "res", "forgive", "lastIndex", "nextNodes", "arr", "astChildren", "selectors", "css", "leavesSet", "stateValue", "href", "origin", "pathname", "attrURL", "target", "type", "buttons", "hash", "id", "current", "focus", "active", "parent", "placeholder", "targetNode", "nodeName", "checked", "form", "inputType", "node1", "node2", "host", "astType", "result", "cacheable", "compound", "filterLeaves", "baseNode", "leafName", "pending", "comboName", "dir", "matchedNode", "filtered", "complex", "targetType", "collected", "pendingItems", "branchLen", "firstTwig", "firstCombo", "firstName", "firstType", "lastTwig", "lastName", "lastType", "pendingItem", "index", "nextCombo", "collectedNodes", "sort", "find", "entryNodes", "entryNodesLen", "n", "entryCombo", "entryLeaves", "entryNode"]
|
|
7
7
|
}
|
package/dist/cjs/js/parser.js
CHANGED
|
@@ -1,3 +1,3 @@
|
|
|
1
|
-
var g=Object.defineProperty;var O=Object.getOwnPropertyDescriptor;var x=Object.getOwnPropertyNames;var T=Object.prototype.hasOwnProperty;var _=(s,t)=>{for(var r in t)g(s,r,{get:t[r],enumerable:!0})}
|
|
2
|
-
`).replace(/[\0\uD800-\uDFFF]|\\$/g,e.U_FFFD)}else if(t==null)t=Object.prototype.toString.call(t).slice(e.TYPE_FROM,e.TYPE_TO).toLowerCase();else if(Array.isArray(t))t=t.join(",");else if(Object.prototype.hasOwnProperty.call(t,"toString"))t=t.toString();else throw new DOMException(`Invalid selector ${t}`,e.SYNTAX_ERR);return t},E=s=>{if(s=u(s),e.REG_INVALID_SELECTOR.test(s))throw new DOMException(`Invalid selector ${s}`,e.SYNTAX_ERR);let t;try{const r=(0,
|
|
1
|
+
var g=Object.defineProperty;var O=Object.getOwnPropertyDescriptor;var x=Object.getOwnPropertyNames;var T=Object.prototype.hasOwnProperty;var _=(s,t)=>{for(var r in t)g(s,r,{get:t[r],enumerable:!0})},m=(s,t,r,o)=>{if(t&&typeof t=="object"||typeof t=="function")for(let n of x(t))!T.call(s,n)&&n!==r&&g(s,n,{get:()=>t[n],enumerable:!(o=O(t,n))||o.enumerable});return s};var $=s=>m(g({},"__esModule",{value:!0}),s);var b={};_(b,{generateCSS:()=>S.generate,parseAstName:()=>L,parseSelector:()=>E,preprocess:()=>u,sortAST:()=>I,unescapeSelector:()=>w,walkAST:()=>y});module.exports=$(b);var h=require("css-tree"),e=require("./constant.js"),S=require("css-tree");const w=(s="")=>{if(typeof s=="string"&&s.indexOf("\\",0)>=0){const t=s.split("\\"),r=t.length;for(let o=1;o<r;o++){let n=t[o];if(n===""&&o===r-1)n=e.U_FFFD;else{const c=e.REG_HEX.exec(n);if(c){const[,f]=c;let a;try{const i=parseInt("D800",e.HEX),p=parseInt("DFFF",e.HEX),d=parseInt(f,e.HEX);d===0||d>=i&&d<=p?a=e.U_FFFD:a=String.fromCodePoint(d)}catch{a=e.U_FFFD}let l="";n.length>f.length&&(l=n.substring(f.length)),n=`${a}${l}`}else/^[\n\r\f]/.test(n)&&(n="\\"+n)}t[o]=n}s=t.join("")}return s},u=(...s)=>{if(!s.length)throw new TypeError("1 argument required, but only 0 present.");let[t]=s;if(typeof t=="string"){let r=0;for(;r>=0&&(r=t.indexOf("#",r),!(r<0));){const o=t.substring(0,r+1);let n=t.substring(r+1);if(/^\d$/.test(n.substring(0,1)))throw new DOMException(`Invalid selector ${t}`,e.SYNTAX_ERR);const c=n.codePointAt(0);if(c===e.BIT_HYPHEN){if(/^\d$/.test(n.substring(1,2)))throw new DOMException(`Invalid selector ${t}`,e.SYNTAX_ERR)}else if(c>e.BIT_FFFF){const f=`\\${c.toString(e.HEX)} `;n.length===e.DUO?n=f:n=`${f}${n.substring(e.DUO)}`}t=`${o}${n}`,r++}t=t.replace(/\f|\r\n?/g,`
|
|
2
|
+
`).replace(/[\0\uD800-\uDFFF]|\\$/g,e.U_FFFD)}else if(t==null)t=Object.prototype.toString.call(t).slice(e.TYPE_FROM,e.TYPE_TO).toLowerCase();else if(Array.isArray(t))t=t.join(",");else if(Object.prototype.hasOwnProperty.call(t,"toString"))t=t.toString();else throw new DOMException(`Invalid selector ${t}`,e.SYNTAX_ERR);return t},E=s=>{if(s=u(s),e.REG_INVALID_SELECTOR.test(s))throw new DOMException(`Invalid selector ${s}`,e.SYNTAX_ERR);let t;try{const r=(0,h.parse)(s,{context:"selectorList",parseCustomProperty:!0});t=(0,h.toPlainObject)(r)}catch(r){const{message:o}=r;if(o==="Identifier is expected"&&e.REG_LANG_QUOTED.test(s)){const[,n,c]=e.REG_LANG_QUOTED.exec(s),f=c.replaceAll("*","\\*").replace(/^"/,"").replace(/"$/,"");let a=n.replace(c,f);a===":lang()"&&(a=`:lang(${e.EMPTY})`),t=E(s.replace(n,a))}else if(/^(?:Identifier|Selector) is expected$/.test(o)&&e.REG_LOGICAL_EMPTY.test(s)){const[,n,c]=e.REG_LOGICAL_EMPTY.exec(s);t=E(s.replace(n,`:${c}(${e.EMPTY})`))}else if(/^(?:"\]"|Attribute selector [()\s,=~^$*|]+) is expected$/.test(o)&&!s.endsWith("]")){const n=s.lastIndexOf("["),c=s.substring(n);c.includes('"')?c.match(/"/g).length%2?t=E(`${s}"]`):t=E(`${s}]`):t=E(`${s}]`)}else if(o==='")" is expected'&&!s.endsWith(")"))t=E(`${s})`);else throw new DOMException(o,e.SYNTAX_ERR)}return t},y=(s={})=>{const t=new Set,r=new Map;return(0,h.walk)(s,{enter:n=>{switch(n.type){case e.SELECTOR:{t.add(n.children);break}case e.SELECTOR_PSEUDO_CLASS:{e.REG_LOGICAL_PSEUDO.test(n.name)&&(r.set("hasNestedSelector",!0),r.set("hasLogicalPseudoFunc",!0),n.name==="has"&&r.set("hasHasPseudoFunc",!0));break}case e.SELECTOR_PSEUDO_ELEMENT:{e.REG_SHADOW_PSEUDO.test(n.name)&&r.set("hasNestedSelector",!0);break}case e.NTH:{n.selector&&r.set("hasNestedSelector",!0);break}default:}}}),r.get("hasNestedSelector")&&(0,h.findAll)(s,(n,c,f)=>{if(f){if(n.type===e.SELECTOR_PSEUDO_CLASS&&e.REG_LOGICAL_PSEUDO.test(n.name)){const a=f.filter(l=>{const{name:i,type:p}=l;return p===e.SELECTOR_PSEUDO_CLASS&&e.REG_LOGICAL_PSEUDO.test(i)});for(const{children:l}of a)for(const{children:i}of l)for(const{children:p}of i)t.has(p)&&t.delete(p)}else if(n.type===e.SELECTOR_PSEUDO_ELEMENT&&e.REG_SHADOW_PSEUDO.test(n.name)){const a=f.filter(l=>{const{name:i,type:p}=l;return p===e.SELECTOR_PSEUDO_ELEMENT&&e.REG_SHADOW_PSEUDO.test(i)});for(const{children:l}of a)for(const{children:i}of l)t.has(i)&&t.delete(i)}else if(n.type===e.NTH&&n.selector){const a=f.filter(l=>{const{selector:i,type:p}=l;return p===e.NTH&&i});for(const{selector:l}of a){const{children:i}=l;for(const{children:p}of i)t.has(p)&&t.delete(p)}}}}),{branches:[...t],info:Object.fromEntries(r)}},I=s=>{const t=[...s];if(t.length>1){const r=new Map([[e.SELECTOR_PSEUDO_ELEMENT,e.BIT_01],[e.SELECTOR_ID,e.BIT_02],[e.SELECTOR_CLASS,e.BIT_04],[e.SELECTOR_TYPE,e.BIT_08],[e.SELECTOR_ATTR,e.BIT_16],[e.SELECTOR_PSEUDO_CLASS,e.BIT_32]]);t.sort((o,n)=>{const{type:c}=o,{type:f}=n,a=r.get(c),l=r.get(f);let i;return a===l?i=0:a>l?i=1:i=-1,i})}return t},L=s=>{let t,r;if(s&&typeof s=="string")s.indexOf("|")>-1?[t,r]=s.split("|"):(t="*",r=s);else throw new DOMException(`Invalid selector ${s}`,e.SYNTAX_ERR);return{prefix:t,localName:r}};0&&(module.exports={generateCSS,parseAstName,parseSelector,preprocess,sortAST,unescapeSelector,walkAST});
|
|
3
3
|
//# sourceMappingURL=parser.js.map
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"version": 3,
|
|
3
3
|
"sources": ["../../../src/js/parser.js"],
|
|
4
|
-
"sourcesContent": ["/**\n * parser.js\n */\n\n/* import */\nimport { findAll, parse, toPlainObject, walk } from 'css-tree';\n\n/* constants */\nimport {\n BIT_01, BIT_02, BIT_04, BIT_08, BIT_16, BIT_32, BIT_FFFF, BIT_HYPHEN,\n DUO, EMPTY, HEX, NTH, REG_HEX, REG_INVALID_SELECTOR, REG_LANG_QUOTED,\n REG_LOGICAL_EMPTY, REG_LOGICAL_PSEUDO, REG_SHADOW_PSEUDO, SELECTOR,\n SELECTOR_ATTR, SELECTOR_CLASS, SELECTOR_ID, SELECTOR_PSEUDO_CLASS,\n SELECTOR_PSEUDO_ELEMENT, SELECTOR_TYPE, SYNTAX_ERR, TYPE_FROM, TYPE_TO, U_FFFD\n} from './constant.js';\n\n/**\n * unescape selector\n * @param {string} selector - CSS selector\n * @returns {?string} - unescaped selector\n */\nexport const unescapeSelector = (selector = '') => {\n if (typeof selector === 'string' && selector.indexOf('\\\\', 0) >= 0) {\n const arr = selector.split('\\\\');\n const l = arr.length;\n for (let i = 1; i < l; i++) {\n let item = arr[i];\n if (item === '' && i === l - 1) {\n item = U_FFFD;\n } else {\n const hexExists = REG_HEX.exec(item);\n if (hexExists) {\n const [, hex] = hexExists;\n let str;\n try {\n const low = parseInt('D800', HEX);\n const high = parseInt('DFFF', HEX);\n const deci = parseInt(hex, HEX);\n if (deci === 0 || (deci >= low && deci <= high)) {\n str = U_FFFD;\n } else {\n str = String.fromCodePoint(deci);\n }\n } catch (e) {\n str = U_FFFD;\n }\n let postStr = '';\n if (item.length > hex.length) {\n postStr = item.substring(hex.length);\n }\n item = `${str}${postStr}`;\n // whitespace\n } else if (/^[\\n\\r\\f]/.test(item)) {\n item = '\\\\' + item;\n }\n }\n arr[i] = item;\n }\n selector = arr.join('');\n }\n return selector;\n};\n\n/**\n * preprocess\n * @see https://drafts.csswg.org/css-syntax-3/#input-preprocessing\n * @param {...*} args - arguments\n * @returns {string} - filtered selector string\n */\nexport const preprocess = (...args) => {\n if (!args.length) {\n throw new TypeError('1 argument required, but only 0 present.');\n }\n let [selector] = args;\n if (typeof selector === 'string') {\n let index = 0;\n while (index >= 0) {\n index = selector.indexOf('#', index);\n if (index < 0) {\n break;\n }\n const preHash = selector.substring(0, index + 1);\n let postHash = selector.substring(index + 1);\n // @see https://drafts.csswg.org/selectors/#id-selectors\n // @see https://drafts.csswg.org/css-syntax-3/#ident-token-diagram\n if (/^\\d$/.test(postHash.substring(0, 1))) {\n throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n }\n const codePoint = postHash.codePointAt(0);\n if (codePoint === BIT_HYPHEN) {\n if (/^\\d$/.test(postHash.substring(1, 2))) {\n throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n }\n // escape char above 0xFFFF\n } else if (codePoint > BIT_FFFF) {\n const str = `\\\\${codePoint.toString(HEX)} `;\n if (postHash.length === DUO) {\n postHash = str;\n } else {\n postHash = `${str}${postHash.substring(DUO)}`;\n }\n }\n selector = `${preHash}${postHash}`;\n index++;\n }\n selector = selector.replace(/\\f|\\r\\n?/g, '\\n')\n .replace(/[\\0\\uD800-\\uDFFF]|\\\\$/g, U_FFFD);\n } else if (selector === undefined || selector === null) {\n selector = Object.prototype.toString.call(selector)\n .slice(TYPE_FROM, TYPE_TO).toLowerCase();\n } else if (Array.isArray(selector)) {\n selector = selector.join(',');\n } else if (Object.prototype.hasOwnProperty.call(selector, 'toString')) {\n selector = selector.toString();\n } else {\n throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n }\n return selector;\n};\n\n/**\n * create AST from CSS selector\n * @param {string} selector - CSS selector\n * @returns {object} - AST\n */\nexport const parseSelector = selector => {\n selector = preprocess(selector);\n // invalid selectors\n if (REG_INVALID_SELECTOR.test(selector)) {\n throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n }\n let res;\n try {\n const ast = parse(selector, {\n context: 'selectorList',\n parseCustomProperty: true\n });\n res = toPlainObject(ast);\n } catch (e) {\n const { message } = e;\n // workaround for https://github.com/csstree/csstree/issues/265\n if (message === 'Identifier is expected' &&\n REG_LANG_QUOTED.test(selector)) {\n const [, lang, range] = REG_LANG_QUOTED.exec(selector);\n const escapedRange =\n range.replaceAll('*', '\\\\*').replace(/^\"/, '').replace(/\"$/, '');\n let escapedLang = lang.replace(range, escapedRange);\n if (escapedLang === ':lang()') {\n escapedLang = `:lang(${EMPTY})`;\n }\n res = parseSelector(selector.replace(lang, escapedLang));\n } else if (/^(?:Identifier|Selector) is expected$/.test(message) &&\n REG_LOGICAL_EMPTY.test(selector)) {\n const [, sel, name] = REG_LOGICAL_EMPTY.exec(selector);\n res = parseSelector(selector.replace(sel, `:${name}(${EMPTY})`));\n } else if (/^(?:\"\\]\"|Attribute selector [()\\s,=~^$*|]+) is expected$/.test(message) &&\n !selector.endsWith(']')) {\n const index = selector.lastIndexOf('[');\n const sel = selector.substring(index);\n if (sel.includes('\"')) {\n const quotes = sel.match(/\"/g).length;\n if (quotes % 2) {\n res = parseSelector(`${selector}\"]`);\n } else {\n res = parseSelector(`${selector}]`);\n }\n } else {\n res = parseSelector(`${selector}]`);\n }\n } else if (message === '\")\" is expected' && !selector.endsWith(')')) {\n res = parseSelector(`${selector})`);\n } else {\n throw new DOMException(message, SYNTAX_ERR);\n }\n }\n return res;\n};\n\n/**\n * walk AST\n * @param {object} ast - AST\n * @returns {Array.<object|undefined>} - collection of AST branches\n */\nexport const walkAST = (ast = {}) => {\n const branches = new Set();\n const info = new Map();\n const opt = {\n enter: node => {\n switch (node.type) {\n case SELECTOR: {\n branches.add(node.children);\n break;\n }\n case SELECTOR_PSEUDO_CLASS: {\n if (REG_LOGICAL_PSEUDO.test(node.name)) {\n info.set('hasNestedSelector', true);\n info.set('hasLogicalPseudoFunc', true);\n }\n break;\n }\n case SELECTOR_PSEUDO_ELEMENT: {\n if (REG_SHADOW_PSEUDO.test(node.name)) {\n info.set('hasNestedSelector', true);\n }\n break;\n }\n case NTH: {\n if (node.selector) {\n info.set('hasNestedSelector', true);\n }\n break;\n }\n default:\n }\n }\n };\n walk(ast, opt);\n if (info.get('hasNestedSelector')) {\n findAll(ast, (node, item, list) => {\n if (list) {\n if (node.type === SELECTOR_PSEUDO_CLASS &&\n REG_LOGICAL_PSEUDO.test(node.name)) {\n const itemList = list.filter(i => {\n const { name, type } = i;\n const res =\n type === SELECTOR_PSEUDO_CLASS && REG_LOGICAL_PSEUDO.test(name);\n return res;\n });\n for (const { children } of itemList) {\n // SelectorList\n for (const { children: grandChildren } of children) {\n // Selector\n for (const { children: greatGrandChildren } of grandChildren) {\n if (branches.has(greatGrandChildren)) {\n branches.delete(greatGrandChildren);\n }\n }\n }\n }\n } else if (node.type === SELECTOR_PSEUDO_ELEMENT &&\n REG_SHADOW_PSEUDO.test(node.name)) {\n const itemList = list.filter(i => {\n const { name, type } = i;\n const res =\n type === SELECTOR_PSEUDO_ELEMENT && REG_SHADOW_PSEUDO.test(name);\n return res;\n });\n for (const { children } of itemList) {\n // Selector\n for (const { children: grandChildren } of children) {\n if (branches.has(grandChildren)) {\n branches.delete(grandChildren);\n }\n }\n }\n } else if (node.type === NTH && node.selector) {\n const itemList = list.filter(i => {\n const { selector, type } = i;\n const res = type === NTH && selector;\n return res;\n });\n for (const { selector } of itemList) {\n const { children } = selector;\n // Selector\n for (const { children: grandChildren } of children) {\n if (branches.has(grandChildren)) {\n branches.delete(grandChildren);\n }\n }\n }\n }\n }\n });\n }\n return {\n branches: [...branches],\n info: Object.fromEntries(info)\n };\n};\n\n/**\n * sort AST\n * @param {Array.<object>} asts - collection of AST\n * @returns {Array.<object>} - collection of sorted AST\n */\nexport const sortAST = asts => {\n const arr = [...asts];\n if (arr.length > 1) {\n const order = new Map([\n [SELECTOR_PSEUDO_ELEMENT, BIT_01],\n [SELECTOR_ID, BIT_02],\n [SELECTOR_CLASS, BIT_04],\n [SELECTOR_TYPE, BIT_08],\n [SELECTOR_ATTR, BIT_16],\n [SELECTOR_PSEUDO_CLASS, BIT_32]\n ]);\n arr.sort((a, b) => {\n const { type: typeA } = a;\n const { type: typeB } = b;\n const bitA = order.get(typeA);\n const bitB = order.get(typeB);\n let res;\n if (bitA === bitB) {\n res = 0;\n } else if (bitA > bitB) {\n res = 1;\n } else {\n res = -1;\n }\n return res;\n });\n }\n return arr;\n};\n\n/**\n * parse AST name - e.g. ns|E -> { prefix: ns, localName: E }\n * @param {string} selector - type selector\n * @returns {object} - node properties\n */\nexport const parseAstName = selector => {\n let prefix;\n let localName;\n if (selector && typeof selector === 'string') {\n if (selector.indexOf('|') > -1) {\n [prefix, localName] = selector.split('|');\n } else {\n prefix = '*';\n localName = selector;\n }\n } else {\n throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n }\n return {\n prefix,\n localName\n };\n};\n\n/* export */\nexport { generate as generateCSS } from 'css-tree';\n"],
|
|
5
|
-
"mappings": "4ZAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,6CAAAE,EAAA,kBAAAC,EAAA,eAAAC,EAAA,YAAAC,EAAA,qBAAAC,EAAA,YAAAC,IAAA,eAAAC,EAAAR,GAKA,IAAAS,EAAoD,oBAGpDC,EAMO,
|
|
4
|
+
"sourcesContent": ["/**\n * parser.js\n */\n\n/* import */\nimport { findAll, parse, toPlainObject, walk } from 'css-tree';\n\n/* constants */\nimport {\n BIT_01, BIT_02, BIT_04, BIT_08, BIT_16, BIT_32, BIT_FFFF, BIT_HYPHEN,\n DUO, EMPTY, HEX, NTH, REG_HEX, REG_INVALID_SELECTOR, REG_LANG_QUOTED,\n REG_LOGICAL_EMPTY, REG_LOGICAL_PSEUDO, REG_SHADOW_PSEUDO, SELECTOR,\n SELECTOR_ATTR, SELECTOR_CLASS, SELECTOR_ID, SELECTOR_PSEUDO_CLASS,\n SELECTOR_PSEUDO_ELEMENT, SELECTOR_TYPE, SYNTAX_ERR, TYPE_FROM, TYPE_TO, U_FFFD\n} from './constant.js';\n\n/**\n * unescape selector\n * @param {string} selector - CSS selector\n * @returns {?string} - unescaped selector\n */\nexport const unescapeSelector = (selector = '') => {\n if (typeof selector === 'string' && selector.indexOf('\\\\', 0) >= 0) {\n const arr = selector.split('\\\\');\n const l = arr.length;\n for (let i = 1; i < l; i++) {\n let item = arr[i];\n if (item === '' && i === l - 1) {\n item = U_FFFD;\n } else {\n const hexExists = REG_HEX.exec(item);\n if (hexExists) {\n const [, hex] = hexExists;\n let str;\n try {\n const low = parseInt('D800', HEX);\n const high = parseInt('DFFF', HEX);\n const deci = parseInt(hex, HEX);\n if (deci === 0 || (deci >= low && deci <= high)) {\n str = U_FFFD;\n } else {\n str = String.fromCodePoint(deci);\n }\n } catch (e) {\n str = U_FFFD;\n }\n let postStr = '';\n if (item.length > hex.length) {\n postStr = item.substring(hex.length);\n }\n item = `${str}${postStr}`;\n // whitespace\n } else if (/^[\\n\\r\\f]/.test(item)) {\n item = '\\\\' + item;\n }\n }\n arr[i] = item;\n }\n selector = arr.join('');\n }\n return selector;\n};\n\n/**\n * preprocess\n * @see https://drafts.csswg.org/css-syntax-3/#input-preprocessing\n * @param {...*} args - arguments\n * @returns {string} - filtered selector string\n */\nexport const preprocess = (...args) => {\n if (!args.length) {\n throw new TypeError('1 argument required, but only 0 present.');\n }\n let [selector] = args;\n if (typeof selector === 'string') {\n let index = 0;\n while (index >= 0) {\n index = selector.indexOf('#', index);\n if (index < 0) {\n break;\n }\n const preHash = selector.substring(0, index + 1);\n let postHash = selector.substring(index + 1);\n // @see https://drafts.csswg.org/selectors/#id-selectors\n // @see https://drafts.csswg.org/css-syntax-3/#ident-token-diagram\n if (/^\\d$/.test(postHash.substring(0, 1))) {\n throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n }\n const codePoint = postHash.codePointAt(0);\n if (codePoint === BIT_HYPHEN) {\n if (/^\\d$/.test(postHash.substring(1, 2))) {\n throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n }\n // escape char above 0xFFFF\n } else if (codePoint > BIT_FFFF) {\n const str = `\\\\${codePoint.toString(HEX)} `;\n if (postHash.length === DUO) {\n postHash = str;\n } else {\n postHash = `${str}${postHash.substring(DUO)}`;\n }\n }\n selector = `${preHash}${postHash}`;\n index++;\n }\n selector = selector.replace(/\\f|\\r\\n?/g, '\\n')\n .replace(/[\\0\\uD800-\\uDFFF]|\\\\$/g, U_FFFD);\n } else if (selector === undefined || selector === null) {\n selector = Object.prototype.toString.call(selector)\n .slice(TYPE_FROM, TYPE_TO).toLowerCase();\n } else if (Array.isArray(selector)) {\n selector = selector.join(',');\n } else if (Object.prototype.hasOwnProperty.call(selector, 'toString')) {\n selector = selector.toString();\n } else {\n throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n }\n return selector;\n};\n\n/**\n * create AST from CSS selector\n * @param {string} selector - CSS selector\n * @returns {object} - AST\n */\nexport const parseSelector = selector => {\n selector = preprocess(selector);\n // invalid selectors\n if (REG_INVALID_SELECTOR.test(selector)) {\n throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n }\n let res;\n try {\n const ast = parse(selector, {\n context: 'selectorList',\n parseCustomProperty: true\n });\n res = toPlainObject(ast);\n } catch (e) {\n const { message } = e;\n // workaround for https://github.com/csstree/csstree/issues/265\n if (message === 'Identifier is expected' &&\n REG_LANG_QUOTED.test(selector)) {\n const [, lang, range] = REG_LANG_QUOTED.exec(selector);\n const escapedRange =\n range.replaceAll('*', '\\\\*').replace(/^\"/, '').replace(/\"$/, '');\n let escapedLang = lang.replace(range, escapedRange);\n if (escapedLang === ':lang()') {\n escapedLang = `:lang(${EMPTY})`;\n }\n res = parseSelector(selector.replace(lang, escapedLang));\n } else if (/^(?:Identifier|Selector) is expected$/.test(message) &&\n REG_LOGICAL_EMPTY.test(selector)) {\n const [, sel, name] = REG_LOGICAL_EMPTY.exec(selector);\n res = parseSelector(selector.replace(sel, `:${name}(${EMPTY})`));\n } else if (/^(?:\"\\]\"|Attribute selector [()\\s,=~^$*|]+) is expected$/.test(message) &&\n !selector.endsWith(']')) {\n const index = selector.lastIndexOf('[');\n const sel = selector.substring(index);\n if (sel.includes('\"')) {\n const quotes = sel.match(/\"/g).length;\n if (quotes % 2) {\n res = parseSelector(`${selector}\"]`);\n } else {\n res = parseSelector(`${selector}]`);\n }\n } else {\n res = parseSelector(`${selector}]`);\n }\n } else if (message === '\")\" is expected' && !selector.endsWith(')')) {\n res = parseSelector(`${selector})`);\n } else {\n throw new DOMException(message, SYNTAX_ERR);\n }\n }\n return res;\n};\n\n/**\n * walk AST\n * @param {object} ast - AST\n * @returns {Array.<object|undefined>} - collection of AST branches\n */\nexport const walkAST = (ast = {}) => {\n const branches = new Set();\n const info = new Map();\n const opt = {\n enter: node => {\n switch (node.type) {\n case SELECTOR: {\n branches.add(node.children);\n break;\n }\n case SELECTOR_PSEUDO_CLASS: {\n if (REG_LOGICAL_PSEUDO.test(node.name)) {\n info.set('hasNestedSelector', true);\n info.set('hasLogicalPseudoFunc', true);\n if (node.name === 'has') {\n info.set('hasHasPseudoFunc', true);\n }\n }\n break;\n }\n case SELECTOR_PSEUDO_ELEMENT: {\n if (REG_SHADOW_PSEUDO.test(node.name)) {\n info.set('hasNestedSelector', true);\n }\n break;\n }\n case NTH: {\n if (node.selector) {\n info.set('hasNestedSelector', true);\n }\n break;\n }\n default:\n }\n }\n };\n walk(ast, opt);\n if (info.get('hasNestedSelector')) {\n findAll(ast, (node, item, list) => {\n if (list) {\n if (node.type === SELECTOR_PSEUDO_CLASS &&\n REG_LOGICAL_PSEUDO.test(node.name)) {\n const itemList = list.filter(i => {\n const { name, type } = i;\n const res =\n type === SELECTOR_PSEUDO_CLASS && REG_LOGICAL_PSEUDO.test(name);\n return res;\n });\n for (const { children } of itemList) {\n // SelectorList\n for (const { children: grandChildren } of children) {\n // Selector\n for (const { children: greatGrandChildren } of grandChildren) {\n if (branches.has(greatGrandChildren)) {\n branches.delete(greatGrandChildren);\n }\n }\n }\n }\n } else if (node.type === SELECTOR_PSEUDO_ELEMENT &&\n REG_SHADOW_PSEUDO.test(node.name)) {\n const itemList = list.filter(i => {\n const { name, type } = i;\n const res =\n type === SELECTOR_PSEUDO_ELEMENT && REG_SHADOW_PSEUDO.test(name);\n return res;\n });\n for (const { children } of itemList) {\n // Selector\n for (const { children: grandChildren } of children) {\n if (branches.has(grandChildren)) {\n branches.delete(grandChildren);\n }\n }\n }\n } else if (node.type === NTH && node.selector) {\n const itemList = list.filter(i => {\n const { selector, type } = i;\n const res = type === NTH && selector;\n return res;\n });\n for (const { selector } of itemList) {\n const { children } = selector;\n // Selector\n for (const { children: grandChildren } of children) {\n if (branches.has(grandChildren)) {\n branches.delete(grandChildren);\n }\n }\n }\n }\n }\n });\n }\n return {\n branches: [...branches],\n info: Object.fromEntries(info)\n };\n};\n\n/**\n * sort AST\n * @param {Array.<object>} asts - collection of AST\n * @returns {Array.<object>} - collection of sorted AST\n */\nexport const sortAST = asts => {\n const arr = [...asts];\n if (arr.length > 1) {\n const order = new Map([\n [SELECTOR_PSEUDO_ELEMENT, BIT_01],\n [SELECTOR_ID, BIT_02],\n [SELECTOR_CLASS, BIT_04],\n [SELECTOR_TYPE, BIT_08],\n [SELECTOR_ATTR, BIT_16],\n [SELECTOR_PSEUDO_CLASS, BIT_32]\n ]);\n arr.sort((a, b) => {\n const { type: typeA } = a;\n const { type: typeB } = b;\n const bitA = order.get(typeA);\n const bitB = order.get(typeB);\n let res;\n if (bitA === bitB) {\n res = 0;\n } else if (bitA > bitB) {\n res = 1;\n } else {\n res = -1;\n }\n return res;\n });\n }\n return arr;\n};\n\n/**\n * parse AST name - e.g. ns|E -> { prefix: ns, localName: E }\n * @param {string} selector - type selector\n * @returns {object} - node properties\n */\nexport const parseAstName = selector => {\n let prefix;\n let localName;\n if (selector && typeof selector === 'string') {\n if (selector.indexOf('|') > -1) {\n [prefix, localName] = selector.split('|');\n } else {\n prefix = '*';\n localName = selector;\n }\n } else {\n throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n }\n return {\n prefix,\n localName\n };\n};\n\n/* export */\nexport { generate as generateCSS } from 'css-tree';\n"],
|
|
5
|
+
"mappings": "4ZAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,6CAAAE,EAAA,kBAAAC,EAAA,eAAAC,EAAA,YAAAC,EAAA,qBAAAC,EAAA,YAAAC,IAAA,eAAAC,EAAAR,GAKA,IAAAS,EAAoD,oBAGpDC,EAMO,yBAyUPD,EAAwC,oBAlUjC,MAAMH,EAAmB,CAACK,EAAW,KAAO,CACjD,GAAI,OAAOA,GAAa,UAAYA,EAAS,QAAQ,KAAM,CAAC,GAAK,EAAG,CAClE,MAAMC,EAAMD,EAAS,MAAM,IAAI,EACzBE,EAAID,EAAI,OACd,QAASE,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,IAAIC,EAAOH,EAAIE,CAAC,EAChB,GAAIC,IAAS,IAAMD,IAAMD,EAAI,EAC3BE,EAAO,aACF,CACL,MAAMC,EAAY,UAAQ,KAAKD,CAAI,EACnC,GAAIC,EAAW,CACb,KAAM,CAAC,CAAEC,CAAG,EAAID,EAChB,IAAIE,EACJ,GAAI,CACF,MAAMC,EAAM,SAAS,OAAQ,KAAG,EAC1BC,EAAO,SAAS,OAAQ,KAAG,EAC3BC,EAAO,SAASJ,EAAK,KAAG,EAC1BI,IAAS,GAAMA,GAAQF,GAAOE,GAAQD,EACxCF,EAAM,SAENA,EAAM,OAAO,cAAcG,CAAI,CAEnC,MAAY,CACVH,EAAM,QACR,CACA,IAAII,EAAU,GACVP,EAAK,OAASE,EAAI,SACpBK,EAAUP,EAAK,UAAUE,EAAI,MAAM,GAErCF,EAAO,GAAGG,CAAG,GAAGI,CAAO,EAEzB,KAAW,YAAY,KAAKP,CAAI,IAC9BA,EAAO,KAAOA,EAElB,CACAH,EAAIE,CAAC,EAAIC,CACX,CACAJ,EAAWC,EAAI,KAAK,EAAE,CACxB,CACA,OAAOD,CACT,EAQaP,EAAa,IAAImB,IAAS,CACrC,GAAI,CAACA,EAAK,OACR,MAAM,IAAI,UAAU,0CAA0C,EAEhE,GAAI,CAACZ,CAAQ,EAAIY,EACjB,GAAI,OAAOZ,GAAa,SAAU,CAChC,IAAIa,EAAQ,EACZ,KAAOA,GAAS,IACdA,EAAQb,EAAS,QAAQ,IAAKa,CAAK,EAC/B,EAAAA,EAAQ,KAFK,CAKjB,MAAMC,EAAUd,EAAS,UAAU,EAAGa,EAAQ,CAAC,EAC/C,IAAIE,EAAWf,EAAS,UAAUa,EAAQ,CAAC,EAG3C,GAAI,OAAO,KAAKE,EAAS,UAAU,EAAG,CAAC,CAAC,EACtC,MAAM,IAAI,aAAa,oBAAoBf,CAAQ,GAAI,YAAU,EAEnE,MAAMgB,EAAYD,EAAS,YAAY,CAAC,EACxC,GAAIC,IAAc,cAChB,GAAI,OAAO,KAAKD,EAAS,UAAU,EAAG,CAAC,CAAC,EACtC,MAAM,IAAI,aAAa,oBAAoBf,CAAQ,GAAI,YAAU,UAG1DgB,EAAY,WAAU,CAC/B,MAAMT,EAAM,KAAKS,EAAU,SAAS,KAAG,CAAC,IACpCD,EAAS,SAAW,MACtBA,EAAWR,EAEXQ,EAAW,GAAGR,CAAG,GAAGQ,EAAS,UAAU,KAAG,CAAC,EAE/C,CACAf,EAAW,GAAGc,CAAO,GAAGC,CAAQ,GAChCF,GACF,CACAb,EAAWA,EAAS,QAAQ,YAAa;AAAA,CAAI,EAC1C,QAAQ,yBAA0B,QAAM,CAC7C,SAAqCA,GAAa,KAChDA,EAAW,OAAO,UAAU,SAAS,KAAKA,CAAQ,EAC/C,MAAM,YAAW,SAAO,EAAE,YAAY,UAChC,MAAM,QAAQA,CAAQ,EAC/BA,EAAWA,EAAS,KAAK,GAAG,UACnB,OAAO,UAAU,eAAe,KAAKA,EAAU,UAAU,EAClEA,EAAWA,EAAS,SAAS,MAE7B,OAAM,IAAI,aAAa,oBAAoBA,CAAQ,GAAI,YAAU,EAEnE,OAAOA,CACT,EAOaR,EAAgBQ,GAAY,CAGvC,GAFAA,EAAWP,EAAWO,CAAQ,EAE1B,uBAAqB,KAAKA,CAAQ,EACpC,MAAM,IAAI,aAAa,oBAAoBA,CAAQ,GAAI,YAAU,EAEnE,IAAIiB,EACJ,GAAI,CACF,MAAMC,KAAM,SAAMlB,EAAU,CAC1B,QAAS,eACT,oBAAqB,EACvB,CAAC,EACDiB,KAAM,iBAAcC,CAAG,CACzB,OAASC,EAAG,CACV,KAAM,CAAE,QAAAC,CAAQ,EAAID,EAEpB,GAAIC,IAAY,0BACZ,kBAAgB,KAAKpB,CAAQ,EAAG,CAClC,KAAM,CAAC,CAAEqB,EAAMC,CAAK,EAAI,kBAAgB,KAAKtB,CAAQ,EAC/CuB,EACJD,EAAM,WAAW,IAAK,KAAK,EAAE,QAAQ,KAAM,EAAE,EAAE,QAAQ,KAAM,EAAE,EACjE,IAAIE,EAAcH,EAAK,QAAQC,EAAOC,CAAY,EAC9CC,IAAgB,YAClBA,EAAc,SAAS,OAAK,KAE9BP,EAAMzB,EAAcQ,EAAS,QAAQqB,EAAMG,CAAW,CAAC,CACzD,SAAW,wCAAwC,KAAKJ,CAAO,GACpD,oBAAkB,KAAKpB,CAAQ,EAAG,CAC3C,KAAM,CAAC,CAAEyB,EAAKC,CAAI,EAAI,oBAAkB,KAAK1B,CAAQ,EACrDiB,EAAMzB,EAAcQ,EAAS,QAAQyB,EAAK,IAAIC,CAAI,IAAI,OAAK,GAAG,CAAC,CACjE,SAAW,2DAA2D,KAAKN,CAAO,GACvE,CAACpB,EAAS,SAAS,GAAG,EAAG,CAClC,MAAMa,EAAQb,EAAS,YAAY,GAAG,EAChCyB,EAAMzB,EAAS,UAAUa,CAAK,EAChCY,EAAI,SAAS,GAAG,EACHA,EAAI,MAAM,IAAI,EAAE,OAClB,EACXR,EAAMzB,EAAc,GAAGQ,CAAQ,IAAI,EAEnCiB,EAAMzB,EAAc,GAAGQ,CAAQ,GAAG,EAGpCiB,EAAMzB,EAAc,GAAGQ,CAAQ,GAAG,CAEtC,SAAWoB,IAAY,mBAAqB,CAACpB,EAAS,SAAS,GAAG,EAChEiB,EAAMzB,EAAc,GAAGQ,CAAQ,GAAG,MAElC,OAAM,IAAI,aAAaoB,EAAS,YAAU,CAE9C,CACA,OAAOH,CACT,EAOarB,EAAU,CAACsB,EAAM,CAAC,IAAM,CACnC,MAAMS,EAAW,IAAI,IACfC,EAAO,IAAI,IAkCjB,iBAAKV,EAjCO,CACV,MAAOW,GAAQ,CACb,OAAQA,EAAK,KAAM,CACjB,KAAK,WAAU,CACbF,EAAS,IAAIE,EAAK,QAAQ,EAC1B,KACF,CACA,KAAK,wBAAuB,CACtB,qBAAmB,KAAKA,EAAK,IAAI,IACnCD,EAAK,IAAI,oBAAqB,EAAI,EAClCA,EAAK,IAAI,uBAAwB,EAAI,EACjCC,EAAK,OAAS,OAChBD,EAAK,IAAI,mBAAoB,EAAI,GAGrC,KACF,CACA,KAAK,0BAAyB,CACxB,oBAAkB,KAAKC,EAAK,IAAI,GAClCD,EAAK,IAAI,oBAAqB,EAAI,EAEpC,KACF,CACA,KAAK,MAAK,CACJC,EAAK,UACPD,EAAK,IAAI,oBAAqB,EAAI,EAEpC,KACF,CACA,QACF,CACF,CACF,CACa,EACTA,EAAK,IAAI,mBAAmB,MAC9B,WAAQV,EAAK,CAACW,EAAMzB,EAAM0B,IAAS,CACjC,GAAIA,GACF,GAAID,EAAK,OAAS,yBACd,qBAAmB,KAAKA,EAAK,IAAI,EAAG,CACtC,MAAME,EAAWD,EAAK,OAAO3B,GAAK,CAChC,KAAM,CAAE,KAAAuB,EAAM,KAAAM,CAAK,EAAI7B,EAGvB,OADE6B,IAAS,yBAAyB,qBAAmB,KAAKN,CAAI,CAElE,CAAC,EACD,SAAW,CAAE,SAAAO,CAAS,IAAKF,EAEzB,SAAW,CAAE,SAAUG,CAAc,IAAKD,EAExC,SAAW,CAAE,SAAUE,CAAmB,IAAKD,EACzCP,EAAS,IAAIQ,CAAkB,GACjCR,EAAS,OAAOQ,CAAkB,CAK5C,SAAWN,EAAK,OAAS,2BACd,oBAAkB,KAAKA,EAAK,IAAI,EAAG,CAC5C,MAAME,EAAWD,EAAK,OAAO3B,GAAK,CAChC,KAAM,CAAE,KAAAuB,EAAM,KAAAM,CAAK,EAAI7B,EAGvB,OADE6B,IAAS,2BAA2B,oBAAkB,KAAKN,CAAI,CAEnE,CAAC,EACD,SAAW,CAAE,SAAAO,CAAS,IAAKF,EAEzB,SAAW,CAAE,SAAUG,CAAc,IAAKD,EACpCN,EAAS,IAAIO,CAAa,GAC5BP,EAAS,OAAOO,CAAa,CAIrC,SAAWL,EAAK,OAAS,OAAOA,EAAK,SAAU,CAC7C,MAAME,EAAWD,EAAK,OAAO3B,GAAK,CAChC,KAAM,CAAE,SAAAH,EAAU,KAAAgC,CAAK,EAAI7B,EAE3B,OADY6B,IAAS,OAAOhC,CAE9B,CAAC,EACD,SAAW,CAAE,SAAAA,CAAS,IAAK+B,EAAU,CACnC,KAAM,CAAE,SAAAE,CAAS,EAAIjC,EAErB,SAAW,CAAE,SAAUkC,CAAc,IAAKD,EACpCN,EAAS,IAAIO,CAAa,GAC5BP,EAAS,OAAOO,CAAa,CAGnC,CACF,EAEJ,CAAC,EAEI,CACL,SAAU,CAAC,GAAGP,CAAQ,EACtB,KAAM,OAAO,YAAYC,CAAI,CAC/B,CACF,EAOalC,EAAU0C,GAAQ,CAC7B,MAAMnC,EAAM,CAAC,GAAGmC,CAAI,EACpB,GAAInC,EAAI,OAAS,EAAG,CAClB,MAAMoC,EAAQ,IAAI,IAAI,CACpB,CAAC,0BAAyB,QAAM,EAChC,CAAC,cAAa,QAAM,EACpB,CAAC,iBAAgB,QAAM,EACvB,CAAC,gBAAe,QAAM,EACtB,CAAC,gBAAe,QAAM,EACtB,CAAC,wBAAuB,QAAM,CAChC,CAAC,EACDpC,EAAI,KAAK,CAACqC,EAAGC,IAAM,CACjB,KAAM,CAAE,KAAMC,CAAM,EAAIF,EAClB,CAAE,KAAMG,CAAM,EAAIF,EAClBG,EAAOL,EAAM,IAAIG,CAAK,EACtBG,EAAON,EAAM,IAAII,CAAK,EAC5B,IAAIxB,EACJ,OAAIyB,IAASC,EACX1B,EAAM,EACGyB,EAAOC,EAChB1B,EAAM,EAENA,EAAM,GAEDA,CACT,CAAC,CACH,CACA,OAAOhB,CACT,EAOaV,EAAeS,GAAY,CACtC,IAAI4C,EACAC,EACJ,GAAI7C,GAAY,OAAOA,GAAa,SAC9BA,EAAS,QAAQ,GAAG,EAAI,GAC1B,CAAC4C,EAAQC,CAAS,EAAI7C,EAAS,MAAM,GAAG,GAExC4C,EAAS,IACTC,EAAY7C,OAGd,OAAM,IAAI,aAAa,oBAAoBA,CAAQ,GAAI,YAAU,EAEnE,MAAO,CACL,OAAA4C,EACA,UAAAC,CACF,CACF",
|
|
6
6
|
"names": ["parser_exports", "__export", "parseAstName", "parseSelector", "preprocess", "sortAST", "unescapeSelector", "walkAST", "__toCommonJS", "import_css_tree", "import_constant", "selector", "arr", "l", "i", "item", "hexExists", "hex", "str", "low", "high", "deci", "postStr", "args", "index", "preHash", "postHash", "codePoint", "res", "ast", "e", "message", "lang", "range", "escapedRange", "escapedLang", "sel", "name", "branches", "info", "node", "list", "itemList", "type", "children", "grandChildren", "greatGrandChildren", "asts", "order", "a", "b", "typeA", "typeB", "bitA", "bitB", "prefix", "localName"]
|
|
7
7
|
}
|
package/package.json
CHANGED
package/src/js/finder.js
CHANGED
|
@@ -161,6 +161,7 @@ export class Finder {
|
|
|
161
161
|
const item = cachedItem.get(`${selector}`);
|
|
162
162
|
ast = item.ast;
|
|
163
163
|
this.#descendant = item.descendant;
|
|
164
|
+
this.#invalidate = item.invalidate;
|
|
164
165
|
}
|
|
165
166
|
}
|
|
166
167
|
if (ast) {
|
|
@@ -179,7 +180,8 @@ export class Finder {
|
|
|
179
180
|
} catch (e) {
|
|
180
181
|
this._onError(e);
|
|
181
182
|
}
|
|
182
|
-
const { branches } = walkAST(cssAst);
|
|
183
|
+
const { branches, info: { hasHasPseudo } } = walkAST(cssAst);
|
|
184
|
+
const invalidate = !!hasHasPseudo;
|
|
183
185
|
let descendant = false;
|
|
184
186
|
let i = 0;
|
|
185
187
|
ast = [];
|
|
@@ -247,10 +249,12 @@ export class Finder {
|
|
|
247
249
|
}
|
|
248
250
|
cachedItem.set(`${selector}`, {
|
|
249
251
|
ast,
|
|
250
|
-
descendant
|
|
252
|
+
descendant,
|
|
253
|
+
invalidate
|
|
251
254
|
});
|
|
252
255
|
this.#documentCache.set(this.#document, cachedItem);
|
|
253
256
|
this.#descendant = descendant;
|
|
257
|
+
this.#invalidate = invalidate;
|
|
254
258
|
}
|
|
255
259
|
return [
|
|
256
260
|
ast,
|
package/src/js/parser.js
CHANGED
|
@@ -195,6 +195,9 @@ export const walkAST = (ast = {}) => {
|
|
|
195
195
|
if (REG_LOGICAL_PSEUDO.test(node.name)) {
|
|
196
196
|
info.set('hasNestedSelector', true);
|
|
197
197
|
info.set('hasLogicalPseudoFunc', true);
|
|
198
|
+
if (node.name === 'has') {
|
|
199
|
+
info.set('hasHasPseudoFunc', true);
|
|
200
|
+
}
|
|
198
201
|
}
|
|
199
202
|
break;
|
|
200
203
|
}
|