//**************************************
    //     
    // Name: File System Directory Walker (R
    //     ecursive)
    // Description:The method walks a direct
    //     ory structure without recursion. Uses th
    //     e Stack and ArrayList object found in Sy
    //     stem.Collections.
    // By: Danny Campbell
    //
    // Inputs:System.String : path  This is
    //     the path to start searching at and is in
    //     cluded in the return.
    System.Boolean : sort  Turns sorting on and off.
    //
    // Returns:System.String[] : The array o
    //     f fully qualified directory names.
    //
    // Assumes:Have not compared function ca
    //     ll recursion using any miscellaneous ben
    //     chmarks code, just thought it may be a u
    //     seful way of processing.
    JUST DON'T BE TOO HARD ON ME.
    //
    // Side Effects:Very useful to cut back 
    //     on STACK space usage
    //
    //This code is copyrighted and has    // limited warranties.Please see http://
    //     www.Planet-Source-Code.com/vb/scripts/Sh
    //     owCode.asp?txtCodeId=1800&lngWId;=10    //for details.    //**************************************
    //     
    
    /// <summary>
    /// Gets a recursive listing of all fold
    //     ers.
    /// </summary>
    /// <param name="path">The path to
    //     search.</param>
    /// <param name="sort">
    /// True to sort the return array, false
    //     to ignore sorting.
    /// </param>
    /// <returns>The array of director
    //     ies.</returns>
    public string[] GetAllDirectories(string path, bool sort)
    {
    	// Define the return value.
    	string[] strReturnValue = null; 
    	// Define the sizable array.
    	ArrayList arlValues = new ArrayList();
    	// Define the stack.
    	Stack stkDirectories = new Stack();
    try
    {
    	if(path == null || path.Length == 0)
    	{
    		throw new ArgumentNullException("path");
    	}
    	// Validate the path.
    	path = Path.GetFullPath(path);
    	// Place the initial value into the stack.
    	stkDirectories.Push(path);
    	arlValues.Add(path);
    	while(stkDirectories.Count > 0)
    	{
    		string strCurrent = stkDirectories.Pop() as string;
    		string[] strDirs = null;
    		if(strCurrent != null)
    		{
    			try
    			{
    				// Get the listing of directories.
    				strDirs = Directory.GetDirectories(strCurrent);
    			}
    			catch
    			{
    				// Init empty.
    				strDirs = new string[0];
    			}
    			// Iterate the directories.
    			for(int i = 0, j = strDirs.Length; i < j; i++)
    			{
    				string strSubCurrent = strDirs[i];
    				// Place the item into the directory.
    				stkDirectories.Push(strSubCurrent);
    				arlValues.Add(strSubCurrent);
    			}
    		}
    	}//while
    	// Sort the array list.
    	arlValues.Sort();
    	// Define the return value.
    	strReturnValue = new string[arlValues.Count];
    	arlValues.CopyTo(strReturnValue);
    }
    catch(ArgumentNullException aex)
    {
    	throw aex;
    }
    catch(Exception ex)
    {
    	#if DEBUG
    		System.Diagnostics.Debug.WriteLine(new string('-', 50));
    		System.Diagnostics.Debug.WriteLine("Error in: " + ex.TargetSite.Name);
    		System.Diagnostics.Debug.WriteLine(ex.GetType().ToString());
    		System.Diagnostics.Debug.WriteLine(ex.Message);
    		System.Diagnostics.Debug.WriteLine("***" + ex.Source);
    		System.Diagnostics.Debug.WriteLine(new string('-', 50));
    	#endif
    }
    finally
    {
    	// Clear the values array.
    	arlValues.Clear();
    	arlValues = null;
    	// Null stack.
    	stkDirectories = null;
    }
    	// Return the value.
    	return strReturnValue;
    }