?

?

TreeView查獲節(jié)點(diǎn)并選中節(jié)點(diǎn)如果有多個(gè)節(jié)點(diǎn)則會(huì)繼續(xù)查找下一個(gè)節(jié)點(diǎn) 支持關(guān)鍵字搜索

private void SearchNodes(string SearchText, TreeNode StartNode){TreeNode node = null;while (StartNode != null){if (StartNode.Text.ToLower().Contains(SearchText.ToLower())){CurrentNodeMatches.Add(StartNode);}if (StartNode.Nodes.Count != 0){SearchNodes(SearchText, StartNode.Nodes[0]);//Recursive Search }StartNode = StartNode.NextNode;}}

使用

?

private List<TreeNode> CurrentNodeMatches = new List<TreeNode>();private int LastNodeIndex = 0;private string LastSearchText;private void SearchNodeText_Click(object sender, EventArgs e){treeView1.Focus();string searchText = this.textBox7.Text;/
if (String.IsNullOrEmpty(searchText)){return;}if (LastSearchText != searchText){//It's a new Search CurrentNodeMatches.Clear();LastSearchText = searchText;LastNodeIndex = 0;SearchNodes(searchText, treeView1.Nodes[0]);}if (CurrentNodeMatches.Count == 0) MessageBox.Show("無(wú)查找記錄!", "提示", MessageBoxButtons.OK, MessageBoxIcon.Information);if (LastNodeIndex >= 0 && CurrentNodeMatches.Count > 0 && LastNodeIndex < CurrentNodeMatches.Count){TreeNode selectedNode = CurrentNodeMatches[LastNodeIndex];LastNodeIndex++;this.treeView1.SelectedNode = selectedNode;this.treeView1.SelectedNode.Expand();this.treeView1.Select();}elseLastNodeIndex = 0; }

?

?

轉(zhuǎn)載于:https://www.cnblogs.com/xe2011/p/3588289.html

總結(jié)

以上是生活随笔為你收集整理的TreeView查获节点并选中节点的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。