Cant figure out where my logic is going wrong when trying to add a node to the front of the linked list. The progarm is allowing for dual inputs and repeats nodes. Be looking at the logic for a while now and keep seem to nail down where I am going wrong. The issue must be simple, and im over looking it. Seems to keep adding it to the same linked_list instead of each users different list Inputs that cause the are are P Sam P Liza P Mark P Amy F Liza Amy F liza Mark F Amy Sam
After executing that the issue is really clear
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <cstring>
using namespace std;
void menu_function(void);
void command_execute( string command, string name1, string name2);
int hash_function(string str);
void insert_into_hashtable( int ascii_total, string name);
void add_friendship( int ascii_key, string name );
void print_friendships( int aascii_key);
void check_friendship( int ascii_key, string name);
void remove_friendship( int ascii_key, string name );
#define SIZE 150
struct friend_list
{
string name;
struct friend_list* next;
};
typedef struct friend_list list;
struct user{
string name;
int key;
friend_list* FriendList;
};
struct user* hashArray[SIZE];
int main(int argc, const char * argv[]) {
menu_function();
return 0;
}
void menu_function(){
char user_input[100];//this could limit the size of input
string command;
string name1 = "\0";
string name2 = "\0";;
char* token;
int inputsize = 100;
int i = 0;
char delimit[]=" \t\r\n\v\f";
while( 1 )
{
printf("\nP <Name> to create a person\n");
printf("F <Name> <Name> record friendship\n");
printf("U <Name> <Name> terminate friendship\n");
printf("L <Name> print out friends of a specified person\n");
printf("Q <Name> <Name> check friendship status of two people\n");
printf("X - terminate the progarm\n");
// Determine user input and
fgets(user_input, inputsize, stdin);
//getline(&input, &inputsize, stdin);//takes in user input;
//parsing e string for the data within
token = strtok( user_input, delimit);
i = 0;
while( token != NULL ){
if(i == 0)
{
command = token;
//cout<< command<<endl;
}
if(i == 1)
{
name1 = token;
// cout<< name1<<":"<<endl;
}
if( i == 2 )
{
name2 = token;
// cout<< name2<<":"<<endl;
name1 = name1 + "\n";
}
token = strtok( NULL, " " );
i++;
}
command_execute( command, name1, name2);
command = '\0';
name1 = '\0';
name2 = '\0';
}
}
void command_execute( string command, string name1, string name2)
{
//cout<<"command is: "<<command<<endl;
switch( command[0])
{
case 'P': //Create record of the person
insert_into_hashtable( hash_function(name1), name1);
break;
case 'F': //Record friendship
add_friendship(hash_function(name1), name2);
add_friendship(hash_function(name2), name1);
break;
case 'U': //Terminate Friendship
remove_friendship( hash_function(name1), name2);
remove_friendship( hash_function(name2), name1);
break;
case 'L': //Print out the persons Friends
print_friendships( hash_function(name1));
break;
case 'Q': //Check on friendship
check_friendship( hash_function(name1), name2);
break;
case 'X': //Exit the program **** COMPLETED
exit(1);
break;
default:
cout<<"Error occured based on your command please try again"<<endl;
break;
}
}
int hash_function(string string){
//going to use the ASCI value of the name with different weights per array position to hash the names
int ascii_key = 0;
int ascii_total = 0;
// cout<< string.length()<< endl;
//cout<< string<< endl;
for( int i = 0; i < string.length()-1; i++)
{
ascii_total = (int) string[i] * (i*3+1);
// cout<< string[i]<< endl;
}
ascii_key = ascii_total % SIZE;
//deals with colisions through open hashing
/*
while(hashArray[ascii_key] != NULL || hashArray[ascii_key]-> key != ascii_key) { //strcmp(hashArray[ascii_key]->name.c_str(), string.c_str())
//hashArray[ascii_key] != NULL ||
ascii_key++;
}
*/
// ****** decide size of the hash table and then finished hashing function. Usually hash time is gonna be half full
cout<< ascii_key<<endl;
return ascii_key;
}
void insert_into_hashtable( int ascii_key, string name)
{
//get the hash key
user *item = new user;
item->name= name;
item->key = ascii_key;
item->FriendList = NULL;
//cout<< ascii_key<<endl;
//store the user in the table
hashArray[ascii_key] = item;
delete(item);
}
void add_friendship( int ascii_key, string name )
{
//gonna have to check for valid input on users
list* add = new friend_list;
list** temp = &hashArray[ascii_key]->FriendList;
add->name = name;
add->next = NULL;
if( temp == NULL )
{
//cout<<hashArray[ascii_key]->FriendList<<endl;
*temp = add;
}
else
{
add->next = *temp;
*temp = add;
}
print_friendships(ascii_key);
}
void print_friendships( int ascii_key)
{
friend_list* temp = hashArray[ascii_key]->FriendList;
while( temp != NULL )
{
cout<<temp->name<<endl;
if( temp->next == NULL)
{
return;
}
temp = temp->next;
}
}
