@rkmodules/rules 0.0.42 → 0.0.44
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index.js +129 -3
- package/dist/index.js.map +1 -1
- package/dist/lib/Primitives/List/shiftList.d.ts +2 -0
- package/dist/lib/Primitives/Math/add.d.ts +2 -0
- package/dist/lib/Primitives/Math/divide.d.ts +2 -0
- package/dist/lib/Primitives/Math/multiply.d.ts +2 -0
- package/dist/lib/Primitives/Math/subtract.d.ts +2 -0
- package/package.json +1 -1
package/dist/index.js
CHANGED
|
@@ -596,6 +596,28 @@ var primitives$6 = (_a$5 = {},
|
|
|
596
596
|
_a$5[value.name] = value,
|
|
597
597
|
_a$5);
|
|
598
598
|
|
|
599
|
+
var add = {
|
|
600
|
+
name: "add",
|
|
601
|
+
label: "Add",
|
|
602
|
+
description: "Add two numbers",
|
|
603
|
+
inputs: {
|
|
604
|
+
a: "number",
|
|
605
|
+
b: "number",
|
|
606
|
+
},
|
|
607
|
+
outputs: {
|
|
608
|
+
sum: "number",
|
|
609
|
+
},
|
|
610
|
+
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
611
|
+
return __generator(this, function (_a) {
|
|
612
|
+
return [2 /*return*/, {
|
|
613
|
+
sum: binaryOnTree(inputs.a, inputs.b, function (itemA, itemB) {
|
|
614
|
+
return itemA + itemB;
|
|
615
|
+
}, true),
|
|
616
|
+
}];
|
|
617
|
+
});
|
|
618
|
+
}); },
|
|
619
|
+
};
|
|
620
|
+
|
|
599
621
|
var math$1 = mathjs.create(mathjs.all, {});
|
|
600
622
|
function evaluate(expression, scope) {
|
|
601
623
|
// console.log("evaluating", expression, "in", scope);
|
|
@@ -755,6 +777,28 @@ function getUnboundSymbols(expr, scope, extraBound) {
|
|
|
755
777
|
return Array.from(free).sort();
|
|
756
778
|
}
|
|
757
779
|
|
|
780
|
+
var divide = {
|
|
781
|
+
name: "divide",
|
|
782
|
+
label: "Divide",
|
|
783
|
+
description: "Divide two numbers",
|
|
784
|
+
inputs: {
|
|
785
|
+
a: "number",
|
|
786
|
+
b: "number",
|
|
787
|
+
},
|
|
788
|
+
outputs: {
|
|
789
|
+
quotient: "number",
|
|
790
|
+
},
|
|
791
|
+
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
792
|
+
return __generator(this, function (_a) {
|
|
793
|
+
return [2 /*return*/, {
|
|
794
|
+
quotient: binaryOnTree(inputs.a, inputs.b, function (itemA, itemB) {
|
|
795
|
+
return itemA / itemB;
|
|
796
|
+
}, true),
|
|
797
|
+
}];
|
|
798
|
+
});
|
|
799
|
+
}); },
|
|
800
|
+
};
|
|
801
|
+
|
|
758
802
|
var greaterThan = {
|
|
759
803
|
name: "greaterThan",
|
|
760
804
|
label: "Greater Than",
|
|
@@ -807,11 +851,59 @@ var lessThan = {
|
|
|
807
851
|
}); },
|
|
808
852
|
};
|
|
809
853
|
|
|
854
|
+
var multiply = {
|
|
855
|
+
name: "multiply",
|
|
856
|
+
label: "Multiply",
|
|
857
|
+
description: "Multiply two numbers",
|
|
858
|
+
inputs: {
|
|
859
|
+
a: "number",
|
|
860
|
+
b: "number",
|
|
861
|
+
},
|
|
862
|
+
outputs: {
|
|
863
|
+
product: "number",
|
|
864
|
+
},
|
|
865
|
+
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
866
|
+
return __generator(this, function (_a) {
|
|
867
|
+
return [2 /*return*/, {
|
|
868
|
+
product: binaryOnTree(inputs.a, inputs.b, function (itemA, itemB) {
|
|
869
|
+
return itemA * itemB;
|
|
870
|
+
}, true),
|
|
871
|
+
}];
|
|
872
|
+
});
|
|
873
|
+
}); },
|
|
874
|
+
};
|
|
875
|
+
|
|
876
|
+
var subtract = {
|
|
877
|
+
name: "subtract",
|
|
878
|
+
label: "Subtract",
|
|
879
|
+
description: "Subtract two numbers",
|
|
880
|
+
inputs: {
|
|
881
|
+
a: "number",
|
|
882
|
+
b: "number",
|
|
883
|
+
},
|
|
884
|
+
outputs: {
|
|
885
|
+
difference: "number",
|
|
886
|
+
},
|
|
887
|
+
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
888
|
+
return __generator(this, function (_a) {
|
|
889
|
+
return [2 /*return*/, {
|
|
890
|
+
difference: binaryOnTree(inputs.a, inputs.b, function (itemA, itemB) {
|
|
891
|
+
return itemA - itemB;
|
|
892
|
+
}, true),
|
|
893
|
+
}];
|
|
894
|
+
});
|
|
895
|
+
}); },
|
|
896
|
+
};
|
|
897
|
+
|
|
810
898
|
var _a$4;
|
|
811
899
|
var primitives$5 = (_a$4 = {},
|
|
812
900
|
_a$4[calc.name] = calc,
|
|
813
901
|
_a$4[lessThan.name] = lessThan,
|
|
814
902
|
_a$4[greaterThan.name] = greaterThan,
|
|
903
|
+
_a$4[add.name] = add,
|
|
904
|
+
_a$4[subtract.name] = subtract,
|
|
905
|
+
_a$4[multiply.name] = multiply,
|
|
906
|
+
_a$4[divide.name] = divide,
|
|
815
907
|
_a$4);
|
|
816
908
|
|
|
817
909
|
var filterList = {
|
|
@@ -852,7 +944,7 @@ var splitGroup = {
|
|
|
852
944
|
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
853
945
|
return __generator(this, function (_a) {
|
|
854
946
|
return [2 /*return*/, {
|
|
855
|
-
tree: graftTree(inputs.tree),
|
|
947
|
+
tree: graftTree(inputs.tree || {}),
|
|
856
948
|
}];
|
|
857
949
|
});
|
|
858
950
|
}); },
|
|
@@ -904,7 +996,7 @@ var listLength = {
|
|
|
904
996
|
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
905
997
|
return __generator(this, function (_a) {
|
|
906
998
|
return [2 /*return*/, {
|
|
907
|
-
length: mapTreeBranch(inputs.list, function (branch) {
|
|
999
|
+
length: mapTreeBranch(inputs.list || {}, function (branch) {
|
|
908
1000
|
return [branch.length];
|
|
909
1001
|
}),
|
|
910
1002
|
}];
|
|
@@ -937,6 +1029,39 @@ var mergeGroup = {
|
|
|
937
1029
|
}); },
|
|
938
1030
|
};
|
|
939
1031
|
|
|
1032
|
+
var shiftList = {
|
|
1033
|
+
name: "shiftList",
|
|
1034
|
+
label: "Shift List",
|
|
1035
|
+
description: "Shifts the list to the left, removing the first element and adding it at the end if wrap is enabled",
|
|
1036
|
+
inputs: {
|
|
1037
|
+
list: "any",
|
|
1038
|
+
step: { type: "number", default: 1, step: 1 },
|
|
1039
|
+
wrap: "boolean",
|
|
1040
|
+
},
|
|
1041
|
+
outputs: {
|
|
1042
|
+
list: "any",
|
|
1043
|
+
},
|
|
1044
|
+
impl: function (inputs, params) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1045
|
+
return __generator(this, function (_a) {
|
|
1046
|
+
return [2 /*return*/, {
|
|
1047
|
+
list: nAryOnTreeBranch([inputs.list || {}, inputs.step || {}, inputs.wrap || {}], function (_a) {
|
|
1048
|
+
var _b;
|
|
1049
|
+
var _c = __read(_a, 3), list = _c[0], step = _c[1], wrap = _c[2];
|
|
1050
|
+
var n = (_b = step[0]) !== null && _b !== void 0 ? _b : 1;
|
|
1051
|
+
if (wrap[0]) {
|
|
1052
|
+
n = n % (list.length || 1);
|
|
1053
|
+
}
|
|
1054
|
+
var shifted = list.slice(n);
|
|
1055
|
+
if (wrap[0]) {
|
|
1056
|
+
shifted.push.apply(shifted, __spreadArray([], __read(list.slice(0, n)), false));
|
|
1057
|
+
}
|
|
1058
|
+
return shifted;
|
|
1059
|
+
}),
|
|
1060
|
+
}];
|
|
1061
|
+
});
|
|
1062
|
+
}); },
|
|
1063
|
+
};
|
|
1064
|
+
|
|
940
1065
|
var _a$3;
|
|
941
1066
|
var primitives$4 = (_a$3 = {},
|
|
942
1067
|
_a$3[splitGroup.name] = splitGroup,
|
|
@@ -944,6 +1069,7 @@ var primitives$4 = (_a$3 = {},
|
|
|
944
1069
|
_a$3[listItem.name] = listItem,
|
|
945
1070
|
_a$3[listLength.name] = listLength,
|
|
946
1071
|
_a$3[filterList.name] = filterList,
|
|
1072
|
+
_a$3[shiftList.name] = shiftList,
|
|
947
1073
|
_a$3);
|
|
948
1074
|
|
|
949
1075
|
var series = {
|
|
@@ -951,7 +1077,7 @@ var series = {
|
|
|
951
1077
|
label: "Series",
|
|
952
1078
|
description: "Create a series of numbers.",
|
|
953
1079
|
inputs: {
|
|
954
|
-
start: { type: "number", default:
|
|
1080
|
+
start: { type: "number", default: 0 },
|
|
955
1081
|
step: { type: "number", default: 1 },
|
|
956
1082
|
count: { type: "number", default: 10 },
|
|
957
1083
|
},
|