I want to show Components in a tabs , so first of all create few components. In this project we have three components, First View Component public class AllViewComponent : ViewComponent { private readonly UserManager<ApplicationUser> _userManager; public AllViewComponent(UserManager<ApplicationUser> userManager) { _userManager = userManager; } public async Task<IViewComponentResult> InvokeAsync() { List<StudentViewModel> allUsers = new List<StudentViewModel>(); var items = await _userManager.Users.ToListAsync(); foreach (var item in items) { allUsers.Add(new StudentViewModel {Id=item.Id, EnrollmentNo = item.EnrollmentNo, FatherName = item.FatherName, Name = item.Name, Age = item.Age, Birthdate = item.Birthdate, Address = item.Address, Gender = item.Gender, Email = item.Email }); }
Traversing in Circular Linked List:
To visit all the nodes of a circular linked list, start from the ROOT and visit first element. Then with the help of link field visit the second element, similarly visit all the elements. The last node is recognized by the
ROOT address in its link field. So, set a pointer variable PTR with ROOT. Process PTR-->INFO and update PTR by LINK of PTR i.e. PTR<--PTR-->LINK. Repeat till the PTR-->LINK is equal to ROOT.
The algorithm is as follows:
TRAVERSCLL (ROOT)
PTR<--ROOT
If PTR = NULL Then:
Write: ‘Empty Circular linked list’; Exit.
[End of If]
Repeat While TRUE
Apply process to PTR-->INFO
If PTR-->LINK = ROOT Then:
Break. [To break the infinite loop]
[End of If]
PTR<--PTR-->LINK
[End of while]
Exit.
Algorithm to print the contents of a linked list:
TRAVERELL (ROOT)
PTR<--ROOT
If PTR = NULL Then:
Write: ‘Empty Circular linked list’; Exit.
[End of If]
Repeat While TRUE [infinite loop]
Write: PTR-->INFO
If PTR-->LINK = ROOT Then:
Break. [To break the infinite loop]
[End of If]
PTR<--PTR-->LINK
[End of while]
Exit.
To visit all the nodes of a circular linked list, start from the ROOT and visit first element. Then with the help of link field visit the second element, similarly visit all the elements. The last node is recognized by the
ROOT address in its link field. So, set a pointer variable PTR with ROOT. Process PTR-->INFO and update PTR by LINK of PTR i.e. PTR<--PTR-->LINK. Repeat till the PTR-->LINK is equal to ROOT.
The algorithm is as follows:
TRAVERSCLL (ROOT)
PTR<--ROOT
If PTR = NULL Then:
Write: ‘Empty Circular linked list’; Exit.
[End of If]
Repeat While TRUE
Apply process to PTR-->INFO
If PTR-->LINK = ROOT Then:
Break. [To break the infinite loop]
[End of If]
PTR<--PTR-->LINK
[End of while]
Exit.
Algorithm to print the contents of a linked list:
TRAVERELL (ROOT)
PTR<--ROOT
If PTR = NULL Then:
Write: ‘Empty Circular linked list’; Exit.
[End of If]
Repeat While TRUE [infinite loop]
Write: PTR-->INFO
If PTR-->LINK = ROOT Then:
Break. [To break the infinite loop]
[End of If]
PTR<--PTR-->LINK
[End of while]
Exit.
Comments
Post a Comment