#include "stdstuff.h"
#include "CustomerDB.h"

// the constructor creates an empty database
CustomerDB::CustomerDB() {
   numCusts=0; // no customer yet (so nothing goes in the ci array)
}
   
// returns the number of customers in the database
int CustomerDB::getNumCusts() const {
   return numCusts;
}

// add a new customer to the database; returns true if successful, false otherwise
// (database full or customer already exists)
bool CustomerDB::add(const Customer &newCust) {
     
   if(numCusts==MAXCUST) return false; // database is full
   
   for(int i=0;i<numCusts;i++) {  
      // **must** use == method in Customer class     
      if(ci[i]==newCust) return false; // Customer already in database
   }
   
   // insert Customer at end
   ci[numCusts] = newCust;
   
   numCusts++; // we've added a Customer
   return true; // success
}

// remove a customer from the database; returns true if successful, false otherwise (customer
// does not exist)
bool CustomerDB::remove(int id) {
   
   for(int i=0;i<numCusts;i++) {
      if(ci[i].getID()==id) { // found it; **must** use getID
         numCusts--;
         ci[i] = ci[numCusts]; // decrement number of customers and move last one into ith pos'n
         return true; // Customer removed
      }
   }
   
   return false; // Customer does not exist in database
}

// prints the full customer database (or a note if the database is empty); 
// Customers are printed one per two lines, with 2 decimals for the total.
void CustomerDB::print() const {
   
   if(numCusts==0) { // empty database
      cout << "Customer database is empty.\n";
      return;
   }
   
   // otherwise print each Customer (one per line) using Customer's print method
   for(int i=0;i<numCusts;i++) {
      ci[i].print();
   }
}

// change the customer number of an existing customer; returns true if successful, 
// false otherwise (customer does not exist, or new customer number in use)
bool CustomerDB::changeID(int id, int nid) {
      
   for(int i=0;i<numCusts;i++) { // check that new id not being used
      if(ci[i].getID()==nid) return false; // new id already in use (must use getID)
   }
     
   for(int i=0;i<numCusts;i++) {
      if(ci[i].getID()==id) { // found the one we want to change
         ci[i].setID(nid); // change the id, **must** use "setID" method
         return true; // Customer information updated
      }
   }
   
   return false; // Customer does not exist in database
}

// change the customer total of an existing customer; returns true if successful, 
// false otherwise (customer does not exist)
bool CustomerDB::changeTotal(int id, double ntotal) {
     
   for(int i=0;i<numCusts;i++) {
      if(ci[i].getID()==id) { // found the one we want to change so update total, use getID
         ci[i].setTotal(ntotal); // **must** use setTotal method
         return true; // Customer information updated
      }
   }
   
   return false; // Customer does not exist in database
}

// move the purchase date by the number of days given; returns true if successful, 
// false otherwise (customer does not exist)
bool CustomerDB::moveDate(int id, int days) {
   Date temp;
     
   for(int i=0;i<numCusts;i++) {
      if(ci[i].getID()==id) { // found the one we want to change so update total, use getID
         temp = ci[i].getDate(); // **must** use getDate and setDate methods
         temp.move(days); // adjust old date
         ci[i].setDate(temp);  // and set the date to the newly calculated date
         return true; // Customer information updated
      }
   }
   
   return false; // Customer does not exist in database
}

// append the given String2002 to the customer name; returns true if successful, 
// false otherwise (customer does not exist)
bool CustomerDB::appendName(int id, const String2002 &add) {

   for(int i=0;i<numCusts;i++) {
      if(ci[i].getID()==id) { // found the one we want to change so update total, use getID
         ci[i].setName(ci[i].getName()+add); // **must** use getName and setName methods
         return true; // Customer information updated
      }
   }
   
   return false; // Customer does not exist in database
}

// returns the lowest customer ID of all customers 
// (returns -1 if there are no customers in the database)
int CustomerDB::getLowestID() const {
   int lowestIDindex;
   
   if(numCusts==0) return -1; // return -1 if database empty
   
   // assume first customer has the lowest id and check the rest
   lowestIDindex = 0;
   
   for (int i=1; i<numCusts; i++) {
      if(ci[i]<ci[lowestIDindex])
         lowestIDindex = i;
   }
   
   return ci[lowestIDindex].getID(); // return the lowest ID
}

// returns the highest total of all customers 
// (returns -1 if there are no customers in the database)
double CustomerDB::getBestTotal() const {
   double maxtotal;
       
   if(numCusts==0) return -1; // return -1 if database empty
   
   // assume first total is largest and then check the rest
   maxtotal = ci[0].getTotal();  // **must** use getTotal
   
   for(int i=1;i<numCusts;i++) {
      if(ci[i].getTotal()>maxtotal) // use getTotal
         maxtotal=ci[i].getTotal(); // **must** use getTotal
   }
   
   return maxtotal;
}

// prints (to cout) the earliest purchase date of all customers 
// (prints 31 12 2099 if there are no customers in the database)
void CustomerDB::outputFirstDate() const {
   Date max(31,12,2099); 
   
   cout << "The first purchase date is: ";
   
   for (int i=0; i<numCusts; i++) {
      if(ci[i].getDate().compareTo(max)<0) // **must** use getDate
         max = ci[i].getDate(); // **must** use getDate
   }
   max.write(cout);
   cout << endl;
}

// returns the customer name that's first in case insensitive alphabetical order 
// (returns "" if there are no customers in the database)
String2002 CustomerDB::getFirstName() const {
   String2002 lowerFirstName, firstName, lowerName, name;
   
   if (numCusts==0) return ""; // return empty string if no customers
   
   // start with index 0 as the first name (convert to lower case)
   name = ci[0].getName(); // **must** use getName
   lowerFirstName = name;
   firstName = name;
   for(int i=0;i<(int)lowerFirstName.length();i++)
      lowerFirstName[i] = tolower(lowerFirstName[i]);
   
   // go through the rest, checking to see if each (converted to lower
   // case) is the first one so far
   for(int i=1; i<numCusts; i++) {
      name = ci[i].getName(); // **must** use getName
      lowerName = name;
      for(int j=0;j<(int)lowerName.length();j++)
         lowerName[j] = tolower(lowerName[j]);
      if(lowerName<lowerFirstName) {
         lowerFirstName=lowerName; // case insensitive lowest (in all lower case)
         firstName=name; // original name that is first so far
      }
   }
   
   return firstName; // returns the first name
}