1 files changed, 30 insertions, 24 deletions

diff --git a/src/list.cpp b/src/list.cpp
index 2612d3e..0101d8c 100644
--- a/src/list.cpp
+++ b/src/list.cpp
@@ -1,14 +1,16 @@
 #include "list.hpp"
 
-List::List(Window m)
+List::List(Window m) //Constructor
 {
   int i;
+  //Creates 5 creatures, inserts them into vector C
   for(i=0;i<5;i++)
   {
-    Creature X = Creature(m,"img/Cbasic.png");
+    Creature X(m,"img/Cbasic.png");
     C.push_back(X);
   }
 
+  //Creates 5 resources, inserts them into vector R; inserts locations of resources into vector L
   for(i=0;i<5;i++)
   {
     Resource Y(m,"img/Rbasic.png");
@@ -17,48 +19,52 @@ List::List(Window m)
   }
 }
 
-void List::Behavior()
-{
-  int i, j;
-  std::vector<Location> Z;
-
-  for(i = 0; i < C.size(); i++)
-  {
-    C[i].Behavior();
-    for(j = 0; j < L.size(); j++)
-      if(200>(Distance(C[i].getLocation(),L[j])))
-      {
-        Z.push_back(L[j]);
-      }
-
-    C[i].giveKnown(Z);
-    Z.clear();
-  }
-}
-
 void List::Place()
 {
   int i;
 
+  //if any locations are creatures, erases them from vector L
   for(i = 0;i < L.size(); i++)
-    if(L[i].t==1)
+    if(L[i].type==1)
       L.erase(L.begin()+i);
 
+  //places each creature on window, inserts their locations into vector L
   for(i = 0; i < C.size(); i++)
   {
     C[i].Place();
     L.push_back(C[i].getLocation());
   }
 
+  //places all resources
   for(i = 0; i < R.size(); i++)
   {
     R[i].Place();
   }
 }
 
+void List::Behavior()
+{
+  int i, j;
+  std::vector<Location> Z;
+
+  //
+  for(i = 0; i < C.size(); i++)
+  {
+    C[i].Behavior(); //executes the behavior of the creature at i
+    for(j = 0; j < L.size(); j++)
+      if(200>(Distance(C[i].getLocation(),L[j]))) //if the distance between the creature and L[j] is less than 200, insert L[j] into vector Z.
+      {
+        Z.push_back(L[j]);
+      }
+
+    C[i].giveKnown(Z); //sets creature's target location?
+    Z.clear(); //clear vector Z for next creature
+  }
+}
+
 double List::Distance(Location A, Location B)
 {
-  double z = sqrt(pow(A.x-B.x,2)+pow(A.y-B.y,2));
-  //std::cout << z << "\n";
+  //computes distance between two points
+  double z = sqrt(pow(A.x - B.x, 2) + pow(A.y - B.y, 2));
   return z;
 }