#include <iostream>
#include "list.h"

List::List() {
   length = 0;
}

bool List::IsEmpty() const{
   return(length==0);
}

bool List::IsFull() const{
   return(length==MAX_LENGTH);
}

int  List::Length() const{
   return(length);
}

void List::Insert(ItemType item){
   if (length < MAX_LENGTH) {
    data[length] = item;
    length++;
   }
}

void List::Delete(ItemType item){
    // is item in this list?
    //  if no , return
    //  else is the item the last in the list?
    //    if no, move the last item to this position
    //  subtract one from the lenght
    //  return

    int i=0;
    bool found=false;

    while ((i<length ) && (! found))  {
       if (data[i] == item) {
         found = true;
       } else {
          i++;
       }
    }

    if (found) {
        if (i < length) {
            data[i] = data[length-1];
        }
        length--;
    }

}

bool List::IsPresent(ItemType item) const {
    int pos;
    bool rv = false;

//    for(pos=0;pos<length;pos++) {
//       if (data[pos] == item) {
//          return(true);
//       }
//    }
//    return(false);

    for(pos=0;pos<length;pos++) {
       if (data[pos] == item) {
          rv = true;
       }
    }
    return(rv);
}

void List::Print() const{
    int i;

    for(i=0;i<length;i++) {
       cout << data[i] << endl;
    }
}