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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <stdlib.h>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <cstddef>
#include <string.h>
using namespace std;
const int buff_size = 81; // buffer size of 81 characters
ifstream input_File;
ifstream delete_File;
int i = 0;
char *buffer = new char[buff_size], // Tokenizing pointers
*tokens[3],
*ptr;
int pause; // Global for pause use
//-----------------------------------------------------------------------------
struct listNode // Structure named listNode
{
string age; // Values within nodes
string firstName;
string lastName;
listNode* next;
};
listNode* newNode; // Node pointers
//-----------------------------------------------------------------------------
void reportDuplicate() // prints duplicates
{
cout << "Duplicate Record: " << newNode-> lastName;
cout << " " << newNode-> firstName;
cout << " " << newNode-> age << endl;
}// end void reportDuplicate()
//-----------------------------------------------------------------------------
void incompleteRecord()
{
cout << "Record incomplete: " << tokens[0] << endl;
}// end void incompleteRecord()
//-----------------------------------------------------------------------------
// Possible node activity //
// newNode-> lastName; -value of lastName
// newNode-> firstName; -value of firstName
// newNode-> age; -value of age
// newNode-> next; -pointer to next node
//-----------------------------------------------------------------------------
int main(int argc, char *argv[])
{
if(argc != 2) // Usage statement
{
cout << "\nUsage: " << argv[0] << " 'Input File Name 1'" << endl;
return(0);
}
//--------------------------- ifstreams
ifstream input_File(argv[1], ios::in); // Open input file to read from
if(input_File.is_open())
{
cout << "\nInput File is open..." << endl;
}
else
{
cout << "\nInput File did NOT open..." << endl;
return (1);
}
listNode* head = NULL; // Initialize head pointer
listNode* current = head;
cout << "Tokenizing..." << endl << endl;
while(input_File.getline(buffer, buff_size))
{
// If we found a blank line (newline char in column 1), ignore it and
// continue.
if(strlen(buffer) == 0)
continue;
// ** Windows Machines Only **
// Break the input string into white space separated tokens.
// 3rd parameter needs to be a char**_Context
// Use char* (placeHolder) as a place holder within the string (used in strtok_s)
// Format: ptr = (char *)strtok_s(buffer, " ", &placeHolder);
ptr = (char *)strtok(buffer, " ");
// If ptr == NULL, then other than whitespace, the input line is
// empty.
if(!ptr)
continue;
// Store the tokens in tokens[]
i = 0;
tokens[i] = (char *)_strdup(ptr);
do
{
ptr = (char *)strtok('\0', " ");
if(ptr)
{
tokens[++i] = (char *)_strdup(ptr);
}
}
while(ptr);
// char* tokens[0] contains string lastName
// char* tokens[1] contains string firstName
// char* tokens[2] contains string ages
//-----------------------------------------------------------------------------
// Creates new node and inserts tokenized values
cout << "Inserting: " << tokens[0];
cout << " " << tokens[1];
cout << " " << tokens[2] << endl;
newNode = new listNode;
newNode-> lastName = tokens[0];
newNode-> firstName = tokens[1];
newNode-> age = tokens[2];
newNode-> next = NULL;
listNode* current = head; // set traversal pointer
if(head == NULL) // If no head node, create one
{
head = newNode;
newNode-> next = NULL;
}
else if(head-> lastName > newNode-> lastName)
{
newNode-> next = head;
head = newNode;
cout << "new head node" << endl;
}
else //if(head != NULL)
{
while((current-> next) && (current-> next-> lastName.compare(newNode-> lastName) <= 0)) // Traversal // Not end of list?
{
current = current-> next;
// Found where newNode goes
if(current-> lastName.compare(newNode-> lastName) == 0) //same lastName?
{
if(current-> firstName.compare(newNode-> firstName) == 0) //same firstName?
{
reportDuplicate();
/*if(current-> age.compare(newNode-> age) == 0) //same age?
{
// Reports duplicate and excludes it from the list
reportDuplicate();
}//end if(age == 0)*/
//age order
/*else //if(current-> age.compare(newNode-> age) < 0)
{
newNode-> next = current-> next;
current-> next = newNode;
}*/
}//end if(firstName == 0)
//firstName order
else if(current-> firstName.compare(newNode-> firstName) < 0)
{
newNode-> next = current-> next;
current-> next = newNode;
}
}//end if(lastName == 0)
else if(current-> lastName.compare(newNode-> lastName) < 0) //lastName order
{
newNode-> next = current-> next;
current-> next = newNode;
}
}//end while
}//end else
}//end while(getline)
//-----------------------------------------------------------------------------
cout << "\nDisplaying List" << endl << endl;
current = head;
while(current != NULL)
{
if(current == NULL)
{
cout << "\nEnd of list!" << endl;
}
else
{
cout << current-> lastName;
cout << " " << current-> firstName;
cout << " " << current-> age << endl;
current = current-> next;
}
}// end while
delete(buffer);
//-----------------------------------------------------------------------------
cout << "\nType anything and press Enter to close program: ";
cin >> pause; // Non Windows Pause similar to (system("pause");)
return 0;
}
|
