Virtual Treeview Implementation

• Download VirtualTreeview_Demo.zip - 4.7 KB
• Download VirtualTreeview_Source.zip - 10.4 KB

Introduction

This is my first my first blog, so I picked a simple topic to talk about: Implementing the simplest virtual treeview possible.

Large data and large metadata are problems I run into on every project I work on, providing search capabilities makes browsing large amounts of information possible, but somewhere you're going to have a Treeview, a Listview or a Grid that is going to need to present some unknown amount of information. How you handle this unknown is what makes your application scalable, or come to grinding halt.

Making your UI controls "Virtual" is also a important to keep your UI thread from locking up. Don't load massive amounts of data that will never be viewed or needed. Virtual (in this context) simply means you only load the amount of data that is being displayed to the user, but give visual cues that there is more data. The .NET Listview nativly implements a virtual view so listview items can be loaded on demand, also most popular 3rd party grids have some sort of virtual support, but the .Net Treeview control doesn't...

Using the code

Synchronous Virtual Treeview

The logic for implementing a synchronous virtual treeview is extremly simple, but doesn't come without its flaws.

1. Load your root nodes
2. Add a child node to each root node with the name VIRT. This causes the treeview to put a plus sign next to each node.
3. Catch the onBeforeExpand event and if the VIRT node is a child of the node being expanded then replace it with the real children.
4. Add a VIRT node to each of the newly added children. (unless you know for sure it's a leaf node)

private void treeVirt1_BeforeExpand( object sender, TreeViewCancelEventArgs e )
{
   // If the node being expanded contains a virtual node then

   // we need to load this node's children on demand. If it doesn't

   // contain a virtual node then we already did it, so do nothing.


   if( e.Node.Nodes.ContainsKey( VIRTUALNODE ) )
   {
      try
      {
         // Do some work to load data.

         // Note this may take a while and could

         // be annoying to your user.

         // See asynchronous version below.


         // Clear out all of the children

         e.Node.Nodes.Clear();

         // Load the new children into the treeview.

         string[] arrChildren = new string[] { "Grapes", "Apples", "Tomatoes", "Kiwi" };
         foreach( string sChild in arrChildren )
         {
            // Be sure to add virtual nodes to new items that "may"

            // have children.  If you know for sure that your item is

            // a leaf node, then there's no need to add the virtual node.

            TreeNode tNode = e.Node.Nodes.Add( sChild );
            AddVirtualNode( tNode );
         }
      }
      catch
      {
         // Error occured, reset to a known state

         e.Node.Nodes.Clear();
         AddVirtualNode( e.Node );
      }
   }
}

This algorithm is very simple to implement and defers load time of data when/if needed. This implementation is good for simple applications where all the data is local and loading a branch of data is quick. However if you need to make a server call to load a branch, that could take... forever... And since you're doing the work on the UI thread you'll lock up your entire application. It's trivial to extend this algorithm to use a background worker thread to load your data asynchrounously.

Asynchronous Virtual Treeview

The logic for implementing an asynchronous virtual treeview is slightly different. Instead of catching the OnBeforeExpand event we catch the OnAfterExpand, we then use a BackgroundWorker thread so we can load the data (time consuming operation) on a thread other than the UI thread. We can't touch UI objects from other threads, but that's the beauty of the BackgroundWorker thread, its callback event fires on the UI thread. So when the RunWorkerCompleted event fires you can take the data you loaded on the other thread and create TreeNodes out of it. When the RunWorkerCompleted event runs you'll need to know what TreeNode initiated the request (this way we know who to add the new nodes to) so we'll send it "along for the ride" on the BackgroundWorker thread, but remember DO NOT use the TreeNode on the BackgroundWorker thread's DoWork function. You can't use UI controls on threads other than the thread that created them. (That's actually not true, you can use BeginInvoke, maybe that will be my next blog).

1. Load your root nodes
2. Add a child node to each root node with the name VIRT. This causes the treeview to put a plus sign next to each node.
3. Catch the onAfterExpand event
4. Create a BackgroundWorker thread and pass in the TreeNode and any other needed information to the DoWork function
5. Perform the timeconsuming operation in the DoWork function on the background thread
6. Return the original TreeNode as well as the results from the time consuming operation
7. Get the TreeNode and data from the server in the RunWorkerCompleted event
8. Remove the VIRT node and replace it with new TreeNodes
9. Add a VIRT node to each of the newly added children. (unless you know for sure it's a leaf node)

#region Asynchronous Treeview

private void treeVirt2_AfterExpand( object sender, TreeViewEventArgs e )
{
   if( e.Node.Nodes.ContainsKey( VIRTUALNODE ) )
   {
      BackgroundWorker bw = new BackgroundWorker();
      bw.DoWork += new DoWorkEventHandler( bw_DoWork );
      bw.RunWorkerCompleted += new RunWorkerCompletedEventHandler( bw_RunWorkerCompleted );

      object[] oArgs = new object[] { e.Node, "Some information..." };            
      bw.RunWorkerAsync( oArgs );
   }
}

private void bw_DoWork( object sender, DoWorkEventArgs e )
{
   object[] oArgs = e.Argument as object[];
   TreeNode tNodeParent = oArgs[0] as TreeNode;
   string sInfo = oArgs[1].ToString();

   // Note you can't use tNodeParent in here because

   // we're not on the the UI thread (see Invoke).  We've only

   // passed it in so we can round trip it to the 

   // bw_RunWorkerCompleted event.

   
   // Use sInfo argument to load the data

   Random r = new Random();
   Thread.Sleep( r.Next( 500, 2500 ) );
   string[] arrChildren = new string[] { "Grapes", "Apples", "Tomatoes", "Kiwi" };

   // Return the Parent Tree Node and the list of children to the

   // UI thread.

   e.Result = new object[] { tNodeParent, arrChildren };
}

private void bw_RunWorkerCompleted( object sender, RunWorkerCompletedEventArgs e )
{
   // Get the Parent Tree Node and the list of children

   // from the Background Worker Thread

   object[] oResult = e.Result as object[];
   TreeNode tNodeParent = oResult[0] as TreeNode;
   string[] arrChildren = oResult[1] as string[];

   tNodeParent.Nodes.Clear();

   foreach( string sChild in arrChildren )
   {
      TreeNode tNode = tNodeParent.Nodes.Add( sChild );
      AddVirtualNode( tNode );
   }
}

#endregion

Helper Functions

// Add Virtual Node function used above. Simply  

// adds a "Loading..." node with the special "VIRT" 

// name to the parent node being passed in.


private const string VIRTUALNODE = "VIRT";

private void AddVirtualNode( TreeNode tNode )
{
   TreeNode tVirt = new TreeNode();
   tVirt.Text = "Loading...";
   tVirt.Name = VIRTUALNODE;
   tVirt.ForeColor = Color.Blue;
   tVirt.NodeFont = new Font( "Microsoft Sans Serif", 8.25F, FontStyle.Underline);
   tNode.Nodes.Add( tVirt );
}

Points of Interest

Andrew D. Weiss
Software Engineer
Check out my Blog: More-On C#



-asdf

You must Sign In to use this message board.

FAQ  Noise Tolerance Very HighHighMediumLowVery Low  Search Messages    Layout Expand All MessagesThread ViewNo Javascript (slow)No Javascript Preview    Per page 102550

Msgs 1 to 1 of 1 (Total in Forum: 1) (Refresh) FirstPrevNext

Best Job ! Thanks :) igetorix 7:52 24 Nov '07   I also worked to make an async TreeView Control because .NET is slow with database compared with Visual Foxpro. You do that very straight ! Good Job, Thanks . Sign In·View Thread·PermaLink

Last Visit: Thursday, January 8, 2009 5:16 PM     Last Update:Thursday, January 8, 2009 5:16 PM