Javascript递归问题 - 深度嵌套的对象

Question

我有一个函数可以遍历对象的密钥并查找敏感密钥，例如电子邮件、密钥、密码、apiKey、secrets、secret 和 userKey。

如果它发现任何有值，它会编辑该值。

但是，它有时会出现以下错误：

"RangeError: Maximum call stack size exceeded"

Whats causing the endless recursion??

const deepObjectRedactor = obj => {
  const sensitiveKeys = [
    'email',
    'key',
    'password',
    'apiKey',
    'secrets',
    'secret',
    'userKey'
  ];
  Object.keys(obj).forEach(key => {
    if (
      sensitiveKeys.map(e => e.toLowerCase()).includes(key.toLowerCase()) &&
      obj[key]
    ) {
      obj[key] = '**********';
      return;
    }

    if (obj[key] && typeof obj[key] === 'object') {
      deepObjectRedactor(obj[key]);
    }
  });
};


// function invoking the redactor

const customRedactorFormat = info => {
  if (info.message && typeof info.message === 'object') {
    deepObjectRedactor(info.message);
  }
  return info;
});

Answer 1

您可以编写适用于对象和数组的通用map。然后把redact写成map的特化——

function map (t, f)
{ switch (t?.constructor)
  { case Array:
      return t.map((v, k) => f(k, map(v, f)))
    case Object:
      return Object.fromEntries(
        Object.entries(t).map(([k, v]) => [k, f(k, map(v, f))])
      )
    default:
      return t
  }
}

const redact = (t, keys = new Set) =>
  map(t, (k, v) => keys.has(k) ? "*****" : v)
  
const data =
  [ { user: 1, cc: 1234, password: "foo" }
  , { nested: [ { a: 1, pin: 999 }, { b: 2, pin: 333 } ] }
  , { deeply: [ { nested: [ { user: 2, password: "here" } ] } ] }
  ]
  
console.log(redact(data, new Set(["cc", "password", "pin"])))

[
  {
    "user": 1,
    "cc": "*****",
    "password": "*****"
  },
  {
    "nested": [
      {
        "a": 1,
        "pin": "*****"
      },
      {
        "b": 2,
        "pin": "*****"
      }
    ]
  },
  {
    "deeply": [
      {
        "nested": [
          {
            "user": 2,
            "password": "*****"
          }
        ]
      }
    ]
  }
]