pusheadmetal · pusheadmetal · Jul 23, 2019
diff --git a/assignments/array-methods.js b/assignments/array-methods.js
@@ -55,29 +55,68 @@ const runners = [{"id":1,"first_name":"Charmain","last_name":"Seiler","email":"c
 
 // ==== Challenge 1: Use .forEach() ====
 // The event director needs both the first and last names of each runner for their running bibs.  Combine both the first and last names into a new array called fullName. 
-let fullName = [];
+
+function returnName(){
+    let getFullName = [];
+    runners.forEach(function(item, index){
+        getFullName.push(runners[index].first_name + " " + runners[index].last_name);
+    });
+
+    return getFullName;
+}
+let fullName = returnName();
 console.log(fullName);
 
 // ==== Challenge 2: Use .map() ====
 // The event director needs to have all the runner's first names converted to uppercase because the director BECAME DRUNK WITH POWER. Convert each first name into all caps and log the result
-let allCaps = [];
-console.log(allCaps); 
+
+let firstNameUpper = runners.map ( currentValue => currentValue.first_name.toUpperCase());
+console.log(firstNameUpper);
 
 // ==== Challenge 3: Use .filter() ====
 // The large shirts won't be available for the event due to an ordering issue.  Get a list of runners with large sized shirts so they can choose a different size. Return an array named largeShirts that contains information about the runners that have a shirt size of L and log the result
-let largeShirts = [];
+let largeShirts = runners.filter( currentValue => currentValue.shirt_size === "L");
 console.log(largeShirts);
 
 // ==== Challenge 4: Use .reduce() ====
 // The donations need to be tallied up and reported for tax purposes. Add up all the donations into a ticketPriceTotal array and log the result
-let ticketPriceTotal = [];
+let initialValue = 0;
+let ticketPriceTotal = runners.reduce( (total, currentValue) => total + currentValue.donation, initialValue );
 console.log(ticketPriceTotal);
 
 // ==== Challenge 5: Be Creative ====
 // Now that you have used .forEach(), .map(), .filter(), and .reduce().  I want you to think of potential problems you could solve given the data set and the 5k fun run theme.  Try to create and then solve 3 unique problems using one or many of the array methods listed above.
 
 // Problem 1
 
+//The event director has decided to be incredibly greedy and now wants a list of runners who donated less than $100 so that he can notify them that, should they not match a $100 donation, they'll be kicked out of the event!
+
+let cheapSkates = runners.filter ( currentValue => currentValue.donation < 100);
+console.log(cheapSkates); //shame on you cheapskates!
+
 // Problem 2
 
-// Problem 3
+//After being notified of the $100 minimum requirement, only Bertie Lonergan, Malachi Okeshott and Marielle Kimmel decided to comply. Modify the donations of each of these participants to exactly $100. Afterwards, create a new array of runners based on everyone who donated at least $100, thusly removing the rest of the "cheapskates". Finally, print the entire array.
+
+
+runners.map( function(currentValue){
+    if (currentValue.first_name === "Bertie" & currentValue.last_name === "Lonergan"){
+        currentValue.donation = 100;
+    }else if (currentValue.first_name === "Malachi" & currentValue.last_name === "Okeshott"){
+        currentValue.donation = 100;
+    }else if (currentValue.first_name === "Marielle" & currentValue.last_name === "Kimmel"){
+        currentValue.donation = 100;
+    }else{/*do nothing*/}
+});
+
+let newRunners = runners.filter ( currentValue => currentValue.donation >= 100);
+console.log(newRunners);
+
+// Problem 3
+
+//The CFO has caught wind of the event director's scheme and has decided that they will keep the event director in charge as long as the scheme ultimately yielded more total donations than before. Use reduce and compare the donation results with the result from challenge 4 to see if the event director was fired or not!
+
+initialValue = 0;
+let newTicketPriceTotal = newRunners.reduce( (total, currentValue) => total + currentValue.donation, initialValue );
+let wasFired = (oldTotal,newTotal) => (oldTotal >= newTotal) ? "FIRED!":"Not Fired!"; 
+console.log(wasFired(ticketPriceTotal,newTicketPriceTotal));
diff --git a/assignments/callbacks.js b/assignments/callbacks.js
@@ -1,6 +1,7 @@
 // Create a higher order function and invoke the callback function to test your work. You have been provided an example of a problem and a solution to see how this works with our items array.  Study both the problem and the solution to figure out the rest of the problems.
 
 const items = ['Pencil', 'Notebook', 'yo-yo', 'Gum'];
+const hasDuplicates = ["Charlie", "Echo", "Delta", "Charlie", "Delta"];
 
 /* 
 
@@ -27,29 +28,62 @@ const items = ['Pencil', 'Notebook', 'yo-yo', 'Gum'];
 
 function getLength(arr, cb) {
   // getLength passes the length of the array into the callback.
+  return cb(arr.length);
 }
 
+getLength(items, function(len) {
+  console.log(len);
+});
+
 function last(arr, cb) {
   // last passes the last item of the array into the callback.
+  return cb(arr[arr.length-1]);
 }
 
+last(items, function(last){
+  console.log(last);
+});
+
 function sumNums(x, y, cb) {
   // sumNums adds two numbers (x, y) and passes the result to the callback.
+
+  return cb(x+y);
 }
 
+sumNums(10, 5, function(sum){
+  console.log(sum);
+});
+
 function multiplyNums(x, y, cb) {
   // multiplyNums multiplies two numbers and passes the result to the callback.
+
+  return cb(x*y);
 }
 
+multiplyNums(10, 5, function(product){
+  console.log(product);
+});
+
 function contains(item, list, cb) {
   // contains checks if an item is present inside of the given array/list.
   // Pass true to the callback if it is, otherwise pass false.
-}
+  //list.map( currentValue => (item===currentValue) ? cb(true):cb(false) );
 
+  (list.indexOf(item) === -1) ? cb(false):cb(true);
+}
+contains("Gum", items, function(bool){
+  console.log(bool);
+});
 /* STRETCH PROBLEM */
 
 function removeDuplicates(array, cb) {
   // removeDuplicates removes all duplicate values from the given array.
   // Pass the duplicate free array to the callback function.
   // Do not mutate the original array.
+
+  return cb(Array.from(new Set(array)));
 }
+
+removeDuplicates(hasDuplicates, function(uniqueArray){
+  console.log(uniqueArray);
+});
diff --git a/assignments/closure.js b/assignments/closure.js
@@ -1,21 +1,54 @@
 // ==== Challenge 1: Write your own closure ====
 // Write a simple closure of your own creation.  Keep it simple!
 
+const myClosure = ( input => {
+  let myArray = [];
+  return input => { myArray.push(input); return myArray}; 
+})();
+
+for (var j=0; j<5; j++){
+  console.log(myClosure(j));
+}
+
 
 /* STRETCH PROBLEMS, Do not attempt until you have completed all previous tasks for today's project files */
 
 
 // ==== Challenge 2: Create a counter function ====
-const counter = () => {
+const counter = ( _ => {
   // Return a function that when invoked increments and returns a counter variable.
-};
+  let count = 0;
+  return _ => {count++; return count};
+})();
 // Example usage: const newCounter = counter();
 // newCounter(); // 1
 // newCounter(); // 2
 
+for (var i=0; i<5; i++){
+  console.log(counter());
+}
+
 // ==== Challenge 3: Create a counter function with an object that can increment and decrement ====
-const counterFactory = () => {
+const counterFactory = ( _ => {
   // Return an object that has two methods called `increment` and `decrement`.
   // `increment` should increment a counter variable in closure scope and return it.
   // `decrement` should decrement the counter variable and return it.
-};
+  let count = 0;
+
+  let operation = {
+    inc: ( _ => {count++; return count}),
+    dec: ( _ => {count--; return count})
+  };
+  return operation;
+});
+
+let numOperate = counterFactory();
+
+for (var i=0; i<5; i++){
+  console.log(numOperate.inc());
+}
+
+for (var i=0; i<5; i++){
+  console.log(numOperate.dec());
+}
+