projen 0.99.2 → 0.99.4

package/node_modules/@oozcitak/dom/lib/algorithm/RangeAlgorithm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RangeAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/RangeAlgorithm.ts"],"names":[],"mappings":";;AA4BA,0CAKC;AAOD,gCAKC;AAQD,8CASC;AAQD,gEAUC;AASD,8CA0BC;AASD,0CA0BC;AAQD,oCAiBC;AAOD,sCAiPC;AAOD,wDAwLC;AAQD,oCAuGC;AAOD,0DAwBC;AAOD,4EAwBC;AAnxBD,kDAG0B;AAC1B,sDAE4B;AAC5B,kCAA+B;AAC/B,uDAAyE;AACzE,mDAGwB;AACxB,qEAAiE;AACjE,qEAAiG;AACjG,mDAA4C;AAC5C,2DAG4B;AAC5B,mDAA4C;AAE5C;;;;;GAKG;AACH,SAAgB,eAAe,CAAC,KAAoB;IAClD;;OAEG;IACH,OAAO,CAAC,KAAK,CAAC,UAAU,KAAK,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,YAAY,KAAK,KAAK,CAAC,UAAU,CAAC,CAAA;AACzF,CAAC;AAED;;;;GAIG;AACH,SAAgB,UAAU,CAAC,KAAoB;IAC7C;;OAEG;IACH,OAAO,IAAA,6BAAa,EAAC,KAAK,CAAC,UAAU,CAAC,CAAA;AACxC,CAAC;AAED;;;;;GAKG;AACH,SAAgB,iBAAiB,CAAC,IAAU,EAAE,KAAoB;IAChE;;;;OAIG;IACH,OAAO,CAAC,IAAA,6BAAa,EAAC,IAAI,CAAC,KAAK,UAAU,CAAC,KAAK,CAAC;QAC/C,IAAA,+CAAsB,EAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,6BAAgB,CAAC,KAAK;QAC1E,IAAA,+CAAsB,EAAC,CAAC,IAAI,EAAE,IAAA,+BAAe,EAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,6BAAgB,CAAC,MAAM,CAAC,CAAA;AAClG,CAAC;AAED;;;;;GAKG;AACH,SAAgB,0BAA0B,CAAC,IAAU,EAAE,KAAoB;IACzE;;;;OAIG;IACH,MAAM,UAAU,GAAG,IAAA,iCAAiB,EAAC,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;IAClE,MAAM,QAAQ,GAAG,IAAA,iCAAiB,EAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;IAE9D,OAAO,CAAC,UAAU,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,UAAU,IAAI,QAAQ,CAAC,CAAA;AAC/D,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,iBAAiB,CAAC,KAAoB,EAAE,IAAU,EAAE,MAAc;IAChF;;;;;;;;;OASG;IACH,IAAI,YAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,mCAAoB,EAAE,CAAA;IAClC,CAAC;IACD,IAAI,MAAM,GAAG,IAAA,+BAAe,EAAC,IAAI,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,6BAAc,EAAE,CAAA;IAC5B,CAAC;IAED,MAAM,EAAE,GAAkB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IAExC,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,IAAA,6BAAa,EAAC,IAAI,CAAC;QAC3C,IAAA,+CAAsB,EAAC,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,6BAAgB,CAAC,KAAK,EAAE,CAAC;QACpE,KAAK,CAAC,IAAI,GAAG,EAAE,CAAA;IACjB,CAAC;IAED,KAAK,CAAC,MAAM,GAAG,EAAE,CAAA;AACnB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,eAAe,CAAC,KAAoB,EAAE,IAAU,EAAE,MAAc;IAC9E;;;;;;;;;OASG;IACH,IAAI,YAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,mCAAoB,EAAE,CAAA;IAClC,CAAC;IACD,IAAI,MAAM,GAAG,IAAA,+BAAe,EAAC,IAAI,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,6BAAc,EAAE,CAAA;IAC5B,CAAC;IAED,MAAM,EAAE,GAAkB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IAExC,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,IAAA,6BAAa,EAAC,IAAI,CAAC;QAC3C,IAAA,+CAAsB,EAAC,EAAE,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,6BAAgB,CAAC,MAAM,EAAE,CAAC;QACvE,KAAK,CAAC,MAAM,GAAG,EAAE,CAAA;IACnB,CAAC;IAED,KAAK,CAAC,IAAI,GAAG,EAAE,CAAA;AACjB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,IAAU,EAAE,KAAoB;IAC3D;;;OAGG;IACH,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;IAC3B,IAAI,MAAM,KAAK,IAAI;QACjB,MAAM,IAAI,mCAAoB,EAAE,CAAA;IAElC;;;;OAIG;IACH,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,IAAI,CAAC,CAAA;IAC9B,KAAK,CAAC,MAAM,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAC9B,KAAK,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;AAClC,CAAC;AAED;;;;GAIG;AACH,SAAgB,aAAa,CAAC,KAAoB;IAChD;;;;OAIG;IACH,MAAM,QAAQ,GAAG,IAAA,yCAAuB,EAAC,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,CAAA;IACxE,IAAI,eAAe,CAAC,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAA;IAE3C;;;;OAIG;IACH,MAAM,iBAAiB,GAAG,KAAK,CAAC,UAAU,CAAA;IAC1C,MAAM,mBAAmB,GAAG,KAAK,CAAC,YAAY,CAAA;IAC9C,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,CAAA;IACtC,MAAM,iBAAiB,GAAG,KAAK,CAAC,UAAU,CAAA;IAE1C;;;;;;;;;;;;OAYG;IACH,IAAI,iBAAiB,KAAK,eAAe;QACvC,YAAK,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,iBAAiB,CAAkB,CAAA;QAC5D,KAAK,CAAC,KAAK,GAAG,IAAA,oDAA2B,EACvC,iBAAiB,EAAE,mBAAmB,EACtC,iBAAiB,GAAG,mBAAmB,CAAC,CAAA;QAC1C,IAAA,mCAAe,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;QAChC,IAAA,kDAAyB,EACvB,iBAAiB,EAAE,mBAAmB,EACtC,iBAAiB,GAAG,mBAAmB,EAAE,EAAE,CAAC,CAAA;QAC9C,OAAO,QAAQ,CAAA;IACjB,CAAC;IAED;;;;OAIG;IACH,IAAI,cAAc,GAAG,iBAAiB,CAAA;IACtC,OAAO,CAAC,IAAA,iCAAiB,EAAC,eAAe,EAAE,cAAc,EAAE,IAAI,CAAC,EAAE,CAAC;QACjE,IAAI,cAAc,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAA;QAC1C,CAAC;QACD,cAAc,GAAG,cAAc,CAAC,OAAO,CAAA;IACzC,CAAC;IAED;;;;;OAKG;IACH,IAAI,4BAA4B,GAAgB,IAAI,CAAA;IACpD,IAAI,CAAC,IAAA,iCAAiB,EAAC,eAAe,EAAE,iBAAiB,EAAE,IAAI,CAAC,EAAE,CAAC;QACjE,KAAK,MAAM,IAAI,IAAI,cAAc,CAAC,SAAS,EAAE,CAAC;YAC5C,IAAI,0BAA0B,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC5C,4BAA4B,GAAG,IAAI,CAAA;gBACnC,MAAK;YACP,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,IAAI,2BAA2B,GAAgB,IAAI,CAAA;IACnD,IAAI,CAAC,IAAA,iCAAiB,EAAC,iBAAiB,EAAE,eAAe,EAAE,IAAI,CAAC,EAAE,CAAC;QACjE,MAAM,QAAQ,GAAG,CAAC,GAAG,cAAc,CAAC,SAAS,CAAC,CAAA;QAC9C,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;YACxB,IAAI,0BAA0B,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC5C,2BAA2B,GAAG,IAAI,CAAA;gBAClC,MAAK;YACP,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,MAAM,iBAAiB,GAAW,EAAE,CAAA;IACpC,KAAK,MAAM,KAAK,IAAI,cAAc,CAAC,SAAS,EAAE,CAAC;QAC7C,IAAI,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;YACpC,IAAI,YAAK,CAAC,kBAAkB,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpC,MAAM,IAAI,oCAAqB,EAAE,CAAA;YACnC,CAAC;YACD,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAC/B,CAAC;IACH,CAAC;IAED,IAAI,OAAa,CAAA;IACjB,IAAI,SAAiB,CAAA;IACrB,IAAI,IAAA,iCAAiB,EAAC,eAAe,EAAE,iBAAiB,EAAE,IAAI,CAAC,EAAE,CAAC;QAChE;;;;WAIG;QACH,OAAO,GAAG,iBAAiB,CAAA;QAC3B,SAAS,GAAG,mBAAmB,CAAA;IACjC,CAAC;SAAM,CAAC;QACN;;;;;;;WAOG;QACH,IAAI,aAAa,GAAG,iBAAiB,CAAA;QACrC,OAAO,aAAa,CAAC,OAAO,KAAK,IAAI;YACnC,CAAC,IAAA,iCAAiB,EAAC,eAAe,EAAE,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;YAC7D,aAAa,GAAG,aAAa,CAAC,OAAO,CAAA;QACvC,CAAC;QACD,0BAA0B;QAC1B,IAAI,aAAa,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YACnC;;;;eAIG;YACH,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAA;QACzC,CAAC;QACD,OAAO,GAAG,aAAa,CAAC,OAAO,CAAA;QAC/B,SAAS,GAAG,CAAC,GAAG,IAAA,0BAAU,EAAC,aAAa,CAAC,CAAA;IAC3C,CAAC;IAED,IAAI,YAAK,CAAC,mBAAmB,CAAC,4BAA4B,CAAC,EAAE,CAAC;QAC5D;;;;;;;;;;;WAWG;QACH,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,iBAAiB,CAAkB,CAAA;QAC5D,KAAK,CAAC,KAAK,GAAG,IAAA,oDAA2B,EACvC,iBAAkC,EAAE,mBAAmB,EACvD,IAAA,+BAAe,EAAC,iBAAiB,CAAC,GAAG,mBAAmB,CAAC,CAAA;QAC3D,IAAA,mCAAe,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;QAChC,IAAA,kDAAyB,EAAC,iBAAkC,EAC1D,mBAAmB,EACnB,IAAA,+BAAe,EAAC,iBAAiB,CAAC,GAAG,mBAAmB,EAAE,EAAE,CAAC,CAAA;IACjE,CAAC;SAAM,IAAI,4BAA4B,KAAK,IAAI,EAAE,CAAC;QACjD;;;;;;;;;WASG;QACH,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,4BAA4B,CAAC,CAAA;QACtD,IAAA,mCAAe,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;QAChC,MAAM,QAAQ,GAAG,IAAA,8BAAY,EAC3B,CAAC,iBAAiB,EAAE,mBAAmB,CAAC,EACxC,CAAC,4BAA4B,EAAE,IAAA,+BAAe,EAAC,4BAA4B,CAAC,CAAC,CAAC,CAAA;QAChF,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAA;QAC3C,IAAA,mCAAe,EAAC,WAAW,EAAE,KAAK,CAAC,CAAA;IACrC,CAAC;IAED;;;OAGG;IACH,KAAK,MAAM,KAAK,IAAI,iBAAiB,EAAE,CAAC;QACtC,IAAA,mCAAe,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;IAClC,CAAC;IAED,IAAI,YAAK,CAAC,mBAAmB,CAAC,2BAA2B,CAAC,EAAE,CAAC;QAC3D;;;;;;;;;WASG;QACH,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,eAAe,CAAkB,CAAA;QAC1D,KAAK,CAAC,KAAK,GAAG,IAAA,oDAA2B,EACvC,eAAgC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAA;QACzD,IAAA,mCAAe,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;QAChC,IAAA,kDAAyB,EAAC,eAAgC,EACxD,CAAC,EAAE,iBAAiB,EAAE,EAAE,CAAC,CAAA;IAC7B,CAAC;SAAM,IAAI,2BAA2B,KAAK,IAAI,EAAE,CAAC;QAChD;;;;;;;;;WASG;QACH,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,2BAA2B,CAAC,CAAA;QACrD,IAAA,mCAAe,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;QAChC,MAAM,QAAQ,GAAG,IAAA,8BAAY,EAC3B,CAAC,2BAA2B,EAAE,CAAC,CAAC,EAChC,CAAC,eAAe,EAAE,iBAAiB,CAAC,CAAC,CAAA;QACvC,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAA;QAC3C,IAAA,mCAAe,EAAC,WAAW,EAAE,KAAK,CAAC,CAAA;IACrC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAA;IACnC,KAAK,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAA;IAEjC;;OAEG;IACH,OAAO,QAAQ,CAAA;AACjB,CAAC;AAED;;;;GAIG;AACH,SAAgB,sBAAsB,CAAC,KAAoB;IACzD;;;;OAIG;IACH,MAAM,QAAQ,GAAG,IAAA,yCAAuB,EAAC,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,CAAA;IACxE,IAAI,eAAe,CAAC,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAA;IAE3C;;;;;;;;;;;;OAYG;IACH,MAAM,iBAAiB,GAAG,KAAK,CAAC,UAAU,CAAA;IAC1C,MAAM,mBAAmB,GAAG,KAAK,CAAC,YAAY,CAAA;IAC9C,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,CAAA;IACtC,MAAM,iBAAiB,GAAG,KAAK,CAAC,UAAU,CAAA;IAE1C,IAAI,iBAAiB,KAAK,eAAe;QACvC,YAAK,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,iBAAiB,CAAkB,CAAA;QAC5D,KAAK,CAAC,KAAK,GAAG,IAAA,oDAA2B,EACvC,iBAAiB,EAAE,mBAAmB,EACtC,iBAAiB,GAAG,mBAAmB,CAAC,CAAA;QAC1C,IAAA,mCAAe,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;IAClC,CAAC;IAED;;;;OAIG;IACH,IAAI,cAAc,GAAG,iBAAiB,CAAA;IACtC,OAAO,CAAC,IAAA,iCAAiB,EAAC,eAAe,EAAE,cAAc,EAAE,IAAI,CAAC,EAAE,CAAC;QACjE,IAAI,cAAc,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAA;QAC1C,CAAC;QACD,cAAc,GAAG,cAAc,CAAC,OAAO,CAAA;IACzC,CAAC;IAED;;;;;OAKG;IACH,IAAI,4BAA4B,GAAgB,IAAI,CAAA;IACpD,IAAI,CAAC,IAAA,iCAAiB,EAAC,eAAe,EAAE,iBAAiB,EAAE,IAAI,CAAC,EAAE,CAAC;QACjE,KAAK,MAAM,IAAI,IAAI,cAAc,CAAC,SAAS,EAAE,CAAC;YAC5C,IAAI,0BAA0B,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC5C,4BAA4B,GAAG,IAAI,CAAA;gBACnC,MAAK;YACP,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,IAAI,2BAA2B,GAAgB,IAAI,CAAA;IACnD,IAAI,CAAC,IAAA,iCAAiB,EAAC,iBAAiB,EAAE,eAAe,EAAE,IAAI,CAAC,EAAE,CAAC;QACjE,MAAM,QAAQ,GAAG,CAAC,GAAG,cAAc,CAAC,SAAS,CAAC,CAAA;QAC9C,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;YACxB,IAAI,0BAA0B,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC5C,2BAA2B,GAAG,IAAI,CAAA;gBAClC,MAAK;YACP,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,MAAM,iBAAiB,GAAW,EAAE,CAAA;IACpC,KAAK,MAAM,KAAK,IAAI,cAAc,CAAC,SAAS,EAAE,CAAC;QAC7C,IAAI,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;YACpC,IAAI,YAAK,CAAC,kBAAkB,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpC,MAAM,IAAI,oCAAqB,EAAE,CAAA;YACnC,CAAC;YACD,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAC/B,CAAC;IACH,CAAC;IAED,IAAI,YAAK,CAAC,mBAAmB,CAAC,4BAA4B,CAAC,EAAE,CAAC;QAC5D;;;;;;;;WAQG;QACH,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,iBAAiB,CAAkB,CAAA;QAC5D,KAAK,CAAC,KAAK,GAAG,IAAA,oDAA2B,EACvC,iBAAkC,EAAE,mBAAmB,EACvD,IAAA,+BAAe,EAAC,iBAAiB,CAAC,GAAG,mBAAmB,CAAC,CAAA;QAC3D,IAAA,mCAAe,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;IAClC,CAAC;SAAM,IAAI,4BAA4B,KAAK,IAAI,EAAE,CAAC;QACjD;;;;;;;;;;WAUG;QACH,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,4BAA4B,CAAC,CAAA;QACtD,IAAA,mCAAe,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;QAChC,MAAM,QAAQ,GAAG,IAAA,8BAAY,EAC3B,CAAC,iBAAiB,EAAE,mBAAmB,CAAC,EACxC,CAAC,4BAA4B,EAAE,IAAA,+BAAe,EAAC,4BAA4B,CAAC,CAAC,CAAC,CAAA;QAChF,MAAM,WAAW,GAAG,sBAAsB,CAAC,QAAQ,CAAC,CAAA;QACpD,IAAA,mCAAe,EAAC,WAAW,EAAE,KAAK,CAAC,CAAA;IACrC,CAAC;IAED;;;;;;OAMG;IACH,KAAK,MAAM,KAAK,IAAI,iBAAiB,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,KAAK,CAAC,CAAA;QAC/B,IAAA,mCAAe,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;IAClC,CAAC;IAED,IAAI,YAAK,CAAC,mBAAmB,CAAC,2BAA2B,CAAC,EAAE,CAAC;QAC3D;;;;;;;WAOG;QACH,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,eAAe,CAAkB,CAAA;QAC1D,KAAK,CAAC,KAAK,GAAG,IAAA,oDAA2B,EACvC,eAAgC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAA;QACzD,IAAA,mCAAe,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;IAClC,CAAC;SAAM,IAAI,2BAA2B,KAAK,IAAI,EAAE,CAAC;QAChD;;;;;;;;;WASG;QACH,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,2BAA2B,CAAC,CAAA;QACrD,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QACtB,MAAM,QAAQ,GAAG,IAAA,8BAAY,EAC3B,CAAC,2BAA2B,EAAE,CAAC,CAAC,EAChC,CAAC,eAAe,EAAE,iBAAiB,CAAC,CAAC,CAAA;QACvC,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAA;QAC3C,IAAA,mCAAe,EAAC,WAAW,EAAE,KAAK,CAAC,CAAA;IACrC,CAAC;IAED;;OAEG;IACH,OAAO,QAAQ,CAAA;AACjB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,IAAU,EAAE,KAAoB;IAC3D;;;;OAIG;IACH,IAAI,YAAK,CAAC,2BAA2B,CAAC,KAAK,CAAC,UAAU,CAAC;QACrD,YAAK,CAAC,aAAa,CAAC,KAAK,CAAC,UAAU,CAAC;QACrC,CAAC,YAAK,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,OAAO,KAAK,IAAI,CAAC;QACzE,KAAK,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;QAC5B,MAAM,IAAI,oCAAqB,EAAE,CAAA;IACnC,CAAC;IAED;;;;;;OAMG;IACH,IAAI,aAAa,GAAgB,IAAI,CAAA;IACrC,IAAI,YAAK,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;QACvC,aAAa,GAAG,KAAK,CAAC,UAAU,CAAA;IAClC,CAAC;SAAM,CAAC;QACN,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC;YAC/C,IAAI,KAAK,KAAK,KAAK,CAAC,YAAY,EAAE,CAAC;gBACjC,aAAa,GAAG,KAAK,CAAA;gBACrB,MAAK;YACP,CAAC;YACD,KAAK,EAAE,CAAA;QACT,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,IAAI,MAAY,CAAA;IAChB,IAAI,aAAa,KAAK,IAAI,EAAE,CAAC;QAC3B,MAAM,GAAG,KAAK,CAAC,UAAU,CAAA;IAC3B,CAAC;SAAM,CAAC;QACN,IAAI,aAAa,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAA;QACzC,CAAC;QACD,MAAM,GAAG,aAAa,CAAC,OAAO,CAAA;IAChC,CAAC;IAED;;OAEG;IACH,IAAA,uDAAmC,EAAC,IAAI,EAAE,MAAM,EAAE,aAAa,CAAC,CAAA;IAEhE;;;OAGG;IACH,IAAI,YAAK,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;QACvC,aAAa,GAAG,IAAA,0BAAU,EAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,YAAY,CAAC,CAAA;IAClE,CAAC;IAED;;OAEG;IACH,IAAI,IAAI,KAAK,aAAa,EAAE,CAAC;QAC3B,aAAa,GAAG,IAAI,CAAC,YAAY,CAAA;IACnC,CAAC;IAED;;OAEG;IACH,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;QAC1B,IAAA,mCAAe,EAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAA;IACrC,CAAC;IAED;;;OAGG;IACH,IAAI,SAAS,GAAG,CAAC,aAAa,KAAK,IAAI,CAAC,CAAC;QACvC,IAAA,+BAAe,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAA,0BAAU,EAAC,aAAa,CAAC,CAAC,CAAA;IAEtD;;;OAGG;IACH,IAAI,YAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,EAAE,CAAC;QACvC,SAAS,IAAI,IAAA,+BAAe,EAAC,IAAI,CAAC,CAAA;IACpC,CAAC;SAAM,CAAC;QACN,SAAS,EAAE,CAAA;IACb,CAAC;IAED;;OAEG;IACH,IAAA,sCAAkB,EAAC,IAAI,EAAE,MAAM,EAAE,aAAa,CAAC,CAAA;IAE/C;;OAEG;IACH,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IAClC,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAgB,uBAAuB,CAAC,KAAY;IAClD,OAAO;QACL,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE;YAEtB,MAAM,SAAS,GAAG,KAAK,CAAC,uBAAuB,CAAA;YAC/C,IAAI,WAAW,GAAG,IAAA,2CAA2B,EAAC,SAAS,CAAC,CAAA;YAExD,OAAO;gBACL,IAAI,EAAE,GAAG,EAAE;oBACT,OAAO,WAAW,IAAI,CAAC,iBAAiB,CAAC,WAAW,EAAE,KAAK,CAAC,EAAE,CAAC;wBAC7D,WAAW,GAAG,IAAA,0CAA0B,EAAC,SAAS,EAAE,WAAW,CAAC,CAAA;oBAClE,CAAC;oBAED,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;wBACzB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;oBACpC,CAAC;yBAAM,CAAC;wBACN,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAA;wBAClD,WAAW,GAAG,IAAA,0CAA0B,EAAC,SAAS,EAAE,WAAW,CAAC,CAAA;wBAChE,OAAO,MAAM,CAAA;oBACf,CAAC;gBACH,CAAC;aACF,CAAA;QACH,CAAC;KACF,CAAA;AACH,CAAC;AAED;;;;GAIG;AACH,SAAgB,gCAAgC,CAAC,KAAY;IAC3D,OAAO;QACL,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE;YAEtB,MAAM,SAAS,GAAG,KAAK,CAAC,uBAAuB,CAAA;YAC/C,IAAI,WAAW,GAAG,IAAA,2CAA2B,EAAC,SAAS,CAAC,CAAA;YAExD,OAAO;gBACL,IAAI,EAAE,GAAG,EAAE;oBACT,OAAO,WAAW,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,KAAK,CAAC,EAAE,CAAC;wBACtE,WAAW,GAAG,IAAA,0CAA0B,EAAC,SAAS,EAAE,WAAW,CAAC,CAAA;oBAClE,CAAC;oBAED,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;wBACzB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;oBACpC,CAAC;yBAAM,CAAC;wBACN,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAA;wBAClD,WAAW,GAAG,IAAA,0CAA0B,EAAC,SAAS,EAAE,WAAW,CAAC,CAAA;wBAChE,OAAO,MAAM,CAAA;oBACf,CAAC;gBACH,CAAC;aACF,CAAA;QACH,CAAC;KACF,CAAA;AACH,CAAC"}

package/node_modules/@oozcitak/dom/lib/algorithm/SelectorsAlgorithm.d.ts

@@ -0,0 +1,8 @@
+import { Element, Node } from "../dom/interfaces";
+/**
+ * Matches elements with the given selectors.
+ *
+ * @param selectors - selectors
+ * @param node - the node to match against
+ */
+export declare function selectors_scopeMatchASelectorsString(selectors: string, node: Node): Element[];

package/node_modules/@oozcitak/dom/lib/algorithm/SelectorsAlgorithm.js

@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.selectors_scopeMatchASelectorsString = selectors_scopeMatchASelectorsString;
+const DOMException_1 = require("../dom/DOMException");
+/**
+ * Matches elements with the given selectors.
+ *
+ * @param selectors - selectors
+ * @param node - the node to match against
+ */
+function selectors_scopeMatchASelectorsString(selectors, node) {
+    /**
+     * TODO: Selectors
+     * 1. Let s be the result of parse a selector selectors. [SELECTORS4]
+     * 2. If s is failure, then throw a "SyntaxError" DOMException.
+     * 3. Return the result of match a selector against a tree with s and node’s
+     * root using scoping root node. [SELECTORS4].
+     */
+    throw new DOMException_1.NotSupportedError();
+}
+//# sourceMappingURL=SelectorsAlgorithm.js.map

package/node_modules/@oozcitak/dom/lib/algorithm/SelectorsAlgorithm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SelectorsAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/SelectorsAlgorithm.ts"],"names":[],"mappings":";;AAUA,oFAUC;AApBD,sDAAuD;AAGvD;;;;;GAKG;AAEH,SAAgB,oCAAoC,CAAC,SAAiB,EAAE,IAAU;IAEhF;;;;;;OAMG;IACH,MAAM,IAAI,gCAAiB,EAAE,CAAA;AAC/B,CAAC"}

package/node_modules/@oozcitak/dom/lib/algorithm/ShadowTreeAlgorithm.d.ts

@@ -0,0 +1,57 @@
+import { Slotable, Slot, Element, Node } from "../dom/interfaces";
+/**
+ * Signals a slot change to the given slot.
+ *
+ * @param slot - a slot
+ */
+export declare function shadowTree_signalASlotChange(slot: Slot): void;
+/**
+ * Determines whether a the shadow tree of the given element node is
+ * connected to a document node.
+ *
+ * @param element - an element node of the shadow tree
+ */
+export declare function shadowTree_isConnected(element: Element): boolean;
+/**
+ * Determines whether a slotable is assigned.
+ *
+ * @param slotable - a slotable
+ */
+export declare function shadowTree_isAssigned(slotable: Slotable): boolean;
+/**
+ * Finds a slot for the given slotable.
+ *
+ * @param slotable - a slotable
+ * @param openFlag - `true` to search open shadow tree's only
+ */
+export declare function shadowTree_findASlot(slotable: Slotable, openFlag?: boolean): Slot | null;
+/**
+ * Finds slotables for the given slot.
+ *
+ * @param slot - a slot
+ */
+export declare function shadowTree_findSlotables(slot: Slot): Slotable[];
+/**
+ * Finds slotables for the given slot.
+ *
+ * @param slot - a slot
+ */
+export declare function shadowTree_findFlattenedSlotables(slot: Slot): Slotable[];
+/**
+ * Assigns slotables to the given slot.
+ *
+ * @param slot - a slot
+ */
+export declare function shadowTree_assignSlotables(slot: Slot): void;
+/**
+ * Assigns slotables to all nodes of a tree.
+ *
+ * @param root - root node
+ */
+export declare function shadowTree_assignSlotablesForATree(root: Node): void;
+/**
+ * Assigns a slot to a slotables.
+ *
+ * @param slotable - a slotable
+ */
+export declare function shadowTree_assignASlot(slotable: Slotable): void;

package/node_modules/@oozcitak/dom/lib/algorithm/ShadowTreeAlgorithm.js

@@ -0,0 +1,241 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.shadowTree_signalASlotChange = shadowTree_signalASlotChange;
+exports.shadowTree_isConnected = shadowTree_isConnected;
+exports.shadowTree_isAssigned = shadowTree_isAssigned;
+exports.shadowTree_findASlot = shadowTree_findASlot;
+exports.shadowTree_findSlotables = shadowTree_findSlotables;
+exports.shadowTree_findFlattenedSlotables = shadowTree_findFlattenedSlotables;
+exports.shadowTree_assignSlotables = shadowTree_assignSlotables;
+exports.shadowTree_assignSlotablesForATree = shadowTree_assignSlotablesForATree;
+exports.shadowTree_assignASlot = shadowTree_assignASlot;
+const DOMImpl_1 = require("../dom/DOMImpl");
+const util_1 = require("../util");
+const util_2 = require("@oozcitak/util");
+const TreeAlgorithm_1 = require("./TreeAlgorithm");
+const MutationObserverAlgorithm_1 = require("./MutationObserverAlgorithm");
+/**
+ * Signals a slot change to the given slot.
+ *
+ * @param slot - a slot
+ */
+function shadowTree_signalASlotChange(slot) {
+    /**
+     * 1. Append slot to slot’s relevant agent’s signal slots.
+     * 2. Queue a mutation observer microtask.
+     */
+    const window = DOMImpl_1.dom.window;
+    window._signalSlots.add(slot);
+    (0, MutationObserverAlgorithm_1.observer_queueAMutationObserverMicrotask)();
+}
+/**
+ * Determines whether a the shadow tree of the given element node is
+ * connected to a document node.
+ *
+ * @param element - an element node of the shadow tree
+ */
+function shadowTree_isConnected(element) {
+    /**
+     * An element is connected if its shadow-including root is a document.
+     */
+    return util_1.Guard.isDocumentNode((0, TreeAlgorithm_1.tree_rootNode)(element, true));
+}
+/**
+ * Determines whether a slotable is assigned.
+ *
+ * @param slotable - a slotable
+ */
+function shadowTree_isAssigned(slotable) {
+    /**
+     * A slotable is assigned if its assigned slot is non-null.
+     */
+    return (slotable._assignedSlot !== null);
+}
+/**
+ * Finds a slot for the given slotable.
+ *
+ * @param slotable - a slotable
+ * @param openFlag - `true` to search open shadow tree's only
+ */
+function shadowTree_findASlot(slotable, openFlag = false) {
+    /**
+     * 1. If slotable’s parent is null, then return null.
+     * 2. Let shadow be slotable’s parent’s shadow root.
+     * 3. If shadow is null, then return null.
+     * 4. If the open flag is set and shadow’s mode is not "open", then
+     * return null.
+     * 5. Return the first slot in tree order in shadow’s descendants whose name
+     * is slotable’s name, if any, and null otherwise.
+     */
+    const node = util_1.Cast.asNode(slotable);
+    const parent = node._parent;
+    if (parent === null)
+        return null;
+    const shadow = parent._shadowRoot || null;
+    if (shadow === null)
+        return null;
+    if (openFlag && shadow._mode !== "open")
+        return null;
+    let child = (0, TreeAlgorithm_1.tree_getFirstDescendantNode)(shadow, false, true, (e) => util_1.Guard.isSlot(e));
+    while (child !== null) {
+        if (child._name === slotable._name)
+            return child;
+        child = (0, TreeAlgorithm_1.tree_getNextDescendantNode)(shadow, child, false, true, (e) => util_1.Guard.isSlot(e));
+    }
+    return null;
+}
+/**
+ * Finds slotables for the given slot.
+ *
+ * @param slot - a slot
+ */
+function shadowTree_findSlotables(slot) {
+    /**
+     * 1. Let result be an empty list.
+     * 2. If slot’s root is not a shadow root, then return result.
+     */
+    const result = [];
+    const root = (0, TreeAlgorithm_1.tree_rootNode)(slot);
+    if (!util_1.Guard.isShadowRoot(root))
+        return result;
+    /**
+     * 3. Let host be slot’s root’s host.
+     * 4. For each slotable child of host, slotable, in tree order:
+     */
+    const host = root._host;
+    for (const slotable of host._children) {
+        if (util_1.Guard.isSlotable(slotable)) {
+            /**
+             * 4.1. Let foundSlot be the result of finding a slot given slotable.
+             * 4.2. If foundSlot is slot, then append slotable to result.
+             */
+            const foundSlot = shadowTree_findASlot(slotable);
+            if (foundSlot === slot) {
+                result.push(slotable);
+            }
+        }
+    }
+    /**
+     * 5. Return result.
+     */
+    return result;
+}
+/**
+ * Finds slotables for the given slot.
+ *
+ * @param slot - a slot
+ */
+function shadowTree_findFlattenedSlotables(slot) {
+    /**
+     * 1. Let result be an empty list.
+     * 2. If slot’s root is not a shadow root, then return result.
+     */
+    const result = [];
+    const root = (0, TreeAlgorithm_1.tree_rootNode)(slot);
+    if (!util_1.Guard.isShadowRoot(root))
+        return result;
+    /**
+     * 3. Let slotables be the result of finding slotables given slot.
+     * 4. If slotables is the empty list, then append each slotable child of
+     * slot, in tree order, to slotables.
+     */
+    const slotables = shadowTree_findSlotables(slot);
+    if ((0, util_2.isEmpty)(slotables)) {
+        for (const slotable of slot._children) {
+            if (util_1.Guard.isSlotable(slotable)) {
+                slotables.push(slotable);
+            }
+        }
+    }
+    /**
+     * 5. For each node in slotables:
+     */
+    for (const node of slotables) {
+        /**
+         * 5.1. If node is a slot whose root is a shadow root, then:
+         */
+        if (util_1.Guard.isSlot(node) && util_1.Guard.isShadowRoot((0, TreeAlgorithm_1.tree_rootNode)(node))) {
+            /**
+             * 5.1.1. Let temporaryResult be the result of finding flattened slotables given node.
+             * 5.1.2. Append each slotable in temporaryResult, in order, to result.
+             */
+            const temporaryResult = shadowTree_findFlattenedSlotables(node);
+            result.push(...temporaryResult);
+        }
+        else {
+            /**
+             * 5.2. Otherwise, append node to result.
+             */
+            result.push(node);
+        }
+    }
+    /**
+     * 6. Return result.
+     */
+    return result;
+}
+/**
+ * Assigns slotables to the given slot.
+ *
+ * @param slot - a slot
+ */
+function shadowTree_assignSlotables(slot) {
+    /**
+     * 1. Let slotables be the result of finding slotables for slot.
+     * 2. If slotables and slot’s assigned nodes are not identical, then run
+     * signal a slot change for slot.
+     */
+    const slotables = shadowTree_findSlotables(slot);
+    if (slotables.length === slot._assignedNodes.length) {
+        let nodesIdentical = true;
+        for (let i = 0; i < slotables.length; i++) {
+            if (slotables[i] !== slot._assignedNodes[i]) {
+                nodesIdentical = false;
+                break;
+            }
+        }
+        if (!nodesIdentical) {
+            shadowTree_signalASlotChange(slot);
+        }
+    }
+    /**
+     * 3. Set slot’s assigned nodes to slotables.
+     * 4. For each slotable in slotables, set slotable’s assigned slot to slot.
+     */
+    slot._assignedNodes = slotables;
+    for (const slotable of slotables) {
+        slotable._assignedSlot = slot;
+    }
+}
+/**
+ * Assigns slotables to all nodes of a tree.
+ *
+ * @param root - root node
+ */
+function shadowTree_assignSlotablesForATree(root) {
+    /**
+     * To assign slotables for a tree, given a node root, run assign slotables
+     * for each slot slot in root’s inclusive descendants, in tree order.
+     */
+    let descendant = (0, TreeAlgorithm_1.tree_getFirstDescendantNode)(root, true, false, (e) => util_1.Guard.isSlot(e));
+    while (descendant !== null) {
+        shadowTree_assignSlotables(descendant);
+        descendant = (0, TreeAlgorithm_1.tree_getNextDescendantNode)(root, descendant, true, false, (e) => util_1.Guard.isSlot(e));
+    }
+}
+/**
+ * Assigns a slot to a slotables.
+ *
+ * @param slotable - a slotable
+ */
+function shadowTree_assignASlot(slotable) {
+    /**
+     * 1. Let slot be the result of finding a slot with slotable.
+     * 2. If slot is non-null, then run assign slotables for slot.
+     */
+    const slot = shadowTree_findASlot(slotable);
+    if (slot !== null) {
+        shadowTree_assignSlotables(slot);
+    }
+}
+//# sourceMappingURL=ShadowTreeAlgorithm.js.map

package/node_modules/@oozcitak/dom/lib/algorithm/ShadowTreeAlgorithm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ShadowTreeAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/ShadowTreeAlgorithm.ts"],"names":[],"mappings":";;AAcA,oEAQC;AAQD,wDAKC;AAOD,sDAKC;AAQD,oDAyBC;AAOD,4DA+BC;AAOD,8EAiDC;AAOD,gEA4BC;AAOD,gFAUC;AAOD,wDASC;AAlPD,4CAAoC;AAEpC,kCAAqC;AACrC,yCAAwC;AACxC,mDAEwB;AACxB,2EAAsF;AAEtF;;;;GAIG;AACH,SAAgB,4BAA4B,CAAC,IAAU;IACrD;;;OAGG;IACH,MAAM,MAAM,GAAG,aAAG,CAAC,MAAM,CAAA;IACzB,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC7B,IAAA,oEAAwC,GAAE,CAAA;AAC5C,CAAC;AAED;;;;;GAKG;AACH,SAAgB,sBAAsB,CAAC,OAAgB;IACrD;;OAEG;IACH,OAAO,YAAK,CAAC,cAAc,CAAC,IAAA,6BAAa,EAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAA;AAC3D,CAAC;AAED;;;;GAIG;AACH,SAAgB,qBAAqB,CAAC,QAAkB;IACtD;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,aAAa,KAAK,IAAI,CAAC,CAAA;AAC1C,CAAC;AAED;;;;;GAKG;AACH,SAAgB,oBAAoB,CAAC,QAAkB,EAAE,WAC7C,KAAK;IACf;;;;;;;;OAQG;IACH,MAAM,IAAI,GAAG,WAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;IAClC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAyB,CAAA;IAC7C,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,IAAI,CAAA;IAChC,MAAM,MAAM,GAAI,MAAM,CAAC,WAAiC,IAAI,IAAI,CAAA;IAChE,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,IAAI,CAAA;IAChC,IAAI,QAAQ,IAAI,MAAM,CAAC,KAAK,KAAK,MAAM;QAAE,OAAO,IAAI,CAAA;IAEpD,IAAI,KAAK,GAAG,IAAA,2CAA2B,EAAC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,YAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IACpF,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;QACtB,IAAK,KAAc,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK;YAAE,OAAQ,KAAc,CAAA;QACpE,KAAK,GAAG,IAAA,0CAA0B,EAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,YAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IACxF,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;GAIG;AACH,SAAgB,wBAAwB,CAAC,IAAU;IACjD;;;OAGG;IACH,MAAM,MAAM,GAAe,EAAE,CAAA;IAC7B,MAAM,IAAI,GAAG,IAAA,6BAAa,EAAC,IAAI,CAAC,CAAA;IAChC,IAAI,CAAC,YAAK,CAAC,YAAY,CAAC,IAAI,CAAC;QAAE,OAAO,MAAM,CAAA;IAE5C;;;OAGG;IACH,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAA;IACvB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QACtC,IAAI,YAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC/B;;;eAGG;YACH,MAAM,SAAS,GAAG,oBAAoB,CAAC,QAAQ,CAAC,CAAA;YAChD,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;gBACvB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;;;GAIG;AACH,SAAgB,iCAAiC,CAAC,IAAU;IAC1D;;;OAGG;IACH,MAAM,MAAM,GAAe,EAAE,CAAA;IAC7B,MAAM,IAAI,GAAG,IAAA,6BAAa,EAAC,IAAI,CAAC,CAAA;IAChC,IAAI,CAAC,YAAK,CAAC,YAAY,CAAC,IAAI,CAAC;QAAE,OAAO,MAAM,CAAA;IAE5C;;;;OAIG;IACH,MAAM,SAAS,GAAG,wBAAwB,CAAC,IAAI,CAAC,CAAA;IAChD,IAAI,IAAA,cAAO,EAAC,SAAS,CAAC,EAAE,CAAC;QACvB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACtC,IAAI,YAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC/B,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B;;WAEG;QACH,IAAI,YAAK,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,YAAK,CAAC,YAAY,CAAC,IAAA,6BAAa,EAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YAClE;;;eAGG;YACH,MAAM,eAAe,GAAG,iCAAiC,CAAC,IAAI,CAAC,CAAA;YAC/D,MAAM,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,CAAA;QACjC,CAAC;aAAM,CAAC;YACN;;eAEG;YACH,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACnB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;;;GAIG;AACH,SAAgB,0BAA0B,CAAC,IAAU;IACnD;;;;OAIG;IACH,MAAM,SAAS,GAAG,wBAAwB,CAAC,IAAI,CAAC,CAAA;IAChD,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC;QACpD,IAAI,cAAc,GAAG,IAAI,CAAA;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5C,cAAc,GAAG,KAAK,CAAA;gBACtB,MAAK;YACP,CAAC;QACH,CAAC;QACD,IAAI,CAAC,cAAc,EAAE,CAAC;YACpB,4BAA4B,CAAC,IAAI,CAAC,CAAA;QACpC,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,cAAc,GAAG,SAAS,CAAA;IAC/B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,QAAQ,CAAC,aAAa,GAAG,IAAI,CAAA;IAC/B,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAgB,kCAAkC,CAAC,IAAU;IAC3D;;;OAGG;IACH,IAAI,UAAU,GAAG,IAAA,2CAA2B,EAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAO,EAAE,EAAE,CAAC,YAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IAC7F,OAAO,UAAU,KAAK,IAAI,EAAE,CAAC;QAC3B,0BAA0B,CAAC,UAAkB,CAAC,CAAA;QAC9C,UAAU,GAAG,IAAA,0CAA0B,EAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAO,EAAE,EAAE,CAAC,YAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IACtG,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAgB,sBAAsB,CAAC,QAAkB;IACvD;;;OAGG;IACH,MAAM,IAAI,GAAG,oBAAoB,CAAC,QAAQ,CAAC,CAAA;IAC3C,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAClB,0BAA0B,CAAC,IAAI,CAAC,CAAA;IAClC,CAAC;AACH,CAAC"}

package/node_modules/@oozcitak/dom/lib/algorithm/TextAlgorithm.d.ts

@@ -0,0 +1,30 @@
+import { Node, Text } from "../dom/interfaces";
+/**
+ * Returns node with its adjacent text and cdata node siblings.
+ *
+ * @param node - a node
+ * @param self - whether to include node itself
+ */
+export declare function text_contiguousTextNodes(node: Text, self?: boolean): Iterable<Text>;
+/**
+ * Returns node with its adjacent text node siblings.
+ *
+ * @param node - a node
+ * @param self - whether to include node itself
+ */
+export declare function text_contiguousExclusiveTextNodes(node: Text, self?: boolean): Iterable<Text>;
+/**
+ * Returns the concatenation of the data of all the Text node descendants of
+ * node, in tree order.
+ *
+ * @param node - a node
+ */
+export declare function text_descendantTextContent(node: Node): string;
+/**
+ * Splits data at the given offset and returns the remainder as a text
+ * node.
+ *
+ * @param node - a text node
+ * @param offset - the offset at which to split the nodes.
+ */
+export declare function text_split(node: Text, offset: number): Text;

package/node_modules/@oozcitak/dom/lib/algorithm/TextAlgorithm.js

@@ -0,0 +1,200 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.text_contiguousTextNodes = text_contiguousTextNodes;
+exports.text_contiguousExclusiveTextNodes = text_contiguousExclusiveTextNodes;
+exports.text_descendantTextContent = text_descendantTextContent;
+exports.text_split = text_split;
+const DOMImpl_1 = require("../dom/DOMImpl");
+const util_1 = require("../util");
+const DOMException_1 = require("../dom/DOMException");
+const CreateAlgorithm_1 = require("./CreateAlgorithm");
+const TreeAlgorithm_1 = require("./TreeAlgorithm");
+const CharacterDataAlgorithm_1 = require("./CharacterDataAlgorithm");
+const MutationAlgorithm_1 = require("./MutationAlgorithm");
+/**
+ * Returns node with its adjacent text and cdata node siblings.
+ *
+ * @param node - a node
+ * @param self - whether to include node itself
+ */
+function text_contiguousTextNodes(node, self = false) {
+    /**
+     * The contiguous Text nodes of a node node are node, node’s previous
+     * sibling Text node, if any, and its contiguous Text nodes, and node’s next
+     * sibling Text node, if any, and its contiguous Text nodes, avoiding any
+     * duplicates.
+     */
+    return {
+        [Symbol.iterator]() {
+            let currentNode = node;
+            while (currentNode && util_1.Guard.isTextNode(currentNode._previousSibling)) {
+                currentNode = currentNode._previousSibling;
+            }
+            return {
+                next() {
+                    if (currentNode && (!self && currentNode === node)) {
+                        if (util_1.Guard.isTextNode(currentNode._nextSibling)) {
+                            currentNode = currentNode._nextSibling;
+                        }
+                        else {
+                            currentNode = null;
+                        }
+                    }
+                    if (currentNode === null) {
+                        return { done: true, value: null };
+                    }
+                    else {
+                        const result = { done: false, value: currentNode };
+                        if (util_1.Guard.isTextNode(currentNode._nextSibling)) {
+                            currentNode = currentNode._nextSibling;
+                        }
+                        else {
+                            currentNode = null;
+                        }
+                        return result;
+                    }
+                }
+            };
+        }
+    };
+}
+/**
+ * Returns node with its adjacent text node siblings.
+ *
+ * @param node - a node
+ * @param self - whether to include node itself
+ */
+function text_contiguousExclusiveTextNodes(node, self = false) {
+    /**
+     * The contiguous exclusive Text nodes of a node node are node, node’s
+     * previous sibling exclusive Text node, if any, and its contiguous
+     * exclusive Text nodes, and node’s next sibling exclusive Text node,
+     * if any, and its contiguous exclusive Text nodes, avoiding any duplicates.
+     */
+    return {
+        [Symbol.iterator]() {
+            let currentNode = node;
+            while (currentNode && util_1.Guard.isExclusiveTextNode(currentNode._previousSibling)) {
+                currentNode = currentNode._previousSibling;
+            }
+            return {
+                next() {
+                    if (currentNode && (!self && currentNode === node)) {
+                        if (util_1.Guard.isExclusiveTextNode(currentNode._nextSibling)) {
+                            currentNode = currentNode._nextSibling;
+                        }
+                        else {
+                            currentNode = null;
+                        }
+                    }
+                    if (currentNode === null) {
+                        return { done: true, value: null };
+                    }
+                    else {
+                        const result = { done: false, value: currentNode };
+                        if (util_1.Guard.isExclusiveTextNode(currentNode._nextSibling)) {
+                            currentNode = currentNode._nextSibling;
+                        }
+                        else {
+                            currentNode = null;
+                        }
+                        return result;
+                    }
+                }
+            };
+        }
+    };
+}
+/**
+ * Returns the concatenation of the data of all the Text node descendants of
+ * node, in tree order.
+ *
+ * @param node - a node
+ */
+function text_descendantTextContent(node) {
+    /**
+     * The descendant text content of a node node is the concatenation of the
+     * data of all the Text node descendants of node, in tree order.
+     */
+    let contents = '';
+    let text = (0, TreeAlgorithm_1.tree_getFirstDescendantNode)(node, false, false, (e) => util_1.Guard.isTextNode(e));
+    while (text !== null) {
+        contents += text._data;
+        text = (0, TreeAlgorithm_1.tree_getNextDescendantNode)(node, text, false, false, (e) => util_1.Guard.isTextNode(e));
+    }
+    return contents;
+}
+/**
+ * Splits data at the given offset and returns the remainder as a text
+ * node.
+ *
+ * @param node - a text node
+ * @param offset - the offset at which to split the nodes.
+ */
+function text_split(node, offset) {
+    /**
+     * 1. Let length be node’s length.
+     * 2. If offset is greater than length, then throw an "IndexSizeError"
+     * DOMException.
+     */
+    const length = node._data.length;
+    if (offset > length) {
+        throw new DOMException_1.IndexSizeError();
+    }
+    /**
+     * 3. Let count be length minus offset.
+     * 4. Let new data be the result of substringing data with node node,
+     * offset offset, and count count.
+     * 5. Let new node be a new Text node, with the same node document as node.
+     * Set new node’s data to new data.
+     * 6. Let parent be node’s parent.
+     * 7. If parent is not null, then:
+     */
+    const count = length - offset;
+    const newData = (0, CharacterDataAlgorithm_1.characterData_substringData)(node, offset, count);
+    const newNode = (0, CreateAlgorithm_1.create_text)(node._nodeDocument, newData);
+    const parent = node._parent;
+    if (parent !== null) {
+        /**
+         * 7.1. Insert new node into parent before node’s next sibling.
+         */
+        (0, MutationAlgorithm_1.mutation_insert)(newNode, parent, node._nextSibling);
+        /**
+         * 7.2. For each live range whose start node is node and start offset is
+         * greater than offset, set its start node to new node and decrease its
+         * start offset by offset.
+         * 7.3. For each live range whose end node is node and end offset is greater
+         * than offset, set its end node to new node and decrease its end offset
+         * by offset.
+         * 7.4. For each live range whose start node is parent and start offset is
+         * equal to the index of node plus 1, increase its start offset by 1.
+         * 7.5. For each live range whose end node is parent and end offset is equal
+         * to the index of node plus 1, increase its end offset by 1.
+         */
+        for (const range of DOMImpl_1.dom.rangeList) {
+            if (range._start[0] === node && range._start[1] > offset) {
+                range._start[0] = newNode;
+                range._start[1] -= offset;
+            }
+            if (range._end[0] === node && range._end[1] > offset) {
+                range._end[0] = newNode;
+                range._end[1] -= offset;
+            }
+            const index = (0, TreeAlgorithm_1.tree_index)(node);
+            if (range._start[0] === parent && range._start[1] === index + 1) {
+                range._start[1]++;
+            }
+            if (range._end[0] === parent && range._end[1] === index + 1) {
+                range._end[1]++;
+            }
+        }
+    }
+    /**
+     * 8. Replace data with node node, offset offset, count count, and data
+     * the empty string.
+     * 9. Return new node.
+     */
+    (0, CharacterDataAlgorithm_1.characterData_replaceData)(node, offset, count, '');
+    return newNode;
+}
+//# sourceMappingURL=TextAlgorithm.js.map

package/node_modules/@oozcitak/dom/lib/algorithm/TextAlgorithm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TextAlgorithm.js","sourceRoot":"","sources":["../../src/algorithm/TextAlgorithm.ts"],"names":[],"mappings":";;AAmBA,4DAyCC;AAQD,8EAyCC;AAQD,gEAYC;AASD,gCAoEC;AA9MD,4CAAoC;AAEpC,kCAA+B;AAC/B,sDAAoD;AACpD,uDAA+C;AAC/C,mDAEwB;AACxB,qEAEiC;AACjC,2DAAqD;AAErD;;;;;GAKG;AACH,SAAgB,wBAAwB,CAAC,IAAU,EAAE,OAAgB,KAAK;IACxE;;;;;OAKG;IACH,OAAO;QACL,CAAC,MAAM,CAAC,QAAQ,CAAC;YAEf,IAAI,WAAW,GAAgB,IAAI,CAAA;YACnC,OAAO,WAAW,IAAI,YAAK,CAAC,UAAU,CAAC,WAAW,CAAC,gBAAgB,CAAC,EAAE,CAAC;gBACrE,WAAW,GAAG,WAAW,CAAC,gBAAgB,CAAA;YAC5C,CAAC;YAED,OAAO;gBACL,IAAI;oBACF,IAAI,WAAW,IAAI,CAAC,CAAC,IAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,CAAC;wBACnD,IAAI,YAAK,CAAC,UAAU,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC;4BAC/C,WAAW,GAAG,WAAW,CAAC,YAAY,CAAA;wBACxC,CAAC;6BAAM,CAAC;4BACN,WAAW,GAAG,IAAI,CAAA;wBACpB,CAAC;oBACH,CAAC;oBAED,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;wBACzB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;oBACpC,CAAC;yBAAM,CAAC;wBACN,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAA;wBAClD,IAAI,YAAK,CAAC,UAAU,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC;4BAC/C,WAAW,GAAG,WAAW,CAAC,YAAY,CAAA;wBACxC,CAAC;6BAAM,CAAC;4BACN,WAAW,GAAG,IAAI,CAAA;wBACpB,CAAC;wBAED,OAAO,MAAM,CAAA;oBACf,CAAC;gBACH,CAAC;aACF,CAAA;QACH,CAAC;KACF,CAAA;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAgB,iCAAiC,CAAC,IAAU,EAAE,OAAgB,KAAK;IACjF;;;;;OAKG;IACH,OAAO;QACL,CAAC,MAAM,CAAC,QAAQ,CAAC;YAEf,IAAI,WAAW,GAAgB,IAAI,CAAA;YACnC,OAAO,WAAW,IAAI,YAAK,CAAC,mBAAmB,CAAC,WAAW,CAAC,gBAAgB,CAAC,EAAE,CAAC;gBAC9E,WAAW,GAAG,WAAW,CAAC,gBAAgB,CAAA;YAC5C,CAAC;YAED,OAAO;gBACL,IAAI;oBACF,IAAI,WAAW,IAAI,CAAC,CAAC,IAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,CAAC;wBACnD,IAAI,YAAK,CAAC,mBAAmB,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC;4BACxD,WAAW,GAAG,WAAW,CAAC,YAAY,CAAA;wBACxC,CAAC;6BAAM,CAAC;4BACN,WAAW,GAAG,IAAI,CAAA;wBACpB,CAAC;oBACH,CAAC;oBAED,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;wBACzB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;oBACpC,CAAC;yBAAM,CAAC;wBACN,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAA;wBAClD,IAAI,YAAK,CAAC,mBAAmB,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC;4BACxD,WAAW,GAAG,WAAW,CAAC,YAAY,CAAA;wBACxC,CAAC;6BAAM,CAAC;4BACN,WAAW,GAAG,IAAI,CAAA;wBACpB,CAAC;wBAED,OAAO,MAAM,CAAA;oBACf,CAAC;gBACH,CAAC;aACF,CAAA;QACH,CAAC;KACF,CAAA;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAgB,0BAA0B,CAAC,IAAU;IACnD;;;OAGG;IACH,IAAI,QAAQ,GAAG,EAAE,CAAA;IACjB,IAAI,IAAI,GAAG,IAAA,2CAA2B,EAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,YAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;IACtF,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;QACrB,QAAQ,IAAK,IAAa,CAAC,KAAK,CAAA;QAChC,IAAI,GAAG,IAAA,0CAA0B,EAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,YAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;IACzF,CAAC;IACD,OAAO,QAAQ,CAAA;AACjB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,UAAU,CAAC,IAAU,EAAE,MAAc;IACnD;;;;OAIG;IACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAA;IAChC,IAAI,MAAM,GAAG,MAAM,EAAE,CAAC;QACpB,MAAM,IAAI,6BAAc,EAAE,CAAA;IAC5B,CAAC;IAED;;;;;;;;OAQG;IACH,MAAM,KAAK,GAAG,MAAM,GAAG,MAAM,CAAA;IAC7B,MAAM,OAAO,GAAG,IAAA,oDAA2B,EAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAA;IAChE,MAAM,OAAO,GAAG,IAAA,6BAAW,EAAC,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,CAAA;IACxD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;IAC3B,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB;;WAEG;QACH,IAAA,mCAAe,EAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,CAAA;QAEnD;;;;;;;;;;;WAWG;QACH,KAAK,MAAM,KAAK,IAAI,aAAG,CAAC,SAAS,EAAE,CAAC;YAClC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;gBACzD,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAA;gBACzB,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAA;YAC3B,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;gBACrD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAA;gBACvB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,CAAA;YACzB,CAAC;YACD,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,IAAI,CAAC,CAAA;YAC9B,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,EAAE,CAAC;gBAChE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAA;YACnB,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,EAAE,CAAC;gBAC5D,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,IAAA,kDAAyB,EAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAA;IAClD,OAAO,OAAO,CAAA;AAChB,CAAC"}

package/node_modules/@oozcitak/dom/lib/algorithm/TraversalAlgorithm.d.ts

@@ -0,0 +1,8 @@
+import { FilterResult, NodeIterator, Node, TreeWalker } from "../dom/interfaces";
+/**
+ * Applies the filter to the given node and returns the result.
+ *
+ * @param traverser - the `NodeIterator` or `TreeWalker` instance
+ * @param node - the node to filter
+ */
+export declare function traversal_filter(traverser: NodeIterator | TreeWalker, node: Node): FilterResult;