victorknox / friend-book Goto Github PK

it should contain parameters like
name
gender
age
city
country
Fav hobby
CF rating
Organization(school/company etc)
Unique ID

Followers list struct
Following list struct

minumum required functions:
empty( ) – Returns whether the queue is empty. (bool)
front( ) function returns a reference to the first element of the queue. back() function returns a reference to the last element of the queue.
push( g) and pop( ) – push() function adds the element ‘g’ at the end of the queue. pop() function deletes the first element of the queue.

printf("Enter your country: ");
newUser->country = (char *)malloc(sizeof(char *));
scanf(" %[^\n]%*c", newUser->country);

This doesn't look right. Need to review.

It should create a struct and take in all the parameters of the user and assign them a USER ID (using the algo below)
It should have
A dynamic array/vector storing positive integers 1 to n

1. pushback into the vector if a new user registers and the minheap/priority queue is empty
2. push it into the minheap/priority queue if a user unregisters and call unregister( ) (not a part of this file)

We directly free the user struct when unregistering but the strings like name, organisation, etc are dynamically allocated and must be freed before freeing the struct itself to avoid memory leaks.

If a user unregisters, they should be removed from everyone's friend's lists(following):
create a "followers" list which is the anti graph of "following" graph
When a user unregisters, traverse through the "followers" list, go to each user's "following" list and delete the user who unregistered.

We are not currently updating the size of the user_list. We should do so by calling the resize_user_array function every time a new user registers. This cannot be done directly as resize_user_array depends on the variable largest_user_ID but we are not updating the value of largest_user_ID in the code currently.