You cannot select more than 25 topics
			Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
		
		
		
		
		
			
		
			
				
	
	
		
			349 lines
		
	
	
		
			9.3 KiB
		
	
	
	
		
			C#
		
	
			
		
		
	
	
			349 lines
		
	
	
		
			9.3 KiB
		
	
	
	
		
			C#
		
	
| using System;
 | |
| using System.Collections.Generic;
 | |
| 
 | |
| namespace FairyGUI
 | |
| {
 | |
|     /// <summary>
 | |
|     /// 
 | |
|     /// </summary>
 | |
|     [Obsolete("Use GTree and GTreeNode instead")]
 | |
|     public class TreeNode
 | |
|     {
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         public object data;
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         public TreeNode parent { get; private set; }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         public TreeView tree { get; private set; }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         public GComponent cell { get; internal set; }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         public int level { get; private set; }
 | |
| 
 | |
|         private List<TreeNode> _children;
 | |
|         private bool _expanded;
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         /// <param name="hasChild"></param>
 | |
|         public TreeNode(bool hasChild)
 | |
|         {
 | |
|             if (hasChild)
 | |
|                 _children = new List<TreeNode>();
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         public bool expanded
 | |
|         {
 | |
|             get
 | |
|             {
 | |
|                 return _expanded;
 | |
|             }
 | |
| 
 | |
|             set
 | |
|             {
 | |
|                 if (_children == null)
 | |
|                     return;
 | |
| 
 | |
|                 if (_expanded != value)
 | |
|                 {
 | |
|                     _expanded = value;
 | |
|                     if (tree != null)
 | |
|                     {
 | |
|                         if (_expanded)
 | |
|                             tree.AfterExpanded(this);
 | |
|                         else
 | |
|                             tree.AfterCollapsed(this);
 | |
|                     }
 | |
|                 }
 | |
|             }
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         public bool isFolder
 | |
|         {
 | |
|             get { return _children != null; }
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         public string text
 | |
|         {
 | |
|             get
 | |
|             {
 | |
|                 if (cell != null)
 | |
|                     return cell.text;
 | |
|                 else
 | |
|                     return null;
 | |
|             }
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         /// <param name="child"></param>
 | |
|         /// <returns></returns>
 | |
|         public TreeNode AddChild(TreeNode child)
 | |
|         {
 | |
|             AddChildAt(child, _children.Count);
 | |
|             return child;
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         /// <param name="child"></param>
 | |
|         /// <param name="index"></param>
 | |
|         /// <returns></returns>
 | |
|         public TreeNode AddChildAt(TreeNode child, int index)
 | |
|         {
 | |
|             if (child == null)
 | |
|                 throw new Exception("child is null");
 | |
| 
 | |
|             int numChildren = _children.Count;
 | |
| 
 | |
|             if (index >= 0 && index <= numChildren)
 | |
|             {
 | |
|                 if (child.parent == this)
 | |
|                 {
 | |
|                     SetChildIndex(child, index);
 | |
|                 }
 | |
|                 else
 | |
|                 {
 | |
|                     if (child.parent != null)
 | |
|                         child.parent.RemoveChild(child);
 | |
| 
 | |
|                     int cnt = _children.Count;
 | |
|                     if (index == cnt)
 | |
|                         _children.Add(child);
 | |
|                     else
 | |
|                         _children.Insert(index, child);
 | |
| 
 | |
|                     child.parent = this;
 | |
|                     child.level = this.level + 1;
 | |
|                     child.SetTree(this.tree);
 | |
|                     if (this.cell != null && this.cell.parent != null && _expanded)
 | |
|                         tree.AfterInserted(child);
 | |
|                 }
 | |
| 
 | |
|                 return child;
 | |
|             }
 | |
|             else
 | |
|             {
 | |
|                 throw new Exception("Invalid child index");
 | |
|             }
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         /// <param name="child"></param>
 | |
|         /// <returns></returns>
 | |
|         public TreeNode RemoveChild(TreeNode child)
 | |
|         {
 | |
|             int childIndex = _children.IndexOf(child);
 | |
|             if (childIndex != -1)
 | |
|             {
 | |
|                 RemoveChildAt(childIndex);
 | |
|             }
 | |
|             return child;
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         /// <param name="index"></param>
 | |
|         /// <returns></returns>
 | |
|         public TreeNode RemoveChildAt(int index)
 | |
|         {
 | |
|             if (index >= 0 && index < numChildren)
 | |
|             {
 | |
|                 TreeNode child = _children[index];
 | |
|                 _children.RemoveAt(index);
 | |
| 
 | |
|                 child.parent = null;
 | |
|                 if (tree != null)
 | |
|                 {
 | |
|                     child.SetTree(null);
 | |
|                     tree.AfterRemoved(child);
 | |
|                 }
 | |
| 
 | |
|                 return child;
 | |
|             }
 | |
|             else
 | |
|             {
 | |
|                 throw new Exception("Invalid child index");
 | |
|             }
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         /// <param name="beginIndex"></param>
 | |
|         /// <param name="endIndex"></param>
 | |
|         public void RemoveChildren(int beginIndex = 0, int endIndex = -1)
 | |
|         {
 | |
|             if (endIndex < 0 || endIndex >= numChildren)
 | |
|                 endIndex = numChildren - 1;
 | |
| 
 | |
|             for (int i = beginIndex; i <= endIndex; ++i)
 | |
|                 RemoveChildAt(beginIndex);
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         /// <param name="index"></param>
 | |
|         /// <returns></returns>
 | |
|         public TreeNode GetChildAt(int index)
 | |
|         {
 | |
|             if (index >= 0 && index < numChildren)
 | |
|                 return _children[index];
 | |
|             else
 | |
|                 throw new Exception("Invalid child index");
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         /// <param name="child"></param>
 | |
|         /// <returns></returns>
 | |
|         public int GetChildIndex(TreeNode child)
 | |
|         {
 | |
|             return _children.IndexOf(child);
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         /// <returns></returns>
 | |
|         public TreeNode GetPrevSibling()
 | |
|         {
 | |
|             if (parent == null)
 | |
|                 return null;
 | |
| 
 | |
|             int i = parent._children.IndexOf(this);
 | |
|             if (i <= 0)
 | |
|                 return null;
 | |
| 
 | |
|             return parent._children[i - 1];
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         /// <returns></returns>
 | |
|         public TreeNode GetNextSibling()
 | |
|         {
 | |
|             if (parent == null)
 | |
|                 return null;
 | |
| 
 | |
|             int i = parent._children.IndexOf(this);
 | |
|             if (i < 0 || i >= parent._children.Count - 1)
 | |
|                 return null;
 | |
| 
 | |
|             return parent._children[i + 1];
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         /// <param name="child"></param>
 | |
|         /// <param name="index"></param>
 | |
|         public void SetChildIndex(TreeNode child, int index)
 | |
|         {
 | |
|             int oldIndex = _children.IndexOf(child);
 | |
|             if (oldIndex == -1)
 | |
|                 throw new Exception("Not a child of this container");
 | |
| 
 | |
|             int cnt = _children.Count;
 | |
|             if (index < 0)
 | |
|                 index = 0;
 | |
|             else if (index > cnt)
 | |
|                 index = cnt;
 | |
| 
 | |
|             if (oldIndex == index)
 | |
|                 return;
 | |
| 
 | |
|             _children.RemoveAt(oldIndex);
 | |
|             _children.Insert(index, child);
 | |
|             if (this.cell != null && this.cell.parent != null && _expanded)
 | |
|                 tree.AfterMoved(child);
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         /// <param name="child1"></param>
 | |
|         /// <param name="child2"></param>
 | |
|         public void SwapChildren(TreeNode child1, TreeNode child2)
 | |
|         {
 | |
|             int index1 = _children.IndexOf(child1);
 | |
|             int index2 = _children.IndexOf(child2);
 | |
|             if (index1 == -1 || index2 == -1)
 | |
|                 throw new Exception("Not a child of this container");
 | |
|             SwapChildrenAt(index1, index2);
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         /// <param name="index1"></param>
 | |
|         /// <param name="index2"></param>
 | |
|         public void SwapChildrenAt(int index1, int index2)
 | |
|         {
 | |
|             TreeNode child1 = _children[index1];
 | |
|             TreeNode child2 = _children[index2];
 | |
| 
 | |
|             SetChildIndex(child1, index2);
 | |
|             SetChildIndex(child2, index1);
 | |
|         }
 | |
| 
 | |
|         /// <summary>
 | |
|         /// 
 | |
|         /// </summary>
 | |
|         public int numChildren
 | |
|         {
 | |
|             get { return (null == _children) ? 0 : _children.Count; }
 | |
|         }
 | |
| 
 | |
|         internal void SetTree(TreeView value)
 | |
|         {
 | |
|             tree = value;
 | |
|             if (tree != null && tree.treeNodeWillExpand != null && _expanded)
 | |
|                 tree.treeNodeWillExpand(this, true);
 | |
| 
 | |
|             if (_children != null)
 | |
|             {
 | |
|                 int cnt = _children.Count;
 | |
|                 for (int i = 0; i < cnt; i++)
 | |
|                 {
 | |
|                     TreeNode node = _children[i];
 | |
|                     node.level = level + 1;
 | |
|                     node.SetTree(value);
 | |
|                 }
 | |
|             }
 | |
|         }
 | |
|     }
 | |
| }
 |