// table lookup for COP4020 Fall 2000
#include <iostream.h>
#include <fstream.h>
#include <string.h>

#define max_items 100
#define data "parts.dat"

typedef struct {
  char part[7];
  float price;
  int onHand;
  } part_rec;

void inline read_rec(ifstream& f, part_rec& p) {
f >> p.part >> p.price >> p.onHand;
}

int search(char part[], part_rec V[], int n) {
int i;
for (i=0;i<n;i++)
   if (strcmp(V[i].part,part)==0) return i;
return -1;
}

main() {
int inx, qty, n_parts=0;
char part[7];
part_rec parts[max_items];
ifstream infile;

infile.open(data);
if (!infile.good()) { cout << "file not found!!!\n"; return 1; }
while (infile.good() && n_parts<max_items)
  read_rec(infile,parts[n_parts++]);
infile.close();
if (n_parts<1) { cout << "No data in file!!\n"; return 2; }

do {
  cout << "part? qty? : ";
  cin >> part;
  if (strcmp(part,"q")==0) break;
  cin >> qty;
  inx = search(part,parts,n_parts);
  if (inx<0) { cout << " Part not found!!\n"; continue; }
  cout << parts[inx].onHand << " on hand\n";
  if (qty>parts[inx].onHand) {
    cout << "Not enough parts on hand.\n";
    continue;
    }
  parts[inx].onHand-=qty;
  cout << qty << " of " << part << " from stock\n";
  } while (1);

return 0;
}