@kenji71089/evaluation 0.0.1 → 0.0.8

package/lib/evaluation.js

@@ -20,7 +20,8 @@ function _arrayWithHoles(r) { if (Array.isArray(r)) return r; }
 function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
 function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
 function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
-function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator["return"] && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, "catch": function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function _regenerator() { /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */ var e, t, r = "function" == typeof Symbol ? Symbol : {}, n = r.iterator || "@@iterator", o = r.toStringTag || "@@toStringTag"; function i(r, n, o, i) { var c = n && n.prototype instanceof Generator ? n : Generator, u = Object.create(c.prototype); return _regeneratorDefine2(u, "_invoke", function (r, n, o) { var i, c, u, f = 0, p = o || [], y = !1, G = { p: 0, n: 0, v: e, a: d, f: d.bind(e, 4), d: function d(t, r) { return i = t, c = 0, u = e, G.n = r, a; } }; function d(r, n) { for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) { var o, i = p[t], d = G.p, l = i[2]; r > 3 ? (o = l === n) && (u = i[(c = i[4]) ? 5 : (c = 3, 3)], i[4] = i[5] = e) : i[0] <= d && ((o = r < 2 && d < i[1]) ? (c = 0, G.v = n, G.n = i[1]) : d < l && (o = r < 3 || i[0] > n || n > l) && (i[4] = r, i[5] = n, G.n = l, c = 0)); } if (o || r > 1) return a; throw y = !0, n; } return function (o, p, l) { if (f > 1) throw TypeError("Generator is already running"); for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) { i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u); try { if (f = 2, i) { if (c || (o = "next"), t = i[o]) { if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object"); if (!t.done) return t; u = t.value, c < 2 && (c = 0); } else 1 === c && (t = i["return"]) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1); i = e; } else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break; } catch (t) { i = e, c = 1, u = t; } finally { f = 1; } } return { value: t, done: y }; }; }(r, o, i), !0), u; } var a = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} t = Object.getPrototypeOf; var c = [][n] ? t(t([][n]())) : (_regeneratorDefine2(t = {}, n, function () { return this; }), t), u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c); function f(e) { return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, _regeneratorDefine2(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e; } return GeneratorFunction.prototype = GeneratorFunctionPrototype, _regeneratorDefine2(u, "constructor", GeneratorFunctionPrototype), _regeneratorDefine2(GeneratorFunctionPrototype, "constructor", GeneratorFunction), GeneratorFunction.displayName = "GeneratorFunction", _regeneratorDefine2(GeneratorFunctionPrototype, o, "GeneratorFunction"), _regeneratorDefine2(u), _regeneratorDefine2(u, o, "Generator"), _regeneratorDefine2(u, n, function () { return this; }), _regeneratorDefine2(u, "toString", function () { return "[object Generator]"; }), (_regenerator = function _regenerator() { return { w: i, m: f }; })(); }
+function _regeneratorDefine2(e, r, n, t) { var i = Object.defineProperty; try { i({}, "", {}); } catch (e) { i = 0; } _regeneratorDefine2 = function _regeneratorDefine(e, r, n, t) { function o(r, n) { _regeneratorDefine2(e, r, function (e) { return this._invoke(r, n, e); }); } r ? i ? i(e, r, { value: n, enumerable: !t, configurable: !t, writable: !t }) : e[r] = n : (o("next", 0), o("throw", 1), o("return", 2)); }, _regeneratorDefine2(e, r, n, t); }
 function asyncGeneratorStep(n, t, e, r, o, a, c) { try { var i = n[a](c), u = i.value; } catch (n) { return void e(n); } i.done ? t(u) : Promise.resolve(u).then(r, o); }
 function _asyncToGenerator(n) { return function () { var t = this, e = arguments; return new Promise(function (r, o) { var a = n.apply(t, e); function _next(n) { asyncGeneratorStep(a, r, o, _next, _throw, "next", n); } function _throw(n) { asyncGeneratorStep(a, r, o, _next, _throw, "throw", n); } _next(void 0); }); }; }
 function _classCallCheck(a, n) { if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function"); }
@@ -29,20 +30,64 @@ function _createClass(e, r, t) { return r && _defineProperties(e.prototype, r),
 function _defineProperty(e, r, t) { return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, { value: t, enumerable: !0, configurable: !0, writable: !0 }) : e[r] = t, e; }
 function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : i + ""; }
 function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
+var __createBinding = void 0 && (void 0).__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 get() {
+        return m[k];
+      }
+    };
+  }
+  Object.defineProperty(o, k2, desc);
+} : function (o, m, k, k2) {
+  if (k2 === undefined) k2 = k;
+  o[k2] = m[k];
+});
+var __setModuleDefault = void 0 && (void 0).__setModuleDefault || (Object.create ? function (o, v) {
+  Object.defineProperty(o, "default", {
+    enumerable: true,
+    value: v
+  });
+} : function (o, v) {
+  o["default"] = v;
+});
+var __importStar = void 0 && (void 0).__importStar || function () {
+  var _ownKeys = function ownKeys(o) {
+    _ownKeys = Object.getOwnPropertyNames || function (o) {
+      var ar = [];
+      for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+      return ar;
+    };
+    return _ownKeys(o);
+  };
+  return function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k = _ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+    __setModuleDefault(result, mod);
+    return result;
+  };
+}();
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.Evaluator = void 0;
 exports.EvaluationID = EvaluationID;
+exports.getFeatureIDsDependsOn = getFeatureIDsDependsOn;
 var errors_1 = require("./errors");
 var clause_pb_1 = require("./proto/feature/clause_pb");
 var evaluation_pb_1 = require("./proto/feature/evaluation_pb");
+var feature_pb_1 = require("./proto/feature/feature_pb");
 var reason_pb_1 = require("./proto/feature/reason_pb");
 var variation_pb_1 = require("./proto/feature/variation_pb");
 var ruleEvaluator_1 = require("./ruleEvaluator");
 var strategyEvaluator_1 = require("./strategyEvaluator");
 var userEvaluation_1 = require("./userEvaluation");
 var modelFactory_1 = require("./modelFactory");
+var yaml = __importStar(require("js-yaml"));
 var SECONDS_TO_RE_EVALUATE_ALL = 30 * 24 * 60 * 60; // 30 days
 var SECONDS_FOR_ADJUSTMENT = 10; // 10 seconds
 function EvaluationID(featureID, featureVersion, userID) {
@@ -53,20 +98,21 @@ var Evaluator = /*#__PURE__*/function () {
     _classCallCheck(this, Evaluator);
     _defineProperty(this, "ruleEvaluator", void 0);
     _defineProperty(this, "strategyEvaluator", void 0);
+    // variationCache caches YAML to JSON conversions using variation ID as the key.
+    // Since variation IDs are UUIDs, they are globally unique and safe to use as cache keys.
+    _defineProperty(this, "variationCache", void 0);
     this.ruleEvaluator = new ruleEvaluator_1.RuleEvaluator();
     this.strategyEvaluator = new strategyEvaluator_1.StrategyEvaluator();
+    this.variationCache = new Map();
   }
   return _createClass(Evaluator, [{
     key: "evaluateFeatures",
     value: function () {
-      var _evaluateFeatures = _asyncToGenerator(/*#__PURE__*/_regeneratorRuntime().mark(function _callee(features, user, mapSegmentUsers, targetTag) {
-        return _regeneratorRuntime().wrap(function _callee$(_context) {
-          while (1) switch (_context.prev = _context.next) {
+      var _evaluateFeatures = _asyncToGenerator(/*#__PURE__*/_regenerator().m(function _callee(features, user, mapSegmentUsers, targetTag) {
+        return _regenerator().w(function (_context) {
+          while (1) switch (_context.n) {
             case 0:
-              return _context.abrupt("return", this.evaluate(features, user, mapSegmentUsers, false, targetTag));
-            case 1:
-            case "end":
-              return _context.stop();
+              return _context.a(2, this.evaluate(features, user, mapSegmentUsers, false, targetTag));
           }
         }, _callee, this);
       }));
@@ -129,13 +175,6 @@ var Evaluator = /*#__PURE__*/function () {
       try {
         for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
           var feature = _step2.value;
-          if (feature.getArchived()) {
-            // To keep response size small, the feature flags archived long time ago are excluded.
-            if (!this.isArchivedBeforeLastThirtyDays(feature)) {
-              archivedIDs.push(feature.getId());
-            }
-            continue;
-          }
           var segmentUsers = this.listSegmentIDs(feature).flatMap(function (id) {
             return mapSegmentUsers.get(id) || [];
           });
@@ -144,13 +183,23 @@ var Evaluator = /*#__PURE__*/function () {
             reason = _this$assignUser2[0],
             variation = _this$assignUser2[1];
           // VariationId is used to check if prerequisite flag's result is what user expects it to be.
+          // This must be set for ALL features (including archived) for dependency resolution to work
           flagVariations[feature.getId()] = variation.getId();
+          if (feature.getArchived()) {
+            // To keep response size small, the feature flags archived long time ago are excluded.
+            if (!this.isArchivedBeforeLastThirtyDays(feature)) {
+              archivedIDs.push(feature.getId());
+            }
+            continue;
+          }
           // When the tag is set in the request,
           // it will return only the evaluations of flags that match the tag configured on the dashboard.
           // When empty, it will return all the evaluations of the flags in the environment.
           if (targetTag !== '' && !this.tagExist(feature.getTagsList(), targetTag)) {
             continue;
           }
+          // Convert YAML to JSON for client SDKs if needed
+          var convertedValue = this.convertVariationValue(feature, variation);
           var evaluationID = EvaluationID(feature.getId(), feature.getVersion(), user.getId());
           var evaluation = new evaluation_pb_1.Evaluation();
           evaluation.setId(evaluationID);
@@ -159,7 +208,7 @@ var Evaluator = /*#__PURE__*/function () {
           evaluation.setUserId(user.getId());
           evaluation.setVariationId(variation.getId());
           evaluation.setVariationName(variation.getName());
-          evaluation.setVariationValue(variation.getValue());
+          evaluation.setVariationValue(convertedValue);
           // Deprecated
           // FIXME: Remove the Variation when is no longer being used.
           // For security reasons, we should remove the variation description.
@@ -168,7 +217,7 @@ var Evaluator = /*#__PURE__*/function () {
           var copyVariation = new variation_pb_1.Variation();
           copyVariation.setId(variation.getId());
           copyVariation.setName(variation.getName());
-          copyVariation.setValue(variation.getValue());
+          copyVariation.setValue(convertedValue);
           evaluation.setVariation(copyVariation);
           evaluation.setReason(reason);
           evaluations.push(evaluation);
@@ -334,6 +383,39 @@ var Evaluator = /*#__PURE__*/function () {
       }
       return variation;
     }
+    /**
+     * Converts YAML to JSON if needed, with in-memory caching.
+     * This ensures client SDKs can retrieve variation values using the object variation interface.
+     * Only performs conversion when the variation type is YAML.
+     * Cache key uses feature.updatedAt + variation.id to ensure cache invalidation when variations are updated.
+     */
+  }, {
+    key: "convertVariationValue",
+    value: function convertVariationValue(feature, variation) {
+      // Only convert if type is YAML
+      if (feature.getVariationType() !== feature_pb_1.Feature.VariationType.YAML) {
+        return variation.getValue();
+      }
+      // Cache key: {featureUpdatedAt}:{variationId}
+      // This ensures cache is invalidated when the feature (and its variations) are updated,
+      // including changes from auto operations that don't increment feature.version
+      var cacheKey = "".concat(feature.getUpdatedAt(), ":").concat(variation.getId());
+      // Check cache first
+      var cached = this.variationCache.get(cacheKey);
+      if (cached !== undefined) {
+        return cached;
+      }
+      // Convert YAML to JSON
+      try {
+        var jsonValue = yamlToJSON(variation.getValue());
+        // Cache the result for future requests
+        this.variationCache.set(cacheKey, jsonValue);
+        return jsonValue;
+      } catch (error) {
+        // Return original value as fallback on error
+        return variation.getValue();
+      }
+    }
   }]);
 }();
 exports.Evaluator = Evaluator;
@@ -344,7 +426,7 @@ var Mark;
   Mark[Mark["Permanently"] = 2] = "Permanently";
 })(Mark || (Mark = {}));
 // FeatureIDsDependsOn returns the ids of the features that this feature depends on.
-function featureIDsDependsOn(feature) {
+function getFeatureIDsDependsOn(feature) {
   var ids = [];
   // Iterate over prerequisites and add their FeatureId
   feature.getPrerequisitesList().forEach(function (p) {
@@ -392,7 +474,7 @@ function topologicalSort(features) {
       throw new ErrCycleExists();
     }
     marks[fId] = Mark.Temporary;
-    var dependentFeatureIds = featureIDsDependsOn(f);
+    var dependentFeatureIds = getFeatureIDsDependsOn(f);
     var _iterator8 = _createForOfIteratorHelper(dependentFeatureIds),
       _step8;
     try {
@@ -439,7 +521,7 @@ function getFeaturesDependedOnTargets(targets, all) {
     // Add feature to evals
     evals[f.getId()] = f;
     // Get dependent features recursively
-    var featureDependencies = featureIDsDependsOn(f);
+    var featureDependencies = getFeatureIDsDependsOn(f);
     featureDependencies.forEach(function (fid) {
       var target = all.get(fid);
       if (target !== undefined) {
@@ -455,6 +537,24 @@ function getFeaturesDependedOnTargets(targets, all) {
 }
 // getFeaturesDependsOnTargets returns the features that depend on the target features.
 // targetFeatures are included in the result.
+//
+// This function ensures complete transitive closure for incremental evaluation.
+//
+// Example scenario:
+//   Feature Dependencies: A ← B ← C, A ← D, E ← D
+//   Target: [C] (recently updated)
+//
+// Step 1 - DFS finds direct/transitive dependents of targets:
+//   - A depends on B, B depends on C (target) → Add A, B
+//   - E depends on D, D doesn't depend on C → Skip E
+//     Result: {C, A, B}
+//
+// Step 2 - Find dependencies of discovered dependents:
+//   - A depends on D (new!) → Add D
+//     Result: {C, A, B, D}
+//
+// Without Step 2: Evaluating A would fail with "feature D not found"
+// With Step 2: Complete closure ensures all dependencies are available
 function getFeaturesDependsOnTargets(targets, all) {
   var evals = {};
   // Mark target features in the evals map initially
@@ -466,12 +566,12 @@ function getFeaturesDependsOnTargets(targets, all) {
     if (evals[f.getId()]) {
       return true;
     }
-    var featureDependencies = featureIDsDependsOn(f);
-    var _iterator10 = _createForOfIteratorHelper(featureDependencies),
-      _step10;
+    var featureDependencies = getFeatureIDsDependsOn(f);
+    var _iterator0 = _createForOfIteratorHelper(featureDependencies),
+      _step0;
     try {
-      for (_iterator10.s(); !(_step10 = _iterator10.n()).done;) {
-        var fid = _step10.value;
+      for (_iterator0.s(); !(_step0 = _iterator0.n()).done;) {
+        var fid = _step0.value;
         var dependentFeature = all.get(fid);
         if (dependentFeature && _dfs2(dependentFeature)) {
           // If the feature depends on one of the target features, add it to evals
@@ -480,9 +580,9 @@ function getFeaturesDependsOnTargets(targets, all) {
         }
       }
     } catch (err) {
-      _iterator10.e(err);
+      _iterator0.e(err);
     } finally {
-      _iterator10.f();
+      _iterator0.f();
     }
     return false;
   };
@@ -490,6 +590,56 @@ function getFeaturesDependsOnTargets(targets, all) {
   all.forEach(function (f) {
     _dfs2(f);
   });
+  // Step 2: Ensure complete transitive closure
+  // The DFS above finds dependents (who depends on targets), but misses dependencies of those dependents.
+  // Example: If target C → dependent A → dependency D, we found A but missed D.
+  // Efficiently process only newly discovered features in each iteration.
+  var processed = new Set();
+  var queue = [];
+  for (var _i = 0, _Object$values = Object.values(evals); _i < _Object$values.length; _i++) {
+    var f = _Object$values[_i];
+    queue.push(f);
+  }
+  var maxIterations = 100; // Prevent infinite loops in case of circular dependencies
+  var iteration = 0;
+  while (queue.length > 0 && iteration < maxIterations) {
+    iteration++;
+    var nextQueue = [];
+    var _iterator1 = _createForOfIteratorHelper(queue),
+      _step1;
+    try {
+      for (_iterator1.s(); !(_step1 = _iterator1.n()).done;) {
+        var _f = _step1.value;
+        if (processed.has(_f.getId())) {
+          continue;
+        }
+        processed.add(_f.getId());
+        // Find dependencies of f
+        var featureDependencies = getFeatureIDsDependsOn(_f);
+        var _iterator10 = _createForOfIteratorHelper(featureDependencies),
+          _step10;
+        try {
+          for (_iterator10.s(); !(_step10 = _iterator10.n()).done;) {
+            var depID = _step10.value;
+            var dep = all.get(depID);
+            if (dep && !evals[depID]) {
+              evals[depID] = dep;
+              nextQueue.push(dep);
+            }
+          }
+        } catch (err) {
+          _iterator10.e(err);
+        } finally {
+          _iterator10.f();
+        }
+      }
+    } catch (err) {
+      _iterator1.e(err);
+    } finally {
+      _iterator1.f();
+    }
+    queue = nextQueue;
+  }
   return evals;
 }
 function arrayToRecord(arr) {
@@ -500,4 +650,11 @@ function arrayToRecord(arr) {
     acc[key] = value;
     return acc;
   }, {});
+}
+/**
+ * Converts a YAML string to a JSON string.
+ */
+function yamlToJSON(yamlStr) {
+  var data = yaml.load(yamlStr);
+  return JSON.stringify(data);
 }

package/lib/evaluation.mjs

@@ -1,16 +1,52 @@
 "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 __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Evaluator = void 0;
 exports.EvaluationID = EvaluationID;
+exports.getFeatureIDsDependsOn = getFeatureIDsDependsOn;
 const errors_1 = require("./errors");
 const clause_pb_1 = require("./proto/feature/clause_pb");
 const evaluation_pb_1 = require("./proto/feature/evaluation_pb");
+const feature_pb_1 = require("./proto/feature/feature_pb");
 const reason_pb_1 = require("./proto/feature/reason_pb");
 const variation_pb_1 = require("./proto/feature/variation_pb");
 const ruleEvaluator_1 = require("./ruleEvaluator");
 const strategyEvaluator_1 = require("./strategyEvaluator");
 const userEvaluation_1 = require("./userEvaluation");
 const modelFactory_1 = require("./modelFactory");
+const yaml = __importStar(require("js-yaml"));
 const SECONDS_TO_RE_EVALUATE_ALL = 30 * 24 * 60 * 60; // 30 days
 const SECONDS_FOR_ADJUSTMENT = 10; // 10 seconds
 function EvaluationID(featureID, featureVersion, userID) {
@@ -19,9 +55,13 @@ function EvaluationID(featureID, featureVersion, userID) {
 class Evaluator {
     ruleEvaluator;
     strategyEvaluator;
+    // variationCache caches YAML to JSON conversions using variation ID as the key.
+    // Since variation IDs are UUIDs, they are globally unique and safe to use as cache keys.
+    variationCache;
     constructor() {
         this.ruleEvaluator = new ruleEvaluator_1.RuleEvaluator();
         this.strategyEvaluator = new strategyEvaluator_1.StrategyEvaluator();
+        this.variationCache = new Map();
     }
     async evaluateFeatures(features, user, mapSegmentUsers, targetTag) {
         return this.evaluate(features, user, mapSegmentUsers, false, targetTag);
@@ -61,6 +101,11 @@ class Evaluator {
         const evaluations = [];
         const archivedIDs = [];
         for (const feature of sortedFeatures) {
+            const segmentUsers = this.listSegmentIDs(feature).flatMap((id) => mapSegmentUsers.get(id) || []);
+            const [reason, variation] = this.assignUser(feature, user, segmentUsers, flagVariations);
+            // VariationId is used to check if prerequisite flag's result is what user expects it to be.
+            // This must be set for ALL features (including archived) for dependency resolution to work
+            flagVariations[feature.getId()] = variation.getId();
             if (feature.getArchived()) {
                 // To keep response size small, the feature flags archived long time ago are excluded.
                 if (!this.isArchivedBeforeLastThirtyDays(feature)) {
@@ -68,16 +113,14 @@ class Evaluator {
                 }
                 continue;
             }
-            const segmentUsers = this.listSegmentIDs(feature).flatMap((id) => mapSegmentUsers.get(id) || []);
-            const [reason, variation] = this.assignUser(feature, user, segmentUsers, flagVariations);
-            // VariationId is used to check if prerequisite flag's result is what user expects it to be.
-            flagVariations[feature.getId()] = variation.getId();
             // When the tag is set in the request,
             // it will return only the evaluations of flags that match the tag configured on the dashboard.
             // When empty, it will return all the evaluations of the flags in the environment.
             if (targetTag !== '' && !this.tagExist(feature.getTagsList(), targetTag)) {
                 continue;
             }
+            // Convert YAML to JSON for client SDKs if needed
+            const convertedValue = this.convertVariationValue(feature, variation);
             const evaluationID = EvaluationID(feature.getId(), feature.getVersion(), user.getId());
             const evaluation = new evaluation_pb_1.Evaluation();
             evaluation.setId(evaluationID);
@@ -86,7 +129,7 @@ class Evaluator {
             evaluation.setUserId(user.getId());
             evaluation.setVariationId(variation.getId());
             evaluation.setVariationName(variation.getName());
-            evaluation.setVariationValue(variation.getValue());
+            evaluation.setVariationValue(convertedValue);
             // Deprecated
             // FIXME: Remove the Variation when is no longer being used.
             // For security reasons, we should remove the variation description.
@@ -95,7 +138,7 @@ class Evaluator {
             const copyVariation = new variation_pb_1.Variation();
             copyVariation.setId(variation.getId());
             copyVariation.setName(variation.getName());
-            copyVariation.setValue(variation.getValue());
+            copyVariation.setValue(convertedValue);
             evaluation.setVariation(copyVariation);
             evaluation.setReason(reason);
             evaluations.push(evaluation);
@@ -195,6 +238,38 @@ class Evaluator {
         }
         return variation;
     }
+    /**
+     * Converts YAML to JSON if needed, with in-memory caching.
+     * This ensures client SDKs can retrieve variation values using the object variation interface.
+     * Only performs conversion when the variation type is YAML.
+     * Cache key uses feature.updatedAt + variation.id to ensure cache invalidation when variations are updated.
+     */
+    convertVariationValue(feature, variation) {
+        // Only convert if type is YAML
+        if (feature.getVariationType() !== feature_pb_1.Feature.VariationType.YAML) {
+            return variation.getValue();
+        }
+        // Cache key: {featureUpdatedAt}:{variationId}
+        // This ensures cache is invalidated when the feature (and its variations) are updated,
+        // including changes from auto operations that don't increment feature.version
+        const cacheKey = `${feature.getUpdatedAt()}:${variation.getId()}`;
+        // Check cache first
+        const cached = this.variationCache.get(cacheKey);
+        if (cached !== undefined) {
+            return cached;
+        }
+        // Convert YAML to JSON
+        try {
+            const jsonValue = yamlToJSON(variation.getValue());
+            // Cache the result for future requests
+            this.variationCache.set(cacheKey, jsonValue);
+            return jsonValue;
+        }
+        catch (error) {
+            // Return original value as fallback on error
+            return variation.getValue();
+        }
+    }
 }
 exports.Evaluator = Evaluator;
 var Mark;
@@ -204,7 +279,7 @@ var Mark;
     Mark[Mark["Permanently"] = 2] = "Permanently";
 })(Mark || (Mark = {}));
 // FeatureIDsDependsOn returns the ids of the features that this feature depends on.
-function featureIDsDependsOn(feature) {
+function getFeatureIDsDependsOn(feature) {
     const ids = [];
     // Iterate over prerequisites and add their FeatureId
     feature.getPrerequisitesList().forEach((p) => {
@@ -248,7 +323,7 @@ function topologicalSort(features) {
             throw new ErrCycleExists();
         }
         marks[fId] = Mark.Temporary;
-        const dependentFeatureIds = featureIDsDependsOn(f);
+        const dependentFeatureIds = getFeatureIDsDependsOn(f);
         for (const fid of dependentFeatureIds) {
             const pf = mapFeatures[fid];
             if (!pf) {
@@ -278,7 +353,7 @@ function getFeaturesDependedOnTargets(targets, all) {
         // Add feature to evals
         evals[f.getId()] = f;
         // Get dependent features recursively
-        const featureDependencies = featureIDsDependsOn(f);
+        const featureDependencies = getFeatureIDsDependsOn(f);
         featureDependencies.forEach((fid) => {
             const target = all.get(fid);
             if (target !== undefined) {
@@ -292,6 +367,24 @@ function getFeaturesDependedOnTargets(targets, all) {
 }
 // getFeaturesDependsOnTargets returns the features that depend on the target features.
 // targetFeatures are included in the result.
+//
+// This function ensures complete transitive closure for incremental evaluation.
+//
+// Example scenario:
+//   Feature Dependencies: A ← B ← C, A ← D, E ← D
+//   Target: [C] (recently updated)
+//
+// Step 1 - DFS finds direct/transitive dependents of targets:
+//   - A depends on B, B depends on C (target) → Add A, B
+//   - E depends on D, D doesn't depend on C → Skip E
+//     Result: {C, A, B}
+//
+// Step 2 - Find dependencies of discovered dependents:
+//   - A depends on D (new!) → Add D
+//     Result: {C, A, B, D}
+//
+// Without Step 2: Evaluating A would fail with "feature D not found"
+// With Step 2: Complete closure ensures all dependencies are available
 function getFeaturesDependsOnTargets(targets, all) {
     const evals = {};
     // Mark target features in the evals map initially
@@ -303,7 +396,7 @@ function getFeaturesDependsOnTargets(targets, all) {
         if (evals[f.getId()]) {
             return true;
         }
-        const featureDependencies = featureIDsDependsOn(f);
+        const featureDependencies = getFeatureIDsDependsOn(f);
         for (const fid of featureDependencies) {
             const dependentFeature = all.get(fid);
             if (dependentFeature && dfs(dependentFeature)) {
@@ -318,6 +411,37 @@ function getFeaturesDependsOnTargets(targets, all) {
     all.forEach((f) => {
         dfs(f);
     });
+    // Step 2: Ensure complete transitive closure
+    // The DFS above finds dependents (who depends on targets), but misses dependencies of those dependents.
+    // Example: If target C → dependent A → dependency D, we found A but missed D.
+    // Efficiently process only newly discovered features in each iteration.
+    const processed = new Set();
+    let queue = [];
+    for (const f of Object.values(evals)) {
+        queue.push(f);
+    }
+    const maxIterations = 100; // Prevent infinite loops in case of circular dependencies
+    let iteration = 0;
+    while (queue.length > 0 && iteration < maxIterations) {
+        iteration++;
+        const nextQueue = [];
+        for (const f of queue) {
+            if (processed.has(f.getId())) {
+                continue;
+            }
+            processed.add(f.getId());
+            // Find dependencies of f
+            const featureDependencies = getFeatureIDsDependsOn(f);
+            for (const depID of featureDependencies) {
+                const dep = all.get(depID);
+                if (dep && !evals[depID]) {
+                    evals[depID] = dep;
+                    nextQueue.push(dep);
+                }
+            }
+        }
+        queue = nextQueue;
+    }
     return evals;
 }
 function arrayToRecord(arr) {
@@ -326,3 +450,10 @@ function arrayToRecord(arr) {
         return acc;
     }, {});
 }
+/**
+ * Converts a YAML string to a JSON string.
+ */
+function yamlToJSON(yamlStr) {
+    const data = yaml.load(yamlStr);
+    return JSON.stringify(data);
+}