填充TreeView控件从价值

Question

我有一些数据，其中的格式像这样的文本文件的路径列表：

A.B.C=12 
A.B.D=13 
A.C.D=14 

，并需要把它变成一个TreeView控件，以便它看起来像这样：

两端的标记值应该与他们在文本中所做的相同，即。 C = 12.

我试过的大部分都是围绕着在每一行上使用foreach循环，然后在'。'和'='上分割字符串并遍历这些字符串，但我有根本无法完成它的工作。

任何帮助将不胜感激......

Answer 1

这里有一个方法你的问题。评论在代码中。 与您的样本数据，但我不能保证它会在其他一些情况下工作:)

主要方法是PopulateTreeView()所以从，例如，窗体的Load事件调用它。此外，还有帮助方法FindNode，它用于搜索第一级节点以查找是否存在具有提供文本的节点。

如果您有其他问题，请随时询问。

private void PopulateTreeView() 
{ 
    //read from file 
    var lines = File.ReadAllLines(@"c:\temp\tree.txt"); 
    //go through all the lines 
    foreach (string line in lines) 
    { 
     //split by dot to get nodes names 
     var nodeNames = line.Split('.'); 
     //TreeNode to remember node level 
     TreeNode lastNode = null; 

     //iterate through all node names 
     foreach (string nodeName in nodeNames) 
     { 
      //values for name and tag (tag is empty string by default) 
      string name = nodeName; 
      string tagValue = string.Empty; 
      //if node is in format "name=value", change default values of name and tag value. If not, 
      if (nodeName.Contains("=")) 
      { 
       name = nodeName.Split('=')[0]; 
       tagValue = nodeName.Split('=')[1]; 
      } 

      //var used for finding existing node 
      TreeNode existingNode = null; 
      //new node to add to tree 
      TreeNode newNode = new TreeNode(name); 
      newNode.Tag = tagValue; 
      //collection of subnodes to search for node name (to check if node exists) 
      //in first pass, that collection is collection of treeView's nodes (first level) 
      TreeNodeCollection nodesCollection = treeView1.Nodes; 

      //with first pass, this will be null, but in every other, this will hold last added node. 
      if (lastNode != null) 
      { 
       nodesCollection = lastNode.Nodes; 
      } 

      //look into collection if node is already there (method checks only first level of node collection) 
      existingNode = FindNode(nodesCollection, name); 
      //node is found? In that case, skip it but mark it as last "added" 
      if (existingNode != null) 
      { 
       lastNode = existingNode; 
       continue; 
      } 
      else //not found so add it to collection and mark node as last added. 
      { 
       nodesCollection.Add(newNode); 
       lastNode = newNode; 
      } 
     } 
    } 

    treeView1.ExpandAll(); 
} 

private TreeNode FindNode(TreeNodeCollection nodeCollectionToSearch, string nodeText) 
{ 
    var nodesToSearch = nodeCollectionToSearch.Cast<TreeNode>(); 
    var foundNode = nodesToSearch.FirstOrDefault(n => n.Text == nodeText); 
    return foundNode; 
}