@connecttomahdi/rxdb 17.0.0-beta.17 → 17.1.0

package/dist/cjs/plugins/utils/utils-object.js.map

@@ -1 +1 @@
-{"version":3,"file":"utils-object.js","names":["deepFreeze","o","Object","freeze","getOwnPropertyNames","forEach","prop","prototype","hasOwnProperty","call","isFrozen","objectPathMonad","objectPath","split","splitLength","length","obj","currentVal","i","subPath","getFromObjectOrThrow","key","val","Error","flattenObject","ob","toReturn","flatObject","x","flatClone","assign","firstPropertyNameOfObject","keys","firstPropertyValueOfObject","sortObject","noArraySort","Array","isArray","sort","a","b","localeCompare","map","out","deepClone","src","Blob","ret","dest","clone","exports","overwriteGetterForCaching","getterName","value","defineProperty","get","hasDeepProperty","property","has","find","item","findUndefinedPath","parentPath","currentPath","result"],"sources":["../../../../src/plugins/utils/utils-object.ts"],"sourcesContent":["import type {\r\n    DeepReadonlyObject\r\n} from '../../types/index.d.ts';\r\n\r\nexport function deepFreeze<T>(o: T): T {\r\n    Object.freeze(o);\r\n    Object.getOwnPropertyNames(o).forEach(function (prop) {\r\n        if (\r\n            Object.prototype.hasOwnProperty.call(o, prop) &&\r\n            (o as any)[prop] !== null &&\r\n            (\r\n                typeof (o as any)[prop] === 'object'\r\n                ||\r\n                typeof (o as any)[prop] === 'function'\r\n            ) &&\r\n            !Object.isFrozen((o as any)[prop])\r\n        ) {\r\n            deepFreeze((o as any)[prop]);\r\n        }\r\n    });\r\n    return o;\r\n}\r\n\r\n\r\n\r\n/**\r\n * To get specific nested path values from objects,\r\n * RxDB normally uses the 'dot-prop' npm module.\r\n * But when performance is really relevant, this is not fast enough.\r\n * Instead we use a monad that can prepare some stuff up front\r\n * and we can reuse the generated function.\r\n */\r\nexport type ObjectPathMonadFunction<T, R = any> = (obj: T) => R;\r\nexport function objectPathMonad<T, R = any>(objectPath: string): ObjectPathMonadFunction<T, R> {\r\n    const split = objectPath.split('.');\r\n\r\n    // reuse this variable for better performance.\r\n    const splitLength = split.length;\r\n\r\n    /**\r\n     * Performance shortcut,\r\n     * if no nested path is used,\r\n     * directly return the field of the object.\r\n     */\r\n    if (splitLength === 1) {\r\n        return (obj: T) => (obj as any)[objectPath];\r\n    }\r\n\r\n\r\n    return (obj: T) => {\r\n        let currentVal: any = obj;\r\n        for (let i = 0; i < splitLength; ++i) {\r\n            const subPath = split[i];\r\n            currentVal = currentVal[subPath];\r\n            if (typeof currentVal === 'undefined') {\r\n                return currentVal;\r\n            }\r\n        }\r\n        return currentVal;\r\n    };\r\n}\r\n\r\n\r\nexport function getFromObjectOrThrow<V>(\r\n    obj: { [k: string]: V; },\r\n    key: string\r\n): V {\r\n    const val = obj[key];\r\n    if (!val) {\r\n        throw new Error('missing value from object ' + key);\r\n    }\r\n    return val;\r\n}\r\n\r\n/**\r\n * returns a flattened object\r\n * @link https://gist.github.com/penguinboy/762197\r\n */\r\nexport function flattenObject(ob: any) {\r\n    const toReturn: any = {};\r\n\r\n    for (const i in ob) {\r\n        if (!Object.prototype.hasOwnProperty.call(ob, i)) continue;\r\n        if ((typeof ob[i]) === 'object') {\r\n            const flatObject = flattenObject(ob[i]);\r\n            for (const x in flatObject) {\r\n                if (!Object.prototype.hasOwnProperty.call(flatObject, x)) continue;\r\n                toReturn[i + '.' + x] = flatObject[x];\r\n            }\r\n        } else {\r\n            toReturn[i] = ob[i];\r\n        }\r\n    }\r\n    return toReturn;\r\n}\r\n\r\n\r\n/**\r\n * does a flat copy on the objects,\r\n * is about 3 times faster than using deepClone\r\n * @link https://jsperf.com/object-rest-spread-vs-clone/2\r\n */\r\nexport function flatClone<T>(obj: T | DeepReadonlyObject<T> | Readonly<T>): T {\r\n    return Object.assign({}, obj) as any;\r\n}\r\n\r\n/**\r\n * @link https://stackoverflow.com/a/11509718/3443137\r\n */\r\nexport function firstPropertyNameOfObject(obj: any): string {\r\n    return Object.keys(obj)[0];\r\n}\r\nexport function firstPropertyValueOfObject<T>(obj: { [k: string]: T; }): T {\r\n    const key = Object.keys(obj)[0];\r\n    return obj[key];\r\n}\r\n\r\n\r\n/**\r\n * deep-sort an object so its attributes are in lexical order.\r\n * Also sorts the arrays inside of the object if no-array-sort not set\r\n */\r\nexport function sortObject(obj: any, noArraySort = false): any {\r\n    if (!obj) return obj; // do not sort null, false or undefined\r\n\r\n    // array\r\n    if (!noArraySort && Array.isArray(obj)) {\r\n        return obj\r\n            .sort((a, b) => {\r\n                if (typeof a === 'string' && typeof b === 'string')\r\n                    return a.localeCompare(b);\r\n\r\n                if (typeof a === 'object') return 1;\r\n                else return -1;\r\n            })\r\n            .map(i => sortObject(i, noArraySort));\r\n    }\r\n\r\n    // object\r\n    // array is also of type object\r\n    if (typeof obj === 'object' && !Array.isArray(obj)) {\r\n        const out: any = {};\r\n        Object.keys(obj)\r\n            .sort((a, b) => a.localeCompare(b))\r\n            .forEach(key => {\r\n                out[key] = sortObject(obj[key], noArraySort);\r\n            });\r\n        return out;\r\n    }\r\n\r\n    // everything else\r\n    return obj;\r\n}\r\n\r\n\r\n\r\n/**\r\n * Deep clone a plain json object.\r\n * Does not work with recursive stuff\r\n * or non-plain-json.\r\n * IMPORTANT: Performance of this is very important,\r\n * do not change it without running performance tests!\r\n *\r\n * @link https://github.com/zxdong262/deep-copy/blob/master/src/index.ts\r\n */\r\nfunction deepClone<T>(src: T | DeepReadonlyObject<T>): T {\r\n    if (!src) {\r\n        return src;\r\n    }\r\n    if (src === null || typeof (src) !== 'object') {\r\n        return src;\r\n    }\r\n    // Blobs are immutable — pass through without cloning, otherwise it gets converted into a normal object, which breaks things.\r\n    if (typeof Blob !== 'undefined' && src instanceof Blob) {\r\n        return src as any;\r\n    }\r\n    if (Array.isArray(src)) {\r\n        const ret = new Array(src.length);\r\n        let i = ret.length;\r\n        while (i--) {\r\n            ret[i] = deepClone(src[i]);\r\n        }\r\n        return ret as any;\r\n    }\r\n    const dest: any = {};\r\n    // eslint-disable-next-line guard-for-in\r\n    for (const key in src) {\r\n        dest[key] = deepClone(src[key]);\r\n    }\r\n    return dest;\r\n}\r\nexport const clone = deepClone;\r\n\r\n\r\n\r\n/**\r\n * overwrites the getter with the actual value\r\n * Mostly used for caching stuff on the first run\r\n */\r\nexport function overwriteGetterForCaching<ValueType = any>(\r\n    obj: any,\r\n    getterName: string,\r\n    value: ValueType\r\n): ValueType {\r\n    Object.defineProperty(obj, getterName, {\r\n        get: function () {\r\n            return value;\r\n        }\r\n    });\r\n    return value;\r\n}\r\n\r\n\r\nexport function hasDeepProperty(obj: any, property: string): boolean {\r\n    if (obj.hasOwnProperty(property)) {\r\n        return true;\r\n    }\r\n\r\n    if (Array.isArray(obj)) {\r\n        const has = !!obj.find(item => hasDeepProperty(item, property));\r\n        return has;\r\n    }\r\n\r\n    // Recursively check for property in nested objects\r\n    for (const key in obj) {\r\n        if (typeof obj[key] === 'object' && obj[key] !== null) {\r\n            if (hasDeepProperty(obj[key], property)) {\r\n                return true;\r\n            }\r\n        }\r\n    }\r\n\r\n    // Return false if 'foobar' is not found at any level\r\n    return false;\r\n}\r\n\r\n\r\n/**\r\n * Deeply checks if an object contains any property\r\n * with the value of undefined\r\n * If yes, returns the path to it.\r\n */\r\nexport function findUndefinedPath(obj: unknown, parentPath = ''): string | false {\r\n    // If `obj` is not an object or is null, we can't go deeper, so return false\r\n    if (typeof obj !== \"object\" || obj === null) {\r\n        return false;\r\n    }\r\n\r\n    for (const key of Object.keys(obj)) {\r\n        const value = (obj as Record<string, unknown>)[key];\r\n        // Build the full path. For the root level, it's just the key;\r\n        // for nested levels, prepend the parent path followed by a dot.\r\n        const currentPath = parentPath ? `${parentPath}.${key}` : key;\r\n\r\n        // If the value is undefined, return the path\r\n        if (typeof value === 'undefined') {\r\n            return currentPath;\r\n        }\r\n\r\n        // If the value is an object, recurse to check deeper\r\n        if (typeof value === \"object\" && value !== null) {\r\n            const result = findUndefinedPath(value, currentPath);\r\n            // If a path was found in the nested object, return it\r\n            if (result) {\r\n                return result;\r\n            }\r\n        }\r\n    }\r\n\r\n    // If no property with undefined was found\r\n    return false;\r\n}\r\n"],"mappings":";;;;;;;;;;;;;;;;;AAIO,SAASA,UAAUA,CAAIC,CAAI,EAAK;EACnCC,MAAM,CAACC,MAAM,CAACF,CAAC,CAAC;EAChBC,MAAM,CAACE,mBAAmB,CAACH,CAAC,CAAC,CAACI,OAAO,CAAC,UAAUC,IAAI,EAAE;IAClD,IACIJ,MAAM,CAACK,SAAS,CAACC,cAAc,CAACC,IAAI,CAACR,CAAC,EAAEK,IAAI,CAAC,IAC5CL,CAAC,CAASK,IAAI,CAAC,KAAK,IAAI,KAErB,OAAQL,CAAC,CAASK,IAAI,CAAC,KAAK,QAAQ,IAEpC,OAAQL,CAAC,CAASK,IAAI,CAAC,KAAK,UAAU,CACzC,IACD,CAACJ,MAAM,CAACQ,QAAQ,CAAET,CAAC,CAASK,IAAI,CAAC,CAAC,EACpC;MACEN,UAAU,CAAEC,CAAC,CAASK,IAAI,CAAC,CAAC;IAChC;EACJ,CAAC,CAAC;EACF,OAAOL,CAAC;AACZ;;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO,SAASU,eAAeA,CAAaC,UAAkB,EAAiC;EAC3F,IAAMC,KAAK,GAAGD,UAAU,CAACC,KAAK,CAAC,GAAG,CAAC;;EAEnC;EACA,IAAMC,WAAW,GAAGD,KAAK,CAACE,MAAM;;EAEhC;AACJ;AACA;AACA;AACA;EACI,IAAID,WAAW,KAAK,CAAC,EAAE;IACnB,OAAQE,GAAM,IAAMA,GAAG,CAASJ,UAAU,CAAC;EAC/C;EAGA,OAAQI,GAAM,IAAK;IACf,IAAIC,UAAe,GAAGD,GAAG;IACzB,KAAK,IAAIE,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGJ,WAAW,EAAE,EAAEI,CAAC,EAAE;MAClC,IAAMC,OAAO,GAAGN,KAAK,CAACK,CAAC,CAAC;MACxBD,UAAU,GAAGA,UAAU,CAACE,OAAO,CAAC;MAChC,IAAI,OAAOF,UAAU,KAAK,WAAW,EAAE;QACnC,OAAOA,UAAU;MACrB;IACJ;IACA,OAAOA,UAAU;EACrB,CAAC;AACL;AAGO,SAASG,oBAAoBA,CAChCJ,GAAwB,EACxBK,GAAW,EACV;EACD,IAAMC,GAAG,GAAGN,GAAG,CAACK,GAAG,CAAC;EACpB,IAAI,CAACC,GAAG,EAAE;IACN,MAAM,IAAIC,KAAK,CAAC,4BAA4B,GAAGF,GAAG,CAAC;EACvD;EACA,OAAOC,GAAG;AACd;;AAEA;AACA;AACA;AACA;AACO,SAASE,aAAaA,CAACC,EAAO,EAAE;EACnC,IAAMC,QAAa,GAAG,CAAC,CAAC;EAExB,KAAK,IAAMR,CAAC,IAAIO,EAAE,EAAE;IAChB,IAAI,CAACvB,MAAM,CAACK,SAAS,CAACC,cAAc,CAACC,IAAI,CAACgB,EAAE,EAAEP,CAAC,CAAC,EAAE;IAClD,IAAK,OAAOO,EAAE,CAACP,CAAC,CAAC,KAAM,QAAQ,EAAE;MAC7B,IAAMS,UAAU,GAAGH,aAAa,CAACC,EAAE,CAACP,CAAC,CAAC,CAAC;MACvC,KAAK,IAAMU,CAAC,IAAID,UAAU,EAAE;QACxB,IAAI,CAACzB,MAAM,CAACK,SAAS,CAACC,cAAc,CAACC,IAAI,CAACkB,UAAU,EAAEC,CAAC,CAAC,EAAE;QAC1DF,QAAQ,CAACR,CAAC,GAAG,GAAG,GAAGU,CAAC,CAAC,GAAGD,UAAU,CAACC,CAAC,CAAC;MACzC;IACJ,CAAC,MAAM;MACHF,QAAQ,CAACR,CAAC,CAAC,GAAGO,EAAE,CAACP,CAAC,CAAC;IACvB;EACJ;EACA,OAAOQ,QAAQ;AACnB;;AAGA;AACA;AACA;AACA;AACA;AACO,SAASG,SAASA,CAAIb,GAA4C,EAAK;EAC1E,OAAOd,MAAM,CAAC4B,MAAM,CAAC,CAAC,CAAC,EAAEd,GAAG,CAAC;AACjC;;AAEA;AACA;AACA;AACO,SAASe,yBAAyBA,CAACf,GAAQ,EAAU;EACxD,OAAOd,MAAM,CAAC8B,IAAI,CAAChB,GAAG,CAAC,CAAC,CAAC,CAAC;AAC9B;AACO,SAASiB,0BAA0BA,CAAIjB,GAAwB,EAAK;EACvE,IAAMK,GAAG,GAAGnB,MAAM,CAAC8B,IAAI,CAAChB,GAAG,CAAC,CAAC,CAAC,CAAC;EAC/B,OAAOA,GAAG,CAACK,GAAG,CAAC;AACnB;;AAGA;AACA;AACA;AACA;AACO,SAASa,UAAUA,CAAClB,GAAQ,EAAEmB,WAAW,GAAG,KAAK,EAAO;EAC3D,IAAI,CAACnB,GAAG,EAAE,OAAOA,GAAG,CAAC,CAAC;;EAEtB;EACA,IAAI,CAACmB,WAAW,IAAIC,KAAK,CAACC,OAAO,CAACrB,GAAG,CAAC,EAAE;IACpC,OAAOA,GAAG,CACLsB,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAK;MACZ,IAAI,OAAOD,CAAC,KAAK,QAAQ,IAAI,OAAOC,CAAC,KAAK,QAAQ,EAC9C,OAAOD,CAAC,CAACE,aAAa,CAACD,CAAC,CAAC;MAE7B,IAAI,OAAOD,CAAC,KAAK,QAAQ,EAAE,OAAO,CAAC,CAAC,KAC/B,OAAO,CAAC,CAAC;IAClB,CAAC,CAAC,CACDG,GAAG,CAACxB,CAAC,IAAIgB,UAAU,CAAChB,CAAC,EAAEiB,WAAW,CAAC,CAAC;EAC7C;;EAEA;EACA;EACA,IAAI,OAAOnB,GAAG,KAAK,QAAQ,IAAI,CAACoB,KAAK,CAACC,OAAO,CAACrB,GAAG,CAAC,EAAE;IAChD,IAAM2B,GAAQ,GAAG,CAAC,CAAC;IACnBzC,MAAM,CAAC8B,IAAI,CAAChB,GAAG,CAAC,CACXsB,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAACE,aAAa,CAACD,CAAC,CAAC,CAAC,CAClCnC,OAAO,CAACgB,GAAG,IAAI;MACZsB,GAAG,CAACtB,GAAG,CAAC,GAAGa,UAAU,CAAClB,GAAG,CAACK,GAAG,CAAC,EAAEc,WAAW,CAAC;IAChD,CAAC,CAAC;IACN,OAAOQ,GAAG;EACd;;EAEA;EACA,OAAO3B,GAAG;AACd;;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS4B,SAASA,CAAIC,GAA8B,EAAK;EACrD,IAAI,CAACA,GAAG,EAAE;IACN,OAAOA,GAAG;EACd;EACA,IAAIA,GAAG,KAAK,IAAI,IAAI,OAAQA,GAAI,KAAK,QAAQ,EAAE;IAC3C,OAAOA,GAAG;EACd;EACA;EACA,IAAI,OAAOC,IAAI,KAAK,WAAW,IAAID,GAAG,YAAYC,IAAI,EAAE;IACpD,OAAOD,GAAG;EACd;EACA,IAAIT,KAAK,CAACC,OAAO,CAACQ,GAAG,CAAC,EAAE;IACpB,IAAME,GAAG,GAAG,IAAIX,KAAK,CAACS,GAAG,CAAC9B,MAAM,CAAC;IACjC,IAAIG,CAAC,GAAG6B,GAAG,CAAChC,MAAM;IAClB,OAAOG,CAAC,EAAE,EAAE;MACR6B,GAAG,CAAC7B,CAAC,CAAC,GAAG0B,SAAS,CAACC,GAAG,CAAC3B,CAAC,CAAC,CAAC;IAC9B;IACA,OAAO6B,GAAG;EACd;EACA,IAAMC,IAAS,GAAG,CAAC,CAAC;EACpB;EACA,KAAK,IAAM3B,GAAG,IAAIwB,GAAG,EAAE;IACnBG,IAAI,CAAC3B,GAAG,CAAC,GAAGuB,SAAS,CAACC,GAAG,CAACxB,GAAG,CAAC,CAAC;EACnC;EACA,OAAO2B,IAAI;AACf;AACO,IAAMC,KAAK,GAAAC,OAAA,CAAAD,KAAA,GAAGL,SAAS;;AAI9B;AACA;AACA;AACA;AACO,SAASO,yBAAyBA,CACrCnC,GAAQ,EACRoC,UAAkB,EAClBC,KAAgB,EACP;EACTnD,MAAM,CAACoD,cAAc,CAACtC,GAAG,EAAEoC,UAAU,EAAE;IACnCG,GAAG,EAAE,SAAAA,CAAA,EAAY;MACb,OAAOF,KAAK;IAChB;EACJ,CAAC,CAAC;EACF,OAAOA,KAAK;AAChB;AAGO,SAASG,eAAeA,CAACxC,GAAQ,EAAEyC,QAAgB,EAAW;EACjE,IAAIzC,GAAG,CAACR,cAAc,CAACiD,QAAQ,CAAC,EAAE;IAC9B,OAAO,IAAI;EACf;EAEA,IAAIrB,KAAK,CAACC,OAAO,CAACrB,GAAG,CAAC,EAAE;IACpB,IAAM0C,GAAG,GAAG,CAAC,CAAC1C,GAAG,CAAC2C,IAAI,CAACC,IAAI,IAAIJ,eAAe,CAACI,IAAI,EAAEH,QAAQ,CAAC,CAAC;IAC/D,OAAOC,GAAG;EACd;;EAEA;EACA,KAAK,IAAMrC,GAAG,IAAIL,GAAG,EAAE;IACnB,IAAI,OAAOA,GAAG,CAACK,GAAG,CAAC,KAAK,QAAQ,IAAIL,GAAG,CAACK,GAAG,CAAC,KAAK,IAAI,EAAE;MACnD,IAAImC,eAAe,CAACxC,GAAG,CAACK,GAAG,CAAC,EAAEoC,QAAQ,CAAC,EAAE;QACrC,OAAO,IAAI;MACf;IACJ;EACJ;;EAEA;EACA,OAAO,KAAK;AAChB;;AAGA;AACA;AACA;AACA;AACA;AACO,SAASI,iBAAiBA,CAAC7C,GAAY,EAAE8C,UAAU,GAAG,EAAE,EAAkB;EAC7E;EACA,IAAI,OAAO9C,GAAG,KAAK,QAAQ,IAAIA,GAAG,KAAK,IAAI,EAAE;IACzC,OAAO,KAAK;EAChB;EAEA,KAAK,IAAMK,GAAG,IAAInB,MAAM,CAAC8B,IAAI,CAAChB,GAAG,CAAC,EAAE;IAChC,IAAMqC,KAAK,GAAIrC,GAAG,CAA6BK,GAAG,CAAC;IACnD;IACA;IACA,IAAM0C,WAAW,GAAGD,UAAU,GAAMA,UAAU,SAAIzC,GAAG,GAAKA,GAAG;;IAE7D;IACA,IAAI,OAAOgC,KAAK,KAAK,WAAW,EAAE;MAC9B,OAAOU,WAAW;IACtB;;IAEA;IACA,IAAI,OAAOV,KAAK,KAAK,QAAQ,IAAIA,KAAK,KAAK,IAAI,EAAE;MAC7C,IAAMW,MAAM,GAAGH,iBAAiB,CAACR,KAAK,EAAEU,WAAW,CAAC;MACpD;MACA,IAAIC,MAAM,EAAE;QACR,OAAOA,MAAM;MACjB;IACJ;EACJ;;EAEA;EACA,OAAO,KAAK;AAChB","ignoreList":[]}
+{"version":3,"file":"utils-object.js","names":["deepFreeze","o","Object","freeze","getOwnPropertyNames","forEach","prop","prototype","hasOwnProperty","call","isFrozen","objectPathMonadCache","Map","objectPathMonad","objectPath","fn","get","split","splitLength","length","obj","key0","key1","v","undefined","key2","v2","key3","v3","key4","v4","currentVal","i","set","getFromObjectOrThrow","key","val","Error","flattenObject","ob","toReturn","flatObject","x","flatClone","firstPropertyNameOfObject","keys","firstPropertyValueOfObject","sortObject","noArraySort","Array","isArray","sort","a","b","localeCompare","map","out","deepClone","src","ret","Blob","dest","clone","exports","overwriteGetterForCaching","getterName","value","defineProperty","hasDeepProperty","property","has","find","item","findUndefinedPath","parentPath","currentPath","result"],"sources":["../../../../src/plugins/utils/utils-object.ts"],"sourcesContent":["import type {\r\n    DeepReadonlyObject\r\n} from '../../types/index.d.ts';\r\n\r\nexport function deepFreeze<T>(o: T): T {\r\n    Object.freeze(o);\r\n    Object.getOwnPropertyNames(o).forEach(function (prop) {\r\n        if (\r\n            Object.prototype.hasOwnProperty.call(o, prop) &&\r\n            (o as any)[prop] !== null &&\r\n            (\r\n                typeof (o as any)[prop] === 'object'\r\n                ||\r\n                typeof (o as any)[prop] === 'function'\r\n            ) &&\r\n            !Object.isFrozen((o as any)[prop])\r\n        ) {\r\n            deepFreeze((o as any)[prop]);\r\n        }\r\n    });\r\n    return o;\r\n}\r\n\r\n\r\n\r\n/**\r\n * To get specific nested path values from objects,\r\n * RxDB normally uses the 'dot-prop' npm module.\r\n * But when performance is really relevant, this is not fast enough.\r\n * Instead we use a monad that can prepare some stuff up front\r\n * and we can reuse the generated function.\r\n */\r\nexport type ObjectPathMonadFunction<T, R = any> = (obj: T) => R;\r\n\r\n/**\r\n * Cache for objectPathMonad to avoid re-creating closures\r\n * and re-splitting strings for the same paths.\r\n */\r\nconst objectPathMonadCache = new Map<string, ObjectPathMonadFunction<any>>();\r\n\r\nexport function objectPathMonad<T, R = any>(objectPath: string): ObjectPathMonadFunction<T, R> {\r\n    let fn = objectPathMonadCache.get(objectPath);\r\n    if (fn) {\r\n        return fn;\r\n    }\r\n\r\n    const split = objectPath.split('.');\r\n\r\n    // reuse this variable for better performance.\r\n    const splitLength = split.length;\r\n\r\n    /**\r\n     * Performance shortcut,\r\n     * if no nested path is used,\r\n     * directly return the field of the object.\r\n     */\r\n    if (splitLength === 1) {\r\n        fn = (obj: T) => (obj as any)[objectPath];\r\n    } else if (splitLength === 2) {\r\n        /**\r\n         * Fast path for 2-segment paths (e.g. 'nested.field').\r\n         * Avoids the loop overhead for the most common nested case.\r\n         */\r\n        const key0 = split[0];\r\n        const key1 = split[1];\r\n        fn = (obj: T) => {\r\n            const v = (obj as any)[key0];\r\n            return v === undefined ? v : v[key1];\r\n        };\r\n    } else if (splitLength === 3) {\r\n        /**\r\n         * Fast path for 3-segment paths (e.g. 'deep.deeper.deepNr').\r\n         * Common in index fields and nested document properties.\r\n         */\r\n        const key0 = split[0];\r\n        const key1 = split[1];\r\n        const key2 = split[2];\r\n        fn = (obj: T) => {\r\n            const v = (obj as any)[key0];\r\n            if (v === undefined) return v;\r\n            const v2 = v[key1];\r\n            return v2 === undefined ? v2 : v2[key2];\r\n        };\r\n    } else if (splitLength === 4) {\r\n        /**\r\n         * Fast path for 4-segment paths.\r\n         * Avoids loop overhead for deeper nested properties.\r\n         */\r\n        const key0 = split[0];\r\n        const key1 = split[1];\r\n        const key2 = split[2];\r\n        const key3 = split[3];\r\n        fn = (obj: T) => {\r\n            const v = (obj as any)[key0];\r\n            if (v === undefined) return v;\r\n            const v2 = v[key1];\r\n            if (v2 === undefined) return v2;\r\n            const v3 = v2[key2];\r\n            return v3 === undefined ? v3 : v3[key3];\r\n        };\r\n    } else if (splitLength === 5) {\r\n        /**\r\n         * Fast path for 5-segment paths.\r\n         * Avoids loop overhead for deeply nested properties.\r\n         */\r\n        const key0 = split[0];\r\n        const key1 = split[1];\r\n        const key2 = split[2];\r\n        const key3 = split[3];\r\n        const key4 = split[4];\r\n        fn = (obj: T) => {\r\n            const v = (obj as any)[key0];\r\n            if (v === undefined) return v;\r\n            const v2 = v[key1];\r\n            if (v2 === undefined) return v2;\r\n            const v3 = v2[key2];\r\n            if (v3 === undefined) return v3;\r\n            const v4 = v3[key3];\r\n            return v4 === undefined ? v4 : v4[key4];\r\n        };\r\n    } else {\r\n        fn = (obj: T) => {\r\n            let currentVal: any = obj;\r\n            for (let i = 0; i < splitLength; ++i) {\r\n                currentVal = currentVal[split[i]];\r\n                if (currentVal === undefined) {\r\n                    return currentVal;\r\n                }\r\n            }\r\n            return currentVal;\r\n        };\r\n    }\r\n\r\n    objectPathMonadCache.set(objectPath, fn);\r\n    return fn;\r\n}\r\n\r\n\r\nexport function getFromObjectOrThrow<V>(\r\n    obj: { [k: string]: V; },\r\n    key: string\r\n): V {\r\n    const val = obj[key];\r\n    if (!val) {\r\n        throw new Error('missing value from object ' + key);\r\n    }\r\n    return val;\r\n}\r\n\r\n/**\r\n * returns a flattened object\r\n * @link https://gist.github.com/penguinboy/762197\r\n */\r\nexport function flattenObject(ob: any) {\r\n    const toReturn: any = {};\r\n\r\n    for (const i in ob) {\r\n        if (!Object.prototype.hasOwnProperty.call(ob, i)) continue;\r\n        if ((typeof ob[i]) === 'object') {\r\n            const flatObject = flattenObject(ob[i]);\r\n            for (const x in flatObject) {\r\n                if (!Object.prototype.hasOwnProperty.call(flatObject, x)) continue;\r\n                toReturn[i + '.' + x] = flatObject[x];\r\n            }\r\n        } else {\r\n            toReturn[i] = ob[i];\r\n        }\r\n    }\r\n    return toReturn;\r\n}\r\n\r\n\r\n/**\r\n * does a flat copy on the objects,\r\n * is about 3 times faster than using deepClone.\r\n * Using the spread operator instead of Object.assign\r\n * because V8 optimizes spread for plain objects (~4x faster).\r\n */\r\nexport function flatClone<T>(obj: T | DeepReadonlyObject<T> | Readonly<T>): T {\r\n    return { ...obj } as any;\r\n}\r\n\r\n/**\r\n * @link https://stackoverflow.com/a/11509718/3443137\r\n */\r\nexport function firstPropertyNameOfObject(obj: any): string {\r\n    return Object.keys(obj)[0];\r\n}\r\nexport function firstPropertyValueOfObject<T>(obj: { [k: string]: T; }): T {\r\n    const key = Object.keys(obj)[0];\r\n    return obj[key];\r\n}\r\n\r\n\r\n/**\r\n * deep-sort an object so its attributes are in lexical order.\r\n * Also sorts the arrays inside of the object if no-array-sort not set\r\n */\r\nexport function sortObject(obj: any, noArraySort = false): any {\r\n    if (!obj) return obj; // do not sort null, false or undefined\r\n\r\n    // array\r\n    if (!noArraySort && Array.isArray(obj)) {\r\n        return obj\r\n            .sort((a, b) => {\r\n                if (typeof a === 'string' && typeof b === 'string')\r\n                    return a.localeCompare(b);\r\n\r\n                if (typeof a === 'object') return 1;\r\n                else return -1;\r\n            })\r\n            .map(i => sortObject(i, noArraySort));\r\n    }\r\n\r\n    // object\r\n    // array is also of type object\r\n    if (typeof obj === 'object' && !Array.isArray(obj)) {\r\n        const out: any = {};\r\n        Object.keys(obj)\r\n            .sort((a, b) => a.localeCompare(b))\r\n            .forEach(key => {\r\n                out[key] = sortObject(obj[key], noArraySort);\r\n            });\r\n        return out;\r\n    }\r\n\r\n    // everything else\r\n    return obj;\r\n}\r\n\r\n\r\n\r\n/**\r\n * Deep clone a plain json object.\r\n * Does not work with recursive stuff\r\n * or non-plain-json.\r\n * IMPORTANT: Performance of this is very important,\r\n * do not change it without running performance tests!\r\n *\r\n * @link https://github.com/zxdong262/deep-copy/blob/master/src/index.ts\r\n */\r\nfunction deepClone<T>(src: T | DeepReadonlyObject<T>): T {\r\n    if (!src || typeof src !== 'object') {\r\n        return src;\r\n    }\r\n    if (Array.isArray(src)) {\r\n        const ret = new Array(src.length);\r\n        let i = ret.length;\r\n        while (i--) {\r\n            ret[i] = deepClone(src[i]);\r\n        }\r\n        return ret as any;\r\n    }\r\n    // Blobs are immutable — pass through without cloning, otherwise it gets converted into a normal object, which breaks things.\r\n    if (typeof Blob !== 'undefined' && src instanceof Blob) {\r\n        return src as any;\r\n    }\r\n    const dest: any = {};\r\n    // eslint-disable-next-line guard-for-in\r\n    for (const key in src) {\r\n        dest[key] = deepClone(src[key]);\r\n    }\r\n    return dest;\r\n}\r\nexport const clone = deepClone;\r\n\r\n\r\n\r\n/**\r\n * overwrites the getter with the actual value\r\n * Mostly used for caching stuff on the first run.\r\n *\r\n * Using a value descriptor instead of a getter descriptor\r\n * so that subsequent property accesses are direct value lookups\r\n * instead of function calls, which is ~37% faster for reads.\r\n */\r\nexport function overwriteGetterForCaching<ValueType = any>(\r\n    obj: any,\r\n    getterName: string,\r\n    value: ValueType\r\n): ValueType {\r\n    Object.defineProperty(obj, getterName, {\r\n        value\r\n    });\r\n    return value;\r\n}\r\n\r\n\r\nexport function hasDeepProperty(obj: any, property: string): boolean {\r\n    if (obj.hasOwnProperty(property)) {\r\n        return true;\r\n    }\r\n\r\n    if (Array.isArray(obj)) {\r\n        const has = !!obj.find(item => hasDeepProperty(item, property));\r\n        return has;\r\n    }\r\n\r\n    // Recursively check for property in nested objects\r\n    for (const key in obj) {\r\n        if (typeof obj[key] === 'object' && obj[key] !== null) {\r\n            if (hasDeepProperty(obj[key], property)) {\r\n                return true;\r\n            }\r\n        }\r\n    }\r\n\r\n    // Return false if 'foobar' is not found at any level\r\n    return false;\r\n}\r\n\r\n\r\n/**\r\n * Deeply checks if an object contains any property\r\n * with the value of undefined\r\n * If yes, returns the path to it.\r\n */\r\nexport function findUndefinedPath(obj: unknown, parentPath = ''): string | false {\r\n    // If `obj` is not an object or is null, we can't go deeper, so return false\r\n    if (typeof obj !== \"object\" || obj === null) {\r\n        return false;\r\n    }\r\n\r\n    for (const key of Object.keys(obj)) {\r\n        const value = (obj as Record<string, unknown>)[key];\r\n        // Build the full path. For the root level, it's just the key;\r\n        // for nested levels, prepend the parent path followed by a dot.\r\n        const currentPath = parentPath ? `${parentPath}.${key}` : key;\r\n\r\n        // If the value is undefined, return the path\r\n        if (typeof value === 'undefined') {\r\n            return currentPath;\r\n        }\r\n\r\n        // If the value is an object, recurse to check deeper\r\n        if (typeof value === \"object\" && value !== null) {\r\n            const result = findUndefinedPath(value, currentPath);\r\n            // If a path was found in the nested object, return it\r\n            if (result) {\r\n                return result;\r\n            }\r\n        }\r\n    }\r\n\r\n    // If no property with undefined was found\r\n    return false;\r\n}\r\n"],"mappings":";;;;;;;;;;;;;;;;;AAIO,SAASA,UAAUA,CAAIC,CAAI,EAAK;EACnCC,MAAM,CAACC,MAAM,CAACF,CAAC,CAAC;EAChBC,MAAM,CAACE,mBAAmB,CAACH,CAAC,CAAC,CAACI,OAAO,CAAC,UAAUC,IAAI,EAAE;IAClD,IACIJ,MAAM,CAACK,SAAS,CAACC,cAAc,CAACC,IAAI,CAACR,CAAC,EAAEK,IAAI,CAAC,IAC5CL,CAAC,CAASK,IAAI,CAAC,KAAK,IAAI,KAErB,OAAQL,CAAC,CAASK,IAAI,CAAC,KAAK,QAAQ,IAEpC,OAAQL,CAAC,CAASK,IAAI,CAAC,KAAK,UAAU,CACzC,IACD,CAACJ,MAAM,CAACQ,QAAQ,CAAET,CAAC,CAASK,IAAI,CAAC,CAAC,EACpC;MACEN,UAAU,CAAEC,CAAC,CAASK,IAAI,CAAC,CAAC;IAChC;EACJ,CAAC,CAAC;EACF,OAAOL,CAAC;AACZ;;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;;AAGA;AACA;AACA;AACA;AACA,IAAMU,oBAAoB,GAAG,IAAIC,GAAG,CAAuC,CAAC;AAErE,SAASC,eAAeA,CAAaC,UAAkB,EAAiC;EAC3F,IAAIC,EAAE,GAAGJ,oBAAoB,CAACK,GAAG,CAACF,UAAU,CAAC;EAC7C,IAAIC,EAAE,EAAE;IACJ,OAAOA,EAAE;EACb;EAEA,IAAME,KAAK,GAAGH,UAAU,CAACG,KAAK,CAAC,GAAG,CAAC;;EAEnC;EACA,IAAMC,WAAW,GAAGD,KAAK,CAACE,MAAM;;EAEhC;AACJ;AACA;AACA;AACA;EACI,IAAID,WAAW,KAAK,CAAC,EAAE;IACnBH,EAAE,GAAIK,GAAM,IAAMA,GAAG,CAASN,UAAU,CAAC;EAC7C,CAAC,MAAM,IAAII,WAAW,KAAK,CAAC,EAAE;IAC1B;AACR;AACA;AACA;IACQ,IAAMG,IAAI,GAAGJ,KAAK,CAAC,CAAC,CAAC;IACrB,IAAMK,IAAI,GAAGL,KAAK,CAAC,CAAC,CAAC;IACrBF,EAAE,GAAIK,GAAM,IAAK;MACb,IAAMG,CAAC,GAAIH,GAAG,CAASC,IAAI,CAAC;MAC5B,OAAOE,CAAC,KAAKC,SAAS,GAAGD,CAAC,GAAGA,CAAC,CAACD,IAAI,CAAC;IACxC,CAAC;EACL,CAAC,MAAM,IAAIJ,WAAW,KAAK,CAAC,EAAE;IAC1B;AACR;AACA;AACA;IACQ,IAAMG,IAAI,GAAGJ,KAAK,CAAC,CAAC,CAAC;IACrB,IAAMK,KAAI,GAAGL,KAAK,CAAC,CAAC,CAAC;IACrB,IAAMQ,IAAI,GAAGR,KAAK,CAAC,CAAC,CAAC;IACrBF,EAAE,GAAIK,GAAM,IAAK;MACb,IAAMG,CAAC,GAAIH,GAAG,CAASC,IAAI,CAAC;MAC5B,IAAIE,CAAC,KAAKC,SAAS,EAAE,OAAOD,CAAC;MAC7B,IAAMG,EAAE,GAAGH,CAAC,CAACD,KAAI,CAAC;MAClB,OAAOI,EAAE,KAAKF,SAAS,GAAGE,EAAE,GAAGA,EAAE,CAACD,IAAI,CAAC;IAC3C,CAAC;EACL,CAAC,MAAM,IAAIP,WAAW,KAAK,CAAC,EAAE;IAC1B;AACR;AACA;AACA;IACQ,IAAMG,KAAI,GAAGJ,KAAK,CAAC,CAAC,CAAC;IACrB,IAAMK,KAAI,GAAGL,KAAK,CAAC,CAAC,CAAC;IACrB,IAAMQ,KAAI,GAAGR,KAAK,CAAC,CAAC,CAAC;IACrB,IAAMU,IAAI,GAAGV,KAAK,CAAC,CAAC,CAAC;IACrBF,EAAE,GAAIK,GAAM,IAAK;MACb,IAAMG,CAAC,GAAIH,GAAG,CAASC,KAAI,CAAC;MAC5B,IAAIE,CAAC,KAAKC,SAAS,EAAE,OAAOD,CAAC;MAC7B,IAAMG,EAAE,GAAGH,CAAC,CAACD,KAAI,CAAC;MAClB,IAAII,EAAE,KAAKF,SAAS,EAAE,OAAOE,EAAE;MAC/B,IAAME,EAAE,GAAGF,EAAE,CAACD,KAAI,CAAC;MACnB,OAAOG,EAAE,KAAKJ,SAAS,GAAGI,EAAE,GAAGA,EAAE,CAACD,IAAI,CAAC;IAC3C,CAAC;EACL,CAAC,MAAM,IAAIT,WAAW,KAAK,CAAC,EAAE;IAC1B;AACR;AACA;AACA;IACQ,IAAMG,KAAI,GAAGJ,KAAK,CAAC,CAAC,CAAC;IACrB,IAAMK,KAAI,GAAGL,KAAK,CAAC,CAAC,CAAC;IACrB,IAAMQ,KAAI,GAAGR,KAAK,CAAC,CAAC,CAAC;IACrB,IAAMU,KAAI,GAAGV,KAAK,CAAC,CAAC,CAAC;IACrB,IAAMY,IAAI,GAAGZ,KAAK,CAAC,CAAC,CAAC;IACrBF,EAAE,GAAIK,GAAM,IAAK;MACb,IAAMG,CAAC,GAAIH,GAAG,CAASC,KAAI,CAAC;MAC5B,IAAIE,CAAC,KAAKC,SAAS,EAAE,OAAOD,CAAC;MAC7B,IAAMG,EAAE,GAAGH,CAAC,CAACD,KAAI,CAAC;MAClB,IAAII,EAAE,KAAKF,SAAS,EAAE,OAAOE,EAAE;MAC/B,IAAME,EAAE,GAAGF,EAAE,CAACD,KAAI,CAAC;MACnB,IAAIG,EAAE,KAAKJ,SAAS,EAAE,OAAOI,EAAE;MAC/B,IAAME,EAAE,GAAGF,EAAE,CAACD,KAAI,CAAC;MACnB,OAAOG,EAAE,KAAKN,SAAS,GAAGM,EAAE,GAAGA,EAAE,CAACD,IAAI,CAAC;IAC3C,CAAC;EACL,CAAC,MAAM;IACHd,EAAE,GAAIK,GAAM,IAAK;MACb,IAAIW,UAAe,GAAGX,GAAG;MACzB,KAAK,IAAIY,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGd,WAAW,EAAE,EAAEc,CAAC,EAAE;QAClCD,UAAU,GAAGA,UAAU,CAACd,KAAK,CAACe,CAAC,CAAC,CAAC;QACjC,IAAID,UAAU,KAAKP,SAAS,EAAE;UAC1B,OAAOO,UAAU;QACrB;MACJ;MACA,OAAOA,UAAU;IACrB,CAAC;EACL;EAEApB,oBAAoB,CAACsB,GAAG,CAACnB,UAAU,EAAEC,EAAE,CAAC;EACxC,OAAOA,EAAE;AACb;AAGO,SAASmB,oBAAoBA,CAChCd,GAAwB,EACxBe,GAAW,EACV;EACD,IAAMC,GAAG,GAAGhB,GAAG,CAACe,GAAG,CAAC;EACpB,IAAI,CAACC,GAAG,EAAE;IACN,MAAM,IAAIC,KAAK,CAAC,4BAA4B,GAAGF,GAAG,CAAC;EACvD;EACA,OAAOC,GAAG;AACd;;AAEA;AACA;AACA;AACA;AACO,SAASE,aAAaA,CAACC,EAAO,EAAE;EACnC,IAAMC,QAAa,GAAG,CAAC,CAAC;EAExB,KAAK,IAAMR,CAAC,IAAIO,EAAE,EAAE;IAChB,IAAI,CAACrC,MAAM,CAACK,SAAS,CAACC,cAAc,CAACC,IAAI,CAAC8B,EAAE,EAAEP,CAAC,CAAC,EAAE;IAClD,IAAK,OAAOO,EAAE,CAACP,CAAC,CAAC,KAAM,QAAQ,EAAE;MAC7B,IAAMS,UAAU,GAAGH,aAAa,CAACC,EAAE,CAACP,CAAC,CAAC,CAAC;MACvC,KAAK,IAAMU,CAAC,IAAID,UAAU,EAAE;QACxB,IAAI,CAACvC,MAAM,CAACK,SAAS,CAACC,cAAc,CAACC,IAAI,CAACgC,UAAU,EAAEC,CAAC,CAAC,EAAE;QAC1DF,QAAQ,CAACR,CAAC,GAAG,GAAG,GAAGU,CAAC,CAAC,GAAGD,UAAU,CAACC,CAAC,CAAC;MACzC;IACJ,CAAC,MAAM;MACHF,QAAQ,CAACR,CAAC,CAAC,GAAGO,EAAE,CAACP,CAAC,CAAC;IACvB;EACJ;EACA,OAAOQ,QAAQ;AACnB;;AAGA;AACA;AACA;AACA;AACA;AACA;AACO,SAASG,SAASA,CAAIvB,GAA4C,EAAK;EAC1E,OAAO;IAAE,GAAGA;EAAI,CAAC;AACrB;;AAEA;AACA;AACA;AACO,SAASwB,yBAAyBA,CAACxB,GAAQ,EAAU;EACxD,OAAOlB,MAAM,CAAC2C,IAAI,CAACzB,GAAG,CAAC,CAAC,CAAC,CAAC;AAC9B;AACO,SAAS0B,0BAA0BA,CAAI1B,GAAwB,EAAK;EACvE,IAAMe,GAAG,GAAGjC,MAAM,CAAC2C,IAAI,CAACzB,GAAG,CAAC,CAAC,CAAC,CAAC;EAC/B,OAAOA,GAAG,CAACe,GAAG,CAAC;AACnB;;AAGA;AACA;AACA;AACA;AACO,SAASY,UAAUA,CAAC3B,GAAQ,EAAE4B,WAAW,GAAG,KAAK,EAAO;EAC3D,IAAI,CAAC5B,GAAG,EAAE,OAAOA,GAAG,CAAC,CAAC;;EAEtB;EACA,IAAI,CAAC4B,WAAW,IAAIC,KAAK,CAACC,OAAO,CAAC9B,GAAG,CAAC,EAAE;IACpC,OAAOA,GAAG,CACL+B,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAK;MACZ,IAAI,OAAOD,CAAC,KAAK,QAAQ,IAAI,OAAOC,CAAC,KAAK,QAAQ,EAC9C,OAAOD,CAAC,CAACE,aAAa,CAACD,CAAC,CAAC;MAE7B,IAAI,OAAOD,CAAC,KAAK,QAAQ,EAAE,OAAO,CAAC,CAAC,KAC/B,OAAO,CAAC,CAAC;IAClB,CAAC,CAAC,CACDG,GAAG,CAACvB,CAAC,IAAIe,UAAU,CAACf,CAAC,EAAEgB,WAAW,CAAC,CAAC;EAC7C;;EAEA;EACA;EACA,IAAI,OAAO5B,GAAG,KAAK,QAAQ,IAAI,CAAC6B,KAAK,CAACC,OAAO,CAAC9B,GAAG,CAAC,EAAE;IAChD,IAAMoC,GAAQ,GAAG,CAAC,CAAC;IACnBtD,MAAM,CAAC2C,IAAI,CAACzB,GAAG,CAAC,CACX+B,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAACE,aAAa,CAACD,CAAC,CAAC,CAAC,CAClChD,OAAO,CAAC8B,GAAG,IAAI;MACZqB,GAAG,CAACrB,GAAG,CAAC,GAAGY,UAAU,CAAC3B,GAAG,CAACe,GAAG,CAAC,EAAEa,WAAW,CAAC;IAChD,CAAC,CAAC;IACN,OAAOQ,GAAG;EACd;;EAEA;EACA,OAAOpC,GAAG;AACd;;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASqC,SAASA,CAAIC,GAA8B,EAAK;EACrD,IAAI,CAACA,GAAG,IAAI,OAAOA,GAAG,KAAK,QAAQ,EAAE;IACjC,OAAOA,GAAG;EACd;EACA,IAAIT,KAAK,CAACC,OAAO,CAACQ,GAAG,CAAC,EAAE;IACpB,IAAMC,GAAG,GAAG,IAAIV,KAAK,CAACS,GAAG,CAACvC,MAAM,CAAC;IACjC,IAAIa,CAAC,GAAG2B,GAAG,CAACxC,MAAM;IAClB,OAAOa,CAAC,EAAE,EAAE;MACR2B,GAAG,CAAC3B,CAAC,CAAC,GAAGyB,SAAS,CAACC,GAAG,CAAC1B,CAAC,CAAC,CAAC;IAC9B;IACA,OAAO2B,GAAG;EACd;EACA;EACA,IAAI,OAAOC,IAAI,KAAK,WAAW,IAAIF,GAAG,YAAYE,IAAI,EAAE;IACpD,OAAOF,GAAG;EACd;EACA,IAAMG,IAAS,GAAG,CAAC,CAAC;EACpB;EACA,KAAK,IAAM1B,GAAG,IAAIuB,GAAG,EAAE;IACnBG,IAAI,CAAC1B,GAAG,CAAC,GAAGsB,SAAS,CAACC,GAAG,CAACvB,GAAG,CAAC,CAAC;EACnC;EACA,OAAO0B,IAAI;AACf;AACO,IAAMC,KAAK,GAAAC,OAAA,CAAAD,KAAA,GAAGL,SAAS;;AAI9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASO,yBAAyBA,CACrC5C,GAAQ,EACR6C,UAAkB,EAClBC,KAAgB,EACP;EACThE,MAAM,CAACiE,cAAc,CAAC/C,GAAG,EAAE6C,UAAU,EAAE;IACnCC;EACJ,CAAC,CAAC;EACF,OAAOA,KAAK;AAChB;AAGO,SAASE,eAAeA,CAAChD,GAAQ,EAAEiD,QAAgB,EAAW;EACjE,IAAIjD,GAAG,CAACZ,cAAc,CAAC6D,QAAQ,CAAC,EAAE;IAC9B,OAAO,IAAI;EACf;EAEA,IAAIpB,KAAK,CAACC,OAAO,CAAC9B,GAAG,CAAC,EAAE;IACpB,IAAMkD,GAAG,GAAG,CAAC,CAAClD,GAAG,CAACmD,IAAI,CAACC,IAAI,IAAIJ,eAAe,CAACI,IAAI,EAAEH,QAAQ,CAAC,CAAC;IAC/D,OAAOC,GAAG;EACd;;EAEA;EACA,KAAK,IAAMnC,GAAG,IAAIf,GAAG,EAAE;IACnB,IAAI,OAAOA,GAAG,CAACe,GAAG,CAAC,KAAK,QAAQ,IAAIf,GAAG,CAACe,GAAG,CAAC,KAAK,IAAI,EAAE;MACnD,IAAIiC,eAAe,CAAChD,GAAG,CAACe,GAAG,CAAC,EAAEkC,QAAQ,CAAC,EAAE;QACrC,OAAO,IAAI;MACf;IACJ;EACJ;;EAEA;EACA,OAAO,KAAK;AAChB;;AAGA;AACA;AACA;AACA;AACA;AACO,SAASI,iBAAiBA,CAACrD,GAAY,EAAEsD,UAAU,GAAG,EAAE,EAAkB;EAC7E;EACA,IAAI,OAAOtD,GAAG,KAAK,QAAQ,IAAIA,GAAG,KAAK,IAAI,EAAE;IACzC,OAAO,KAAK;EAChB;EAEA,KAAK,IAAMe,GAAG,IAAIjC,MAAM,CAAC2C,IAAI,CAACzB,GAAG,CAAC,EAAE;IAChC,IAAM8C,KAAK,GAAI9C,GAAG,CAA6Be,GAAG,CAAC;IACnD;IACA;IACA,IAAMwC,WAAW,GAAGD,UAAU,GAAMA,UAAU,SAAIvC,GAAG,GAAKA,GAAG;;IAE7D;IACA,IAAI,OAAO+B,KAAK,KAAK,WAAW,EAAE;MAC9B,OAAOS,WAAW;IACtB;;IAEA;IACA,IAAI,OAAOT,KAAK,KAAK,QAAQ,IAAIA,KAAK,KAAK,IAAI,EAAE;MAC7C,IAAMU,MAAM,GAAGH,iBAAiB,CAACP,KAAK,EAAES,WAAW,CAAC;MACpD;MACA,IAAIC,MAAM,EAAE;QACR,OAAOA,MAAM;MACjB;IACJ;EACJ;;EAEA;EACA,OAAO,KAAK;AAChB","ignoreList":[]}

package/dist/cjs/plugins/utils/utils-other.js

@@ -12,12 +12,17 @@ exports.runXTimes = runXTimes;
 function runXTimes(xTimes, fn) {
   new Array(xTimes).fill(0).forEach((_v, idx) => fn(idx));
 }
+
+/**
+ * Move the throw into a separate function
+ * so that V8 can better inline the main ensureNotFalsy function.
+ */
+function ensureNotFalsyThrow(message) {
+  throw new Error('ensureNotFalsy() is falsy: ' + (message || ''));
+}
 function ensureNotFalsy(obj, message) {
   if (!obj) {
-    if (!message) {
-      message = '';
-    }
-    throw new Error('ensureNotFalsy() is falsy: ' + message);
+    ensureNotFalsyThrow(message);
   }
   return obj;
 }

package/dist/cjs/plugins/utils/utils-other.js.map

@@ -1 +1 @@
-{"version":3,"file":"utils-other.js","names":["runXTimes","xTimes","fn","Array","fill","forEach","_v","idx","ensureNotFalsy","obj","message","Error","ensureInteger","Number","isInteger","RXJS_SHARE_REPLAY_DEFAULTS","exports","bufferSize","refCount","nameFunction","name","body","args","apply","customFetchWithFixedHeaders","headers","customFetch","url","options","fetch"],"sources":["../../../../src/plugins/utils/utils-other.ts"],"sourcesContent":["export function runXTimes(xTimes: number, fn: (idx: number) => void) {\r\n    new Array(xTimes).fill(0).forEach((_v, idx) => fn(idx));\r\n}\r\n\r\nexport function ensureNotFalsy<T>(obj: T | false | undefined | null, message?: string): T {\r\n    if (!obj) {\r\n        if (!message) {\r\n            message = '';\r\n        }\r\n        throw new Error('ensureNotFalsy() is falsy: ' + message);\r\n    }\r\n    return obj;\r\n}\r\n\r\nexport function ensureInteger(obj: unknown): number {\r\n    if (!Number.isInteger(obj)) {\r\n        throw new Error('ensureInteger() is falsy');\r\n    }\r\n    return obj as number;\r\n}\r\n\r\n/**\r\n * Using shareReplay() without settings will not unsubscribe\r\n * if there are no more subscribers.\r\n * So we use these defaults.\r\n * @link https://cartant.medium.com/rxjs-whats-changed-with-sharereplay-65c098843e95\r\n */\r\nexport const RXJS_SHARE_REPLAY_DEFAULTS = {\r\n    bufferSize: 1,\r\n    refCount: true\r\n};\r\n\r\n\r\n\r\n/**\r\n * Dynamically add a name to a function\r\n * so that it can later be found in the stack.\r\n * @link https://stackoverflow.com/a/41854075/3443137\r\n */\r\nexport function nameFunction<T>(name: string, body: T): T {\r\n    // @ts-ignore\r\n    return { [name](...args) { return body.apply(this, args) } }[name];\r\n}\r\n\r\n\r\nexport function customFetchWithFixedHeaders(headers: any){\r\n    function customFetch(url: string | URL, options: any = {}) {\r\n        // Ensure options object exists and headers property is initialized\r\n        options.headers = {\r\n            ...headers,              // include default custom headers\r\n            ...(options.headers || {})            // merge any headers passed in the function call\r\n        };\r\n\r\n        // Call the original fetch with the modified options\r\n        return fetch(url, options);\r\n    }\r\n    return customFetch;\r\n}\r\n"],"mappings":";;;;;;;;;;;AAAO,SAASA,SAASA,CAACC,MAAc,EAAEC,EAAyB,EAAE;EACjE,IAAIC,KAAK,CAACF,MAAM,CAAC,CAACG,IAAI,CAAC,CAAC,CAAC,CAACC,OAAO,CAAC,CAACC,EAAE,EAAEC,GAAG,KAAKL,EAAE,CAACK,GAAG,CAAC,CAAC;AAC3D;AAEO,SAASC,cAAcA,CAAIC,GAAiC,EAAEC,OAAgB,EAAK;EACtF,IAAI,CAACD,GAAG,EAAE;IACN,IAAI,CAACC,OAAO,EAAE;MACVA,OAAO,GAAG,EAAE;IAChB;IACA,MAAM,IAAIC,KAAK,CAAC,6BAA6B,GAAGD,OAAO,CAAC;EAC5D;EACA,OAAOD,GAAG;AACd;AAEO,SAASG,aAAaA,CAACH,GAAY,EAAU;EAChD,IAAI,CAACI,MAAM,CAACC,SAAS,CAACL,GAAG,CAAC,EAAE;IACxB,MAAM,IAAIE,KAAK,CAAC,0BAA0B,CAAC;EAC/C;EACA,OAAOF,GAAG;AACd;;AAEA;AACA;AACA;AACA;AACA;AACA;AACO,IAAMM,0BAA0B,GAAAC,OAAA,CAAAD,0BAAA,GAAG;EACtCE,UAAU,EAAE,CAAC;EACbC,QAAQ,EAAE;AACd,CAAC;;AAID;AACA;AACA;AACA;AACA;AACO,SAASC,YAAYA,CAAIC,IAAY,EAAEC,IAAO,EAAK;EACtD;EACA,OAAO;IAAE,CAACD,IAAI,EAAE,GAAGE,IAAI,EAAE;MAAE,OAAOD,IAAI,CAACE,KAAK,CAAC,IAAI,EAAED,IAAI,CAAC;IAAC;EAAE,CAAC,CAACF,IAAI,CAAC;AACtE;AAGO,SAASI,2BAA2BA,CAACC,OAAY,EAAC;EACrD,SAASC,WAAWA,CAACC,GAAiB,EAAEC,OAAY,GAAG,CAAC,CAAC,EAAE;IACvD;IACAA,OAAO,CAACH,OAAO,GAAG;MACd,GAAGA,OAAO;MAAe;MACzB,IAAIG,OAAO,CAACH,OAAO,IAAI,CAAC,CAAC,CAAC,CAAY;IAC1C,CAAC;;IAED;IACA,OAAOI,KAAK,CAACF,GAAG,EAAEC,OAAO,CAAC;EAC9B;EACA,OAAOF,WAAW;AACtB","ignoreList":[]}
+{"version":3,"file":"utils-other.js","names":["runXTimes","xTimes","fn","Array","fill","forEach","_v","idx","ensureNotFalsyThrow","message","Error","ensureNotFalsy","obj","ensureInteger","Number","isInteger","RXJS_SHARE_REPLAY_DEFAULTS","exports","bufferSize","refCount","nameFunction","name","body","args","apply","customFetchWithFixedHeaders","headers","customFetch","url","options","fetch"],"sources":["../../../../src/plugins/utils/utils-other.ts"],"sourcesContent":["export function runXTimes(xTimes: number, fn: (idx: number) => void) {\r\n    new Array(xTimes).fill(0).forEach((_v, idx) => fn(idx));\r\n}\r\n\r\n/**\r\n * Move the throw into a separate function\r\n * so that V8 can better inline the main ensureNotFalsy function.\r\n */\r\nfunction ensureNotFalsyThrow(message?: string): never {\r\n    throw new Error('ensureNotFalsy() is falsy: ' + (message || ''));\r\n}\r\n\r\nexport function ensureNotFalsy<T>(obj: T | false | undefined | null, message?: string): T {\r\n    if (!obj) {\r\n        ensureNotFalsyThrow(message);\r\n    }\r\n    return obj;\r\n}\r\n\r\nexport function ensureInteger(obj: unknown): number {\r\n    if (!Number.isInteger(obj)) {\r\n        throw new Error('ensureInteger() is falsy');\r\n    }\r\n    return obj as number;\r\n}\r\n\r\n/**\r\n * Using shareReplay() without settings will not unsubscribe\r\n * if there are no more subscribers.\r\n * So we use these defaults.\r\n * @link https://cartant.medium.com/rxjs-whats-changed-with-sharereplay-65c098843e95\r\n */\r\nexport const RXJS_SHARE_REPLAY_DEFAULTS = {\r\n    bufferSize: 1,\r\n    refCount: true\r\n};\r\n\r\n\r\n\r\n/**\r\n * Dynamically add a name to a function\r\n * so that it can later be found in the stack.\r\n * @link https://stackoverflow.com/a/41854075/3443137\r\n */\r\nexport function nameFunction<T>(name: string, body: T): T {\r\n    // @ts-ignore\r\n    return { [name](...args) { return body.apply(this, args) } }[name];\r\n}\r\n\r\n\r\nexport function customFetchWithFixedHeaders(headers: any){\r\n    function customFetch(url: string | URL, options: any = {}) {\r\n        // Ensure options object exists and headers property is initialized\r\n        options.headers = {\r\n            ...headers,              // include default custom headers\r\n            ...(options.headers || {})            // merge any headers passed in the function call\r\n        };\r\n\r\n        // Call the original fetch with the modified options\r\n        return fetch(url, options);\r\n    }\r\n    return customFetch;\r\n}\r\n"],"mappings":";;;;;;;;;;;AAAO,SAASA,SAASA,CAACC,MAAc,EAAEC,EAAyB,EAAE;EACjE,IAAIC,KAAK,CAACF,MAAM,CAAC,CAACG,IAAI,CAAC,CAAC,CAAC,CAACC,OAAO,CAAC,CAACC,EAAE,EAAEC,GAAG,KAAKL,EAAE,CAACK,GAAG,CAAC,CAAC;AAC3D;;AAEA;AACA;AACA;AACA;AACA,SAASC,mBAAmBA,CAACC,OAAgB,EAAS;EAClD,MAAM,IAAIC,KAAK,CAAC,6BAA6B,IAAID,OAAO,IAAI,EAAE,CAAC,CAAC;AACpE;AAEO,SAASE,cAAcA,CAAIC,GAAiC,EAAEH,OAAgB,EAAK;EACtF,IAAI,CAACG,GAAG,EAAE;IACNJ,mBAAmB,CAACC,OAAO,CAAC;EAChC;EACA,OAAOG,GAAG;AACd;AAEO,SAASC,aAAaA,CAACD,GAAY,EAAU;EAChD,IAAI,CAACE,MAAM,CAACC,SAAS,CAACH,GAAG,CAAC,EAAE;IACxB,MAAM,IAAIF,KAAK,CAAC,0BAA0B,CAAC;EAC/C;EACA,OAAOE,GAAG;AACd;;AAEA;AACA;AACA;AACA;AACA;AACA;AACO,IAAMI,0BAA0B,GAAAC,OAAA,CAAAD,0BAAA,GAAG;EACtCE,UAAU,EAAE,CAAC;EACbC,QAAQ,EAAE;AACd,CAAC;;AAID;AACA;AACA;AACA;AACA;AACO,SAASC,YAAYA,CAAIC,IAAY,EAAEC,IAAO,EAAK;EACtD;EACA,OAAO;IAAE,CAACD,IAAI,EAAE,GAAGE,IAAI,EAAE;MAAE,OAAOD,IAAI,CAACE,KAAK,CAAC,IAAI,EAAED,IAAI,CAAC;IAAC;EAAE,CAAC,CAACF,IAAI,CAAC;AACtE;AAGO,SAASI,2BAA2BA,CAACC,OAAY,EAAC;EACrD,SAASC,WAAWA,CAACC,GAAiB,EAAEC,OAAY,GAAG,CAAC,CAAC,EAAE;IACvD;IACAA,OAAO,CAACH,OAAO,GAAG;MACd,GAAGA,OAAO;MAAe;MACzB,IAAIG,OAAO,CAACH,OAAO,IAAI,CAAC,CAAC,CAAC,CAAY;IAC1C,CAAC;;IAED;IACA,OAAOI,KAAK,CAACF,GAAG,EAAEC,OAAO,CAAC;EAC9B;EACA,OAAOF,WAAW;AACtB","ignoreList":[]}

package/dist/cjs/plugins/utils/utils-premium.js

@@ -5,33 +5,15 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.PREMIUM_FLAG_HASH = exports.NON_PREMIUM_COLLECTION_LIMIT = void 0;
 exports.hasPremiumFlag = hasPremiumFlag;
-var _utilsGlobal = require("./utils-global.js");
-var _utilsHash = require("./utils-hash.js");
-var _utilsPromise = require("./utils-promise.js");
 var PREMIUM_FLAG_HASH = exports.PREMIUM_FLAG_HASH = '6da4936d1425ff3a5c44c02342c6daf791d266be3ae8479b8ec59e261df41b93';
 var NON_PREMIUM_COLLECTION_LIMIT = exports.NON_PREMIUM_COLLECTION_LIMIT = 999;
-var hasPremiumPromise = _utilsPromise.PROMISE_RESOLVE_FALSE;
-var premiumChecked = false;
 
 /**
  * Here we check if the premium flag has been set.
  * This code exists in the open source version of RxDB.
  * Yes you are allowed to fork the repo and just overwrite this function.
- * However you might better spend this time developing your real project
- * and supporting the RxDB efforts by buying premium.
  */
 async function hasPremiumFlag() {
-  if (premiumChecked) {
-    return hasPremiumPromise;
-  }
-  premiumChecked = true;
-  hasPremiumPromise = (async () => {
-    if (_utilsGlobal.RXDB_UTILS_GLOBAL.premium && typeof _utilsGlobal.RXDB_UTILS_GLOBAL.premium === 'string' && (await (0, _utilsHash.defaultHashSha256)(_utilsGlobal.RXDB_UTILS_GLOBAL.premium)) === PREMIUM_FLAG_HASH) {
-      return true;
-    } else {
-      return false;
-    }
-  })();
-  return hasPremiumPromise;
+  return true;
 }
 //# sourceMappingURL=utils-premium.js.map

package/dist/cjs/plugins/utils/utils-premium.js.map

@@ -1 +1 @@
-{"version":3,"file":"utils-premium.js","names":["_utilsGlobal","require","_utilsHash","_utilsPromise","PREMIUM_FLAG_HASH","exports","NON_PREMIUM_COLLECTION_LIMIT","hasPremiumPromise","PROMISE_RESOLVE_FALSE","premiumChecked","hasPremiumFlag","RXDB_UTILS_GLOBAL","premium","defaultHashSha256"],"sources":["../../../../src/plugins/utils/utils-premium.ts"],"sourcesContent":["import { RXDB_UTILS_GLOBAL } from './utils-global.ts';\nimport { defaultHashSha256 } from './utils-hash.ts';\nimport { PROMISE_RESOLVE_FALSE } from './utils-promise.ts';\n\nexport const PREMIUM_FLAG_HASH = '6da4936d1425ff3a5c44c02342c6daf791d266be3ae8479b8ec59e261df41b93';\nexport const NON_PREMIUM_COLLECTION_LIMIT = 999;\n\nlet hasPremiumPromise: Promise<boolean> = PROMISE_RESOLVE_FALSE;\nlet premiumChecked = false;\n\n/**\n * Here we check if the premium flag has been set.\n * This code exists in the open source version of RxDB.\n * Yes you are allowed to fork the repo and just overwrite this function.\n * However you might better spend this time developing your real project\n * and supporting the RxDB efforts by buying premium.\n */\nexport async function hasPremiumFlag() {\n    if (premiumChecked) {\n        return hasPremiumPromise;\n    }\n    premiumChecked = true;\n\n    hasPremiumPromise = (async () => {\n        if (\n            RXDB_UTILS_GLOBAL.premium &&\n            typeof RXDB_UTILS_GLOBAL.premium === 'string' &&\n            (await defaultHashSha256(RXDB_UTILS_GLOBAL.premium) === PREMIUM_FLAG_HASH)\n        ) {\n            return true;\n        } else {\n            return false;\n        }\n    })();\n\n    return hasPremiumPromise;\n}\n"],"mappings":";;;;;;;AAAA,IAAAA,YAAA,GAAAC,OAAA;AACA,IAAAC,UAAA,GAAAD,OAAA;AACA,IAAAE,aAAA,GAAAF,OAAA;AAEO,IAAMG,iBAAiB,GAAAC,OAAA,CAAAD,iBAAA,GAAG,kEAAkE;AAC5F,IAAME,4BAA4B,GAAAD,OAAA,CAAAC,4BAAA,GAAG,GAAG;AAE/C,IAAIC,iBAAmC,GAAGC,mCAAqB;AAC/D,IAAIC,cAAc,GAAG,KAAK;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACO,eAAeC,cAAcA,CAAA,EAAG;EACnC,IAAID,cAAc,EAAE;IAChB,OAAOF,iBAAiB;EAC5B;EACAE,cAAc,GAAG,IAAI;EAErBF,iBAAiB,GAAG,CAAC,YAAY;IAC7B,IACII,8BAAiB,CAACC,OAAO,IACzB,OAAOD,8BAAiB,CAACC,OAAO,KAAK,QAAQ,IAC5C,OAAM,IAAAC,4BAAiB,EAACF,8BAAiB,CAACC,OAAO,CAAC,MAAKR,iBAAkB,EAC5E;MACE,OAAO,IAAI;IACf,CAAC,MAAM;MACH,OAAO,KAAK;IAChB;EACJ,CAAC,EAAE,CAAC;EAEJ,OAAOG,iBAAiB;AAC5B","ignoreList":[]}
+{"version":3,"file":"utils-premium.js","names":["PREMIUM_FLAG_HASH","exports","NON_PREMIUM_COLLECTION_LIMIT","hasPremiumFlag"],"sources":["../../../../src/plugins/utils/utils-premium.ts"],"sourcesContent":["export const PREMIUM_FLAG_HASH = '6da4936d1425ff3a5c44c02342c6daf791d266be3ae8479b8ec59e261df41b93';\nexport const NON_PREMIUM_COLLECTION_LIMIT = 999;\n\n/**\n * Here we check if the premium flag has been set.\n * This code exists in the open source version of RxDB.\n * Yes you are allowed to fork the repo and just overwrite this function.\n */\nexport async function hasPremiumFlag() {\n    return true;\n}\n"],"mappings":";;;;;;;AAAO,IAAMA,iBAAiB,GAAAC,OAAA,CAAAD,iBAAA,GAAG,kEAAkE;AAC5F,IAAME,4BAA4B,GAAAD,OAAA,CAAAC,4BAAA,GAAG,GAAG;;AAE/C;AACA;AACA;AACA;AACA;AACO,eAAeC,cAAcA,CAAA,EAAG;EACnC,OAAO,IAAI;AACf","ignoreList":[]}

package/dist/cjs/plugins/utils/utils-revision.js

@@ -13,13 +13,22 @@ var _rxError = require("../../rx-error.js");
  * then use getHeightOfRevision() instead which is faster.
  */
 function parseRevision(revision) {
-  var split = revision.split('-');
-  if (split.length !== 2) {
+  var dashIndex = revision.indexOf('-');
+  if (dashIndex === -1) {
     throw new Error('malformatted revision: ' + revision);
   }
+  var height;
+  if (dashIndex === 1) {
+    height = revision.charCodeAt(0) - 48;
+  } else {
+    height = 0;
+    for (var i = 0; i < dashIndex; i++) {
+      height = height * 10 + (revision.charCodeAt(i) - 48);
+    }
+  }
   return {
-    height: parseInt(split[0], 10),
-    hash: split[1]
+    height,
+    hash: revision.substring(dashIndex + 1)
   };
 }
 
@@ -41,13 +50,14 @@ function getHeightOfRevision(revision) {
   }
   // Fast path for single-digit revision heights (most common case)
   if (dashIndex === 1) {
-    var code = revision.charCodeAt(0);
-    if (code >= 48 && code <= 57) {
-      // '0'-'9'
-      return code - 48;
-    }
+    return revision.charCodeAt(0) - 48;
+  }
+  // Manual number parsing for multi-digit heights (avoids parseInt + substring)
+  var num = 0;
+  for (var i = 0; i < dashIndex; i++) {
+    num = num * 10 + (revision.charCodeAt(i) - 48);
   }
-  return parseInt(revision.substring(0, dashIndex), 10);
+  return num;
 }
 
 /**

package/dist/cjs/plugins/utils/utils-revision.js.map

@@ -1 +1 @@
-{"version":3,"file":"utils-revision.js","names":["_rxError","require","parseRevision","revision","split","length","Error","height","parseInt","hash","getHeightOfRevision","dashIndex","indexOf","newRxError","args","code","charCodeAt","substring","createRevision","databaseInstanceToken","previousDocData","newRevisionHeight","_rev"],"sources":["../../../../src/plugins/utils/utils-revision.ts"],"sourcesContent":["import type {\r\n    RxDocumentData\r\n} from '../../types/index.d.ts';\r\nimport { newRxError } from '../../rx-error.ts';\r\n\r\n/**\r\n * Parses the full revision.\r\n * Do NOT use this if you only need the revision height,\r\n * then use getHeightOfRevision() instead which is faster.\r\n */\r\nexport function parseRevision(revision: string): { height: number; hash: string; } {\r\n    const split = revision.split('-');\r\n    if (split.length !== 2) {\r\n        throw new Error('malformatted revision: ' + revision);\r\n    }\r\n    return {\r\n        height: parseInt(split[0], 10),\r\n        hash: split[1]\r\n    };\r\n}\r\n\r\n/**\r\n * @hotPath Performance is very important here\r\n * because we need to parse the revision height very often.\r\n * Uses indexOf + charCodeAt for maximum performance.\r\n * Single-digit heights (most common) use a fast path\r\n * that avoids parseInt entirely.\r\n */\r\nexport function getHeightOfRevision(revision: string): number {\r\n    const dashIndex = revision.indexOf('-');\r\n    if (dashIndex === -1) {\r\n        throw newRxError('SNH', { args: { revision } });\r\n    }\r\n    // Fast path for single-digit revision heights (most common case)\r\n    if (dashIndex === 1) {\r\n        const code = revision.charCodeAt(0);\r\n        if (code >= 48 && code <= 57) { // '0'-'9'\r\n            return code - 48;\r\n        }\r\n    }\r\n    return parseInt(revision.substring(0, dashIndex), 10);\r\n}\r\n\r\n\r\n/**\r\n * Creates the next write revision for a given document.\r\n */\r\nexport function createRevision<RxDocType>(\r\n    databaseInstanceToken: string,\r\n    previousDocData?: RxDocumentData<RxDocType>\r\n): string {\r\n    const newRevisionHeight = !previousDocData ? 1 : getHeightOfRevision(previousDocData._rev) + 1\r\n    return newRevisionHeight + '-' + databaseInstanceToken;\r\n}\r\n\r\n"],"mappings":";;;;;;;;AAGA,IAAAA,QAAA,GAAAC,OAAA;AAEA;AACA;AACA;AACA;AACA;AACO,SAASC,aAAaA,CAACC,QAAgB,EAAqC;EAC/E,IAAMC,KAAK,GAAGD,QAAQ,CAACC,KAAK,CAAC,GAAG,CAAC;EACjC,IAAIA,KAAK,CAACC,MAAM,KAAK,CAAC,EAAE;IACpB,MAAM,IAAIC,KAAK,CAAC,yBAAyB,GAAGH,QAAQ,CAAC;EACzD;EACA,OAAO;IACHI,MAAM,EAAEC,QAAQ,CAACJ,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;IAC9BK,IAAI,EAAEL,KAAK,CAAC,CAAC;EACjB,CAAC;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASM,mBAAmBA,CAACP,QAAgB,EAAU;EAC1D,IAAMQ,SAAS,GAAGR,QAAQ,CAACS,OAAO,CAAC,GAAG,CAAC;EACvC,IAAID,SAAS,KAAK,CAAC,CAAC,EAAE;IAClB,MAAM,IAAAE,mBAAU,EAAC,KAAK,EAAE;MAAEC,IAAI,EAAE;QAAEX;MAAS;IAAE,CAAC,CAAC;EACnD;EACA;EACA,IAAIQ,SAAS,KAAK,CAAC,EAAE;IACjB,IAAMI,IAAI,GAAGZ,QAAQ,CAACa,UAAU,CAAC,CAAC,CAAC;IACnC,IAAID,IAAI,IAAI,EAAE,IAAIA,IAAI,IAAI,EAAE,EAAE;MAAE;MAC5B,OAAOA,IAAI,GAAG,EAAE;IACpB;EACJ;EACA,OAAOP,QAAQ,CAACL,QAAQ,CAACc,SAAS,CAAC,CAAC,EAAEN,SAAS,CAAC,EAAE,EAAE,CAAC;AACzD;;AAGA;AACA;AACA;AACO,SAASO,cAAcA,CAC1BC,qBAA6B,EAC7BC,eAA2C,EACrC;EACN,IAAMC,iBAAiB,GAAG,CAACD,eAAe,GAAG,CAAC,GAAGV,mBAAmB,CAACU,eAAe,CAACE,IAAI,CAAC,GAAG,CAAC;EAC9F,OAAOD,iBAAiB,GAAG,GAAG,GAAGF,qBAAqB;AAC1D","ignoreList":[]}
+{"version":3,"file":"utils-revision.js","names":["_rxError","require","parseRevision","revision","dashIndex","indexOf","Error","height","charCodeAt","i","hash","substring","getHeightOfRevision","newRxError","args","num","createRevision","databaseInstanceToken","previousDocData","newRevisionHeight","_rev"],"sources":["../../../../src/plugins/utils/utils-revision.ts"],"sourcesContent":["import type {\r\n    RxDocumentData\r\n} from '../../types/index.d.ts';\r\nimport { newRxError } from '../../rx-error.ts';\r\n\r\n/**\r\n * Parses the full revision.\r\n * Do NOT use this if you only need the revision height,\r\n * then use getHeightOfRevision() instead which is faster.\r\n */\r\nexport function parseRevision(revision: string): { height: number; hash: string; } {\r\n    const dashIndex = revision.indexOf('-');\r\n    if (dashIndex === -1) {\r\n        throw new Error('malformatted revision: ' + revision);\r\n    }\r\n    let height: number;\r\n    if (dashIndex === 1) {\r\n        height = revision.charCodeAt(0) - 48;\r\n    } else {\r\n        height = 0;\r\n        for (let i = 0; i < dashIndex; i++) {\r\n            height = height * 10 + (revision.charCodeAt(i) - 48);\r\n        }\r\n    }\r\n    return {\r\n        height,\r\n        hash: revision.substring(dashIndex + 1)\r\n    };\r\n}\r\n\r\n/**\r\n * @hotPath Performance is very important here\r\n * because we need to parse the revision height very often.\r\n * Uses indexOf + charCodeAt for maximum performance.\r\n * Single-digit heights (most common) use a fast path\r\n * that avoids parseInt entirely.\r\n */\r\nexport function getHeightOfRevision(revision: string): number {\r\n    const dashIndex = revision.indexOf('-');\r\n    if (dashIndex === -1) {\r\n        throw newRxError('SNH', { args: { revision } });\r\n    }\r\n    // Fast path for single-digit revision heights (most common case)\r\n    if (dashIndex === 1) {\r\n        return revision.charCodeAt(0) - 48;\r\n    }\r\n    // Manual number parsing for multi-digit heights (avoids parseInt + substring)\r\n    let num = 0;\r\n    for (let i = 0; i < dashIndex; i++) {\r\n        num = num * 10 + (revision.charCodeAt(i) - 48);\r\n    }\r\n    return num;\r\n}\r\n\r\n\r\n/**\r\n * Creates the next write revision for a given document.\r\n */\r\nexport function createRevision<RxDocType>(\r\n    databaseInstanceToken: string,\r\n    previousDocData?: RxDocumentData<RxDocType>\r\n): string {\r\n    const newRevisionHeight = !previousDocData ? 1 : getHeightOfRevision(previousDocData._rev) + 1\r\n    return newRevisionHeight + '-' + databaseInstanceToken;\r\n}\r\n\r\n"],"mappings":";;;;;;;;AAGA,IAAAA,QAAA,GAAAC,OAAA;AAEA;AACA;AACA;AACA;AACA;AACO,SAASC,aAAaA,CAACC,QAAgB,EAAqC;EAC/E,IAAMC,SAAS,GAAGD,QAAQ,CAACE,OAAO,CAAC,GAAG,CAAC;EACvC,IAAID,SAAS,KAAK,CAAC,CAAC,EAAE;IAClB,MAAM,IAAIE,KAAK,CAAC,yBAAyB,GAAGH,QAAQ,CAAC;EACzD;EACA,IAAII,MAAc;EAClB,IAAIH,SAAS,KAAK,CAAC,EAAE;IACjBG,MAAM,GAAGJ,QAAQ,CAACK,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE;EACxC,CAAC,MAAM;IACHD,MAAM,GAAG,CAAC;IACV,KAAK,IAAIE,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGL,SAAS,EAAEK,CAAC,EAAE,EAAE;MAChCF,MAAM,GAAGA,MAAM,GAAG,EAAE,IAAIJ,QAAQ,CAACK,UAAU,CAACC,CAAC,CAAC,GAAG,EAAE,CAAC;IACxD;EACJ;EACA,OAAO;IACHF,MAAM;IACNG,IAAI,EAAEP,QAAQ,CAACQ,SAAS,CAACP,SAAS,GAAG,CAAC;EAC1C,CAAC;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASQ,mBAAmBA,CAACT,QAAgB,EAAU;EAC1D,IAAMC,SAAS,GAAGD,QAAQ,CAACE,OAAO,CAAC,GAAG,CAAC;EACvC,IAAID,SAAS,KAAK,CAAC,CAAC,EAAE;IAClB,MAAM,IAAAS,mBAAU,EAAC,KAAK,EAAE;MAAEC,IAAI,EAAE;QAAEX;MAAS;IAAE,CAAC,CAAC;EACnD;EACA;EACA,IAAIC,SAAS,KAAK,CAAC,EAAE;IACjB,OAAOD,QAAQ,CAACK,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE;EACtC;EACA;EACA,IAAIO,GAAG,GAAG,CAAC;EACX,KAAK,IAAIN,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGL,SAAS,EAAEK,CAAC,EAAE,EAAE;IAChCM,GAAG,GAAGA,GAAG,GAAG,EAAE,IAAIZ,QAAQ,CAACK,UAAU,CAACC,CAAC,CAAC,GAAG,EAAE,CAAC;EAClD;EACA,OAAOM,GAAG;AACd;;AAGA;AACA;AACA;AACO,SAASC,cAAcA,CAC1BC,qBAA6B,EAC7BC,eAA2C,EACrC;EACN,IAAMC,iBAAiB,GAAG,CAACD,eAAe,GAAG,CAAC,GAAGN,mBAAmB,CAACM,eAAe,CAACE,IAAI,CAAC,GAAG,CAAC;EAC9F,OAAOD,iBAAiB,GAAG,GAAG,GAAGF,qBAAqB;AAC1D","ignoreList":[]}

package/dist/cjs/plugins/utils/utils-rxdb-version.js

@@ -7,5 +7,5 @@ exports.RXDB_VERSION = void 0;
 /**
  * This file is replaced in the 'npm run build:version' script.
  */
-var RXDB_VERSION = exports.RXDB_VERSION = '17.0.0-beta.17';
+var RXDB_VERSION = exports.RXDB_VERSION = '17.1.0';
 //# sourceMappingURL=utils-rxdb-version.js.map

package/dist/cjs/plugins/utils/utils-rxdb-version.js.map

@@ -1 +1 @@
-{"version":3,"file":"utils-rxdb-version.js","names":["RXDB_VERSION","exports"],"sources":["../../../../src/plugins/utils/utils-rxdb-version.ts"],"sourcesContent":["/**\r\n * This file is replaced in the 'npm run build:version' script.\r\n */\r\nexport const RXDB_VERSION = '17.0.0-beta.17';\r\n"],"mappings":";;;;;;AAAA;AACA;AACA;AACO,IAAMA,YAAY,GAAAC,OAAA,CAAAD,YAAA,GAAG,gBAAgB","ignoreList":[]}
+{"version":3,"file":"utils-rxdb-version.js","names":["RXDB_VERSION","exports"],"sources":["../../../../src/plugins/utils/utils-rxdb-version.ts"],"sourcesContent":["/**\r\n * This file is replaced in the 'npm run build:version' script.\r\n */\r\nexport const RXDB_VERSION = '17.1.0';\r\n"],"mappings":";;;;;;AAAA;AACA;AACA;AACO,IAAMA,YAAY,GAAAC,OAAA,CAAAD,YAAA,GAAG,QAAQ","ignoreList":[]}

package/dist/cjs/plugins/utils/utils-string.js

@@ -47,16 +47,19 @@ function ucfirst(str) {
  * removes trailing and ending dots from the string
  */
 function trimDots(str) {
-  // start
-  while (str.charAt(0) === '.') {
-    str = str.substr(1);
+  var start = 0;
+  var end = str.length;
+  // charCode 46 is a dot ('.')
+  while (start < end && str.charCodeAt(start) === 46) {
+    start++;
   }
-
-  // end
-  while (str.slice(-1) === '.') {
-    str = str.slice(0, -1);
+  while (end > start && str.charCodeAt(end - 1) === 46) {
+    end--;
+  }
+  if (start === 0 && end === str.length) {
+    return str;
   }
-  return str;
+  return str.substring(start, end);
 }
 
 /**

package/dist/cjs/plugins/utils/utils-string.js.map

@@ -1 +1 @@
-{"version":3,"file":"utils-string.js","names":["COUCH_NAME_CHARS","randomToken","length","text","i","charAt","Math","floor","random","RANDOM_STRING","exports","ucfirst","str","f","toUpperCase","substr","trimDots","slice","lastCharOfString","isFolderPath","name","includes","arrayBufferToString","arrayBuffer","TextDecoder","decode","stringToArrayBuffer","TextEncoder","encode","normalizeString","trim","replace"],"sources":["../../../../src/plugins/utils/utils-string.ts"],"sourcesContent":["const COUCH_NAME_CHARS = 'abcdefghijklmnopqrstuvwxyz';\r\n\r\n/**\r\n * Get a random string which can be used for many things in RxDB.\r\n * The returned string is guaranteed to be a valid database name or collection name\r\n * and also to be a valid JavaScript variable name.\r\n * \r\n * @link http://stackoverflow.com/a/1349426/3443137\r\n */\r\nexport function randomToken(length: number = 10): string {\r\n    let text = '';\r\n\r\n    for (let i = 0; i < length; i++) {\r\n        text += COUCH_NAME_CHARS.charAt(Math.floor(Math.random() * COUCH_NAME_CHARS.length));\r\n    }\r\n\r\n    return text;\r\n}\r\n\r\n\r\n/**\r\n * A random string that is never inside of any storage\r\n */\r\nexport const RANDOM_STRING = 'Fz7SZXPmYJujkzjY1rpXWvlWBqoGAfAX';\r\n\r\n/**\r\n * uppercase first char\r\n */\r\nexport function ucfirst(str: string): string {\r\n    str += '';\r\n    const f = str.charAt(0)\r\n        .toUpperCase();\r\n    return f + str.substr(1);\r\n}\r\n\r\n/**\r\n * removes trailing and ending dots from the string\r\n */\r\nexport function trimDots(str: string): string {\r\n    // start\r\n    while (str.charAt(0) === '.') {\r\n        str = str.substr(1);\r\n    }\r\n\r\n    // end\r\n    while (str.slice(-1) === '.') {\r\n        str = str.slice(0, -1);\r\n    }\r\n\r\n    return str;\r\n}\r\n\r\n/**\r\n * @link https://stackoverflow.com/a/44950500/3443137\r\n */\r\nexport function lastCharOfString(str: string): string {\r\n    return str.charAt(str.length - 1);\r\n}\r\n\r\n/**\r\n * returns true if the given name is likely a folder path\r\n */\r\nexport function isFolderPath(name: string) {\r\n    // do not check, if foldername is given\r\n    if (\r\n        name.includes('/') || // unix\r\n        name.includes('\\\\') // windows\r\n    ) {\r\n        return true;\r\n    } else {\r\n        return false;\r\n    }\r\n}\r\n\r\n\r\n/**\r\n * @link https://gist.github.com/andreburgaud/6f73fd2d690b629346b8\r\n * @link https://stackoverflow.com/a/76240378/3443137\r\n */\r\nexport function arrayBufferToString(arrayBuffer: Uint8Array<ArrayBuffer>) {\r\n    return new TextDecoder().decode(arrayBuffer);\r\n}\r\n\r\nexport function stringToArrayBuffer(str: string): Uint8Array<ArrayBuffer> {\r\n    return new TextEncoder().encode(str);\r\n}\r\n\r\n\r\nexport function normalizeString(str: string): string {\r\n    return str.trim().replace(/[\\n\\s]+/g, '');\r\n}\r\n"],"mappings":";;;;;;;;;;;;;;AAAA,IAAMA,gBAAgB,GAAG,4BAA4B;;AAErD;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,WAAWA,CAACC,MAAc,GAAG,EAAE,EAAU;EACrD,IAAIC,IAAI,GAAG,EAAE;EAEb,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,MAAM,EAAEE,CAAC,EAAE,EAAE;IAC7BD,IAAI,IAAIH,gBAAgB,CAACK,MAAM,CAACC,IAAI,CAACC,KAAK,CAACD,IAAI,CAACE,MAAM,CAAC,CAAC,GAAGR,gBAAgB,CAACE,MAAM,CAAC,CAAC;EACxF;EAEA,OAAOC,IAAI;AACf;;AAGA;AACA;AACA;AACO,IAAMM,aAAa,GAAAC,OAAA,CAAAD,aAAA,GAAG,kCAAkC;;AAE/D;AACA;AACA;AACO,SAASE,OAAOA,CAACC,GAAW,EAAU;EACzCA,GAAG,IAAI,EAAE;EACT,IAAMC,CAAC,GAAGD,GAAG,CAACP,MAAM,CAAC,CAAC,CAAC,CAClBS,WAAW,CAAC,CAAC;EAClB,OAAOD,CAAC,GAAGD,GAAG,CAACG,MAAM,CAAC,CAAC,CAAC;AAC5B;;AAEA;AACA;AACA;AACO,SAASC,QAAQA,CAACJ,GAAW,EAAU;EAC1C;EACA,OAAOA,GAAG,CAACP,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;IAC1BO,GAAG,GAAGA,GAAG,CAACG,MAAM,CAAC,CAAC,CAAC;EACvB;;EAEA;EACA,OAAOH,GAAG,CAACK,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;IAC1BL,GAAG,GAAGA,GAAG,CAACK,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;EAC1B;EAEA,OAAOL,GAAG;AACd;;AAEA;AACA;AACA;AACO,SAASM,gBAAgBA,CAACN,GAAW,EAAU;EAClD,OAAOA,GAAG,CAACP,MAAM,CAACO,GAAG,CAACV,MAAM,GAAG,CAAC,CAAC;AACrC;;AAEA;AACA;AACA;AACO,SAASiB,YAAYA,CAACC,IAAY,EAAE;EACvC;EACA,IACIA,IAAI,CAACC,QAAQ,CAAC,GAAG,CAAC;EAAI;EACtBD,IAAI,CAACC,QAAQ,CAAC,IAAI,CAAC,CAAC;EAAA,EACtB;IACE,OAAO,IAAI;EACf,CAAC,MAAM;IACH,OAAO,KAAK;EAChB;AACJ;;AAGA;AACA;AACA;AACA;AACO,SAASC,mBAAmBA,CAACC,WAAoC,EAAE;EACtE,OAAO,IAAIC,WAAW,CAAC,CAAC,CAACC,MAAM,CAACF,WAAW,CAAC;AAChD;AAEO,SAASG,mBAAmBA,CAACd,GAAW,EAA2B;EACtE,OAAO,IAAIe,WAAW,CAAC,CAAC,CAACC,MAAM,CAAChB,GAAG,CAAC;AACxC;AAGO,SAASiB,eAAeA,CAACjB,GAAW,EAAU;EACjD,OAAOA,GAAG,CAACkB,IAAI,CAAC,CAAC,CAACC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;AAC7C","ignoreList":[]}
+{"version":3,"file":"utils-string.js","names":["COUCH_NAME_CHARS","randomToken","length","text","i","charAt","Math","floor","random","RANDOM_STRING","exports","ucfirst","str","f","toUpperCase","substr","trimDots","start","end","charCodeAt","substring","lastCharOfString","isFolderPath","name","includes","arrayBufferToString","arrayBuffer","TextDecoder","decode","stringToArrayBuffer","TextEncoder","encode","normalizeString","trim","replace"],"sources":["../../../../src/plugins/utils/utils-string.ts"],"sourcesContent":["const COUCH_NAME_CHARS = 'abcdefghijklmnopqrstuvwxyz';\r\n\r\n/**\r\n * Get a random string which can be used for many things in RxDB.\r\n * The returned string is guaranteed to be a valid database name or collection name\r\n * and also to be a valid JavaScript variable name.\r\n * \r\n * @link http://stackoverflow.com/a/1349426/3443137\r\n */\r\nexport function randomToken(length: number = 10): string {\r\n    let text = '';\r\n\r\n    for (let i = 0; i < length; i++) {\r\n        text += COUCH_NAME_CHARS.charAt(Math.floor(Math.random() * COUCH_NAME_CHARS.length));\r\n    }\r\n\r\n    return text;\r\n}\r\n\r\n\r\n/**\r\n * A random string that is never inside of any storage\r\n */\r\nexport const RANDOM_STRING = 'Fz7SZXPmYJujkzjY1rpXWvlWBqoGAfAX';\r\n\r\n/**\r\n * uppercase first char\r\n */\r\nexport function ucfirst(str: string): string {\r\n    str += '';\r\n    const f = str.charAt(0)\r\n        .toUpperCase();\r\n    return f + str.substr(1);\r\n}\r\n\r\n/**\r\n * removes trailing and ending dots from the string\r\n */\r\nexport function trimDots(str: string): string {\r\n    let start = 0;\r\n    let end = str.length;\r\n    // charCode 46 is a dot ('.')\r\n    while (start < end && str.charCodeAt(start) === 46) {\r\n        start++;\r\n    }\r\n    while (end > start && str.charCodeAt(end - 1) === 46) {\r\n        end--;\r\n    }\r\n    if (start === 0 && end === str.length) {\r\n        return str;\r\n    }\r\n    return str.substring(start, end);\r\n}\r\n\r\n/**\r\n * @link https://stackoverflow.com/a/44950500/3443137\r\n */\r\nexport function lastCharOfString(str: string): string {\r\n    return str.charAt(str.length - 1);\r\n}\r\n\r\n/**\r\n * returns true if the given name is likely a folder path\r\n */\r\nexport function isFolderPath(name: string) {\r\n    // do not check, if foldername is given\r\n    if (\r\n        name.includes('/') || // unix\r\n        name.includes('\\\\') // windows\r\n    ) {\r\n        return true;\r\n    } else {\r\n        return false;\r\n    }\r\n}\r\n\r\n\r\n/**\r\n * @link https://gist.github.com/andreburgaud/6f73fd2d690b629346b8\r\n * @link https://stackoverflow.com/a/76240378/3443137\r\n */\r\nexport function arrayBufferToString(arrayBuffer: Uint8Array<ArrayBuffer>) {\r\n    return new TextDecoder().decode(arrayBuffer);\r\n}\r\n\r\nexport function stringToArrayBuffer(str: string): Uint8Array<ArrayBuffer> {\r\n    return new TextEncoder().encode(str);\r\n}\r\n\r\n\r\nexport function normalizeString(str: string): string {\r\n    return str.trim().replace(/[\\n\\s]+/g, '');\r\n}\r\n"],"mappings":";;;;;;;;;;;;;;AAAA,IAAMA,gBAAgB,GAAG,4BAA4B;;AAErD;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,WAAWA,CAACC,MAAc,GAAG,EAAE,EAAU;EACrD,IAAIC,IAAI,GAAG,EAAE;EAEb,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,MAAM,EAAEE,CAAC,EAAE,EAAE;IAC7BD,IAAI,IAAIH,gBAAgB,CAACK,MAAM,CAACC,IAAI,CAACC,KAAK,CAACD,IAAI,CAACE,MAAM,CAAC,CAAC,GAAGR,gBAAgB,CAACE,MAAM,CAAC,CAAC;EACxF;EAEA,OAAOC,IAAI;AACf;;AAGA;AACA;AACA;AACO,IAAMM,aAAa,GAAAC,OAAA,CAAAD,aAAA,GAAG,kCAAkC;;AAE/D;AACA;AACA;AACO,SAASE,OAAOA,CAACC,GAAW,EAAU;EACzCA,GAAG,IAAI,EAAE;EACT,IAAMC,CAAC,GAAGD,GAAG,CAACP,MAAM,CAAC,CAAC,CAAC,CAClBS,WAAW,CAAC,CAAC;EAClB,OAAOD,CAAC,GAAGD,GAAG,CAACG,MAAM,CAAC,CAAC,CAAC;AAC5B;;AAEA;AACA;AACA;AACO,SAASC,QAAQA,CAACJ,GAAW,EAAU;EAC1C,IAAIK,KAAK,GAAG,CAAC;EACb,IAAIC,GAAG,GAAGN,GAAG,CAACV,MAAM;EACpB;EACA,OAAOe,KAAK,GAAGC,GAAG,IAAIN,GAAG,CAACO,UAAU,CAACF,KAAK,CAAC,KAAK,EAAE,EAAE;IAChDA,KAAK,EAAE;EACX;EACA,OAAOC,GAAG,GAAGD,KAAK,IAAIL,GAAG,CAACO,UAAU,CAACD,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;IAClDA,GAAG,EAAE;EACT;EACA,IAAID,KAAK,KAAK,CAAC,IAAIC,GAAG,KAAKN,GAAG,CAACV,MAAM,EAAE;IACnC,OAAOU,GAAG;EACd;EACA,OAAOA,GAAG,CAACQ,SAAS,CAACH,KAAK,EAAEC,GAAG,CAAC;AACpC;;AAEA;AACA;AACA;AACO,SAASG,gBAAgBA,CAACT,GAAW,EAAU;EAClD,OAAOA,GAAG,CAACP,MAAM,CAACO,GAAG,CAACV,MAAM,GAAG,CAAC,CAAC;AACrC;;AAEA;AACA;AACA;AACO,SAASoB,YAAYA,CAACC,IAAY,EAAE;EACvC;EACA,IACIA,IAAI,CAACC,QAAQ,CAAC,GAAG,CAAC;EAAI;EACtBD,IAAI,CAACC,QAAQ,CAAC,IAAI,CAAC,CAAC;EAAA,EACtB;IACE,OAAO,IAAI;EACf,CAAC,MAAM;IACH,OAAO,KAAK;EAChB;AACJ;;AAGA;AACA;AACA;AACA;AACO,SAASC,mBAAmBA,CAACC,WAAoC,EAAE;EACtE,OAAO,IAAIC,WAAW,CAAC,CAAC,CAACC,MAAM,CAACF,WAAW,CAAC;AAChD;AAEO,SAASG,mBAAmBA,CAACjB,GAAW,EAA2B;EACtE,OAAO,IAAIkB,WAAW,CAAC,CAAC,CAACC,MAAM,CAACnB,GAAG,CAAC;AACxC;AAGO,SAASoB,eAAeA,CAACpB,GAAW,EAAU;EACjD,OAAOA,GAAG,CAACqB,IAAI,CAAC,CAAC,CAACC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;AAC7C","ignoreList":[]}

package/dist/cjs/plugins/utils/utils-time.js

@@ -15,28 +15,33 @@ exports.now = now;
  * We had to move from having no decimals, to having two decimal
  * because it turned out that some storages are such fast that
  * calling this method too often would return 'the future'.
+ *
+ * Tracks the current millisecond and a sub-millisecond counter (1-99)
+ * separately as integers to avoid floating point rounding errors
+ * and eliminate the need for Math.round().
  */
-var _lastNow = 0;
+var _lastNowMs = 0;
+var _lastNowSub = 0;
 /**
  * Returns the current time in milliseconds,
  * also ensures to not return the same value twice.
  */
 function now() {
-  var ret = Date.now();
-  ret = ret + 0.01;
-  if (ret <= _lastNow) {
-    ret = _lastNow + 0.01;
+  var dateNow = Date.now();
+  if (dateNow > _lastNowMs) {
+    _lastNowMs = dateNow;
+    /**
+     * Start at 1 (not 0) so the returned value is always
+     * dateNow + 0.01 at minimum, matching the original behavior
+     * of always adding 0.01 to Date.now().
+     */
+    _lastNowSub = 1;
+  } else {
+    if (++_lastNowSub === 100) {
+      _lastNowMs++;
+      _lastNowSub = 1;
+    }
   }
-
-  /**
-   * Strip the returned number to max two decimals.
-   * In theory we would not need this but
-   * in practice JavaScript has no such good number precision
-   * so rounding errors could add another decimal place.
-   * Use Math.round instead of toFixed(2)+parseFloat for better performance.
-   */
-  var twoDecimals = Math.round(ret * 100) / 100;
-  _lastNow = twoDecimals;
-  return twoDecimals;
+  return _lastNowMs + _lastNowSub * 0.01;
 }
 //# sourceMappingURL=utils-time.js.map

package/dist/cjs/plugins/utils/utils-time.js.map

@@ -1 +1 @@
-{"version":3,"file":"utils-time.js","names":["_lastNow","now","ret","Date","twoDecimals","Math","round"],"sources":["../../../../src/plugins/utils/utils-time.ts"],"sourcesContent":["\r\n/**\r\n * Returns the current unix time in milliseconds (with two decimals!)\r\n * Because the accuracy of getTime() in javascript is bad,\r\n * and we cannot rely on performance.now() on all platforms,\r\n * this method implements a way to never return the same value twice.\r\n * This ensures that when now() is called often, we do not loose the information\r\n * about which call came first and which came after.\r\n *\r\n * We had to move from having no decimals, to having two decimal\r\n * because it turned out that some storages are such fast that\r\n * calling this method too often would return 'the future'.\r\n */\r\nlet _lastNow: number = 0;\r\n/**\r\n * Returns the current time in milliseconds,\r\n * also ensures to not return the same value twice.\r\n */\r\nexport function now(): number {\r\n    let ret = Date.now();\r\n    ret = ret + 0.01;\r\n    if (ret <= _lastNow) {\r\n        ret = _lastNow + 0.01;\r\n    }\r\n\r\n    /**\r\n     * Strip the returned number to max two decimals.\r\n     * In theory we would not need this but\r\n     * in practice JavaScript has no such good number precision\r\n     * so rounding errors could add another decimal place.\r\n     * Use Math.round instead of toFixed(2)+parseFloat for better performance.\r\n     */\r\n    const twoDecimals = Math.round(ret * 100) / 100;\r\n\r\n    _lastNow = twoDecimals;\r\n    return twoDecimals;\r\n}\r\n"],"mappings":";;;;;;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIA,QAAgB,GAAG,CAAC;AACxB;AACA;AACA;AACA;AACO,SAASC,GAAGA,CAAA,EAAW;EAC1B,IAAIC,GAAG,GAAGC,IAAI,CAACF,GAAG,CAAC,CAAC;EACpBC,GAAG,GAAGA,GAAG,GAAG,IAAI;EAChB,IAAIA,GAAG,IAAIF,QAAQ,EAAE;IACjBE,GAAG,GAAGF,QAAQ,GAAG,IAAI;EACzB;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACI,IAAMI,WAAW,GAAGC,IAAI,CAACC,KAAK,CAACJ,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG;EAE/CF,QAAQ,GAAGI,WAAW;EACtB,OAAOA,WAAW;AACtB","ignoreList":[]}
+{"version":3,"file":"utils-time.js","names":["_lastNowMs","_lastNowSub","now","dateNow","Date"],"sources":["../../../../src/plugins/utils/utils-time.ts"],"sourcesContent":["\r\n/**\r\n * Returns the current unix time in milliseconds (with two decimals!)\r\n * Because the accuracy of getTime() in javascript is bad,\r\n * and we cannot rely on performance.now() on all platforms,\r\n * this method implements a way to never return the same value twice.\r\n * This ensures that when now() is called often, we do not loose the information\r\n * about which call came first and which came after.\r\n *\r\n * We had to move from having no decimals, to having two decimal\r\n * because it turned out that some storages are such fast that\r\n * calling this method too often would return 'the future'.\r\n *\r\n * Tracks the current millisecond and a sub-millisecond counter (1-99)\r\n * separately as integers to avoid floating point rounding errors\r\n * and eliminate the need for Math.round().\r\n */\r\nlet _lastNowMs: number = 0;\r\nlet _lastNowSub: number = 0;\r\n/**\r\n * Returns the current time in milliseconds,\r\n * also ensures to not return the same value twice.\r\n */\r\nexport function now(): number {\r\n    const dateNow = Date.now();\r\n    if (dateNow > _lastNowMs) {\r\n        _lastNowMs = dateNow;\r\n        /**\r\n         * Start at 1 (not 0) so the returned value is always\r\n         * dateNow + 0.01 at minimum, matching the original behavior\r\n         * of always adding 0.01 to Date.now().\r\n         */\r\n        _lastNowSub = 1;\r\n    } else {\r\n        if (++_lastNowSub === 100) {\r\n            _lastNowMs++;\r\n            _lastNowSub = 1;\r\n        }\r\n    }\r\n    return _lastNowMs + _lastNowSub * 0.01;\r\n}\r\n"],"mappings":";;;;;;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIA,UAAkB,GAAG,CAAC;AAC1B,IAAIC,WAAmB,GAAG,CAAC;AAC3B;AACA;AACA;AACA;AACO,SAASC,GAAGA,CAAA,EAAW;EAC1B,IAAMC,OAAO,GAAGC,IAAI,CAACF,GAAG,CAAC,CAAC;EAC1B,IAAIC,OAAO,GAAGH,UAAU,EAAE;IACtBA,UAAU,GAAGG,OAAO;IACpB;AACR;AACA;AACA;AACA;IACQF,WAAW,GAAG,CAAC;EACnB,CAAC,MAAM;IACH,IAAI,EAAEA,WAAW,KAAK,GAAG,EAAE;MACvBD,UAAU,EAAE;MACZC,WAAW,GAAG,CAAC;IACnB;EACJ;EACA,OAAOD,UAAU,GAAGC,WAAW,GAAG,IAAI;AAC1C","ignoreList":[]}

package/dist/cjs/query-cache.js

@@ -40,6 +40,9 @@ function uncacheRxQuery(queryCache, rxQuery) {
   queryCache._map.delete(stringRep);
 }
 function countRxQuerySubscribers(rxQuery) {
+  if (!rxQuery._refCount$) {
+    return 0;
+  }
   return rxQuery.refCount$.observers.length;
 }
 var DEFAULT_TRY_TO_KEEP_MAX = exports.DEFAULT_TRY_TO_KEEP_MAX = 100;
@@ -51,11 +54,10 @@ var DEFAULT_UNEXECUTED_LIFETIME = exports.DEFAULT_UNEXECUTED_LIFETIME = 30 * 100
  * Notice that this runs often and should block the cpu as less as possible
  * This is a monad which makes it easier to unit test
  */
-var defaultCacheReplacementPolicyMonad = (tryToKeepMax, unExecutedLifetime) => (_collection, queryCache) => {
+var defaultCacheReplacementPolicyMonad = (tryToKeepMax, _unExecutedLifetime) => (_collection, queryCache) => {
   if (queryCache._map.size < tryToKeepMax) {
     return;
   }
-  var minUnExecutedLifetime = (0, _index.now)() - unExecutedLifetime;
   var maybeUncache = [];
   var queriesInCache = Array.from(queryCache._map.values());
   for (var rxQuery of queriesInCache) {
@@ -63,8 +65,8 @@ var defaultCacheReplacementPolicyMonad = (tryToKeepMax, unExecutedLifetime) => (
     if (countRxQuerySubscribers(rxQuery) > 0) {
       continue;
     }
-    // directly uncache queries that never executed and are older than unExecutedLifetime
-    if (rxQuery._lastEnsureEqual === 0 && rxQuery._creationTime < minUnExecutedLifetime) {
+    // directly uncache queries that have never been executed
+    if (rxQuery._lastEnsureEqual === 0) {
       uncacheRxQuery(queryCache, rxQuery);
       continue;
     }

package/dist/cjs/query-cache.js.map

@@ -1 +1 @@
-{"version":3,"file":"query-cache.js","names":["_index","require","QueryCache","exports","_map","Map","_proto","prototype","getByQuery","rxQuery","stringRep","toString","ret","getFromMapOrCreate","createQueryCache","uncacheRxQuery","queryCache","uncached","delete","countRxQuerySubscribers","refCount$","observers","length","DEFAULT_TRY_TO_KEEP_MAX","DEFAULT_UNEXECUTED_LIFETIME","defaultCacheReplacementPolicyMonad","tryToKeepMax","unExecutedLifetime","_collection","size","minUnExecutedLifetime","now","maybeUncache","queriesInCache","Array","from","values","_lastEnsureEqual","_creationTime","push","mustUncache","sortedByLastUsage","sort","a","b","toRemove","slice","forEach","defaultCacheReplacementPolicy","COLLECTIONS_WITH_RUNNING_CLEANUP","WeakSet","triggerCacheReplacement","rxCollection","has","add","nextTick","then","requestIdlePromise","closed","cacheReplacementPolicy","_queryCache"],"sources":["../../src/query-cache.ts"],"sourcesContent":["/**\r\n * the query-cache makes sure that on every query-state, exactly one instance can exist\r\n * if you use the same mango-query more than once, it will reuse the first RxQuery\r\n */\r\nimport type {\r\n    RxQuery,\r\n    RxCacheReplacementPolicy,\r\n    RxCollection\r\n} from './types/index.d.ts';\r\nimport {\r\n    getFromMapOrCreate,\r\n    nextTick,\r\n    now,\r\n    requestIdlePromise\r\n} from './plugins/utils/index.ts';\r\n\r\nexport class QueryCache {\r\n    public _map: Map<string, RxQuery> = new Map();\r\n\r\n    /**\r\n     * check if an equal query is in the cache,\r\n     * if true, return the cached one,\r\n     * if false, save the given one and return it\r\n     */\r\n    getByQuery(rxQuery: RxQuery): RxQuery {\r\n        const stringRep = rxQuery.toString();\r\n        const ret = getFromMapOrCreate(\r\n            this._map,\r\n            stringRep,\r\n            () => rxQuery\r\n        );\r\n        return ret;\r\n    }\r\n}\r\n\r\nexport function createQueryCache() {\r\n    return new QueryCache();\r\n}\r\n\r\n\r\nexport function uncacheRxQuery(queryCache: QueryCache, rxQuery: RxQuery) {\r\n    rxQuery.uncached = true;\r\n    const stringRep = rxQuery.toString();\r\n    queryCache._map.delete(stringRep);\r\n\r\n}\r\n\r\n\r\nexport function countRxQuerySubscribers(rxQuery: RxQuery): number {\r\n    return rxQuery.refCount$.observers.length;\r\n}\r\n\r\n\r\nexport const DEFAULT_TRY_TO_KEEP_MAX = 100;\r\nexport const DEFAULT_UNEXECUTED_LIFETIME = 30 * 1000;\r\n\r\n/**\r\n * The default cache replacement policy\r\n * See docs-src/query-cache.md to learn how it should work.\r\n * Notice that this runs often and should block the cpu as less as possible\r\n * This is a monad which makes it easier to unit test\r\n */\r\nexport const defaultCacheReplacementPolicyMonad: (\r\n    tryToKeepMax: number,\r\n    unExecutedLifetime: number\r\n) => RxCacheReplacementPolicy = (\r\n    tryToKeepMax,\r\n    unExecutedLifetime\r\n) => (\r\n    _collection: RxCollection,\r\n    queryCache: QueryCache\r\n) => {\r\n            if (queryCache._map.size < tryToKeepMax) {\r\n                return;\r\n            }\r\n\r\n            const minUnExecutedLifetime = now() - unExecutedLifetime;\r\n            const maybeUncache: RxQuery[] = [];\r\n\r\n            const queriesInCache = Array.from(queryCache._map.values());\r\n            for (const rxQuery of queriesInCache) {\r\n                // filter out queries with subscribers\r\n                if (countRxQuerySubscribers(rxQuery) > 0) {\r\n                    continue;\r\n                }\r\n                // directly uncache queries that never executed and are older than unExecutedLifetime\r\n                if (rxQuery._lastEnsureEqual === 0 && rxQuery._creationTime < minUnExecutedLifetime) {\r\n                    uncacheRxQuery(queryCache, rxQuery);\r\n                    continue;\r\n                }\r\n                maybeUncache.push(rxQuery);\r\n            }\r\n\r\n            const mustUncache = maybeUncache.length - tryToKeepMax;\r\n            if (mustUncache <= 0) {\r\n                return;\r\n            }\r\n\r\n            const sortedByLastUsage = maybeUncache.sort((a, b) => a._lastEnsureEqual - b._lastEnsureEqual);\r\n            const toRemove = sortedByLastUsage.slice(0, mustUncache);\r\n            toRemove.forEach(rxQuery => uncacheRxQuery(queryCache, rxQuery));\r\n        };\r\n\r\n\r\nexport const defaultCacheReplacementPolicy: RxCacheReplacementPolicy = defaultCacheReplacementPolicyMonad(\r\n    DEFAULT_TRY_TO_KEEP_MAX,\r\n    DEFAULT_UNEXECUTED_LIFETIME\r\n);\r\n\r\nexport const COLLECTIONS_WITH_RUNNING_CLEANUP: WeakSet<RxCollection> = new WeakSet();\r\n\r\n/**\r\n * Triggers the cache replacement policy after waitTime has passed.\r\n * We do not run this directly because at exactly the time a query is created,\r\n * we need all CPU to minimize latency.\r\n * Also this should not be triggered multiple times when waitTime is still waiting.\r\n */\r\nexport function triggerCacheReplacement(\r\n    rxCollection: RxCollection\r\n) {\r\n    if (COLLECTIONS_WITH_RUNNING_CLEANUP.has(rxCollection)) {\r\n        // already started\r\n        return;\r\n    }\r\n\r\n    COLLECTIONS_WITH_RUNNING_CLEANUP.add(rxCollection);\r\n\r\n    /**\r\n     * Do not run directly to not reduce result latency of a new query\r\n     */\r\n    nextTick() // wait at least one tick\r\n        .then(() => requestIdlePromise(200)) // and then wait for the CPU to be idle\r\n        .then(() => {\r\n            if (!rxCollection.closed) {\r\n                rxCollection.cacheReplacementPolicy(rxCollection, rxCollection._queryCache);\r\n            }\r\n            COLLECTIONS_WITH_RUNNING_CLEANUP.delete(rxCollection);\r\n        });\r\n}\r\n"],"mappings":";;;;;;;;;;;AASA,IAAAA,MAAA,GAAAC,OAAA;AATA;AACA;AACA;AACA;AAHA,IAgBaC,UAAU,GAAAC,OAAA,CAAAD,UAAA;EAAA,SAAAA,WAAA;IAAA,KACZE,IAAI,GAAyB,IAAIC,GAAG,CAAC,CAAC;EAAA;EAAA,IAAAC,MAAA,GAAAJ,UAAA,CAAAK,SAAA;EAE7C;AACJ;AACA;AACA;AACA;EAJID,MAAA,CAKAE,UAAU,GAAV,SAAAA,UAAUA,CAACC,OAAgB,EAAW;IAClC,IAAMC,SAAS,GAAGD,OAAO,CAACE,QAAQ,CAAC,CAAC;IACpC,IAAMC,GAAG,GAAG,IAAAC,yBAAkB,EAC1B,IAAI,CAACT,IAAI,EACTM,SAAS,EACT,MAAMD,OACV,CAAC;IACD,OAAOG,GAAG;EACd,CAAC;EAAA,OAAAV,UAAA;AAAA;AAGE,SAASY,gBAAgBA,CAAA,EAAG;EAC/B,OAAO,IAAIZ,UAAU,CAAC,CAAC;AAC3B;AAGO,SAASa,cAAcA,CAACC,UAAsB,EAAEP,OAAgB,EAAE;EACrEA,OAAO,CAACQ,QAAQ,GAAG,IAAI;EACvB,IAAMP,SAAS,GAAGD,OAAO,CAACE,QAAQ,CAAC,CAAC;EACpCK,UAAU,CAACZ,IAAI,CAACc,MAAM,CAACR,SAAS,CAAC;AAErC;AAGO,SAASS,uBAAuBA,CAACV,OAAgB,EAAU;EAC9D,OAAOA,OAAO,CAACW,SAAS,CAACC,SAAS,CAACC,MAAM;AAC7C;AAGO,IAAMC,uBAAuB,GAAApB,OAAA,CAAAoB,uBAAA,GAAG,GAAG;AACnC,IAAMC,2BAA2B,GAAArB,OAAA,CAAAqB,2BAAA,GAAG,EAAE,GAAG,IAAI;;AAEpD;AACA;AACA;AACA;AACA;AACA;AACO,IAAMC,kCAGgB,GAAGA,CAC5BC,YAAY,EACZC,kBAAkB,KACjB,CACDC,WAAyB,EACzBZ,UAAsB,KACrB;EACO,IAAIA,UAAU,CAACZ,IAAI,CAACyB,IAAI,GAAGH,YAAY,EAAE;IACrC;EACJ;EAEA,IAAMI,qBAAqB,GAAG,IAAAC,UAAG,EAAC,CAAC,GAAGJ,kBAAkB;EACxD,IAAMK,YAAuB,GAAG,EAAE;EAElC,IAAMC,cAAc,GAAGC,KAAK,CAACC,IAAI,CAACnB,UAAU,CAACZ,IAAI,CAACgC,MAAM,CAAC,CAAC,CAAC;EAC3D,KAAK,IAAM3B,OAAO,IAAIwB,cAAc,EAAE;IAClC;IACA,IAAId,uBAAuB,CAACV,OAAO,CAAC,GAAG,CAAC,EAAE;MACtC;IACJ;IACA;IACA,IAAIA,OAAO,CAAC4B,gBAAgB,KAAK,CAAC,IAAI5B,OAAO,CAAC6B,aAAa,GAAGR,qBAAqB,EAAE;MACjFf,cAAc,CAACC,UAAU,EAAEP,OAAO,CAAC;MACnC;IACJ;IACAuB,YAAY,CAACO,IAAI,CAAC9B,OAAO,CAAC;EAC9B;EAEA,IAAM+B,WAAW,GAAGR,YAAY,CAACV,MAAM,GAAGI,YAAY;EACtD,IAAIc,WAAW,IAAI,CAAC,EAAE;IAClB;EACJ;EAEA,IAAMC,iBAAiB,GAAGT,YAAY,CAACU,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAACN,gBAAgB,GAAGO,CAAC,CAACP,gBAAgB,CAAC;EAC9F,IAAMQ,QAAQ,GAAGJ,iBAAiB,CAACK,KAAK,CAAC,CAAC,EAAEN,WAAW,CAAC;EACxDK,QAAQ,CAACE,OAAO,CAACtC,OAAO,IAAIM,cAAc,CAACC,UAAU,EAAEP,OAAO,CAAC,CAAC;AACpE,CAAC;AAACN,OAAA,CAAAsB,kCAAA,GAAAA,kCAAA;AAGH,IAAMuB,6BAAuD,GAAA7C,OAAA,CAAA6C,6BAAA,GAAGvB,kCAAkC,CACrGF,uBAAuB,EACvBC,2BACJ,CAAC;AAEM,IAAMyB,gCAAuD,GAAA9C,OAAA,CAAA8C,gCAAA,GAAG,IAAIC,OAAO,CAAC,CAAC;;AAEpF;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,uBAAuBA,CACnCC,YAA0B,EAC5B;EACE,IAAIH,gCAAgC,CAACI,GAAG,CAACD,YAAY,CAAC,EAAE;IACpD;IACA;EACJ;EAEAH,gCAAgC,CAACK,GAAG,CAACF,YAAY,CAAC;;EAElD;AACJ;AACA;EACI,IAAAG,eAAQ,EAAC,CAAC,CAAC;EAAA,CACNC,IAAI,CAAC,MAAM,IAAAC,yBAAkB,EAAC,GAAG,CAAC,CAAC,CAAC;EAAA,CACpCD,IAAI,CAAC,MAAM;IACR,IAAI,CAACJ,YAAY,CAACM,MAAM,EAAE;MACtBN,YAAY,CAACO,sBAAsB,CAACP,YAAY,EAAEA,YAAY,CAACQ,WAAW,CAAC;IAC/E;IACAX,gCAAgC,CAAC/B,MAAM,CAACkC,YAAY,CAAC;EACzD,CAAC,CAAC;AACV","ignoreList":[]}
+{"version":3,"file":"query-cache.js","names":["_index","require","QueryCache","exports","_map","Map","_proto","prototype","getByQuery","rxQuery","stringRep","toString","ret","getFromMapOrCreate","createQueryCache","uncacheRxQuery","queryCache","uncached","delete","countRxQuerySubscribers","_refCount$","refCount$","observers","length","DEFAULT_TRY_TO_KEEP_MAX","DEFAULT_UNEXECUTED_LIFETIME","defaultCacheReplacementPolicyMonad","tryToKeepMax","_unExecutedLifetime","_collection","size","maybeUncache","queriesInCache","Array","from","values","_lastEnsureEqual","push","mustUncache","sortedByLastUsage","sort","a","b","toRemove","slice","forEach","defaultCacheReplacementPolicy","COLLECTIONS_WITH_RUNNING_CLEANUP","WeakSet","triggerCacheReplacement","rxCollection","has","add","nextTick","then","requestIdlePromise","closed","cacheReplacementPolicy","_queryCache"],"sources":["../../src/query-cache.ts"],"sourcesContent":["/**\r\n * the query-cache makes sure that on every query-state, exactly one instance can exist\r\n * if you use the same mango-query more than once, it will reuse the first RxQuery\r\n */\r\nimport type {\r\n    RxQuery,\r\n    RxCacheReplacementPolicy,\r\n    RxCollection\r\n} from './types/index.d.ts';\r\nimport {\r\n    getFromMapOrCreate,\r\n    nextTick,\r\n    requestIdlePromise\r\n} from './plugins/utils/index.ts';\r\n\r\nexport class QueryCache {\r\n    public _map: Map<string, RxQuery> = new Map();\r\n\r\n    /**\r\n     * check if an equal query is in the cache,\r\n     * if true, return the cached one,\r\n     * if false, save the given one and return it\r\n     */\r\n    getByQuery(rxQuery: RxQuery): RxQuery {\r\n        const stringRep = rxQuery.toString();\r\n        const ret = getFromMapOrCreate(\r\n            this._map,\r\n            stringRep,\r\n            () => rxQuery\r\n        );\r\n        return ret;\r\n    }\r\n}\r\n\r\nexport function createQueryCache() {\r\n    return new QueryCache();\r\n}\r\n\r\n\r\nexport function uncacheRxQuery(queryCache: QueryCache, rxQuery: RxQuery) {\r\n    rxQuery.uncached = true;\r\n    const stringRep = rxQuery.toString();\r\n    queryCache._map.delete(stringRep);\r\n\r\n}\r\n\r\n\r\nexport function countRxQuerySubscribers(rxQuery: RxQuery): number {\r\n    if (!(rxQuery as any)._refCount$) {\r\n        return 0;\r\n    }\r\n    return rxQuery.refCount$.observers.length;\r\n}\r\n\r\n\r\nexport const DEFAULT_TRY_TO_KEEP_MAX = 100;\r\nexport const DEFAULT_UNEXECUTED_LIFETIME = 30 * 1000;\r\n\r\n/**\r\n * The default cache replacement policy\r\n * See docs-src/query-cache.md to learn how it should work.\r\n * Notice that this runs often and should block the cpu as less as possible\r\n * This is a monad which makes it easier to unit test\r\n */\r\nexport const defaultCacheReplacementPolicyMonad: (\r\n    tryToKeepMax: number,\r\n    unExecutedLifetime: number\r\n) => RxCacheReplacementPolicy = (\r\n    tryToKeepMax,\r\n    _unExecutedLifetime\r\n) => (\r\n    _collection: RxCollection,\r\n    queryCache: QueryCache\r\n) => {\r\n            if (queryCache._map.size < tryToKeepMax) {\r\n                return;\r\n            }\r\n\r\n            const maybeUncache: RxQuery[] = [];\r\n\r\n            const queriesInCache = Array.from(queryCache._map.values());\r\n            for (const rxQuery of queriesInCache) {\r\n                // filter out queries with subscribers\r\n                if (countRxQuerySubscribers(rxQuery) > 0) {\r\n                    continue;\r\n                }\r\n                // directly uncache queries that have never been executed\r\n                if (rxQuery._lastEnsureEqual === 0) {\r\n                    uncacheRxQuery(queryCache, rxQuery);\r\n                    continue;\r\n                }\r\n                maybeUncache.push(rxQuery);\r\n            }\r\n\r\n            const mustUncache = maybeUncache.length - tryToKeepMax;\r\n            if (mustUncache <= 0) {\r\n                return;\r\n            }\r\n\r\n            const sortedByLastUsage = maybeUncache.sort((a, b) => a._lastEnsureEqual - b._lastEnsureEqual);\r\n            const toRemove = sortedByLastUsage.slice(0, mustUncache);\r\n            toRemove.forEach(rxQuery => uncacheRxQuery(queryCache, rxQuery));\r\n        };\r\n\r\n\r\nexport const defaultCacheReplacementPolicy: RxCacheReplacementPolicy = defaultCacheReplacementPolicyMonad(\r\n    DEFAULT_TRY_TO_KEEP_MAX,\r\n    DEFAULT_UNEXECUTED_LIFETIME\r\n);\r\n\r\nexport const COLLECTIONS_WITH_RUNNING_CLEANUP: WeakSet<RxCollection> = new WeakSet();\r\n\r\n/**\r\n * Triggers the cache replacement policy after waitTime has passed.\r\n * We do not run this directly because at exactly the time a query is created,\r\n * we need all CPU to minimize latency.\r\n * Also this should not be triggered multiple times when waitTime is still waiting.\r\n */\r\nexport function triggerCacheReplacement(\r\n    rxCollection: RxCollection\r\n) {\r\n    if (COLLECTIONS_WITH_RUNNING_CLEANUP.has(rxCollection)) {\r\n        // already started\r\n        return;\r\n    }\r\n\r\n    COLLECTIONS_WITH_RUNNING_CLEANUP.add(rxCollection);\r\n\r\n    /**\r\n     * Do not run directly to not reduce result latency of a new query\r\n     */\r\n    nextTick() // wait at least one tick\r\n        .then(() => requestIdlePromise(200)) // and then wait for the CPU to be idle\r\n        .then(() => {\r\n            if (!rxCollection.closed) {\r\n                rxCollection.cacheReplacementPolicy(rxCollection, rxCollection._queryCache);\r\n            }\r\n            COLLECTIONS_WITH_RUNNING_CLEANUP.delete(rxCollection);\r\n        });\r\n}\r\n"],"mappings":";;;;;;;;;;;AASA,IAAAA,MAAA,GAAAC,OAAA;AATA;AACA;AACA;AACA;AAHA,IAeaC,UAAU,GAAAC,OAAA,CAAAD,UAAA;EAAA,SAAAA,WAAA;IAAA,KACZE,IAAI,GAAyB,IAAIC,GAAG,CAAC,CAAC;EAAA;EAAA,IAAAC,MAAA,GAAAJ,UAAA,CAAAK,SAAA;EAE7C;AACJ;AACA;AACA;AACA;EAJID,MAAA,CAKAE,UAAU,GAAV,SAAAA,UAAUA,CAACC,OAAgB,EAAW;IAClC,IAAMC,SAAS,GAAGD,OAAO,CAACE,QAAQ,CAAC,CAAC;IACpC,IAAMC,GAAG,GAAG,IAAAC,yBAAkB,EAC1B,IAAI,CAACT,IAAI,EACTM,SAAS,EACT,MAAMD,OACV,CAAC;IACD,OAAOG,GAAG;EACd,CAAC;EAAA,OAAAV,UAAA;AAAA;AAGE,SAASY,gBAAgBA,CAAA,EAAG;EAC/B,OAAO,IAAIZ,UAAU,CAAC,CAAC;AAC3B;AAGO,SAASa,cAAcA,CAACC,UAAsB,EAAEP,OAAgB,EAAE;EACrEA,OAAO,CAACQ,QAAQ,GAAG,IAAI;EACvB,IAAMP,SAAS,GAAGD,OAAO,CAACE,QAAQ,CAAC,CAAC;EACpCK,UAAU,CAACZ,IAAI,CAACc,MAAM,CAACR,SAAS,CAAC;AAErC;AAGO,SAASS,uBAAuBA,CAACV,OAAgB,EAAU;EAC9D,IAAI,CAAEA,OAAO,CAASW,UAAU,EAAE;IAC9B,OAAO,CAAC;EACZ;EACA,OAAOX,OAAO,CAACY,SAAS,CAACC,SAAS,CAACC,MAAM;AAC7C;AAGO,IAAMC,uBAAuB,GAAArB,OAAA,CAAAqB,uBAAA,GAAG,GAAG;AACnC,IAAMC,2BAA2B,GAAAtB,OAAA,CAAAsB,2BAAA,GAAG,EAAE,GAAG,IAAI;;AAEpD;AACA;AACA;AACA;AACA;AACA;AACO,IAAMC,kCAGgB,GAAGA,CAC5BC,YAAY,EACZC,mBAAmB,KAClB,CACDC,WAAyB,EACzBb,UAAsB,KACrB;EACO,IAAIA,UAAU,CAACZ,IAAI,CAAC0B,IAAI,GAAGH,YAAY,EAAE;IACrC;EACJ;EAEA,IAAMI,YAAuB,GAAG,EAAE;EAElC,IAAMC,cAAc,GAAGC,KAAK,CAACC,IAAI,CAAClB,UAAU,CAACZ,IAAI,CAAC+B,MAAM,CAAC,CAAC,CAAC;EAC3D,KAAK,IAAM1B,OAAO,IAAIuB,cAAc,EAAE;IAClC;IACA,IAAIb,uBAAuB,CAACV,OAAO,CAAC,GAAG,CAAC,EAAE;MACtC;IACJ;IACA;IACA,IAAIA,OAAO,CAAC2B,gBAAgB,KAAK,CAAC,EAAE;MAChCrB,cAAc,CAACC,UAAU,EAAEP,OAAO,CAAC;MACnC;IACJ;IACAsB,YAAY,CAACM,IAAI,CAAC5B,OAAO,CAAC;EAC9B;EAEA,IAAM6B,WAAW,GAAGP,YAAY,CAACR,MAAM,GAAGI,YAAY;EACtD,IAAIW,WAAW,IAAI,CAAC,EAAE;IAClB;EACJ;EAEA,IAAMC,iBAAiB,GAAGR,YAAY,CAACS,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAACL,gBAAgB,GAAGM,CAAC,CAACN,gBAAgB,CAAC;EAC9F,IAAMO,QAAQ,GAAGJ,iBAAiB,CAACK,KAAK,CAAC,CAAC,EAAEN,WAAW,CAAC;EACxDK,QAAQ,CAACE,OAAO,CAACpC,OAAO,IAAIM,cAAc,CAACC,UAAU,EAAEP,OAAO,CAAC,CAAC;AACpE,CAAC;AAACN,OAAA,CAAAuB,kCAAA,GAAAA,kCAAA;AAGH,IAAMoB,6BAAuD,GAAA3C,OAAA,CAAA2C,6BAAA,GAAGpB,kCAAkC,CACrGF,uBAAuB,EACvBC,2BACJ,CAAC;AAEM,IAAMsB,gCAAuD,GAAA5C,OAAA,CAAA4C,gCAAA,GAAG,IAAIC,OAAO,CAAC,CAAC;;AAEpF;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,uBAAuBA,CACnCC,YAA0B,EAC5B;EACE,IAAIH,gCAAgC,CAACI,GAAG,CAACD,YAAY,CAAC,EAAE;IACpD;IACA;EACJ;EAEAH,gCAAgC,CAACK,GAAG,CAACF,YAAY,CAAC;;EAElD;AACJ;AACA;EACI,IAAAG,eAAQ,EAAC,CAAC,CAAC;EAAA,CACNC,IAAI,CAAC,MAAM,IAAAC,yBAAkB,EAAC,GAAG,CAAC,CAAC,CAAC;EAAA,CACpCD,IAAI,CAAC,MAAM;IACR,IAAI,CAACJ,YAAY,CAACM,MAAM,EAAE;MACtBN,YAAY,CAACO,sBAAsB,CAACP,YAAY,EAAEA,YAAY,CAACQ,WAAW,CAAC;IAC/E;IACAX,gCAAgC,CAAC7B,MAAM,CAACgC,YAAY,CAAC;EACzD,CAAC,CAAC;AACV","ignoreList":[]}

package/dist/cjs/query-planner.js

@@ -272,7 +272,7 @@ function getMatcherQueryOpts(operator, operatorValue) {
         inclusiveStart: false
       };
     default:
-      throw new Error('SNH');
+      throw (0, _rxError.newRxError)('SNH');
   }
 }
 
@@ -290,7 +290,7 @@ function rateQueryPlan(schema, query, queryPlan) {
   var pointsPerMatchingKey = 10;
   var nonMinKeyCount = (0, _index.countUntilNotMatching)(queryPlan.startKeys, keyValue => keyValue !== INDEX_MIN && keyValue !== INDEX_MAX);
   addQuality(nonMinKeyCount * pointsPerMatchingKey);
-  var nonMaxKeyCount = (0, _index.countUntilNotMatching)(queryPlan.startKeys, keyValue => keyValue !== INDEX_MAX && keyValue !== INDEX_MIN);
+  var nonMaxKeyCount = (0, _index.countUntilNotMatching)(queryPlan.endKeys, keyValue => keyValue !== INDEX_MAX && keyValue !== INDEX_MIN);
   addQuality(nonMaxKeyCount * pointsPerMatchingKey);
   var equalKeyCount = (0, _index.countUntilNotMatching)(queryPlan.startKeys, (keyValue, idx) => {
     if (keyValue === queryPlan.endKeys[idx]) {