second commit

Author: Rejoicet

Faculty.cpp

@@ -34,6 +34,11 @@ void Faculty::setID(unsigned int ID)
   IDnum = ID;
 }
 
+void Faculty::addtolist(unsigned int aID)
+{
+  adviseeIDs -> addBack (aID);
+}
+
 void Faculty::printinfo()
 {
   cout << endl << "Id: " << IDnum << endl <<
@@ -56,6 +61,24 @@ int Faculty::listsize()
   return adviseeIDs -> size();
 }
 
+unsigned int Faculty::removeadID(unsigned int& sID)
+{
+  if (adviseeIDs -> isEmpty() == true) {
+    cout << "There are no advisees under this faculty" << endl;
+    return sID = 0;
+  }
+  else {
+    if (adviseeIDs -> contains (sID) == false) {
+      cout << "This advisee is not present under this faculty" << endl;
+      return sID = 0;
+    }
+    else {
+      adviseeIDs -> remove (sID);
+      return sID;
+    }
+  }
+}
+
 bool operator== (const Faculty &f1, const Faculty &f2) {
      return (f1.IDnum == f2.IDnum);
 }

Faculty.h

@@ -12,6 +12,8 @@ class Faculty : public Person {
      void printinfo();
      void printexit();
      int listsize();
+     unsigned int removeadID(unsigned int& sID);
+     void addtolist(unsigned int aID);
 
      friend bool operator== (const Faculty &f1, const Faculty &f2);
      friend bool operator!= (const Faculty &f1, const Faculty &f2);

GenBST.h

@@ -26,10 +26,17 @@ class BST {
 
   void individualInfo(T k);
   unsigned int facultyInfo(T k);
+  unsigned int changeFadvisor (T k, unsigned int& afID);
+  unsigned int removeSadvisee (T k, unsigned int& asID);
+  bool checkAdvisor (T k, unsigned int afID);
+  void addFadvisee (T k, unsigned int asID);
+  T getobject(T& k);
+  void adviseeInfo (unsigned int fID);
 
   TreeNode<T> *getSuccessor (TreeNode<T> *d);
 
 private:
+  unsigned int fID;
   TreeNode<T> *root;
   friend class Simulation;
 };
@@ -324,8 +331,102 @@ unsigned int BST<T>::facultyInfo (T k)
   return current -> key.getAdvisorID();
 }
 
-/*template <class T>
-unsigned int BST<T>::adviseeInfo (T k)
+template <class T>
+unsigned int BST<T>::changeFadvisor (T k, unsigned int& afID)
+{
+  TreeNode<T> *parent = root;
+  TreeNode<T> *current = root;
+
+  //now we need to find it
+  while (current -> key != k) {
+    if (k < current -> key) {
+      parent = current;
+      current = current -> left;
+    }
+    else { //go right
+      parent = current;
+      current = current -> right;
+    }
+  }
+  fID = current -> key.getAdvisorID();
+  current -> key.setAdvisorID(afID);
+  return fID;
+}
+
+template <class T>
+unsigned int BST<T>::removeSadvisee (T k, unsigned int& asID)
+{
+  TreeNode<T> *parent = root;
+  TreeNode<T> *current = root;
+
+  //now we need to find it
+  while (current -> key != k) {
+    if (k < current -> key) {
+      parent = current;
+      current = current -> left;
+    }
+    else { //go right
+      parent = current;
+      current = current -> right;
+    }
+  }
+  if (current -> key.removeadID (asID) == 0) {
+    return asID = 0;
+  }
+  else {
+    return asID;
+  }
+}
+
+template <class T>
+bool BST<T>::checkAdvisor (T k, unsigned int afID)
+{
+  TreeNode<T> *parent = root;
+  TreeNode<T> *current = root;
+
+  //now we need to find it
+  while (current -> key != k) {
+    if (k < current -> key) {
+      parent = current;
+      current = current -> left;
+    }
+    else { //go right
+      parent = current;
+      current = current -> right;
+    }
+    if (current == NULL)
+      return false;
+  }
+  if (current -> key.getAdvisorID () == afID) {
+    return true;
+  }
+  else {
+    return false;
+  }
+}
+
+template <class T>
+void BST<T>::addFadvisee(T k, unsigned int asID)
+{
+  TreeNode<T> *parent = root;
+  TreeNode<T> *current = root;
+
+  //now we need to find it
+  while (current -> key != k) {
+    if (k < current -> key) {
+      parent = current;
+      current = current -> left;
+    }
+    else { //go right
+      parent = current;
+      current = current -> right;
+    }
+  }
+  current -> key.addtolist(asID);
+}
+
+template <class T>
+T BST<T>::getobject(T& k)
 {
   TreeNode<T> *parent = root;
   TreeNode<T> *current = root;
@@ -341,5 +442,18 @@ unsigned int BST<T>::adviseeInfo (T k)
       current = current -> right;
     }
   }
-  current -> key.listsize();
-}*/
+  return current -> key;
+}
+
+template <class T>
+void BST<T>::adviseeInfo (unsigned int fID)
+{
+  TreeNode<T>* node = root;
+  if (node == NULL)
+  return;
+
+  recPrintAll (node -> left);
+  if (node -> key.getAdvisorID() == fID)
+    node -> key.printinfo();
+  recPrintAll (node -> right);
+}

GenDlinkedlist.h

@@ -22,6 +22,7 @@ class GenDlinkedlist {
   void reduce ();
   T sort (T c, T d, T& s, T& med);
   int size();
+  unsigned int listDetails();
 
 private:
   friend class Faculty;
@@ -129,9 +130,9 @@ GenNode<T> *GenDlinkedlist<T>::remove (T key)
       node = node -> next;
     }
 
-    if (node == trailer) {
-      cout << "There is no node with element " << key << " in the linked list." << endl;
-    }
+    //if (node == trailer) {
+      //cout << "There is no node with element " << key << " in the linked list." << endl;
+    //}
   }
 }
 
@@ -176,6 +177,20 @@ void GenDlinkedlist<T>::printList() const
   }
 }
 
+template <class T>
+unsigned int GenDlinkedlist<T>::listDetails()
+{
+  GenNode<T> *curr = new GenNode<T>;
+  curr = header;
+  curr = curr -> next;
+
+  while (curr != trailer) {
+    return curr -> elem;
+    curr = curr -> next;
+  }
+}
+
+
 template <class T>
 int GenDlinkedlist<T>::size()
 {

Genstack.h

@@ -0,0 +1,100 @@
+#include <iostream>
+
+using namespace std;
+
+template <class T>
+class GenStack {
+  T *genArray;
+  int capacity, t;
+  friend class Simulation;
+
+public:
+  int size() const;  //const because they do not alter the contents of the stack
+  bool empty() const;
+  const T& top ();
+  void pop ();
+  void push (const T& p);
+
+  GenStack();
+  ~GenStack();
+};
+
+template <class T>
+GenStack<T>::GenStack()
+{
+  capacity = 5;
+  genArray = new T [capacity];
+  t = -1;
+}
+
+template <class T>
+GenStack<T>::~GenStack()
+{
+  delete genArray;
+}
+
+template <class T>
+int GenStack<T>::size() const
+{
+  return (t+1);
+}
+
+template <class T>
+bool GenStack<T>::empty() const
+{
+  return (t<0);
+}
+
+template <class T>
+const T& GenStack<T>::top()
+{
+  return genArray[t];
+}
+
+template <class T>
+void GenStack<T>::pop()
+{
+  if (empty()) {
+    cout << "There are no elements in the stack to pop!!" << endl;
+    exit(1);
+  }
+  else {
+    --t;
+  }
+}
+
+/*template <class T>
+T GenStack <T>::top()
+{
+  if (empty()) {
+    cout << "There are no elements in the stack" << endl;
+    exit(1);
+  }
+  else {
+    return genArray[t];
+  }
+}
+
+template <class T>
+T GenStack <T>::pop()
+{
+  if (empty()) {
+    cout << "There are no elements in the stack" << endl;
+    exit(1);
+  }
+  else {
+    return genArray[t--];
+  }
+}*/
+
+template <class T>
+void GenStack<T>::push (const T& p)
+{
+  if (size() == capacity) {
+    pop();
+    genArray[++t] = p;
+  }
+  else {
+    genArray[++t] = p;
+  }
+}

README.md

@@ -1 +1,3 @@
 # Assignment5
+
+I worked with Brandon Fabre for this assignment.