-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlist.h
More file actions
111 lines (94 loc) · 2.13 KB
/
list.h
File metadata and controls
111 lines (94 loc) · 2.13 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
struct node{
char *username;
char *password;
struct node *next;
};
struct node *head = NULL;
//head->username = "Ramapo";
//head->password = "123";
struct node *CreateNode(char *name, char *pass){
struct node *newnode = (struct node *)malloc(sizeof(struct node));
newnode->username = name;
newnode->password = pass;
newnode->next = NULL;
return newnode;
}
void AddNode(char *name, char *pass){
if(head == NULL){
head = CreateNode(name, pass);
return;
}
else{
struct node *temp = head;
while(temp->next != NULL){
temp = temp->next;
}
temp->next = CreateNode(name, pass);
}
}
void FindNode(char *name){
struct node *temp = head;
if(head == NULL){
printf("Empty List.\n");
}
while(temp->next!=NULL){
if(strcmp(temp->username, name) == 0){
printf("Pass: %s\n", temp->password);
return;
}
}
printf("Username does not exist\n");
}
void Print(){
struct node *temp = head;
while(temp->next != NULL){
printf("Username: %s\nPassword: %s\n\n", temp->username, temp->password);
temp = temp->next;
}
printf("Username: %s\nPassword: %s\n\n", temp->username, temp->password);
return;
}
void RemoveAll(){
struct node *temp = head;
struct node *tempPrev = temp;
while(temp->next != NULL){
temp = temp->next;
free(tempPrev);
tempPrev = temp;
}
free(temp);
}
void RemoveOne(char *name){
struct node *temp = head;
struct node *tempPrev = temp;
while(temp->next != NULL){
if(strcmp(temp->username, name) == 0){
printf("Removing: %s\n\n", name);
// printf("tempPrev->username: %s\n", tempPrev->username);
tempPrev->next = temp->next;
// printf("tempPrev->username: %s\n", tempPrev->username);
// printf("tempPrev->next->username: %s\n\n", tempPrev->next->username);
free(temp);
return;
}
else{
tempPrev = temp;
temp = temp->next;
//tempPrev = temp;
}
}
}
/*int main(){
AddNode("Ramapo", "123");
AddNode("Rutgers", "client1");
AddNode("TCNJ", "client2");
AddNode("Princeton", "client3");
Print();
RemoveOne("TCNJ");
Print();
RemoveAll();
}*/