Alright, for this assignment there is quite a lot of tasks to go through, so I’m going to go over the assignment task-by-task.
Task 1: Easy enough, no real coding to be done here, just initializing certain git elements. I have also found that my IDE, IntelliJ, has quite a bit of git functionality built in, which is very convenient. Of course, I’m also going to go through the manual git commands and such, to learn, but afterwards I’m going to see about learning how to use git with my IDE as a way to speed some things up.
Task 2: Task 2 simply involves creating another class, this one being a ‘Player’ class and giving it some data, and then testing that data in Main. This was also very simple and was quickly pushed onto git.
Task 3: Task 3 had us create a very simply linklist class, that allowed you to chain a bunch of nodes together to hold some kind of data. This was very simple to do, and I used a while loop and another method to test the linked list in main.
Task 4: This task literally just required me to copy and paste a big chunk of code from the assignment page into my own project, so it was very simple. The hardest part was trying to figure out what I’m supposed to use all the data in the PlayerData class for.
Task 5: Alright Task 5 asks me to delete Player.java, so I did.
Task 6: Well that was a huge pain, for some reason trying to revert completely borked my project, and I had to troubleshoot for like 10 minutes to get back on track, but I’ve done it, the Player.java file is back, and through a git revert nonetheless.
Task 7: Task 7 was easy enough, although I will say that I was kind of annoyed at the vagueness behind some of the tasks here. Like I wasn’t exactly sure what the point of the playerData was exactly, and I’m just kind of using it for what I think it is.
Task 8: This task had us add an ‘initializeList()’ method to Player.java, which was pretty simply, it just involved having a while loop and using the addPlayer() until it filled out the list.
Task 9: This task wanted us to create a ‘findMaxWeight()’ method, which required a runner to run through the linked list, in order to access all of the data.
Task 10: This is where we initialized a new branch in git, that being ‘doubleLink’ where we can push changes without affecting main
Task 11: This task wanted me to refactor SeLinkList in my branch to act as a doubly link-list, this was relatively simple, but I’m pretty sure I have a very janky indexing situation going on
Task 12: This asked me to add a removeNode method, to Player.java, this was probably the most complicated method so far in this assignment, but it still wasn’t too bad, I had to make a helper method to help with indexing.
Task 13: This made me go back to main, and add a findMinWeight method to Player.java, along with refactoring findMaxWeight a little bit, so that it does something slightly different.
Task 14: This task required me to create a findMinMaxWeight method, which used basically the same idea from the first two weight methods, but in this case you had to do both tasks in one walk of the list, which was easy enough
Task 15: Now we merge back onto main, I accidently merged main onto my branch first, so whoops, but either way it was fine, since resolving the conflicts and then merging my branch onto main worked fine.
Task 16: This just required me to Demo the final code, which required a little finagling since I forgot to initialize the list, honestly to make the code a bit better I’d make initializing the list as a part of the constructor, since in this case we’re not using any other data except the data we received as a part of the assignment.
DONE: With that, the assignment is complete, it was pretty interesting and learning git was very helpful, IntelliJ is also pretty good for simplifying some git procedures. Other than that I can’t really think of anything very impactful that I experienced during this assignment.