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 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285
|
#include "stdafx.h"
#include <iostream>
#include <fstream>
#include <iomanip>
#include <string>
#include <algorithm>
using namespace std;
// global constants
const int MAX_CUSTOMERS = 1000;
int maxStringSize = 8;
int maxTempSize = 3;
const int NOT_FOUND = -1;
// function prototypes
bool OpenAndValidateInputFile (ifstream& textIn);
void ReadAndStoreInputFile (ifstream& textIn, string Customer[], double Charge[], int& counter);
void SelectionSort (string Customer[], double Charge [], int counter);
bool OpenAndValidateOutputFile (ofstream& textOut);
void WriteToOutputFile (ofstream& textOut, string Customer [], double Charge [], int counter);
void DisplayChargesForCustomers (ofstream& textOut, int counter, string Customer [], string userCustomerCode);
bool GetUserInput (string &userCustomerCode);
string ValidateCustomerCode (string& userCustomerCode, int counter, string Customer []);
void BinarySearchForCustomerCode (string userCustomerCode, int counter, string Customer []);
int main()
{
// local variables
ifstream textIn; // input file stream variable
ofstream textOut;
string Customer [MAX_CUSTOMERS];
double Charge [MAX_CUSTOMERS];
int counter = 0;
string userCustomerCode;
if (OpenAndValidateInputFile (textIn))
{
ReadAndStoreInputFile (textIn, Customer, Charge, counter);
SelectionSort (Customer, Charge, counter);
if (OpenAndValidateOutputFile (textOut))
{
WriteToOutputFile (textOut, Customer, Charge, counter);
}
else
{
return 1;
}
DisplayChargesForCustomers (textOut, counter, Customer, userCustomerCode);
ValidateCustomerCode (userCustomerCode, counter, Customer);
BinarySearchForCustomerCode (userCustomerCode, counter, Customer);
system ("PAUSE");
return 0;
}
else
{
return 1;
}
// CLOSE FILE!!!!!!
}
bool OpenAndValidateInputFile (ifstream& textIn)
{
// open input file
textIn.open ("CUSTOMERS.TXT");
// check if file opens successfully
// if not, print a warning and exit program from main with a return code 1
if (!textIn.is_open ())
{
return false;
}
else
{
return true;
}
}// end OpenAndValidateInputFile
void ReadAndStoreInputFile (ifstream& textIn, string Customer[], double Charge[], int& counter)
{
string customerCode; // customer ID code - unique 4 capital letters followed by 4 digits
double utilityCharge = 0; // utility charge per unit
// while file is still readable, and peek does not find end-of-file
while (textIn.good () && textIn.peek () != EOF)
{
// read in data from CUSTOMERS.TXT
textIn >> customerCode;
textIn >> utilityCharge;
// if the file contains too many lines of data, stop reading data and issue warning
if (counter >= MAX_CUSTOMERS)
{
cout << "Error: file contains too many lines of data" << endl;
}
else
{
Customer [counter] = customerCode;
Charge [counter] = utilityCharge;
counter++;
}
// read newline
textIn.get ();
}
}// end ReadAndStoreInputFile
void SelectionSort (string Customer [], double Charge [], int counter)
{
// local variables
int i; // integer place holder i
int j; // integer place holder j
int max; // place holder for highest letter found for sort
// setting parameter for i
for (i = 0; i < counter - 1; i++)
{
max = i;
// setting parameter for j
for (j = i + 1; j < counter; j++)
{
// searching through array, and replacing lower value higher value if found
if (Customer [j] > Customer [max])
{
max = j;
}
}
if ( max != i )
{
string tempString = Customer[i];
Customer[i] = Customer[max];
Customer[max] = tempString;
// aligning Charge [] with Customer []
double tempDouble = Charge[i];
Charge[i] = Charge[max];
Charge[max] = tempDouble;
}
}
} // end SelectionSort
bool OpenAndValidateOutputFile (ofstream& textOut)
{
// open input file
textOut.open ("SORTED.TXT");
// check if file opens successfully
// if not, print a warning and exit program from main with a return code 1
if (!textOut.is_open ())
{
return false;
}
else
{
return true;
}
}// end OpenAndValidateOutputFile
void WriteToOutputFile (ofstream& textOut, string Customer [], double Charge [], int counter)
{
// write each instance to output file for Customer [] and Charge []
for (int i = 0; i < counter; i++)
{
textOut << Customer [i] << showpoint << fixed << setprecision (2) << setw (8) << Charge [i] << endl;
}
}// end WriteToOutputFile
void DisplayChargesForCustomers (ofstream& textOut, int counter, string Customer [], string userCustomerCode)
{
cout << "CUSTOMER CODES on file are: " << endl << endl;
for (int i = 0, lines = 0; i < counter; ++i)
{
cout << setw (11) << Customer [i];
if (++lines > 5)
{
lines = 0;
cout << endl;
}
}
cout << endl << endl;
while (GetUserInput (userCustomerCode))
{
ValidateCustomerCode (userCustomerCode, counter, Customer);
BinarySearchForCustomerCode (userCustomerCode, counter, Customer);
}
}// end DisplayChargesForCustomers
bool GetUserInput (string &userCustomerCode)
{
cout << "Enter a customer code (or E to exit): ";
return (cin >> userCustomerCode && userCustomerCode != "E" && userCustomerCode != "e");
}// end GetUserInput
string ValidateCustomerCode (string& userCustomerCode, int counter, string Customer [])
{
// local variables
string tempA;
string tempB;
cout << endl;
tempA = userCustomerCode.substr (0, 4);
tempB = userCustomerCode.substr (4, 4);
if (userCustomerCode.length () != maxStringSize)
{
cout << "Invalid Entry! Customer code " << userCustomerCode << " is too long." << endl;
cout << "Must be 4 letters followed by 4 digits. Try again." << endl;
}
else if (!isalpha (tempA [maxTempSize]))
{
cout << "Invalid Entry! Customer Code " << userCustomerCode << " is formatted incorrectly." << endl;
cout << "Must be 4 letters followed by 4 digits. Try again." << endl;
}
for (unsigned int i = 0; i < tempB.length (); i++)
{
if (!isdigit (tempB [i]))
{
cout << "Invalid Entry! Customer Code " << userCustomerCode << " is formatted incorrectly." << endl;
cout << "Must be 4 letters followed by 4 digits. Try again." << endl;
}
}
for (unsigned int i = 0; i < tempA.length (); i++)
{
tempA [i] = toupper (tempA [i]);
}
return userCustomerCode = tempA + tempB;
}// end ValidateCustomerCode
void BinarySearchForCustomerCode (string userCustomerCode, int counter, string Customer [])
{
int position;
int comparisonCount = 1;
int low = 0;
int high = counter -1;
position = (low + high) / 2;
while ((Customer [position] != userCustomerCode) && (low <= high))
{
comparisonCount++;
if (Customer [position] > userCustomerCode)
{
high = position - 1;
}
else
{
low = position + 1;
}
position = (low + high) / 2;
}
if (low <= high)
{
cout << position << endl;
}
else
{
cout << "Not found" << endl;
}
}
|