@datadog/flagging-core 0.1.0-preview.9 → 0.2.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2025 Datadog, Inc.
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,5 @@
+# Datadog OpenFeature Core Library
+
+## End-user license agreement
+
+https://www.datadoghq.com/legal/eula

package/cjs/cache/abstract-assignment-cache.d.ts

@@ -0,0 +1,39 @@
+import type { ExposureEvent } from '../configuration';
+export type AssignmentCacheKey = Pick<ExposureEvent, 'flag' | 'subject'>;
+export type AssignmentCacheEntry = ExposureEvent;
+/** Converts an {@link AssignmentCacheKey} to a string. */
+export declare function assignmentCacheKeyToString(exposureEvent: AssignmentCacheKey | ExposureEvent): string;
+/** Converts an {@link AssignmentCacheValue} to a string. */
+export declare function assignmentCacheValueToString(cacheValue: AssignmentCacheEntry): string;
+export interface AsyncMap<K, V> {
+    get(key: K): Promise<V | undefined>;
+    set(key: K, value: V): Promise<void>;
+    has(key: K): Promise<boolean>;
+}
+export interface AssignmentCache {
+    init(): Promise<void>;
+    set(key: AssignmentCacheEntry): void;
+    has(key: AssignmentCacheEntry): boolean;
+    clear(): Promise<void> | void;
+}
+export declare abstract class AbstractAssignmentCache<T extends Map<string, string>> implements AssignmentCache {
+    protected readonly delegate: T;
+    protected constructor(delegate: T);
+    init(): Promise<void>;
+    /** Returns whether the provided {@link AssignmentCacheEntry} is present in the cache. */
+    has(entry: AssignmentCacheEntry): boolean;
+    get(key: AssignmentCacheKey): string | undefined;
+    /**
+     * Stores the provided {@link AssignmentCacheEntry} in the cache. If the key already exists, it
+     * will be overwritten.
+     */
+    set(entry: AssignmentCacheEntry): void;
+    /**
+     * Returns an array with all {@link AssignmentCacheEntry} entries in the cache as an array of
+     * {@link string}s.
+     */
+    entries(): IterableIterator<[string, string]>;
+    /** Clears all entries from the cache. */
+    clear(): void;
+}
+//# sourceMappingURL=abstract-assignment-cache.d.ts.map

package/cjs/cache/abstract-assignment-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"abstract-assignment-cache.d.ts","sourceRoot":"","sources":["../../src/cache/abstract-assignment-cache.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAA;AAGrD,MAAM,MAAM,kBAAkB,GAAG,IAAI,CAAC,aAAa,EAAE,MAAM,GAAG,SAAS,CAAC,CAAA;AACxE,MAAM,MAAM,oBAAoB,GAAG,aAAa,CAAA;AAEhD,0DAA0D;AAC1D,wBAAgB,0BAA0B,CAAC,aAAa,EAAE,kBAAkB,GAAG,aAAa,GAAG,MAAM,CAWpG;AAED,4DAA4D;AAC5D,wBAAgB,4BAA4B,CAAC,UAAU,EAAE,oBAAoB,GAAG,MAAM,CAErF;AAED,MAAM,WAAW,QAAQ,CAAC,CAAC,EAAE,CAAC;IAC5B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAAA;IAEnC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;IAEpC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAA;CAC9B;AAED,MAAM,WAAW,eAAe;IAC9B,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAA;IAErB,GAAG,CAAC,GAAG,EAAE,oBAAoB,GAAG,IAAI,CAAA;IAEpC,GAAG,CAAC,GAAG,EAAE,oBAAoB,GAAG,OAAO,CAAA;IAEvC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;CAC9B;AAED,8BAAsB,uBAAuB,CAAC,CAAC,SAAS,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAE,YAAW,eAAe;IAE/E,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC;IAApD,SAAS,aAAgC,QAAQ,EAAE,CAAC;IAEpD,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAIrB,yFAAyF;IACzF,GAAG,CAAC,KAAK,EAAE,oBAAoB,GAAG,OAAO;IAIzC,GAAG,CAAC,GAAG,EAAE,kBAAkB,GAAG,MAAM,GAAG,SAAS;IAIhD;;;OAGG;IACH,GAAG,CAAC,KAAK,EAAE,oBAAoB,GAAG,IAAI;IAItC;;;OAGG;IACH,OAAO,IAAI,gBAAgB,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAI7C,yCAAyC;IACzC,KAAK,IAAI,IAAI;CAGd"}

package/cjs/cache/abstract-assignment-cache.js

@@ -0,0 +1,59 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AbstractAssignmentCache = void 0;
+exports.assignmentCacheKeyToString = assignmentCacheKeyToString;
+exports.assignmentCacheValueToString = assignmentCacheValueToString;
+const obfuscation_1 = require("../obfuscation");
+/** Converts an {@link AssignmentCacheKey} to a string. */
+function assignmentCacheKeyToString(exposureEvent) {
+    const key = {
+        flag: {
+            key: exposureEvent.flag.key,
+        },
+        subject: {
+            id: exposureEvent.subject.id,
+            attributes: exposureEvent.subject.attributes,
+        },
+    };
+    return (0, obfuscation_1.getMD5Hash)(JSON.stringify(key));
+}
+/** Converts an {@link AssignmentCacheValue} to a string. */
+function assignmentCacheValueToString(cacheValue) {
+    return (0, obfuscation_1.getMD5Hash)(JSON.stringify(cacheValue));
+}
+class AbstractAssignmentCache {
+    // key -> variation value hash
+    constructor(delegate) {
+        this.delegate = delegate;
+    }
+    init() {
+        return Promise.resolve();
+    }
+    /** Returns whether the provided {@link AssignmentCacheEntry} is present in the cache. */
+    has(entry) {
+        return this.get(entry) === assignmentCacheValueToString(entry);
+    }
+    get(key) {
+        return this.delegate.get(assignmentCacheKeyToString(key));
+    }
+    /**
+     * Stores the provided {@link AssignmentCacheEntry} in the cache. If the key already exists, it
+     * will be overwritten.
+     */
+    set(entry) {
+        this.delegate.set(assignmentCacheKeyToString(entry), assignmentCacheValueToString(entry));
+    }
+    /**
+     * Returns an array with all {@link AssignmentCacheEntry} entries in the cache as an array of
+     * {@link string}s.
+     */
+    entries() {
+        return this.delegate.entries();
+    }
+    /** Clears all entries from the cache. */
+    clear() {
+        this.delegate.clear();
+    }
+}
+exports.AbstractAssignmentCache = AbstractAssignmentCache;
+//# sourceMappingURL=abstract-assignment-cache.js.map

package/cjs/cache/abstract-assignment-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"abstract-assignment-cache.js","sourceRoot":"","sources":["../../src/cache/abstract-assignment-cache.ts"],"names":[],"mappings":";;;AAOA,gEAWC;AAGD,oEAEC;AAtBD,gDAA2C;AAK3C,0DAA0D;AAC1D,SAAgB,0BAA0B,CAAC,aAAiD;IAC1F,MAAM,GAAG,GAAuB;QAC9B,IAAI,EAAE;YACJ,GAAG,EAAE,aAAa,CAAC,IAAI,CAAC,GAAG;SAC5B;QACD,OAAO,EAAE;YACP,EAAE,EAAE,aAAa,CAAC,OAAO,CAAC,EAAE;YAC5B,UAAU,EAAE,aAAa,CAAC,OAAO,CAAC,UAAU;SAC7C;KACF,CAAA;IACD,OAAO,IAAA,wBAAU,EAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAA;AACxC,CAAC;AAED,4DAA4D;AAC5D,SAAgB,4BAA4B,CAAC,UAAgC;IAC3E,OAAO,IAAA,wBAAU,EAAC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAA;AAC/C,CAAC;AAoBD,MAAsB,uBAAuB;IAC3C,8BAA8B;IAC9B,YAAyC,QAAW;QAAX,aAAQ,GAAR,QAAQ,CAAG;IAAG,CAAC;IAExD,IAAI;QACF,OAAO,OAAO,CAAC,OAAO,EAAE,CAAA;IAC1B,CAAC;IAED,yFAAyF;IACzF,GAAG,CAAC,KAA2B;QAC7B,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,4BAA4B,CAAC,KAAK,CAAC,CAAA;IAChE,CAAC;IAED,GAAG,CAAC,GAAuB;QACzB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,0BAA0B,CAAC,GAAG,CAAC,CAAC,CAAA;IAC3D,CAAC;IAED;;;OAGG;IACH,GAAG,CAAC,KAA2B;QAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,0BAA0B,CAAC,KAAK,CAAC,EAAE,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAA;IAC3F,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAA;IAChC,CAAC;IAED,yCAAyC;IACzC,KAAK;QACH,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAA;IACvB,CAAC;CACF;AArCD,0DAqCC"}

package/cjs/cache/index.d.ts

@@ -0,0 +1,4 @@
+export * from './abstract-assignment-cache';
+export * from './lru-in-memory-assignment-cache';
+export * from './non-expiring-in-memory-cache-assignment';
+//# sourceMappingURL=index.d.ts.map

package/cjs/cache/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/cache/index.ts"],"names":[],"mappings":"AAAA,cAAc,6BAA6B,CAAA;AAC3C,cAAc,kCAAkC,CAAA;AAChD,cAAc,2CAA2C,CAAA"}

package/cjs/cache/index.js

@@ -0,0 +1,20 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./abstract-assignment-cache"), exports);
+__exportStar(require("./lru-in-memory-assignment-cache"), exports);
+__exportStar(require("./non-expiring-in-memory-cache-assignment"), exports);
+//# sourceMappingURL=index.js.map

package/cjs/cache/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/cache/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,8DAA2C;AAC3C,mEAAgD;AAChD,4EAAyD"}

package/cjs/cache/lru-cache.d.ts

@@ -0,0 +1,31 @@
+/**
+ * LRUCache is a simple implementation of a Least Recently Used (LRU) cache.
+ *
+ * Old items are evicted when the cache reaches its capacity.
+ *
+ * The cache is implemented as a Map, which maintains insertion order:
+ * ```
+ * Iteration happens in insertion order, which corresponds to the order in which each key-value pair
+ * was first inserted into the map by the set() method (that is, there wasn't a key with the same
+ * value already in the map when set() was called).
+ * ```
+ * Source: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map
+ */
+export declare class LRUCache implements Map<string, string> {
+    protected readonly capacity: number;
+    protected readonly cache: Map<string, string>;
+    [Symbol.toStringTag]: string;
+    constructor(capacity: number);
+    [Symbol.iterator](): IterableIterator<[string, string]>;
+    forEach(callbackFn: (value: string, key: string, map: Map<string, string>) => void): void;
+    readonly size: number;
+    entries(): IterableIterator<[string, string]>;
+    clear(): void;
+    delete(key: string): boolean;
+    keys(): IterableIterator<string>;
+    values(): IterableIterator<string>;
+    has(key: string): boolean;
+    get(key: string): string | undefined;
+    set(key: string, value: string): this;
+}
+//# sourceMappingURL=lru-cache.d.ts.map

package/cjs/cache/lru-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lru-cache.d.ts","sourceRoot":"","sources":["../../src/cache/lru-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,qBAAa,QAAS,YAAW,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAMtC,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM;IAL/C,SAAS,CAAC,QAAQ,CAAC,KAAK,sBAA6B;IAGrD,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,MAAM,CAAA;gBAEG,QAAQ,EAAE,MAAM;IAE/C,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAIvD,OAAO,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,IAAI,GAAG,IAAI;IAIzF,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAkB;IAEvC,OAAO,IAAI,gBAAgB,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAI7C,KAAK;IAIL,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAI5B,IAAI,IAAI,gBAAgB,CAAC,MAAM,CAAC;IAIhC,MAAM,IAAI,gBAAgB,CAAC,MAAM,CAAC;IAIlC,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAoBpC,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;CAqBtC"}

package/cjs/cache/lru-cache.js

@@ -0,0 +1,85 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LRUCache = void 0;
+/**
+ * LRUCache is a simple implementation of a Least Recently Used (LRU) cache.
+ *
+ * Old items are evicted when the cache reaches its capacity.
+ *
+ * The cache is implemented as a Map, which maintains insertion order:
+ * ```
+ * Iteration happens in insertion order, which corresponds to the order in which each key-value pair
+ * was first inserted into the map by the set() method (that is, there wasn't a key with the same
+ * value already in the map when set() was called).
+ * ```
+ * Source: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map
+ */
+class LRUCache {
+    constructor(capacity) {
+        this.capacity = capacity;
+        this.cache = new Map();
+        this.size = this.cache.size;
+    }
+    [(Symbol.toStringTag, Symbol.iterator)]() {
+        return this.cache[Symbol.iterator]();
+    }
+    forEach(callbackFn) {
+        this.cache.forEach(callbackFn);
+    }
+    entries() {
+        return this.cache.entries();
+    }
+    clear() {
+        this.cache.clear();
+    }
+    delete(key) {
+        return this.cache.delete(key);
+    }
+    keys() {
+        return this.cache.keys();
+    }
+    values() {
+        return this.cache.values();
+    }
+    has(key) {
+        return this.cache.has(key);
+    }
+    get(key) {
+        if (!this.has(key)) {
+            return undefined;
+        }
+        const value = this.cache.get(key);
+        if (value !== undefined) {
+            // the delete and set operations are used together to ensure that the most recently accessed
+            // or added item is always considered the "newest" in terms of access order.
+            // This is crucial for maintaining the correct order of elements in the cache,
+            // which directly impacts which item is considered the least recently used (LRU) and
+            // thus eligible for eviction when the cache reaches its capacity.
+            this.delete(key);
+            this.cache.set(key, value);
+        }
+        return value;
+    }
+    set(key, value) {
+        if (this.capacity === 0) {
+            return this;
+        }
+        if (this.cache.has(key)) {
+            this.cache.delete(key);
+        }
+        else if (this.cache.size >= this.capacity) {
+            // To evict the least recently used (LRU) item, we retrieve the first key in the Map.
+            // This is possible because the Map object in JavaScript maintains the insertion order of the keys.
+            // Therefore, the first key represents the oldest entry, which is the least recently used item in our cache.
+            // We use Map.prototype.keys().next().value to obtain this oldest key and then delete it from the cache.
+            const oldestKey = this.cache.keys().next().value;
+            if (oldestKey) {
+                this.delete(oldestKey);
+            }
+        }
+        this.cache.set(key, value);
+        return this;
+    }
+}
+exports.LRUCache = LRUCache;
+//# sourceMappingURL=lru-cache.js.map

package/cjs/cache/lru-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lru-cache.js","sourceRoot":"","sources":["../../src/cache/lru-cache.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;GAYG;AACH,MAAa,QAAQ;IAMnB,YAA+B,QAAgB;QAAhB,aAAQ,GAAR,QAAQ,CAAQ;QAL5B,UAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QAe5C,SAAI,GAAW,IAAI,CAAC,KAAK,CAAC,IAAI,CAAA;IAVW,CAAC;IAEnD,EAJC,MAAM,CAAC,WAAW,EAIlB,MAAM,CAAC,QAAQ,EAAC;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IACtC,CAAC;IAED,OAAO,CAAC,UAA0E;QAChF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAA;IAChC,CAAC;IAID,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAA;IAC7B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;IACpB,CAAC;IAED,MAAM,CAAC,GAAW;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IAC/B,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAA;IAC1B,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAA;IAC5B,CAAC;IAED,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC5B,CAAC;IAED,GAAG,CAAC,GAAW;QACb,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,OAAO,SAAS,CAAA;QAClB,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAEjC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,4FAA4F;YAC5F,4EAA4E;YAC5E,8EAA8E;YAC9E,oFAAoF;YACpF,kEAAkE;YAClE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QAC5B,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;IAED,GAAG,CAAC,GAAW,EAAE,KAAa;QAC5B,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,IAAI,CAAA;QACb,CAAC;QAED,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACxB,CAAC;aAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC5C,qFAAqF;YACrF,mGAAmG;YACnG,4GAA4G;YAC5G,wGAAwG;YACxG,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAA;YAChD,IAAI,SAAS,EAAE,CAAC;gBACd,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;YACxB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QAC1B,OAAO,IAAI,CAAA;IACb,CAAC;CACF;AAnFD,4BAmFC"}

package/cjs/cache/lru-in-memory-assignment-cache.d.ts

@@ -0,0 +1,16 @@
+import { AbstractAssignmentCache } from './abstract-assignment-cache';
+import { LRUCache } from './lru-cache';
+/**
+ * A cache that uses the LRU algorithm to evict the least recently used items.
+ *
+ * It is used to limit the size of the cache.
+ *
+ * The primary use case is for server-side SDKs, where the cache is shared across
+ * multiple users. In this case, the cache size should be set to the maximum number
+ * of users that can be active at the same time.
+ * @param {number} maxSize - Maximum cache size
+ */
+export declare class LRUInMemoryAssignmentCache extends AbstractAssignmentCache<LRUCache> {
+    constructor(maxSize: number);
+}
+//# sourceMappingURL=lru-in-memory-assignment-cache.d.ts.map

package/cjs/cache/lru-in-memory-assignment-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lru-in-memory-assignment-cache.d.ts","sourceRoot":"","sources":["../../src/cache/lru-in-memory-assignment-cache.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,uBAAuB,EAAE,MAAM,6BAA6B,CAAA;AACrE,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAA;AAEtC;;;;;;;;;GASG;AACH,qBAAa,0BAA2B,SAAQ,uBAAuB,CAAC,QAAQ,CAAC;gBACnE,OAAO,EAAE,MAAM;CAG5B"}

package/cjs/cache/lru-in-memory-assignment-cache.js

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LRUInMemoryAssignmentCache = void 0;
+const abstract_assignment_cache_1 = require("./abstract-assignment-cache");
+const lru_cache_1 = require("./lru-cache");
+/**
+ * A cache that uses the LRU algorithm to evict the least recently used items.
+ *
+ * It is used to limit the size of the cache.
+ *
+ * The primary use case is for server-side SDKs, where the cache is shared across
+ * multiple users. In this case, the cache size should be set to the maximum number
+ * of users that can be active at the same time.
+ * @param {number} maxSize - Maximum cache size
+ */
+class LRUInMemoryAssignmentCache extends abstract_assignment_cache_1.AbstractAssignmentCache {
+    constructor(maxSize) {
+        super(new lru_cache_1.LRUCache(maxSize));
+    }
+}
+exports.LRUInMemoryAssignmentCache = LRUInMemoryAssignmentCache;
+//# sourceMappingURL=lru-in-memory-assignment-cache.js.map

package/cjs/cache/lru-in-memory-assignment-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lru-in-memory-assignment-cache.js","sourceRoot":"","sources":["../../src/cache/lru-in-memory-assignment-cache.ts"],"names":[],"mappings":";;;AAAA,2EAAqE;AACrE,2CAAsC;AAEtC;;;;;;;;;GASG;AACH,MAAa,0BAA2B,SAAQ,mDAAiC;IAC/E,YAAY,OAAe;QACzB,KAAK,CAAC,IAAI,oBAAQ,CAAC,OAAO,CAAC,CAAC,CAAA;IAC9B,CAAC;CACF;AAJD,gEAIC"}

package/cjs/cache/non-expiring-in-memory-cache-assignment.d.ts

@@ -0,0 +1,11 @@
+import { AbstractAssignmentCache } from './abstract-assignment-cache';
+/**
+ * A cache that never expires.
+ *
+ * The primary use case is for client-side SDKs, where the cache is only used
+ * for a single user.
+ */
+export declare class NonExpiringInMemoryAssignmentCache extends AbstractAssignmentCache<Map<string, string>> {
+    constructor(store?: Map<string, string>);
+}
+//# sourceMappingURL=non-expiring-in-memory-cache-assignment.d.ts.map

package/cjs/cache/non-expiring-in-memory-cache-assignment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"non-expiring-in-memory-cache-assignment.d.ts","sourceRoot":"","sources":["../../src/cache/non-expiring-in-memory-cache-assignment.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,uBAAuB,EAAE,MAAM,6BAA6B,CAAA;AAErE;;;;;GAKG;AACH,qBAAa,kCAAmC,SAAQ,uBAAuB,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACtF,KAAK,sBAA4B;CAG9C"}

package/cjs/cache/non-expiring-in-memory-cache-assignment.js

@@ -0,0 +1,17 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.NonExpiringInMemoryAssignmentCache = void 0;
+const abstract_assignment_cache_1 = require("./abstract-assignment-cache");
+/**
+ * A cache that never expires.
+ *
+ * The primary use case is for client-side SDKs, where the cache is only used
+ * for a single user.
+ */
+class NonExpiringInMemoryAssignmentCache extends abstract_assignment_cache_1.AbstractAssignmentCache {
+    constructor(store = new Map()) {
+        super(store);
+    }
+}
+exports.NonExpiringInMemoryAssignmentCache = NonExpiringInMemoryAssignmentCache;
+//# sourceMappingURL=non-expiring-in-memory-cache-assignment.js.map

package/cjs/cache/non-expiring-in-memory-cache-assignment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"non-expiring-in-memory-cache-assignment.js","sourceRoot":"","sources":["../../src/cache/non-expiring-in-memory-cache-assignment.ts"],"names":[],"mappings":";;;AAAA,2EAAqE;AAErE;;;;;GAKG;AACH,MAAa,kCAAmC,SAAQ,mDAA4C;IAClG,YAAY,QAAQ,IAAI,GAAG,EAAkB;QAC3C,KAAK,CAAC,KAAK,CAAC,CAAA;IACd,CAAC;CACF;AAJD,gFAIC"}

package/cjs/configuration/configuration.d.ts

@@ -28,7 +28,7 @@ export type PrecomputedConfigurationResponse = {
     data: {
         attributes: {
             /** When configuration was generated. */
-            createdAt: number;
+            createdAt: string;
             flags: Record<string, PrecomputedFlag>;
         };
     };

package/cjs/configuration/exposureEvent.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"exposureEvent.d.ts","sourceRoot":"","sources":["../../src/configuration/exposureEvent.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AACxF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAA;AAE1D,wBAAgB,mBAAmB,CAAC,CAAC,SAAS,SAAS,EACrD,OAAO,EAAE,iBAAiB,EAC1B,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC,GAC5B,aAAa,GAAG,SAAS,CA+B3B"}
+{"version":3,"file":"exposureEvent.d.ts","sourceRoot":"","sources":["../../src/configuration/exposureEvent.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AACxF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAA;AAE1D,wBAAgB,mBAAmB,CAAC,CAAC,SAAS,SAAS,EACrD,OAAO,EAAE,iBAAiB,EAC1B,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC,GAC5B,aAAa,GAAG,SAAS,CA8B3B"}

package/cjs/configuration/exposureEvent.js

@@ -15,7 +15,6 @@ function createExposureEvent(context, details) {
     }
     const { targetingKey: id = '', ...attributes } = context;
     return {
-        timestamp: Date.now(),
         allocation: {
             key: allocationKey,
         },

package/cjs/configuration/exposureEvent.js.map

@@ -1 +1 @@
-{"version":3,"file":"exposureEvent.js","sourceRoot":"","sources":["../../src/configuration/exposureEvent.ts"],"names":[],"mappings":";;AAGA,kDAkCC;AAlCD,SAAgB,mBAAmB,CACjC,OAA0B,EAC1B,OAA6B;;IAE7B,iCAAiC;IACjC,IAAI,CAAC,CAAA,MAAA,OAAO,CAAC,YAAY,0CAAE,KAAK,CAAA,EAAE,CAAC;QACjC,OAAM;IACR,CAAC;IAED,kFAAkF;IAClF,MAAM,aAAa,GAAG,MAAA,OAAO,CAAC,YAAY,0CAAE,aAAuB,CAAA;IACnE,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAA;IAClC,IAAI,CAAC,aAAa,IAAI,CAAC,UAAU,EAAE,CAAC;QAClC,OAAM;IACR,CAAC;IAED,MAAM,EAAE,YAAY,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,UAAU,EAAE,GAAG,OAAO,CAAA;IAExD,OAAO;QACL,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;QACrB,UAAU,EAAE;YACV,GAAG,EAAE,aAAa;SACnB;QACD,IAAI,EAAE;YACJ,GAAG,EAAE,OAAO,CAAC,OAAO;SACrB;QACD,OAAO,EAAE;YACP,GAAG,EAAE,UAAU;SAChB;QACD,OAAO,EAAE;YACP,EAAE;YACF,UAAU;SACX;KACsB,CAAA;AAC3B,CAAC"}
+{"version":3,"file":"exposureEvent.js","sourceRoot":"","sources":["../../src/configuration/exposureEvent.ts"],"names":[],"mappings":";;AAGA,kDAiCC;AAjCD,SAAgB,mBAAmB,CACjC,OAA0B,EAC1B,OAA6B;;IAE7B,iCAAiC;IACjC,IAAI,CAAC,CAAA,MAAA,OAAO,CAAC,YAAY,0CAAE,KAAK,CAAA,EAAE,CAAC;QACjC,OAAM;IACR,CAAC;IAED,kFAAkF;IAClF,MAAM,aAAa,GAAG,MAAA,OAAO,CAAC,YAAY,0CAAE,aAAuB,CAAA;IACnE,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAA;IAClC,IAAI,CAAC,aAAa,IAAI,CAAC,UAAU,EAAE,CAAC;QAClC,OAAM;IACR,CAAC;IAED,MAAM,EAAE,YAAY,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,UAAU,EAAE,GAAG,OAAO,CAAA;IAExD,OAAO;QACL,UAAU,EAAE;YACV,GAAG,EAAE,aAAa;SACnB;QACD,IAAI,EAAE;YACJ,GAAG,EAAE,OAAO,CAAC,OAAO;SACrB;QACD,OAAO,EAAE;YACP,GAAG,EAAE,UAAU;SAChB;QACD,OAAO,EAAE;YACP,EAAE;YACF,UAAU;SACX;KACsB,CAAA;AAC3B,CAAC"}

package/cjs/configuration/exposureEvent.types.d.ts

@@ -1,7 +1,5 @@
 import type { EvaluationContext } from '@openfeature/core';
 export interface ExposureEvent {
-    /** Unix timestamp in milliseconds */
-    timestamp: number;
     allocation: {
         key: string;
     };
@@ -15,5 +13,18 @@ export interface ExposureEvent {
         id: string;
         attributes: EvaluationContext;
     };
+    service?: string;
+    rum?: {
+        application?: {
+            id?: string;
+        };
+        view?: {
+            url?: string;
+        };
+    };
+}
+export interface ExposureEventWithTimestamp extends ExposureEvent {
+    /** Unix timestamp in milliseconds */
+    timestamp: number;
 }
 //# sourceMappingURL=exposureEvent.types.d.ts.map

package/cjs/configuration/exposureEvent.types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"exposureEvent.types.d.ts","sourceRoot":"","sources":["../../src/configuration/exposureEvent.types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAA;AAE1D,MAAM,WAAW,aAAa;IAC5B,qCAAqC;IACrC,SAAS,EAAE,MAAM,CAAA;IACjB,UAAU,EAAE;QACV,GAAG,EAAE,MAAM,CAAA;KACZ,CAAA;IACD,IAAI,EAAE;QACJ,GAAG,EAAE,MAAM,CAAA;KACZ,CAAA;IACD,OAAO,EAAE;QACP,GAAG,EAAE,MAAM,CAAA;KACZ,CAAA;IACD,OAAO,EAAE;QACP,EAAE,EAAE,MAAM,CAAA;QACV,UAAU,EAAE,iBAAiB,CAAA;KAC9B,CAAA;CACF"}
+{"version":3,"file":"exposureEvent.types.d.ts","sourceRoot":"","sources":["../../src/configuration/exposureEvent.types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAA;AAE1D,MAAM,WAAW,aAAa;IAC5B,UAAU,EAAE;QACV,GAAG,EAAE,MAAM,CAAA;KACZ,CAAA;IACD,IAAI,EAAE;QACJ,GAAG,EAAE,MAAM,CAAA;KACZ,CAAA;IACD,OAAO,EAAE;QACP,GAAG,EAAE,MAAM,CAAA;KACZ,CAAA;IACD,OAAO,EAAE;QACP,EAAE,EAAE,MAAM,CAAA;QACV,UAAU,EAAE,iBAAiB,CAAA;KAC9B,CAAA;IACD,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,GAAG,CAAC,EAAE;QACJ,WAAW,CAAC,EAAE;YACZ,EAAE,CAAC,EAAE,MAAM,CAAA;SACZ,CAAA;QACD,IAAI,CAAC,EAAE;YACL,GAAG,CAAC,EAAE,MAAM,CAAA;SACb,CAAA;KACF,CAAA;CACF;AAED,MAAM,WAAW,0BAA2B,SAAQ,aAAa;IAC/D,qCAAqC;IACrC,SAAS,EAAE,MAAM,CAAA;CAClB"}

package/cjs/index.d.ts

@@ -1,2 +1,4 @@
+export * from './cache';
 export * from './configuration';
+export * from './obfuscation';
 //# sourceMappingURL=index.d.ts.map

package/cjs/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAA;AACvB,cAAc,iBAAiB,CAAA;AAC/B,cAAc,eAAe,CAAA"}