|
1 | 1 | 'use strict' |
2 | 2 |
|
3 | | -const { |
4 | | - cloneDeep, |
5 | | - concat, |
6 | | - first, |
7 | | - findIndex, |
8 | | - forEach, |
9 | | - chain, |
10 | | - castArray, |
11 | | - has, |
12 | | - set |
13 | | -} = require('lodash') |
14 | | - |
15 | | -const forEachRule = (collection, fn) => forEach(castArray(collection), fn) |
16 | | - |
17 | | -const loadRules = rulesBundle => |
18 | | - chain(rulesBundle) |
19 | | - .reduce((acc, { test, pkgName, ...rules }) => { |
20 | | - forEach(rules, (innerRules, propName) => { |
21 | | - forEachRule(innerRules, rule => { |
| 3 | +const castArray = value => (Array.isArray(value) ? value : [value]) |
| 4 | + |
| 5 | +const loadRules = rulesBundle => { |
| 6 | + const acc = {} |
| 7 | + |
| 8 | + for (const { test, pkgName, ...rules } of rulesBundle) { |
| 9 | + for (const [propName, innerRules] of Object.entries(rules)) { |
| 10 | + const processedRules = castArray(innerRules) |
| 11 | + if (test || pkgName) { |
| 12 | + for (const rule of processedRules) { |
22 | 13 | if (test) rule.test = test |
23 | | - rule.pkgName = pkgName ?? 'uknown' |
24 | | - }) |
25 | | - |
26 | | - set( |
27 | | - acc, |
28 | | - propName, |
29 | | - has(acc, propName) |
30 | | - ? concat(acc[propName], innerRules) |
31 | | - : concat(innerRules) |
32 | | - ) |
33 | | - |
34 | | - return acc |
35 | | - }) |
36 | | - return acc |
37 | | - }, {}) |
38 | | - .toPairs() |
39 | | - .value() |
40 | | - |
41 | | -const mergeRules = (rules, baseRules) => |
42 | | - chain(rules) |
43 | | - .reduce((acc, { test, ...rules }) => { |
44 | | - forEach(rules, (innerRules, propName) => { |
45 | | - if (test) forEachRule(innerRules, rule => (rule.test = test)) |
46 | | - // find the rules associated with `propName` |
47 | | - const index = findIndex(acc, item => first(item) === propName) |
48 | | - // if `propName` has more rule, add the new rule from the end |
49 | | - if (index !== -1) acc[index][1] = concat(innerRules, ...acc[index][1]) |
50 | | - // otherwise, create an array of rules |
51 | | - else acc.push([propName, castArray(innerRules)]) |
52 | | - }) |
53 | | - return acc |
54 | | - }, cloneDeep(baseRules)) |
55 | | - .value() |
| 14 | + if (pkgName) rule.pkgName = pkgName ?? 'unknown' |
| 15 | + } |
| 16 | + } |
| 17 | + |
| 18 | + if (acc[propName]) { |
| 19 | + acc[propName].push(...processedRules) |
| 20 | + } else { |
| 21 | + acc[propName] = processedRules |
| 22 | + } |
| 23 | + } |
| 24 | + } |
| 25 | + return Object.entries(acc) |
| 26 | +} |
| 27 | + |
| 28 | +const mergeRules = (rules, baseRules, omitPropNames = new Set()) => { |
| 29 | + const result = {} |
| 30 | + |
| 31 | + // Process base rules first (shallow clone arrays only) |
| 32 | + for (const [propName, ruleArray] of baseRules) { |
| 33 | + if (!omitPropNames.has(propName)) { |
| 34 | + result[propName] = [...ruleArray] // Shallow clone array |
| 35 | + } |
| 36 | + } |
| 37 | + |
| 38 | + // Handle case where rules might be null/undefined or not an array |
| 39 | + if (!rules || !Array.isArray(rules)) { |
| 40 | + return Object.entries(result) |
| 41 | + } |
| 42 | + |
| 43 | + // Process inline rules |
| 44 | + for (const { test, ...ruleSet } of rules) { |
| 45 | + for (const [propName, innerRules] of Object.entries(ruleSet)) { |
| 46 | + if (omitPropNames.has(propName)) continue |
| 47 | + |
| 48 | + const processedRules = Array.isArray(innerRules) |
| 49 | + ? [...innerRules] |
| 50 | + : [innerRules] |
| 51 | + if (test) { |
| 52 | + for (const rule of processedRules) { |
| 53 | + rule.test = test |
| 54 | + } |
| 55 | + } |
| 56 | + |
| 57 | + if (result[propName]) { |
| 58 | + // Prepend new rules to match original concat(innerRules, existing) behavior |
| 59 | + result[propName] = [...processedRules, ...result[propName]] |
| 60 | + } else { |
| 61 | + result[propName] = processedRules |
| 62 | + } |
| 63 | + } |
| 64 | + } |
| 65 | + |
| 66 | + return Object.entries(result) |
| 67 | +} |
56 | 68 |
|
57 | 69 | module.exports = { mergeRules, loadRules } |
0 commit comments