示例#1
0
        public void Cmd_Prepare_Tree_Data()
        {
            try
            {
                LocalData.My_MaxLevel     = LocalData.dynamic_List.Max(x => x.Tree_Level);
                LocalData.My_MinLevel     = LocalData.dynamic_List.Min(x => x.Tree_Level);
                LocalData.My_Levels_Count = LocalData.My_MaxLevel - LocalData.My_MinLevel + 1;

                int k = 0;

                foreach (TreeItem item in LocalData.dynamic_List.OrderBy(x => x.Tree_SequenceNumber))
                {
                    k++;
                    item.Tree_SequenceNumber = (double)k;

                    item.Tree_Level             = item.Tree_Level - LocalData.My_MinLevel + 1;
                    item.Tree_IsLastItemInLevel = LocalTreeFunctions.Cmd_Check_If_Item_Is_Last_In_This_Level(item.Tree_ID);
                    item.Tree_IsVisible         = true;
                    item.Tree_IsExpanded        = true;
                    item.Tree_HasChildren       = LocalData.dynamic_List.Any(x => x.Tree_ParentID == item.Tree_ID);
                }



                //LocalData.dynamic_List.Single(x => x.Tree_ID == 5).Tree_IsExpanded = false;
                //LocalData.dynamic_List.Single(x => x.Tree_ID == 6).Tree_IsVisible = false;
                //LocalData.dynamic_List.Single(x => x.Tree_ID == 7).Tree_IsVisible = false;
            }
            catch (Exception ex)
            {
                Console.WriteLine(ex.ToString(), MethodBase.GetCurrentMethod());
                //LocalFunctions.Display_Message(ex.ToString(), MethodBase.GetCurrentMethod());
            }
        }
示例#2
0
        private void Cmd_Button_Click()
        {
            if (LocalData.Current_Tree_ID > 0)
            {
                if (LocalData.dynamic_List.Any(x => x.Tree_ID == LocalData.Current_Tree_ID))
                {
                    if (!LocalData.dynamic_List.Any(x => x.Tree_ParentID == LocalData.Current_Tree_ID))
                    {
                        LocalData.dynamic_List.Remove(LocalData.dynamic_List.Single(x => x.Tree_ID == LocalData.Current_Tree_ID));
                        LocalData.Current_Tree_ID = 0;


                        int k = 0;
                        foreach (TreeItem item in LocalData.dynamic_List.OrderBy(x => x.Tree_SequenceNumber))
                        {
                            k++;
                            item.Tree_SequenceNumber    = (double)k;
                            item.Tree_IsLastItemInLevel = LocalTreeFunctions.Cmd_Check_If_Item_Is_Last_In_This_Level(item.Tree_ID);
                            item.Tree_HasChildren       = LocalData.dynamic_List.Any(x => x.Tree_ParentID == item.Tree_ID);
                        }
                    }
                    else
                    {
                        jsRuntime.InvokeVoidAsync("alert", "Parent node can't be deleted!");
                    }
                }
            }

            update();

            //int Par_ID = 1;


            //TreeItem Curr_Item = LocalData.dynamic_List.Single(x => x.Tree_ID == Par_ID);
            //if (Curr_Item.Tree_HasChildren)
            //{

            //    Curr_Item.Tree_IsExpanded = !Curr_Item.Tree_IsExpanded;

            //    LocalTreeFunctions.Cmd_ChangeVisibility(Curr_Item.Tree_ID, Curr_Item.Tree_IsExpanded, true);


            //}

            //update();
        }