コード例 #1
0
        /// <summary>
        ///
        /// </summary>
        /// <param name="node"></param>
        /// <returns></returns>
        int GetInsertIndexForNode(TreeNode node)
        {
            TreeNode prevNode = node.GetPrevSibling();

            if (prevNode == null)
            {
                prevNode = node.parent;
            }
            int insertIndex = list.GetChildIndex(prevNode.cell) + 1;
            int myLevel     = node.level;
            int cnt         = list.numChildren;

            for (int i = insertIndex; i < cnt; i++)
            {
                TreeNode testNode = (TreeNode)list.GetChildAt(i).data;
                if (testNode.level <= myLevel)
                {
                    break;
                }

                insertIndex++;
            }

            return(insertIndex);
        }
コード例 #2
0
 static public int GetPrevSibling(IntPtr l)
 {
     try {
         FairyGUI.TreeNode self = (FairyGUI.TreeNode)checkSelf(l);
         var ret = self.GetPrevSibling();
         pushValue(l, true);
         pushValue(l, ret);
         return(2);
     }
     catch (Exception e) {
         return(error(l, e));
     }
 }
コード例 #3
0
 static int GetPrevSibling(IntPtr L)
 {
     try
     {
         ToLua.CheckArgsCount(L, 1);
         FairyGUI.TreeNode obj = (FairyGUI.TreeNode)ToLua.CheckObject(L, 1, typeof(FairyGUI.TreeNode));
         FairyGUI.TreeNode o   = obj.GetPrevSibling();
         ToLua.PushObject(L, o);
         return(1);
     }
     catch (Exception e)
     {
         return(LuaDLL.toluaL_exception(L, e));
     }
 }
コード例 #4
0
ファイル: TreeView.cs プロジェクト: fairygui/FairyGUI-unity
        /// <summary>
        /// 
        /// </summary>
        /// <param name="node"></param>
        /// <returns></returns>
        int GetInsertIndexForNode(TreeNode node)
        {
            TreeNode prevNode = node.GetPrevSibling();
            if (prevNode == null)
                prevNode = node.parent;
            int insertIndex = list.GetChildIndex(prevNode.cell) + 1;
            int myLevel = node.level;
            int cnt = list.numChildren;
            for (int i = insertIndex; i < cnt; i++)
            {
                TreeNode testNode = (TreeNode)list.GetChildAt(i).data;
                if (testNode.level <= myLevel)
                    break;

                insertIndex++;
            }

            return insertIndex;
        }