@itwin/appui-abstract 4.0.0-dev.48 → 4.0.0-dev.51

package/lib/esm/appui-abstract/utils/filter/map.js.map

@@ -1 +1 @@
-{"version":3,"file":"map.js","sourceRoot":"","sources":["../../../../../src/appui-abstract/utils/filter/map.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;;AAyB/F;;GAEG;AACH,uBAAuB;AACvB,MAAM,OAAO,SAAS;IAWpB;QATS,QAAoB,GAAG,WAAW,CAAC;QAU1C,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,EAAiB,CAAC;QACrC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED,OAAO;QACL,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;IACpC,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;IAC3B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;IAC3B,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,oBAAyB;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,EAAE;YACT,OAAO,SAAS,CAAC;SAClB;QACD,IAAI,KAAK,iBAAe,EAAE;YACxB,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;SACzB;QACD,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ,EAAE,oBAAyB;QAC7C,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;YACnB,IAAI,KAAK,iBAAe,EAAE;gBACxB,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;aACzB;SACF;aAAM;YACL,IAAI,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;YAC5D,QAAQ,KAAK,EAAE;gBACb;oBACE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM;gBACR;oBACE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;oBACxB,MAAM;gBACR;oBACE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM;gBACR;oBACE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM;aACT;YACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACzB,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,GAAM;QACX,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,EAAE;YACT,OAAO,SAAS,CAAC;SAClB;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,OAAO,SAAS,CAAC;SAClB;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACjC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO,CAAC,UAA4D,EAAE,OAAa;QACjF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,OAAO,OAAO,EAAE;YACd,IAAI,OAAO,EAAE;gBACX,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;aAC5D;iBAAM;gBACL,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;aAC9C;YACD,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,EAAE;gBACzB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;aAC7D;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;SACxB;IACH,CAAC;IAED,IAAI;QACF,MAAM,GAAG,GAAG,IAAI,CAAC;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,QAAQ,GAAwB;YACpC,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACf,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI;gBACF,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,EAAE;oBACxB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;iBAC7D;gBACD,IAAI,OAAO,EAAE;oBACX,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;oBACnD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;oBACvB,OAAO,MAAM,CAAC;iBACf;qBAAM;oBACL,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;iBACzC;YACH,CAAC;SACF,CAAC;QACF,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,MAAM;QACJ,MAAM,GAAG,GAAG,IAAI,CAAC;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,QAAQ,GAAwB;YACpC,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACf,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI;gBACF,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,EAAE;oBACxB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;iBAC7D;gBACD,IAAI,OAAO,EAAE;oBACX,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;oBACrD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;oBACvB,OAAO,MAAM,CAAC;iBACf;qBAAM;oBACL,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;iBACzC;YACH,CAAC;SACF,CAAC;QACF,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OAAO;QACL,4DAA4D;QAC5D,MAAM,GAAG,GAAG,IAAI,CAAC;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,QAAQ,GAA6B;YACzC,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACf,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI;gBACF,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,EAAE;oBACxB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;iBAC7D;gBACD,IAAI,OAAO,EAAE;oBACX,MAAM,MAAM,GAA2B,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;oBAC5F,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;oBACvB,OAAO,MAAM,CAAC;iBACf;qBAAM;oBACL,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;iBACzC;YACH,CAAC;SACF,CAAC;QACF,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OA3MU,MAAM,CAAC,WAAW,EA2M3B,MAAM,CAAC,QAAQ,EAAC;QACf,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IAES,OAAO,CAAC,OAAe;QAC/B,IAAI,OAAO,IAAI,IAAI,CAAC,IAAI,EAAE;YACxB,OAAO;SACR;QACD,IAAI,OAAO,KAAK,CAAC,EAAE;YACjB,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,OAAO;SACR;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,OAAO,OAAO,IAAI,WAAW,GAAG,OAAO,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAC9B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACvB,WAAW,EAAE,CAAC;SACf;QACD,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC;QACzB,IAAI,OAAO,EAAE;YACX,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;SAC9B;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEO,YAAY,CAAC,IAAgB;QACnC,oBAAoB;QACpB,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;SACnB;aAAM,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACtB,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACjC;aAAM;YACL,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;SAC5B;QACD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEO,WAAW,CAAC,IAAgB;QAClC,oBAAoB;QACpB,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;SACnB;aAAM,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACtB,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACjC;aAAM;YACL,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;SACxB;QACD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEO,UAAU,CAAC,IAAgB;QACjC,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;YAC9C,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;SACxB;aAAM,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;YAC9B,sDAAsD;YACtD,qBAAqB;YACrB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBACd,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;aACjC;YACD,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;SACxB;aAAM,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;YAC9B,sDAAsD;YACtD,qBAAqB;YACrB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;gBAClB,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;aACjC;YACD,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,SAAS,CAAC;YAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;SAC5B;aAAM;YACL,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC/B,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACtB,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;aACjC;YACD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;YACzB,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;SACtB;QACD,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC1B,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEO,KAAK,CAAC,IAAgB,EAAE,KAAY;QAC1C,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACjC;QACD,IAAI,CAAC,KAAK,kBAAgB,IAAI,KAAK,kBAAgB,CAAC,EAAE;YACpD,OAAO;SACR;QAED,IAAI,KAAK,kBAAgB,EAAE;YACzB,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBACvB,OAAO;aACR;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAE/B,kBAAkB;YAClB,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBACvB,+DAA+D;gBAC/D,4CAA4C;gBAC5C,QAAS,CAAC,IAAI,GAAG,SAAS,CAAC;gBAC3B,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;aACvB;iBAAM;gBACL,iFAAiF;gBACjF,IAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC;gBAC1B,QAAS,CAAC,IAAI,GAAG,IAAI,CAAC;aACvB;YAED,0BAA0B;YAC1B,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;aAAM,IAAI,KAAK,kBAAgB,EAAE;YAChC,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBACvB,OAAO;aACR;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAE/B,mBAAmB;YACnB,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBACvB,2DAA2D;gBAC3D,4CAA4C;gBAC5C,IAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;aACnB;iBAAM;gBACL,iFAAiF;gBACjF,IAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC;gBAC1B,QAAS,CAAC,IAAI,GAAG,IAAI,CAAC;aACvB;YACD,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;YACtB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;IACH,CAAC;IAED,MAAM;QACJ,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;YAC1B,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACd,CAAC;IAED,QAAQ,CAAC,IAAc;QACrB,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE;YAC/B,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;SACtB;IACH,CAAC;CACF;AAED;;GAEG;AACH,uBAAuB;AACvB,MAAM,OAAO,QAAe,SAAQ,SAAe;IAKjD,YAAY,KAAa,EAAE,QAAgB,CAAC;QAC1C,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,KAAK,CAAC,KAAa;QACrB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,KAAK,CAAC,KAAa;QACrB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAEQ,GAAG,CAAC,GAAM,EAAE,qBAA0B;QAC7C,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,IAAI,CAAC,GAAM;QACT,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,eAAa,CAAC;IACpC,CAAC;IAEQ,GAAG,CAAC,GAAM,EAAE,KAAQ;QAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,gBAAc,CAAC;QACnC,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,SAAS;QACf,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE;YAC3B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;SACrD;IACH,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n// code extracted from https://github.com/microsoft/vscode/blob/master/src/vs/base/common/map.ts\n\n/* eslint-disable @typescript-eslint/explicit-member-accessibility */\n/* eslint-disable @itwin/prefer-get */\n/* eslint-disable no-restricted-syntax */\n/* eslint-disable @typescript-eslint/no-this-alias */\n\ninterface Item<K, V> {\n  previous: Item<K, V> | undefined;\n  next: Item<K, V> | undefined;\n  key: K;\n  value: V;\n}\n\n/**\n * @internal\n */\nexport const enum Touch {\n  None = 0,\n  AsOld = 1,\n  AsNew = 2\n}\n\n/**\n * @internal\n */\n// istanbul ignore next\nexport class LinkedMap<K, V> implements Map<K, V> {\n\n  readonly [Symbol.toStringTag] = \"LinkedMap\";\n\n  private _map: Map<K, Item<K, V>>;\n  private _head: Item<K, V> | undefined;\n  private _tail: Item<K, V> | undefined;\n  private _size: number;\n\n  private _state: number;\n\n  constructor() {\n    this._map = new Map<K, Item<K, V>>();\n    this._head = undefined;\n    this._tail = undefined;\n    this._size = 0;\n    this._state = 0;\n  }\n\n  clear(): void {\n    this._map.clear();\n    this._head = undefined;\n    this._tail = undefined;\n    this._size = 0;\n    this._state++;\n  }\n\n  isEmpty(): boolean {\n    return !this._head && !this._tail;\n  }\n\n  get size(): number {\n    return this._size;\n  }\n\n  get first(): V | undefined {\n    return this._head?.value;\n  }\n\n  get last(): V | undefined {\n    return this._tail?.value;\n  }\n\n  has(key: K): boolean {\n    return this._map.has(key);\n  }\n\n  get(key: K, touch: Touch = Touch.None): V | undefined {\n    const item = this._map.get(key);\n    if (!item) {\n      return undefined;\n    }\n    if (touch !== Touch.None) {\n      this.touch(item, touch);\n    }\n    return item.value;\n  }\n\n  set(key: K, value: V, touch: Touch = Touch.None): this {\n    let item = this._map.get(key);\n    if (item) {\n      item.value = value;\n      if (touch !== Touch.None) {\n        this.touch(item, touch);\n      }\n    } else {\n      item = { key, value, next: undefined, previous: undefined };\n      switch (touch) {\n        case Touch.None:\n          this.addItemLast(item);\n          break;\n        case Touch.AsOld:\n          this.addItemFirst(item);\n          break;\n        case Touch.AsNew:\n          this.addItemLast(item);\n          break;\n        default:\n          this.addItemLast(item);\n          break;\n      }\n      this._map.set(key, item);\n      this._size++;\n    }\n    return this;\n  }\n\n  delete(key: K): boolean {\n    return !!this.remove(key);\n  }\n\n  remove(key: K): V | undefined {\n    const item = this._map.get(key);\n    if (!item) {\n      return undefined;\n    }\n    this._map.delete(key);\n    this.removeItem(item);\n    this._size--;\n    return item.value;\n  }\n\n  shift(): V | undefined {\n    if (!this._head && !this._tail) {\n      return undefined;\n    }\n    if (!this._head || !this._tail) {\n      throw new Error(\"Invalid list\");\n    }\n    const item = this._head;\n    this._map.delete(item.key);\n    this.removeItem(item);\n    this._size--;\n    return item.value;\n  }\n\n  forEach(callbackfn: (value: V, key: K, map: LinkedMap<K, V>) => void, thisArg?: any): void {\n    const state = this._state;\n    let current = this._head;\n    while (current) {\n      if (thisArg) {\n        callbackfn.bind(thisArg)(current.value, current.key, this);\n      } else {\n        callbackfn(current.value, current.key, this);\n      }\n      if (this._state !== state) {\n        throw new Error(`LinkedMap got modified during iteration.`);\n      }\n      current = current.next;\n    }\n  }\n\n  keys(): IterableIterator<K> {\n    const map = this;\n    const state = this._state;\n    let current = this._head;\n    const iterator: IterableIterator<K> = {\n      [Symbol.iterator]() {\n        return iterator;\n      },\n      next(): IteratorResult<K> {\n        if (map._state !== state) {\n          throw new Error(`LinkedMap got modified during iteration.`);\n        }\n        if (current) {\n          const result = { value: current.key, done: false };\n          current = current.next;\n          return result;\n        } else {\n          return { value: undefined, done: true };\n        }\n      },\n    };\n    return iterator;\n  }\n\n  values(): IterableIterator<V> {\n    const map = this;\n    const state = this._state;\n    let current = this._head;\n    const iterator: IterableIterator<V> = {\n      [Symbol.iterator]() {\n        return iterator;\n      },\n      next(): IteratorResult<V> {\n        if (map._state !== state) {\n          throw new Error(`LinkedMap got modified during iteration.`);\n        }\n        if (current) {\n          const result = { value: current.value, done: false };\n          current = current.next;\n          return result;\n        } else {\n          return { value: undefined, done: true };\n        }\n      },\n    };\n    return iterator;\n  }\n\n  entries(): IterableIterator<[K, V]> {\n    // eslint-disable-next-line @typescript-eslint/no-this-alias\n    const map = this;\n    const state = this._state;\n    let current = this._head;\n    const iterator: IterableIterator<[K, V]> = {\n      [Symbol.iterator]() {\n        return iterator;\n      },\n      next(): IteratorResult<[K, V]> {\n        if (map._state !== state) {\n          throw new Error(`LinkedMap got modified during iteration.`);\n        }\n        if (current) {\n          const result: IteratorResult<[K, V]> = { value: [current.key, current.value], done: false };\n          current = current.next;\n          return result;\n        } else {\n          return { value: undefined, done: true };\n        }\n      },\n    };\n    return iterator;\n  }\n\n  [Symbol.iterator](): IterableIterator<[K, V]> {\n    return this.entries();\n  }\n\n  protected trimOld(newSize: number) {\n    if (newSize >= this.size) {\n      return;\n    }\n    if (newSize === 0) {\n      this.clear();\n      return;\n    }\n    let current = this._head;\n    let currentSize = this.size;\n    while (current && currentSize > newSize) {\n      this._map.delete(current.key);\n      current = current.next;\n      currentSize--;\n    }\n    this._head = current;\n    this._size = currentSize;\n    if (current) {\n      current.previous = undefined;\n    }\n    this._state++;\n  }\n\n  private addItemFirst(item: Item<K, V>): void {\n    // First time Insert\n    if (!this._head && !this._tail) {\n      this._tail = item;\n    } else if (!this._head) {\n      throw new Error(\"Invalid list\");\n    } else {\n      item.next = this._head;\n      this._head.previous = item;\n    }\n    this._head = item;\n    this._state++;\n  }\n\n  private addItemLast(item: Item<K, V>): void {\n    // First time Insert\n    if (!this._head && !this._tail) {\n      this._head = item;\n    } else if (!this._tail) {\n      throw new Error(\"Invalid list\");\n    } else {\n      item.previous = this._tail;\n      this._tail.next = item;\n    }\n    this._tail = item;\n    this._state++;\n  }\n\n  private removeItem(item: Item<K, V>): void {\n    if (item === this._head && item === this._tail) {\n      this._head = undefined;\n      this._tail = undefined;\n    } else if (item === this._head) {\n      // This can only happend if size === 1 which is handle\n      // by the case above.\n      if (!item.next) {\n        throw new Error(\"Invalid list\");\n      }\n      item.next.previous = undefined;\n      this._head = item.next;\n    } else if (item === this._tail) {\n      // This can only happend if size === 1 which is handle\n      // by the case above.\n      if (!item.previous) {\n        throw new Error(\"Invalid list\");\n      }\n      item.previous.next = undefined;\n      this._tail = item.previous;\n    } else {\n      const next = item.next;\n      const previous = item.previous;\n      if (!next || !previous) {\n        throw new Error(\"Invalid list\");\n      }\n      next.previous = previous;\n      previous.next = next;\n    }\n    item.next = undefined;\n    item.previous = undefined;\n    this._state++;\n  }\n\n  private touch(item: Item<K, V>, touch: Touch): void {\n    if (!this._head || !this._tail) {\n      throw new Error(\"Invalid list\");\n    }\n    if ((touch !== Touch.AsOld && touch !== Touch.AsNew)) {\n      return;\n    }\n\n    if (touch === Touch.AsOld) {\n      if (item === this._head) {\n        return;\n      }\n\n      const next = item.next;\n      const previous = item.previous;\n\n      // Unlink the item\n      if (item === this._tail) {\n        // previous must be defined since item was not head but is tail\n        // So there are more than on item in the map\n        previous!.next = undefined;\n        this._tail = previous;\n      } else {\n        // Both next and previous are not undefined since item was neither head nor tail.\n        next!.previous = previous;\n        previous!.next = next;\n      }\n\n      // Insert the node at head\n      item.previous = undefined;\n      item.next = this._head;\n      this._head.previous = item;\n      this._head = item;\n      this._state++;\n    } else if (touch === Touch.AsNew) {\n      if (item === this._tail) {\n        return;\n      }\n\n      const next = item.next;\n      const previous = item.previous;\n\n      // Unlink the item.\n      if (item === this._head) {\n        // next must be defined since item was not tail but is head\n        // So there are more than on item in the map\n        next!.previous = undefined;\n        this._head = next;\n      } else {\n        // Both next and previous are not undefined since item was neither head nor tail.\n        next!.previous = previous;\n        previous!.next = next;\n      }\n      item.next = undefined;\n      item.previous = this._tail;\n      this._tail.next = item;\n      this._tail = item;\n      this._state++;\n    }\n  }\n\n  toJSON(): [K, V][] {\n    const data: [K, V][] = [];\n\n    this.forEach((value, key) => {\n      data.push([key, value]);\n    });\n\n    return data;\n  }\n\n  fromJSON(data: [K, V][]): void {\n    this.clear();\n\n    for (const [key, value] of data) {\n      this.set(key, value);\n    }\n  }\n}\n\n/**\n * @internal\n */\n// istanbul ignore next\nexport class LRUCache<K, V> extends LinkedMap<K, V> {\n\n  private _limit: number;\n  private _ratio: number;\n\n  constructor(limit: number, ratio: number = 1) {\n    super();\n    this._limit = limit;\n    this._ratio = Math.min(Math.max(0, ratio), 1);\n  }\n\n  get limit(): number {\n    return this._limit;\n  }\n\n  set limit(limit: number) {\n    this._limit = limit;\n    this.checkTrim();\n  }\n\n  get ratio(): number {\n    return this._ratio;\n  }\n\n  set ratio(ratio: number) {\n    this._ratio = Math.min(Math.max(0, ratio), 1);\n    this.checkTrim();\n  }\n\n  override get(key: K, touch: Touch = Touch.AsNew): V | undefined {\n    return super.get(key, touch);\n  }\n\n  peek(key: K): V | undefined {\n    return super.get(key, Touch.None);\n  }\n\n  override set(key: K, value: V): this {\n    super.set(key, value, Touch.AsNew);\n    this.checkTrim();\n    return this;\n  }\n\n  private checkTrim() {\n    if (this.size > this._limit) {\n      this.trimOld(Math.round(this._limit * this._ratio));\n    }\n  }\n}\n"]}
+{"version":3,"file":"map.js","sourceRoot":"","sources":["../../../../../src/appui-abstract/utils/filter/map.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;;AAyB/F;;GAEG;AACH,uBAAuB;AACvB,MAAM,OAAO,SAAS;IAWpB;QATS,QAAoB,GAAG,WAAW,CAAC;QAU1C,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,EAAiB,CAAC;QACrC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED,OAAO;QACL,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;IACpC,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;IAC3B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;IAC3B,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,oBAAyB;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,EAAE;YACT,OAAO,SAAS,CAAC;SAClB;QACD,IAAI,KAAK,iBAAe,EAAE;YACxB,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;SACzB;QACD,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ,EAAE,oBAAyB;QAC7C,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;YACnB,IAAI,KAAK,iBAAe,EAAE;gBACxB,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;aACzB;SACF;aAAM;YACL,IAAI,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;YAC5D,QAAQ,KAAK,EAAE;gBACb;oBACE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM;gBACR;oBACE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;oBACxB,MAAM;gBACR;oBACE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM;gBACR;oBACE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM;aACT;YACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACzB,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,GAAM;QACX,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,EAAE;YACT,OAAO,SAAS,CAAC;SAClB;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,OAAO,SAAS,CAAC;SAClB;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACjC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO,CAAC,UAA4D,EAAE,OAAa;QACjF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,OAAO,OAAO,EAAE;YACd,IAAI,OAAO,EAAE;gBACX,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;aAC5D;iBAAM;gBACL,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;aAC9C;YACD,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,EAAE;gBACzB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;aAC7D;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;SACxB;IACH,CAAC;IAED,IAAI;QACF,MAAM,GAAG,GAAG,IAAI,CAAC;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,QAAQ,GAAwB;YACpC,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACf,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI;gBACF,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,EAAE;oBACxB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;iBAC7D;gBACD,IAAI,OAAO,EAAE;oBACX,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;oBACnD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;oBACvB,OAAO,MAAM,CAAC;iBACf;qBAAM;oBACL,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;iBACzC;YACH,CAAC;SACF,CAAC;QACF,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,MAAM;QACJ,MAAM,GAAG,GAAG,IAAI,CAAC;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,QAAQ,GAAwB;YACpC,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACf,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI;gBACF,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,EAAE;oBACxB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;iBAC7D;gBACD,IAAI,OAAO,EAAE;oBACX,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;oBACrD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;oBACvB,OAAO,MAAM,CAAC;iBACf;qBAAM;oBACL,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;iBACzC;YACH,CAAC;SACF,CAAC;QACF,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OAAO;QACL,4DAA4D;QAC5D,MAAM,GAAG,GAAG,IAAI,CAAC;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,QAAQ,GAA6B;YACzC,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACf,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI;gBACF,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,EAAE;oBACxB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;iBAC7D;gBACD,IAAI,OAAO,EAAE;oBACX,MAAM,MAAM,GAA2B,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;oBAC5F,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;oBACvB,OAAO,MAAM,CAAC;iBACf;qBAAM;oBACL,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;iBACzC;YACH,CAAC;SACF,CAAC;QACF,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OA3MU,MAAM,CAAC,WAAW,EA2M3B,MAAM,CAAC,QAAQ,EAAC;QACf,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IAES,OAAO,CAAC,OAAe;QAC/B,IAAI,OAAO,IAAI,IAAI,CAAC,IAAI,EAAE;YACxB,OAAO;SACR;QACD,IAAI,OAAO,KAAK,CAAC,EAAE;YACjB,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,OAAO;SACR;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,OAAO,OAAO,IAAI,WAAW,GAAG,OAAO,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAC9B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACvB,WAAW,EAAE,CAAC;SACf;QACD,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC;QACzB,IAAI,OAAO,EAAE;YACX,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;SAC9B;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEO,YAAY,CAAC,IAAgB;QACnC,oBAAoB;QACpB,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;SACnB;aAAM,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACtB,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACjC;aAAM;YACL,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;SAC5B;QACD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEO,WAAW,CAAC,IAAgB;QAClC,oBAAoB;QACpB,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;SACnB;aAAM,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACtB,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACjC;aAAM;YACL,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;SACxB;QACD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEO,UAAU,CAAC,IAAgB;QACjC,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;YAC9C,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;SACxB;aAAM,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;YAC9B,sDAAsD;YACtD,qBAAqB;YACrB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBACd,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;aACjC;YACD,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;SACxB;aAAM,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;YAC9B,sDAAsD;YACtD,qBAAqB;YACrB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;gBAClB,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;aACjC;YACD,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,SAAS,CAAC;YAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;SAC5B;aAAM;YACL,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC/B,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACtB,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;aACjC;YACD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;YACzB,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;SACtB;QACD,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC1B,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEO,KAAK,CAAC,IAAgB,EAAE,KAAY;QAC1C,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACjC;QACD,IAAI,CAAC,KAAK,kBAAgB,IAAI,KAAK,kBAAgB,CAAC,EAAE;YACpD,OAAO;SACR;QAED,IAAI,KAAK,kBAAgB,EAAE;YACzB,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBACvB,OAAO;aACR;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAE/B,kBAAkB;YAClB,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBACvB,+DAA+D;gBAC/D,4CAA4C;gBAC5C,QAAS,CAAC,IAAI,GAAG,SAAS,CAAC;gBAC3B,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;aACvB;iBAAM;gBACL,iFAAiF;gBACjF,IAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC;gBAC1B,QAAS,CAAC,IAAI,GAAG,IAAI,CAAC;aACvB;YAED,0BAA0B;YAC1B,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;aAAM,IAAI,KAAK,kBAAgB,EAAE;YAChC,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBACvB,OAAO;aACR;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAE/B,mBAAmB;YACnB,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBACvB,2DAA2D;gBAC3D,4CAA4C;gBAC5C,IAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;aACnB;iBAAM;gBACL,iFAAiF;gBACjF,IAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC;gBAC1B,QAAS,CAAC,IAAI,GAAG,IAAI,CAAC;aACvB;YACD,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;YACtB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;IACH,CAAC;IAED,MAAM;QACJ,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;YAC1B,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACd,CAAC;IAED,QAAQ,CAAC,IAAc;QACrB,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE;YAC/B,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;SACtB;IACH,CAAC;CACF;AAED;;GAEG;AACH,uBAAuB;AACvB,MAAM,OAAO,QAAe,SAAQ,SAAe;IAKjD,YAAY,KAAa,EAAE,QAAgB,CAAC;QAC1C,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,KAAK,CAAC,KAAa;QACrB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,KAAK,CAAC,KAAa;QACrB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAEQ,GAAG,CAAC,GAAM,EAAE,qBAA0B;QAC7C,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,IAAI,CAAC,GAAM;QACT,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,eAAa,CAAC;IACpC,CAAC;IAEQ,GAAG,CAAC,GAAM,EAAE,KAAQ;QAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,gBAAc,CAAC;QACnC,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,SAAS;QACf,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE;YAC3B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;SACrD;IACH,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n// code extracted from https://github.com/microsoft/vscode/blob/master/src/vs/base/common/map.ts\r\n\r\n/* eslint-disable @typescript-eslint/explicit-member-accessibility */\r\n/* eslint-disable @itwin/prefer-get */\r\n/* eslint-disable no-restricted-syntax */\r\n/* eslint-disable @typescript-eslint/no-this-alias */\r\n\r\ninterface Item<K, V> {\r\n  previous: Item<K, V> | undefined;\r\n  next: Item<K, V> | undefined;\r\n  key: K;\r\n  value: V;\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport const enum Touch {\r\n  None = 0,\r\n  AsOld = 1,\r\n  AsNew = 2\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\n// istanbul ignore next\r\nexport class LinkedMap<K, V> implements Map<K, V> {\r\n\r\n  readonly [Symbol.toStringTag] = \"LinkedMap\";\r\n\r\n  private _map: Map<K, Item<K, V>>;\r\n  private _head: Item<K, V> | undefined;\r\n  private _tail: Item<K, V> | undefined;\r\n  private _size: number;\r\n\r\n  private _state: number;\r\n\r\n  constructor() {\r\n    this._map = new Map<K, Item<K, V>>();\r\n    this._head = undefined;\r\n    this._tail = undefined;\r\n    this._size = 0;\r\n    this._state = 0;\r\n  }\r\n\r\n  clear(): void {\r\n    this._map.clear();\r\n    this._head = undefined;\r\n    this._tail = undefined;\r\n    this._size = 0;\r\n    this._state++;\r\n  }\r\n\r\n  isEmpty(): boolean {\r\n    return !this._head && !this._tail;\r\n  }\r\n\r\n  get size(): number {\r\n    return this._size;\r\n  }\r\n\r\n  get first(): V | undefined {\r\n    return this._head?.value;\r\n  }\r\n\r\n  get last(): V | undefined {\r\n    return this._tail?.value;\r\n  }\r\n\r\n  has(key: K): boolean {\r\n    return this._map.has(key);\r\n  }\r\n\r\n  get(key: K, touch: Touch = Touch.None): V | undefined {\r\n    const item = this._map.get(key);\r\n    if (!item) {\r\n      return undefined;\r\n    }\r\n    if (touch !== Touch.None) {\r\n      this.touch(item, touch);\r\n    }\r\n    return item.value;\r\n  }\r\n\r\n  set(key: K, value: V, touch: Touch = Touch.None): this {\r\n    let item = this._map.get(key);\r\n    if (item) {\r\n      item.value = value;\r\n      if (touch !== Touch.None) {\r\n        this.touch(item, touch);\r\n      }\r\n    } else {\r\n      item = { key, value, next: undefined, previous: undefined };\r\n      switch (touch) {\r\n        case Touch.None:\r\n          this.addItemLast(item);\r\n          break;\r\n        case Touch.AsOld:\r\n          this.addItemFirst(item);\r\n          break;\r\n        case Touch.AsNew:\r\n          this.addItemLast(item);\r\n          break;\r\n        default:\r\n          this.addItemLast(item);\r\n          break;\r\n      }\r\n      this._map.set(key, item);\r\n      this._size++;\r\n    }\r\n    return this;\r\n  }\r\n\r\n  delete(key: K): boolean {\r\n    return !!this.remove(key);\r\n  }\r\n\r\n  remove(key: K): V | undefined {\r\n    const item = this._map.get(key);\r\n    if (!item) {\r\n      return undefined;\r\n    }\r\n    this._map.delete(key);\r\n    this.removeItem(item);\r\n    this._size--;\r\n    return item.value;\r\n  }\r\n\r\n  shift(): V | undefined {\r\n    if (!this._head && !this._tail) {\r\n      return undefined;\r\n    }\r\n    if (!this._head || !this._tail) {\r\n      throw new Error(\"Invalid list\");\r\n    }\r\n    const item = this._head;\r\n    this._map.delete(item.key);\r\n    this.removeItem(item);\r\n    this._size--;\r\n    return item.value;\r\n  }\r\n\r\n  forEach(callbackfn: (value: V, key: K, map: LinkedMap<K, V>) => void, thisArg?: any): void {\r\n    const state = this._state;\r\n    let current = this._head;\r\n    while (current) {\r\n      if (thisArg) {\r\n        callbackfn.bind(thisArg)(current.value, current.key, this);\r\n      } else {\r\n        callbackfn(current.value, current.key, this);\r\n      }\r\n      if (this._state !== state) {\r\n        throw new Error(`LinkedMap got modified during iteration.`);\r\n      }\r\n      current = current.next;\r\n    }\r\n  }\r\n\r\n  keys(): IterableIterator<K> {\r\n    const map = this;\r\n    const state = this._state;\r\n    let current = this._head;\r\n    const iterator: IterableIterator<K> = {\r\n      [Symbol.iterator]() {\r\n        return iterator;\r\n      },\r\n      next(): IteratorResult<K> {\r\n        if (map._state !== state) {\r\n          throw new Error(`LinkedMap got modified during iteration.`);\r\n        }\r\n        if (current) {\r\n          const result = { value: current.key, done: false };\r\n          current = current.next;\r\n          return result;\r\n        } else {\r\n          return { value: undefined, done: true };\r\n        }\r\n      },\r\n    };\r\n    return iterator;\r\n  }\r\n\r\n  values(): IterableIterator<V> {\r\n    const map = this;\r\n    const state = this._state;\r\n    let current = this._head;\r\n    const iterator: IterableIterator<V> = {\r\n      [Symbol.iterator]() {\r\n        return iterator;\r\n      },\r\n      next(): IteratorResult<V> {\r\n        if (map._state !== state) {\r\n          throw new Error(`LinkedMap got modified during iteration.`);\r\n        }\r\n        if (current) {\r\n          const result = { value: current.value, done: false };\r\n          current = current.next;\r\n          return result;\r\n        } else {\r\n          return { value: undefined, done: true };\r\n        }\r\n      },\r\n    };\r\n    return iterator;\r\n  }\r\n\r\n  entries(): IterableIterator<[K, V]> {\r\n    // eslint-disable-next-line @typescript-eslint/no-this-alias\r\n    const map = this;\r\n    const state = this._state;\r\n    let current = this._head;\r\n    const iterator: IterableIterator<[K, V]> = {\r\n      [Symbol.iterator]() {\r\n        return iterator;\r\n      },\r\n      next(): IteratorResult<[K, V]> {\r\n        if (map._state !== state) {\r\n          throw new Error(`LinkedMap got modified during iteration.`);\r\n        }\r\n        if (current) {\r\n          const result: IteratorResult<[K, V]> = { value: [current.key, current.value], done: false };\r\n          current = current.next;\r\n          return result;\r\n        } else {\r\n          return { value: undefined, done: true };\r\n        }\r\n      },\r\n    };\r\n    return iterator;\r\n  }\r\n\r\n  [Symbol.iterator](): IterableIterator<[K, V]> {\r\n    return this.entries();\r\n  }\r\n\r\n  protected trimOld(newSize: number) {\r\n    if (newSize >= this.size) {\r\n      return;\r\n    }\r\n    if (newSize === 0) {\r\n      this.clear();\r\n      return;\r\n    }\r\n    let current = this._head;\r\n    let currentSize = this.size;\r\n    while (current && currentSize > newSize) {\r\n      this._map.delete(current.key);\r\n      current = current.next;\r\n      currentSize--;\r\n    }\r\n    this._head = current;\r\n    this._size = currentSize;\r\n    if (current) {\r\n      current.previous = undefined;\r\n    }\r\n    this._state++;\r\n  }\r\n\r\n  private addItemFirst(item: Item<K, V>): void {\r\n    // First time Insert\r\n    if (!this._head && !this._tail) {\r\n      this._tail = item;\r\n    } else if (!this._head) {\r\n      throw new Error(\"Invalid list\");\r\n    } else {\r\n      item.next = this._head;\r\n      this._head.previous = item;\r\n    }\r\n    this._head = item;\r\n    this._state++;\r\n  }\r\n\r\n  private addItemLast(item: Item<K, V>): void {\r\n    // First time Insert\r\n    if (!this._head && !this._tail) {\r\n      this._head = item;\r\n    } else if (!this._tail) {\r\n      throw new Error(\"Invalid list\");\r\n    } else {\r\n      item.previous = this._tail;\r\n      this._tail.next = item;\r\n    }\r\n    this._tail = item;\r\n    this._state++;\r\n  }\r\n\r\n  private removeItem(item: Item<K, V>): void {\r\n    if (item === this._head && item === this._tail) {\r\n      this._head = undefined;\r\n      this._tail = undefined;\r\n    } else if (item === this._head) {\r\n      // This can only happend if size === 1 which is handle\r\n      // by the case above.\r\n      if (!item.next) {\r\n        throw new Error(\"Invalid list\");\r\n      }\r\n      item.next.previous = undefined;\r\n      this._head = item.next;\r\n    } else if (item === this._tail) {\r\n      // This can only happend if size === 1 which is handle\r\n      // by the case above.\r\n      if (!item.previous) {\r\n        throw new Error(\"Invalid list\");\r\n      }\r\n      item.previous.next = undefined;\r\n      this._tail = item.previous;\r\n    } else {\r\n      const next = item.next;\r\n      const previous = item.previous;\r\n      if (!next || !previous) {\r\n        throw new Error(\"Invalid list\");\r\n      }\r\n      next.previous = previous;\r\n      previous.next = next;\r\n    }\r\n    item.next = undefined;\r\n    item.previous = undefined;\r\n    this._state++;\r\n  }\r\n\r\n  private touch(item: Item<K, V>, touch: Touch): void {\r\n    if (!this._head || !this._tail) {\r\n      throw new Error(\"Invalid list\");\r\n    }\r\n    if ((touch !== Touch.AsOld && touch !== Touch.AsNew)) {\r\n      return;\r\n    }\r\n\r\n    if (touch === Touch.AsOld) {\r\n      if (item === this._head) {\r\n        return;\r\n      }\r\n\r\n      const next = item.next;\r\n      const previous = item.previous;\r\n\r\n      // Unlink the item\r\n      if (item === this._tail) {\r\n        // previous must be defined since item was not head but is tail\r\n        // So there are more than on item in the map\r\n        previous!.next = undefined;\r\n        this._tail = previous;\r\n      } else {\r\n        // Both next and previous are not undefined since item was neither head nor tail.\r\n        next!.previous = previous;\r\n        previous!.next = next;\r\n      }\r\n\r\n      // Insert the node at head\r\n      item.previous = undefined;\r\n      item.next = this._head;\r\n      this._head.previous = item;\r\n      this._head = item;\r\n      this._state++;\r\n    } else if (touch === Touch.AsNew) {\r\n      if (item === this._tail) {\r\n        return;\r\n      }\r\n\r\n      const next = item.next;\r\n      const previous = item.previous;\r\n\r\n      // Unlink the item.\r\n      if (item === this._head) {\r\n        // next must be defined since item was not tail but is head\r\n        // So there are more than on item in the map\r\n        next!.previous = undefined;\r\n        this._head = next;\r\n      } else {\r\n        // Both next and previous are not undefined since item was neither head nor tail.\r\n        next!.previous = previous;\r\n        previous!.next = next;\r\n      }\r\n      item.next = undefined;\r\n      item.previous = this._tail;\r\n      this._tail.next = item;\r\n      this._tail = item;\r\n      this._state++;\r\n    }\r\n  }\r\n\r\n  toJSON(): [K, V][] {\r\n    const data: [K, V][] = [];\r\n\r\n    this.forEach((value, key) => {\r\n      data.push([key, value]);\r\n    });\r\n\r\n    return data;\r\n  }\r\n\r\n  fromJSON(data: [K, V][]): void {\r\n    this.clear();\r\n\r\n    for (const [key, value] of data) {\r\n      this.set(key, value);\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\n// istanbul ignore next\r\nexport class LRUCache<K, V> extends LinkedMap<K, V> {\r\n\r\n  private _limit: number;\r\n  private _ratio: number;\r\n\r\n  constructor(limit: number, ratio: number = 1) {\r\n    super();\r\n    this._limit = limit;\r\n    this._ratio = Math.min(Math.max(0, ratio), 1);\r\n  }\r\n\r\n  get limit(): number {\r\n    return this._limit;\r\n  }\r\n\r\n  set limit(limit: number) {\r\n    this._limit = limit;\r\n    this.checkTrim();\r\n  }\r\n\r\n  get ratio(): number {\r\n    return this._ratio;\r\n  }\r\n\r\n  set ratio(ratio: number) {\r\n    this._ratio = Math.min(Math.max(0, ratio), 1);\r\n    this.checkTrim();\r\n  }\r\n\r\n  override get(key: K, touch: Touch = Touch.AsNew): V | undefined {\r\n    return super.get(key, touch);\r\n  }\r\n\r\n  peek(key: K): V | undefined {\r\n    return super.get(key, Touch.None);\r\n  }\r\n\r\n  override set(key: K, value: V): this {\r\n    super.set(key, value, Touch.AsNew);\r\n    this.checkTrim();\r\n    return this;\r\n  }\r\n\r\n  private checkTrim() {\r\n    if (this.size > this._limit) {\r\n      this.trimOld(Math.round(this._limit * this._ratio));\r\n    }\r\n  }\r\n}\r\n"]}

package/lib/esm/appui-abstract/utils/filter/strings.d.ts

@@ -1,21 +1,21 @@
-/**
- * @internal
- */
-export declare function convertSimple2RegExpPattern(pattern: string): string;
-/**
- * @internal
- */
-export declare function isLowerAsciiLetter(code: number): boolean;
-/**
- * @internal
- */
-export declare function isUpperAsciiLetter(code: number): boolean;
-/**
- * @internal
- */
-export declare function equalsIgnoreCase(a: string, b: string): boolean;
-/**
- * @internal
- */
-export declare function startsWithIgnoreCase(str: string, candidate: string): boolean;
+/**
+ * @internal
+ */
+export declare function convertSimple2RegExpPattern(pattern: string): string;
+/**
+ * @internal
+ */
+export declare function isLowerAsciiLetter(code: number): boolean;
+/**
+ * @internal
+ */
+export declare function isUpperAsciiLetter(code: number): boolean;
+/**
+ * @internal
+ */
+export declare function equalsIgnoreCase(a: string, b: string): boolean;
+/**
+ * @internal
+ */
+export declare function startsWithIgnoreCase(str: string, candidate: string): boolean;
 //# sourceMappingURL=strings.d.ts.map

package/lib/esm/appui-abstract/utils/filter/strings.js

@@ -1,71 +1,71 @@
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-/**
- * @internal
- */
-export function convertSimple2RegExpPattern(pattern) {
-    return pattern.replace(/[\-\\\{\}\+\?\|\^\$\.\,\[\]\(\)\#\s]/g, "\\$&").replace(/[\*]/g, ".*");
-}
-/**
- * @internal
- */
-export function isLowerAsciiLetter(code) {
-    return code >= 97 /* a */ && code <= 122 /* z */;
-}
-/**
- * @internal
- */
-export function isUpperAsciiLetter(code) {
-    return code >= 65 /* A */ && code <= 90 /* Z */;
-}
-/**
- * @internal
- */
-function isAsciiLetter(code) {
-    return isLowerAsciiLetter(code) || isUpperAsciiLetter(code);
-}
-/**
- * @internal
- */
-export function equalsIgnoreCase(a, b) {
-    return a.length === b.length && doEqualsIgnoreCase(a, b);
-}
-/**
- * @internal
- */
-function doEqualsIgnoreCase(a, b, stopAt = a.length) {
-    for (let i = 0; i < stopAt; i++) {
-        const codeA = a.charCodeAt(i);
-        const codeB = b.charCodeAt(i);
-        if (codeA === codeB) {
-            continue;
-        }
-        // a-z A-Z
-        if (isAsciiLetter(codeA) && isAsciiLetter(codeB)) {
-            const diff = Math.abs(codeA - codeB);
-            if (diff !== 0 && diff !== 32) {
-                return false;
-            }
-        }
-        else {
-            // Any other char code
-            if (String.fromCharCode(codeA).toLowerCase() !== String.fromCharCode(codeB).toLowerCase()) {
-                return false;
-            }
-        }
-    }
-    return true;
-}
-/**
- * @internal
- */
-export function startsWithIgnoreCase(str, candidate) {
-    const candidateLength = candidate.length;
-    if (candidate.length > str.length) {
-        return false;
-    }
-    return doEqualsIgnoreCase(str, candidate, candidateLength);
-}
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/**
+ * @internal
+ */
+export function convertSimple2RegExpPattern(pattern) {
+    return pattern.replace(/[\-\\\{\}\+\?\|\^\$\.\,\[\]\(\)\#\s]/g, "\\$&").replace(/[\*]/g, ".*");
+}
+/**
+ * @internal
+ */
+export function isLowerAsciiLetter(code) {
+    return code >= 97 /* a */ && code <= 122 /* z */;
+}
+/**
+ * @internal
+ */
+export function isUpperAsciiLetter(code) {
+    return code >= 65 /* A */ && code <= 90 /* Z */;
+}
+/**
+ * @internal
+ */
+function isAsciiLetter(code) {
+    return isLowerAsciiLetter(code) || isUpperAsciiLetter(code);
+}
+/**
+ * @internal
+ */
+export function equalsIgnoreCase(a, b) {
+    return a.length === b.length && doEqualsIgnoreCase(a, b);
+}
+/**
+ * @internal
+ */
+function doEqualsIgnoreCase(a, b, stopAt = a.length) {
+    for (let i = 0; i < stopAt; i++) {
+        const codeA = a.charCodeAt(i);
+        const codeB = b.charCodeAt(i);
+        if (codeA === codeB) {
+            continue;
+        }
+        // a-z A-Z
+        if (isAsciiLetter(codeA) && isAsciiLetter(codeB)) {
+            const diff = Math.abs(codeA - codeB);
+            if (diff !== 0 && diff !== 32) {
+                return false;
+            }
+        }
+        else {
+            // Any other char code
+            if (String.fromCharCode(codeA).toLowerCase() !== String.fromCharCode(codeB).toLowerCase()) {
+                return false;
+            }
+        }
+    }
+    return true;
+}
+/**
+ * @internal
+ */
+export function startsWithIgnoreCase(str, candidate) {
+    const candidateLength = candidate.length;
+    if (candidate.length > str.length) {
+        return false;
+    }
+    return doEqualsIgnoreCase(str, candidate, candidateLength);
+}
 //# sourceMappingURL=strings.js.map

package/lib/esm/appui-abstract/utils/filter/strings.js.map

@@ -1 +1 @@
-{"version":3,"file":"strings.js","sourceRoot":"","sources":["../../../../../src/appui-abstract/utils/filter/strings.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAI/F;;GAEG;AACH,MAAM,UAAU,2BAA2B,CAAC,OAAe;IACzD,OAAO,OAAO,CAAC,OAAO,CAAC,uCAAuC,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AACjG,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,OAAO,IAAI,cAAc,IAAI,IAAI,eAAc,CAAC;AAClD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,OAAO,IAAI,cAAc,IAAI,IAAI,cAAc,CAAC;AAClD,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,kBAAkB,CAAC,IAAI,CAAC,IAAI,kBAAkB,CAAC,IAAI,CAAC,CAAC;AAC9D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAS,EAAE,CAAS;IACnD,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,CAAS,EAAE,CAAS,EAAE,MAAM,GAAG,CAAC,CAAC,MAAM;IACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;QAC/B,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAE9B,IAAI,KAAK,KAAK,KAAK,EAAE;YACnB,SAAS;SACV;QAED,UAAU;QACV,IAAI,aAAa,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE;YAChD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;YACrC,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,EAAE,EAAE;gBAC7B,OAAO,KAAK,CAAC;aACd;SACF;aAAM;YACL,sBAAsB;YACtB,IAAI,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,EAAE;gBACzF,OAAO,KAAK,CAAC;aACd;SACF;KACF;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,GAAW,EAAE,SAAiB;IACjE,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CAAC;IACzC,IAAI,SAAS,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE;QACjC,OAAO,KAAK,CAAC;KACd;IAED,OAAO,kBAAkB,CAAC,GAAG,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;AAC7D,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\nimport { CharCode } from \"./charCode\";\n\n/**\n * @internal\n */\nexport function convertSimple2RegExpPattern(pattern: string): string {\n  return pattern.replace(/[\\-\\\\\\{\\}\\+\\?\\|\\^\\$\\.\\,\\[\\]\\(\\)\\#\\s]/g, \"\\\\$&\").replace(/[\\*]/g, \".*\");\n}\n\n/**\n * @internal\n */\nexport function isLowerAsciiLetter(code: number): boolean {\n  return code >= CharCode.a && code <= CharCode.z;\n}\n\n/**\n * @internal\n */\nexport function isUpperAsciiLetter(code: number): boolean {\n  return code >= CharCode.A && code <= CharCode.Z;\n}\n\n/**\n * @internal\n */\nfunction isAsciiLetter(code: number): boolean {\n  return isLowerAsciiLetter(code) || isUpperAsciiLetter(code);\n}\n\n/**\n * @internal\n */\nexport function equalsIgnoreCase(a: string, b: string): boolean {\n  return a.length === b.length && doEqualsIgnoreCase(a, b);\n}\n\n/**\n * @internal\n */\nfunction doEqualsIgnoreCase(a: string, b: string, stopAt = a.length): boolean {\n  for (let i = 0; i < stopAt; i++) {\n    const codeA = a.charCodeAt(i);\n    const codeB = b.charCodeAt(i);\n\n    if (codeA === codeB) {\n      continue;\n    }\n\n    // a-z A-Z\n    if (isAsciiLetter(codeA) && isAsciiLetter(codeB)) {\n      const diff = Math.abs(codeA - codeB);\n      if (diff !== 0 && diff !== 32) {\n        return false;\n      }\n    } else {\n      // Any other char code\n      if (String.fromCharCode(codeA).toLowerCase() !== String.fromCharCode(codeB).toLowerCase()) {\n        return false;\n      }\n    }\n  }\n\n  return true;\n}\n\n/**\n * @internal\n */\nexport function startsWithIgnoreCase(str: string, candidate: string): boolean {\n  const candidateLength = candidate.length;\n  if (candidate.length > str.length) {\n    return false;\n  }\n\n  return doEqualsIgnoreCase(str, candidate, candidateLength);\n}\n"]}
+{"version":3,"file":"strings.js","sourceRoot":"","sources":["../../../../../src/appui-abstract/utils/filter/strings.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAI/F;;GAEG;AACH,MAAM,UAAU,2BAA2B,CAAC,OAAe;IACzD,OAAO,OAAO,CAAC,OAAO,CAAC,uCAAuC,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AACjG,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,OAAO,IAAI,cAAc,IAAI,IAAI,eAAc,CAAC;AAClD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,OAAO,IAAI,cAAc,IAAI,IAAI,cAAc,CAAC;AAClD,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,kBAAkB,CAAC,IAAI,CAAC,IAAI,kBAAkB,CAAC,IAAI,CAAC,CAAC;AAC9D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAS,EAAE,CAAS;IACnD,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,CAAS,EAAE,CAAS,EAAE,MAAM,GAAG,CAAC,CAAC,MAAM;IACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;QAC/B,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAE9B,IAAI,KAAK,KAAK,KAAK,EAAE;YACnB,SAAS;SACV;QAED,UAAU;QACV,IAAI,aAAa,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE;YAChD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;YACrC,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,EAAE,EAAE;gBAC7B,OAAO,KAAK,CAAC;aACd;SACF;aAAM;YACL,sBAAsB;YACtB,IAAI,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,EAAE;gBACzF,OAAO,KAAK,CAAC;aACd;SACF;KACF;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,GAAW,EAAE,SAAiB;IACjE,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CAAC;IACzC,IAAI,SAAS,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE;QACjC,OAAO,KAAK,CAAC;KACd;IAED,OAAO,kBAAkB,CAAC,GAAG,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;AAC7D,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\nimport { CharCode } from \"./charCode\";\r\n\r\n/**\r\n * @internal\r\n */\r\nexport function convertSimple2RegExpPattern(pattern: string): string {\r\n  return pattern.replace(/[\\-\\\\\\{\\}\\+\\?\\|\\^\\$\\.\\,\\[\\]\\(\\)\\#\\s]/g, \"\\\\$&\").replace(/[\\*]/g, \".*\");\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport function isLowerAsciiLetter(code: number): boolean {\r\n  return code >= CharCode.a && code <= CharCode.z;\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport function isUpperAsciiLetter(code: number): boolean {\r\n  return code >= CharCode.A && code <= CharCode.Z;\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nfunction isAsciiLetter(code: number): boolean {\r\n  return isLowerAsciiLetter(code) || isUpperAsciiLetter(code);\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport function equalsIgnoreCase(a: string, b: string): boolean {\r\n  return a.length === b.length && doEqualsIgnoreCase(a, b);\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nfunction doEqualsIgnoreCase(a: string, b: string, stopAt = a.length): boolean {\r\n  for (let i = 0; i < stopAt; i++) {\r\n    const codeA = a.charCodeAt(i);\r\n    const codeB = b.charCodeAt(i);\r\n\r\n    if (codeA === codeB) {\r\n      continue;\r\n    }\r\n\r\n    // a-z A-Z\r\n    if (isAsciiLetter(codeA) && isAsciiLetter(codeB)) {\r\n      const diff = Math.abs(codeA - codeB);\r\n      if (diff !== 0 && diff !== 32) {\r\n        return false;\r\n      }\r\n    } else {\r\n      // Any other char code\r\n      if (String.fromCharCode(codeA).toLowerCase() !== String.fromCharCode(codeB).toLowerCase()) {\r\n        return false;\r\n      }\r\n    }\r\n  }\r\n\r\n  return true;\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport function startsWithIgnoreCase(str: string, candidate: string): boolean {\r\n  const candidateLength = candidate.length;\r\n  if (candidate.length > str.length) {\r\n    return false;\r\n  }\r\n\r\n  return doEqualsIgnoreCase(str, candidate, candidateLength);\r\n}\r\n"]}

package/lib/esm/appui-abstract/utils/isLetter.d.ts

@@ -1,10 +1,10 @@
-/** @packageDocumentation
- * @module Utilities
- */
-/** Uses ECMAScript case transformation (toLowerCase() and toUpperCase()) to check whether or not a given character is a letter.
- * Beyond the English alphabet, this solution will also work for most Greek, Armenian, Cyrillic, and Latin characters.
- * But, it will not work for Chinese or Japanese characters since those languages do not have uppercase and lowercase letters.
- * @alpha
- */
-export declare function isLetter(char: string): boolean;
+/** @packageDocumentation
+ * @module Utilities
+ */
+/** Uses ECMAScript case transformation (toLowerCase() and toUpperCase()) to check whether or not a given character is a letter.
+ * Beyond the English alphabet, this solution will also work for most Greek, Armenian, Cyrillic, and Latin characters.
+ * But, it will not work for Chinese or Japanese characters since those languages do not have uppercase and lowercase letters.
+ * @alpha
+ */
+export declare function isLetter(char: string): boolean;
 //# sourceMappingURL=isLetter.d.ts.map

package/lib/esm/appui-abstract/utils/isLetter.js

@@ -1,16 +1,16 @@
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-/** @packageDocumentation
- * @module Utilities
- */
-/** Uses ECMAScript case transformation (toLowerCase() and toUpperCase()) to check whether or not a given character is a letter.
- * Beyond the English alphabet, this solution will also work for most Greek, Armenian, Cyrillic, and Latin characters.
- * But, it will not work for Chinese or Japanese characters since those languages do not have uppercase and lowercase letters.
- * @alpha
- */
-export function isLetter(char) {
-    return char.length === 1 && char.toLowerCase() !== char.toUpperCase();
-}
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Utilities
+ */
+/** Uses ECMAScript case transformation (toLowerCase() and toUpperCase()) to check whether or not a given character is a letter.
+ * Beyond the English alphabet, this solution will also work for most Greek, Armenian, Cyrillic, and Latin characters.
+ * But, it will not work for Chinese or Japanese characters since those languages do not have uppercase and lowercase letters.
+ * @alpha
+ */
+export function isLetter(char) {
+    return char.length === 1 && char.toLowerCase() !== char.toUpperCase();
+}
 //# sourceMappingURL=isLetter.js.map

package/lib/esm/appui-abstract/utils/isLetter.js.map

@@ -1 +1 @@
-{"version":3,"file":"isLetter.js","sourceRoot":"","sources":["../../../../src/appui-abstract/utils/isLetter.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC;AACxE,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Utilities\n */\n\n/** Uses ECMAScript case transformation (toLowerCase() and toUpperCase()) to check whether or not a given character is a letter.\n * Beyond the English alphabet, this solution will also work for most Greek, Armenian, Cyrillic, and Latin characters.\n * But, it will not work for Chinese or Japanese characters since those languages do not have uppercase and lowercase letters.\n * @alpha\n */\nexport function isLetter(char: string): boolean {\n  return char.length === 1 && char.toLowerCase() !== char.toUpperCase();\n}\n"]}
+{"version":3,"file":"isLetter.js","sourceRoot":"","sources":["../../../../src/appui-abstract/utils/isLetter.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC;AACxE,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Utilities\r\n */\r\n\r\n/** Uses ECMAScript case transformation (toLowerCase() and toUpperCase()) to check whether or not a given character is a letter.\r\n * Beyond the English alphabet, this solution will also work for most Greek, Armenian, Cyrillic, and Latin characters.\r\n * But, it will not work for Chinese or Japanese characters since those languages do not have uppercase and lowercase letters.\r\n * @alpha\r\n */\r\nexport function isLetter(char: string): boolean {\r\n  return char.length === 1 && char.toLowerCase() !== char.toUpperCase();\r\n}\r\n"]}

package/lib/esm/appui-abstract/utils/misc.d.ts

@@ -1,12 +1,12 @@
-/** @packageDocumentation
- * @module Utilities
- */
-/** Gets the class name for an object.
- * @internal
- */
-export declare const getClassName: (obj: any) => string;
-/** Gets category to use for adding Log entries
- *  @internal
- */
-export declare const loggerCategory: (obj: any) => string;
+/** @packageDocumentation
+ * @module Utilities
+ */
+/** Gets the class name for an object.
+ * @internal
+ */
+export declare const getClassName: (obj: any) => string;
+/** Gets category to use for adding Log entries
+ *  @internal
+ */
+export declare const loggerCategory: (obj: any) => string;
 //# sourceMappingURL=misc.d.ts.map

package/lib/esm/appui-abstract/utils/misc.js

@@ -1,32 +1,32 @@
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-/** @packageDocumentation
- * @module Utilities
- */
-/** Gets the class name for an object.
- * @internal
- */
-export const getClassName = (obj) => {
-    let className = "";
-    if (obj) {
-        if (obj.name)
-            className = obj.name;
-        else {
-            // istanbul ignore else
-            if (obj.constructor && obj.constructor.name)
-                className = obj.constructor.name;
-        }
-    }
-    return className;
-};
-/** Gets category to use for adding Log entries
- *  @internal
- */
-export const loggerCategory = (obj) => {
-    const className = getClassName(obj);
-    const category = `appui-abstract${(className ? `.${className}` : "")}`;
-    return category;
-};
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Utilities
+ */
+/** Gets the class name for an object.
+ * @internal
+ */
+export const getClassName = (obj) => {
+    let className = "";
+    if (obj) {
+        if (obj.name)
+            className = obj.name;
+        else {
+            // istanbul ignore else
+            if (obj.constructor && obj.constructor.name)
+                className = obj.constructor.name;
+        }
+    }
+    return className;
+};
+/** Gets category to use for adding Log entries
+ *  @internal
+ */
+export const loggerCategory = (obj) => {
+    const className = getClassName(obj);
+    const category = `appui-abstract${(className ? `.${className}` : "")}`;
+    return category;
+};
 //# sourceMappingURL=misc.js.map

package/lib/esm/appui-abstract/utils/misc.js.map

@@ -1 +1 @@
-{"version":3,"file":"misc.js","sourceRoot":"","sources":["../../../../src/appui-abstract/utils/misc.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,GAAQ,EAAU,EAAE;IAC/C,IAAI,SAAS,GAAG,EAAE,CAAC;IAEnB,IAAI,GAAG,EAAE;QACP,IAAI,GAAG,CAAC,IAAI;YACV,SAAS,GAAG,GAAG,CAAC,IAAI,CAAC;aAClB;YACH,uBAAuB;YACvB,IAAI,GAAG,CAAC,WAAW,IAAI,GAAG,CAAC,WAAW,CAAC,IAAI;gBACzC,SAAS,GAAG,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC;SACpC;KACF;IAED,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,GAAQ,EAAU,EAAE;IACjD,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;IACvE,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Utilities\n */\n\n/** Gets the class name for an object.\n * @internal\n */\nexport const getClassName = (obj: any): string => {\n  let className = \"\";\n\n  if (obj) {\n    if (obj.name)\n      className = obj.name;\n    else {\n      // istanbul ignore else\n      if (obj.constructor && obj.constructor.name)\n        className = obj.constructor.name;\n    }\n  }\n\n  return className;\n};\n\n/** Gets category to use for adding Log entries\n *  @internal\n */\nexport const loggerCategory = (obj: any): string => {\n  const className = getClassName(obj);\n  const category = `appui-abstract${(className ? `.${className}` : \"\")}`;\n  return category;\n};\n\n"]}
+{"version":3,"file":"misc.js","sourceRoot":"","sources":["../../../../src/appui-abstract/utils/misc.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,GAAQ,EAAU,EAAE;IAC/C,IAAI,SAAS,GAAG,EAAE,CAAC;IAEnB,IAAI,GAAG,EAAE;QACP,IAAI,GAAG,CAAC,IAAI;YACV,SAAS,GAAG,GAAG,CAAC,IAAI,CAAC;aAClB;YACH,uBAAuB;YACvB,IAAI,GAAG,CAAC,WAAW,IAAI,GAAG,CAAC,WAAW,CAAC,IAAI;gBACzC,SAAS,GAAG,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC;SACpC;KACF;IAED,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,GAAQ,EAAU,EAAE;IACjD,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;IACvE,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Utilities\r\n */\r\n\r\n/** Gets the class name for an object.\r\n * @internal\r\n */\r\nexport const getClassName = (obj: any): string => {\r\n  let className = \"\";\r\n\r\n  if (obj) {\r\n    if (obj.name)\r\n      className = obj.name;\r\n    else {\r\n      // istanbul ignore else\r\n      if (obj.constructor && obj.constructor.name)\r\n        className = obj.constructor.name;\r\n    }\r\n  }\r\n\r\n  return className;\r\n};\r\n\r\n/** Gets category to use for adding Log entries\r\n *  @internal\r\n */\r\nexport const loggerCategory = (obj: any): string => {\r\n  const className = getClassName(obj);\r\n  const category = `appui-abstract${(className ? `.${className}` : \"\")}`;\r\n  return category;\r\n};\r\n\r\n"]}