从目录路径获取对象数组中的目录路径作为字符串

Question

一直在搜索 SO 帖子，但没有人能回答我这个问题。

我有一个这样的文件夹数组：

[{
"name": "home",
"folders": [{
    "name": "New Folder",
    "folders": [{
        "name": "53w5r",
        "folders": [{
            "name": "test",
            "folders": []
        }]
    }]
}, {
    "name": "public folder",
    "folders": [{
        "name": "cold",
        "folders": []
    }, {
        "name": "hot",
        "folders": []
    }]
}, {
    "name": "My Folder",
    "folders": []
}]

}]

我需要使用如下的路径字符串来搜索这个数组：

"home,New Folder,53w5r,test"

我正在搜索该文件夹，因此 findFolder 方法将获取上面的字符串并返回“test”文件夹中的文件夹对象。

Answer 1

假设您的逗号分隔路径始终有效，您可以使用这种简单的方法来遍历数据：

var str = "home,New Folder,53w5r,test";
var data = [{
  "name": "home",
  "folders": [{
    "name": "New Folder",
    "folders": [{
      "name": "53w5r",
      "folders": [{
        "name": "test",
        "folders": []
      }]
    }]
  }, {
    "name": "public folder",
    "folders": [{
      "name": "cold",
      "folders": []
    }, {
      "name": "hot",
      "folders": []
    }]
  }, {
    "name": "My Folder",
    "folders": []
  }]
}];

var folderNames = str.split(",");
var result = folderNames.reduce((results, folderName, index) => {
  var currFolder = results.find(folder => folder.name === folderName);
  // if last folder, return entire folder, otherwise return currFolder.folders
  return index === folderNames.length-1 ? currFolder : currFolder.folders;
}, data);
console.log(result);

Answer 2

这是我没有reduce的实现，如果找不到目录，它将返回null。

const dirSeperator = ",";

function findDir(path, dirs) {
  var parts = path.split(dirSeperator);

  if (parts && parts.length > 0) {
    var n = parts[0];
    for (var i = 0; i < dirs.length; i++) {
      if (dirs[i].name === n) {
        if (parts.length > 1)
          return findDir(path.replace(n + dirSeperator, ''), dirs[i].folders)
        else if (parts.length == 1)
          return dirs[i]
      }
    }

    return null;
  } else {
    return null;
  }
}

var dirs = [{
    "name": "Test",
    "folders": [{
      "name": "Test2",
      "folders": [{
          "name": "test 3",
          "folders": []
        },
        {
          "name": "test 3",
          "folders": []
        }
      ]
    }]
  },
  {
    "name": "Main",
    "folders": [{
      "name": "Test2",
      "folders": [{
          "name": "test 3",
          "folders": []
        },
        {
          "name": "test 3",
          "folders": []
        }
      ]
    }]
  }
];
const testcase = "Test,Test2,test 3";
console.log('Searching for', testcase, ' in ', dirs)
console.log(findDir(testcase, dirs))

Answer 3

这是一个 2 行解决方案：

您可以使用.find方法在层级上搜索文件夹：

(folder, name) => folder.folders.find(e => e.name == name);

然后我编写了一个递归函数，它将查找所提供路径的每个元素的文件夹。它使用.reduce 来跟踪父文件夹（acc）。在循环结束时，它返回最后一个文件夹数组（路径末尾的那个）。

path.split(',').reduce((acc, curr) => find(acc, curr), {folders:folders});

这是一个快速演示：

const find = (folder, name) => folder.folders.find(e => e.name == name);

const getFolders = path => path.split(',').reduce((acc, curr) => find(acc, curr), {folders:folders});

console.log(
  getFolders('home,New Folder,53w5r,test')
);

<script>
const folders = [{
  "name": "home",
  "folders": [{
    "name": "New Folder",
    "folders": [{
      "name": "53w5r",
      "folders": [{
        "name": "test",
        "folders": []
      }]
    }]
  }, {
    "name": "public folder",
    "folders": [{
      "name": "cold",
      "folders": []
    }, {
      "name": "hot",
      "folders": []
    }]
  }, {
    "name": "My Folder",
    "folders": []
  }]
}]
</script>