@rkmodules/rules 0.0.55 → 0.0.56

package/dist/index.esm.js

@@ -806,8 +806,8 @@ var greaterThan = {
     label: "Greater Than",
     description: "Compare on greater than or greater than or equal to",
     inputs: {
-        a: "number",
-        b: "number",
+        a: { type: "number", default: 0 },
+        b: { type: "number", default: 0 },
     },
     outputs: {
         gt: "boolean",
@@ -817,9 +817,13 @@ var greaterThan = {
         return __generator(this, function (_a) {
             return [2 /*return*/, {
                     gt: binaryOnTree(inputs.a, inputs.b, function (itemA, itemB) {
+                        if (itemA === undefined || itemB === undefined)
+                            return DISCARD;
                         return itemA > itemB;
                     }, true),
                     gte: binaryOnTree(inputs.a, inputs.b, function (itemA, itemB) {
+                        if (itemA === undefined || itemB === undefined)
+                            return DISCARD;
                         return itemA >= itemB;
                     }, true),
                 }];
@@ -832,8 +836,8 @@ var lessThan = {
     label: "Less Than",
     description: "Compare on less than or less than or equal to",
     inputs: {
-        a: "number",
-        b: "number",
+        a: { type: "number", default: 0 },
+        b: { type: "number", default: 0 },
     },
     outputs: {
         lt: "boolean",
@@ -843,9 +847,13 @@ var lessThan = {
         return __generator(this, function (_a) {
             return [2 /*return*/, {
                     lt: binaryOnTree(inputs.a, inputs.b, function (itemA, itemB) {
+                        if (itemA === undefined || itemB === undefined)
+                            return DISCARD;
                         return itemA < itemB;
                     }, true),
                     lte: binaryOnTree(inputs.a, inputs.b, function (itemA, itemB) {
+                        if (itemA === undefined || itemB === undefined)
+                            return DISCARD;
                         return itemA <= itemB;
                     }, true),
                 }];
@@ -965,21 +973,23 @@ var listItem = {
     },
     outputs: {
         item: "any",
+        others: "any",
     },
     impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
+        var item, others;
         return __generator(this, function (_a) {
+            item = binaryOnTreeBranch(inputs.list || {}, inputs.index || {}, function (branch, indices) {
+                if (indices) {
+                    return indices.map(function (i) { return branch[i]; });
+                }
+            });
+            others = binaryOnTreeBranch(inputs.list || {}, inputs.index || {}, function (branch, indices) {
+                console.log("others", branch, indices);
+                return branch.filter(function (i) { return !(indices === null || indices === void 0 ? void 0 : indices.includes(i)); });
+            });
             return [2 /*return*/, {
-                    // item: mapTreeBranch(inputs.list, (branch, path) => {
-                    //     let indices = getBranch(inputs.index, path);
-                    //     if (indices) {
-                    //         return indices.map((i) => branch[i]);
-                    //     }
-                    // }),
-                    item: binaryOnTreeBranch(inputs.list || {}, inputs.index || {}, function (branch, indices) {
-                        if (indices) {
-                            return indices.map(function (i) { return branch[i]; });
-                        }
-                    }),
+                    item: item,
+                    others: others,
                 }];
         });
     }); },