将目录路径转换为 ​​JSON 目录树表示

Question

我有一个文件路径的示例输出，这只是问题的一个示例

新建文本 Document.txt
新建文件夹/
新建文件夹/README.txt

我想将其转换为以下 JSON

{
   "Data":"/",
   "Nodes":[
      {
         "Data":"New Folder",
         "Nodes":[
            {
               "Data":"New Text Document.txt"
            }
         ]
      },
      {
         "Data":"New Text Document.txt",
         "Nodes":[
            ""
         ]
      }
   ]
} 

我的节点类如下

public class Node
    {
        public Node(string fileName)
        {
            Nodes = new List<Node>();
            Data = fileName;
        }

        public List<Node> Nodes { get; set; }

        public string Data { get; set; }
    }

我正在尝试找出算法，如何将文件路径表示为 Node 类，稍后我将对其进行序列化以获取 JSON。如果有任何其他方式将文件路径表示为目录树结构的 JSON，请建议

Answer 1

我终于有时间为你制作一个样品。这应该是一个很好的可扩展递归解决方案。 :)

static void Main(string[] args)
{
    Node root = new Node("/");
    AddNode("New Text Document.txt", root);
    AddNode("New folder/", root);
    AddNode("New folder/README.txt", root);

    Console.ReadKey();
}

public class Node
{
    public Node() { Nodes = new List<Node>(); }
    public Node(string fileName)
    {
        Nodes = new List<Node>();
        Data = fileName;
    }

    public Node FindNode(string data)
    {
        if (this.Nodes == null || !this.Nodes.Any()) { return null; }

        // check Node list to see if there are any that already exist
        return this.Nodes
            .FirstOrDefault(n => String.Equals(n.Data, data, StringComparison.CurrentCultureIgnoreCase));
    }

    public string Data { get; set; }
    public List<Node> Nodes { get; set; }
}

public static Node AddNode(string filePath, Node rootNode)
{
    // convenience method. this creates the queue that we need for recursion from the filepath for you
    var tokens = filePath.Split('/').ToList();

    // if you split a folder ending with / it leaves an empty string at the end and we want to remove that
    if (String.IsNullOrWhiteSpace(tokens.Last())) { tokens.Remove(""); }

    return AddNode(new Queue<string>(tokens), rootNode);
}

private static Node AddNode(Queue<string> tokens, Node rootNode)
{
    // base case -> node wasnt found and tokens are gone  :(
    if (tokens == null || !tokens.Any())
    {
        return null;
    }

    // get current token, leaving only unsearched ones in the tokens object
    string current = tokens.Dequeue();

    // create node if not already exists
    Node foundNode = rootNode.FindNode(current);
    if (foundNode != null)
    {
        // node exists! recurse
        return AddNode(tokens, foundNode);
    }
    else
    {
        // node doesnt exist! add it manually and recurse
        Node newNode = new Node() { Data = current };
        rootNode.Nodes.Add(newNode);
        return AddNode(tokens, newNode);
    }
}

Answer 2

using System.Web.Script.Serialization; ///name space to use

    JavaScriptSerializer js = new JavaScriptSerializer();
      string json = js.Serialize(pass node class object here);

下面的代码应该给出所需的目录结构。

static void Main(string[] args)
{
    string path = @"path where to check";
    Node n = new Node();
    n.Nodes = new List<Node>();
    GetNodes(path, n);
    JavaScriptSerializer js = new JavaScriptSerializer();
    string json = js.Serialize(n);
}

public static void GetNodes(string path, Node node)
{
    if (File.Exists(path))
    {
        node = new Node(path);
    }
    else if (Directory.Exists(path))
    {
        node.Data = "\\";
        GetFiles(path, node);

        foreach ( string item in Directory.GetDirectories(path))
        {
            Node n = new Node();
            n.Nodes = new List<Node>();
            n.Data = item;
            GetFiles(path, n);
            node.Nodes.Add(n);
        }
    }
}

public static void GetFiles(string path, Node node)
{
    foreach (string item in Directory.GetFiles(path))
    {
        node.Nodes.Add(new Node(item));
    }

}

public class Node
{
    public Node()
    { }
    public Node(string fileName)
    {
        Nodes = new List<Node>();
        Data = fileName;
    }

    public List<Node> Nodes { get; set; }

    public string Data { get; set; }
}