@rkmodules/rules 0.0.60 → 0.0.61
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.cjs.js +5 -5
- package/dist/index.cjs.js.map +1 -1
- package/dist/index.esm.js +5 -5
- package/dist/index.esm.js.map +1 -1
- package/package.json +1 -1
package/dist/index.cjs.js
CHANGED
|
@@ -259,14 +259,14 @@ function getBranch(tree, path) {
|
|
|
259
259
|
* @returns
|
|
260
260
|
*/
|
|
261
261
|
function mapTree(tree, fn) {
|
|
262
|
-
return nAryOnTree([tree], function (_a, _b, index) {
|
|
262
|
+
return nAryOnTree([tree], function mapTreeCallback(_a, _b, index) {
|
|
263
263
|
var _c = __read(_a, 1), item = _c[0];
|
|
264
264
|
var _d = __read(_b, 1), path = _d[0];
|
|
265
265
|
return fn(item, path, index);
|
|
266
266
|
});
|
|
267
267
|
}
|
|
268
268
|
function mapTreeBranch(tree, fn) {
|
|
269
|
-
return nAryOnTreeBranch([tree], function (_a, _b) {
|
|
269
|
+
return nAryOnTreeBranch([tree], function mapTreeBranchCallback(_a, _b) {
|
|
270
270
|
var _c = __read(_a, 1), branch = _c[0];
|
|
271
271
|
var _d = __read(_b, 1), path = _d[0];
|
|
272
272
|
return fn(branch, path);
|
|
@@ -319,7 +319,7 @@ function nAryOnTreeBranch(trees, fn) {
|
|
|
319
319
|
* @returns
|
|
320
320
|
*/
|
|
321
321
|
function nAryOnTree(trees, fn, fill) {
|
|
322
|
-
return nAryOnTreeBranch(trees, function (branches, paths) {
|
|
322
|
+
return nAryOnTreeBranch(trees, function nAryOnTreeCallback(branches, paths) {
|
|
323
323
|
var maxLength = Math.max.apply(Math, __spreadArray([], __read(branches.map(function (b) { return b.length; })), false));
|
|
324
324
|
if (maxLength === 0)
|
|
325
325
|
return; // Skip empty branches
|
|
@@ -356,7 +356,7 @@ function nAryOnTree(trees, fn, fill) {
|
|
|
356
356
|
* @returns
|
|
357
357
|
*/
|
|
358
358
|
function binaryOnTreeBranch(treeA, treeB, fn) {
|
|
359
|
-
return nAryOnTreeBranch([treeA, treeB], function (_a, _b) {
|
|
359
|
+
return nAryOnTreeBranch([treeA, treeB], function binaryOnTreeBranchCallback(_a, _b) {
|
|
360
360
|
var _c = __read(_a, 2), branchA = _c[0], branchB = _c[1];
|
|
361
361
|
var _d = __read(_b, 2), pathA = _d[0], pathB = _d[1];
|
|
362
362
|
return fn(branchA, branchB, pathA, pathB);
|
|
@@ -375,7 +375,7 @@ function binaryOnTreeBranch(treeA, treeB, fn) {
|
|
|
375
375
|
* @returns
|
|
376
376
|
*/
|
|
377
377
|
function binaryOnTree(treeA, treeB, fn, fill) {
|
|
378
|
-
return nAryOnTree([treeA, treeB], function (_a, _b, index) {
|
|
378
|
+
return nAryOnTree([treeA, treeB], function binaryOnTreeCallback(_a, _b, index) {
|
|
379
379
|
var _c = __read(_a, 2), itemA = _c[0], itemB = _c[1];
|
|
380
380
|
var _d = __read(_b, 2), pathA = _d[0], pathB = _d[1];
|
|
381
381
|
return fn(itemA, itemB, pathA, pathB, index);
|