@@ -137,7 +137,7 @@ void RefreshTree()
137137 ClassNode selectedNode = null ;
138138 if ( search . Length > 1 && search . Contains ( '.' ) && tree . Nodes . Count > 0 )
139139 {
140- var node = SelectedNode as ClassNode ?? ( ClassNode ) tree . Nodes [ 0 ] ;
140+ var node = SelectedNode as ClassNode ?? ( ClassNode ) tree . Nodes [ 0 ] ;
141141 var parts = search . Split ( '.' ) ;
142142 if ( node . Name == parts [ 0 ] )
143143 {
@@ -151,7 +151,7 @@ void RefreshTree()
151151 {
152152 if ( search . Length == 0 ) FillTree ( ) ;
153153 else FillTree ( search ) ;
154- if ( tree . Nodes . Count > 0 ) tree . SelectedNode = tree . Nodes [ 0 ] ;
154+ tree . SelectedNode = tree . TopNode ;
155155 }
156156 else
157157 {
@@ -206,7 +206,7 @@ void FillTree(ClassNode node, string search)
206206 if ( search . Length > 0 ) items = SearchUtil . FindAll ( items , search ) ;
207207 foreach ( var it in items )
208208 {
209- nodes . Add ( FormHelper . CreateTreeNode ( inFile , isHaxe , it ) ) ;
209+ nodes . Add ( NodeFactory . CreateTreeNode ( inFile , isHaxe , it ) ) ;
210210 }
211211 }
212212
@@ -232,7 +232,7 @@ static IEnumerable<ClassNode> CreateNodes([NotNull] IEnumerable<string> matches,
232232 static ClassNode CreateNode ( [ NotNull ] string type )
233233 {
234234 var classModel = TypeToClassModel [ type ] ;
235- return ( ClassNode ) FormHelper . CreateTreeNode ( classModel ) ;
235+ return ( ClassNode ) NodeFactory . CreateTreeNode ( classModel ) ;
236236 }
237237
238238 [ NotNull ]
0 commit comments