diff --git a/assignments/array-methods.js b/assignments/array-methods.js index f692c35c6..b6d6a4e5f 100644 --- a/assignments/array-methods.js +++ b/assignments/array-methods.js @@ -58,26 +58,56 @@ const runners = [{"id":1,"first_name":"Charmain","last_name":"Seiler","email":"c let fullName = []; console.log(fullName); +runners.forEach(runner => fullName.push(runner.first_name + ' ' + runner.last_name)); + +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 = []; + +allCaps = runners.map(runner => runner.first_name.toUpperCase()); + console.log(allCaps); // ==== 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 = []; + +largeShirts = runners.filter( runner => runner.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 = []; + + +ticketPriceTotal = runners.reduce( (amount,runner) => amount += runner.donation,0); + + 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 +// Problem 1 - Create an array of names of runners that have a shirt size of small. +let small = []; +small = runners.filter( runner => runner.shirt_size === 'S'); +let smallRunners = small.map( runner => runner.first_name + ' ' + runner.last_name); +console.log(smallRunners); + + +// Problem 2 - sort the runners alphabetically by last name + +let sortedRunners = runners.sort( (runnerA,runnerB) => runnerA.last_name > runnerB.last_name ? 1 : -1); + +let names_sorted = sortedRunners.map( runner => runner.first_name + ' ' + runner.last_name); +console.log(names_sorted); -// Problem 2 +// Problem 3 - collect all the emails of the registered runners into an array. -// Problem 3 \ No newline at end of file +let runnerEmails = runners.map( runner => runner.email); +console.log(runnerEmails); diff --git a/assignments/callbacks.js b/assignments/callbacks.js index c1c013800..1ee5c751b 100644 --- a/assignments/callbacks.js +++ b/assignments/callbacks.js @@ -24,32 +24,57 @@ const items = ['Pencil', 'Notebook', 'yo-yo', 'Gum']; */ - function getLength(arr, cb) { // getLength passes the length of the array into the callback. + cb(arr.length); } +getLength(items, length => console.log('the length of the array is: ' + length)); + function last(arr, cb) { // last passes the last item of the array into the callback. + cb(arr[arr.length-1]); } +last(items, last => console.log(last)); + function sumNums(x, y, cb) { // sumNums adds two numbers (x, y) and passes the result to the callback. + cb(x+y); } +sumNums(3,4, sum => console.log(`the sum is ${sum}`)); + function multiplyNums(x, y, cb) { // multiplyNums multiplies two numbers and passes the result to the callback. + cb(x*y); } +multiplyNums(3,4, result => console.log(`the result of multiplying the two numbers is: ${result}`)) + 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.includes(item) ? cb(true) : cb(false); } +contains('yo-yo', items, isPresent => console.log('Is the item present? ' + isPresent)); + + /* 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. + let unique = items.filter( (item,i) => items.indexOf(item) >= i); + cb(unique); + //because indexOf(item) looks for the first occurrence of the item, if that happens to be less than the current index, that means there is more than one occurrence of that item. so only return the item index that is greater than or = to current index. } + + +removeDuplicates(items, (array) => console.log(array)); + + + diff --git a/assignments/closure.js b/assignments/closure.js index 4307524fc..a04603db8 100644 --- a/assignments/closure.js +++ b/assignments/closure.js @@ -1,13 +1,30 @@ // ==== Challenge 1: Write your own closure ==== // Write a simple closure of your own creation. Keep it simple! +function backpack(){ + const gloves = 'warm'; + + function shavingKit() { + console.log('these gloves are ' + gloves); + } + + shavingKit(); +} + +backpack(); + + + + /* 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 = () => { - // Return a function that when invoked increments and returns a counter variable. + let counter = 0; + + // Return a function that when invoked increments and returns a counter variable. }; // Example usage: const newCounter = counter(); // newCounter(); // 1