对MongoDB中的集合进行递归计数

function recursiveCount(collection, query) {
  let count = 0;

  function countDocuments(documents) {
    for (let document of documents) {
      if (query(document)) {
        count++;
      }
      if (document.children) {
        countDocuments(document.children);
      }
    }
  }

  countDocuments(collection);
  return count;
}

// 假设有以下集合结构
const collection = [
  {
    _id: 1,
    name: "document 1",
    children: [
      {
        _id: 2,
        name: "document 2",
        children: [
          {
            _id: 3,
            name: "document 3",
            children: []
          },
          {
            _id: 4,
            name: "document 4",
            children: []
          }
        ]
      },
      {
        _id: 5,
        name: "document 5",
        children: []
      }
    ]
  },
  {
    _id: 6,
    name: "document 6",
    children: []
  }
];

// 定义筛选条件函数
function query(document) {
  return document.name.includes("document");
}

// 对集合进行递归计数
const count = recursiveCount(collection, query);
console.log(count); // 输出：6