public void CmdPrepareData() { try { LocalData.MaxLevel = LocalData.dynamicList.Max(x => x.Level); LocalData.MinLevel = LocalData.dynamicList.Min(x => x.Level); LocalData.LevelsCount = LocalData.MaxLevel - LocalData.MinLevel + 1; int k = 0; foreach (TreeItem item in LocalData.dynamicList.OrderBy(x => x.SequenceNumber)) { k++; item.SequenceNumber = (double)k; item.Level = item.Level - LocalData.MinLevel + 1; item.IsLastItemInLevel = LocalTreeFunctions.CmdCheckIfItemIsLastInThisLevel(item.ID); item.IsVisible = true; item.IsExpanded = true; item.HasChildren = LocalData.dynamicList.Any(x => x.ParentID == item.ID); } //LocalData.dynamicList.Single(x => x.ID == 5).IsExpanded = false; //LocalData.dynamicList.Single(x => x.ID == 6).IsVisible = false; //LocalData.dynamicList.Single(x => x.ID == 7).IsVisible = false; } catch (Exception ex) { Console.WriteLine(ex.ToString(), MethodBase.GetCurrentMethod()); //LocalFunctions.DisplayMessage(ex.ToString(), MethodBase.GetCurrentMethod()); } }
public void CmdPrepareData() { try { LocalData.MaxLevel = SourceList.Max(x => x.Level); LocalData.MinLevel = SourceList.Min(x => x.Level); LocalData.LevelsCount = LocalData.MaxLevel - LocalData.MinLevel + 1; int k = 0; foreach (TreeItem item in SourceList.OrderBy(x => x.SequenceNumber)) { k++; item.SequenceNumber = (double)k; item.Level = item.Level - LocalData.MinLevel + 1; item.IsLastItemInLevel = LocalTreeFunctions.CmdCheckIfItemIsLastInThisLevel(SourceList, item.ID); item.IsVisible = true; item.IsExpanded = true; item.HasChildren = SourceList.Any(x => x.ParentID == item.ID); } } catch (Exception ex) { LocalTreeFunctions.PrintError(ex.Message, MethodBase.GetCurrentMethod()); } }
public void CmdDeleteSelected() { if (CurrentID > 0) { if (SourceList.Any(x => x.ID == CurrentID)) { if (!SourceList.Any(x => x.ParentID == CurrentID)) { SourceList.Remove(SourceList.Single(x => x.ID == CurrentID)); CurrentID = 0; int k = 0; foreach (TreeItem item in SourceList.OrderBy(x => x.SequenceNumber)) { k++; item.SequenceNumber = (double)k; item.IsLastItemInLevel = LocalTreeFunctions.CmdCheckIfItemIsLastInThisLevel(SourceList, item.ID); item.HasChildren = SourceList.Any(x => x.ParentID == item.ID); } } else { jsRuntime.InvokeVoidAsync("alert", "Parent node can't be deleted!"); } } } StateHasChanged(); }
public void CmdDeleteSelected() { if (LocalData.CurrentID > 0) { if (LocalData.dynamicList.Any(x => x.ID == LocalData.CurrentID)) { if (!LocalData.dynamicList.Any(x => x.ParentID == LocalData.CurrentID)) { LocalData.dynamicList.Remove(LocalData.dynamicList.Single(x => x.ID == LocalData.CurrentID)); LocalData.CurrentID = 0; int k = 0; foreach (TreeItem item in LocalData.dynamicList.OrderBy(x => x.SequenceNumber)) { k++; item.SequenceNumber = (double)k; item.IsLastItemInLevel = LocalTreeFunctions.CmdCheckIfItemIsLastInThisLevel(item.ID); item.HasChildren = LocalData.dynamicList.Any(x => x.ParentID == item.ID); } } else { jsRuntime.InvokeVoidAsync("alert", "Parent node can't be deleted!"); } } } update(); //int ParID = 1; //TreeItem CurrItem = LocalData.dynamicList.Single(x => x.ID == ParID); //if (CurrItem.HasChildren) //{ // CurrItem.IsExpanded = !CurrItem.IsExpanded; // LocalTreeFunctions.CmdChangeVisibility(CurrItem.ID, CurrItem.IsExpanded, true); //} //update(); }