从多个字符串路径创建嵌套对象

Question

我正在寻找将多个字符串路径转换为使用javascript的嵌套对象的最佳方法。如果可以以任何方式帮助，我正在使用lodash。

我得到了以下路径：

/root/library/Folder 1 
/root/library/Folder 2 
/root/library/Folder 1/Document.docx 
/root/library/Folder 1/Document 2.docx 
/root/library/Folder 2/Document 3.docx 
/root/library/Document 4.docx 

，我想创建对象的下列数组：在每个字符串

var objectArray = 
    [ 
     { 
     "name": "root", "children": [ 
      { 
      "name": "library", "children": [ 
       { 
       "name": "Folder 1", "children": [ 
        { "name": "Document.docx", "children": [] }, 
        { "name": "Document 2.docx", "children": [] } 
       ] 
       }, 
       { 
       "name": "Folder 2", "children": [ 
        { "name": "Document 3.docx", "children": [] } 
       ] 
       }, 
       { 
       "name": "Document 4.docx", "children": [] 
       } 
      ] 
      } 
     ] 
     } 
    ]; 

Answer 1

我建议实现一个树插入函数，其参数是一个包含子元素和路径的数组。它根据给定的路径穿过的孩子，并插入必要的新的孩子，避免重复：

// Insert path into directory tree structure: 
 
function insert(children = [], [head, ...tail]) { 
 
    let child = children.find(child => child.name === head); 
 
    if (!child) children.push(child = {name: head, children: []}); 
 
    if (tail.length > 0) insert(child.children, tail); 
 
    return children; 
 
} 
 

 
// Example: 
 
let paths = [ 
 
    '/root/library/Folder 1', 
 
    '/root/library/Folder 2', 
 
    '/root/library/Folder 1/Document.docx', 
 
    '/root/library/Folder 1/Document 2.docx', 
 
    '/root/library/Folder 2/Document 3.docx', 
 
    '/root/library/Document 4.docx' 
 
]; 
 

 
let objectArray = paths 
 
    .map(path => path.split('/').slice(1)) 
 
    .reduce((children, path) => insert(children, path), []); 
 

 
console.log(objectArray);

Answer 2

迭代并将它解析为一个对象：

var glob={name:undefined,children:[]}; 

["/root/library/Folder 1","/root/library/Folder 2","/root/library/Folder 1/Document.docx","/root/library/Folder 1/Document 2.docx","/root/library/Folder 2/Document 3.docx","/root/library/Document 4.docx"] 
.forEach(function(path){ 

    path.split("/").slice(1).reduce(function(dir,sub){ 

    var children; 

    if(children=dir.children.find(el=>el.name===sub)){ 
     return children; 
    } 

    children={name:sub,children:[]}; 
    dir.children.push(children); 
    return children; 

    },glob); 

}); 

console.log(glob); 

http://jsbin.com/yusopiguci/edit?console

---

改进版本：

var glob={name:undefined,children:[]}; 
var symbol="/" /* or Symbol("lookup") in modern browsers */ ; 
var lookup={[symbol]:glob}; 

["/root/library/Folder 1","/root/library/Folder 2","/root/library/Folder 1/Document.docx","/root/library/Folder 1/Document 2.docx","/root/library/Folder 2/Document 3.docx","/root/library/Document 4.docx"] 
.forEach(function(path){ 

    path.split("/").slice(1).reduce(function(dir,sub){ 
    if(!dir[sub]){ 
     let subObj={name:sub,children:[]}; 
     dir[symbol].children.push(subObj); 
     return dir[sub]={[symbol]:subObj}; 
    } 
    return dir[sub]; 
    },lookup); 

}); 

console.log(glob); 

它创建相同的结果，但它可能更快（最多为O（n）与O（N + N）！） http://jsbin.com/xumazinesa/edit?console