forked from bloominstituteoftechnology/JavaScript-II
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcallbacks.js
More file actions
90 lines (67 loc) · 2.29 KB
/
callbacks.js
File metadata and controls
90 lines (67 loc) · 2.29 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
// Create a callback function and invoke the 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 sportsTeams = ['Giants', 'Warriors', 'Lakers', 'Knicks']
/*
//Given this problem:
function firstItem(arr, cb) {
// firstItem passes the first item of the given array to the callback function.
}
// Potential Solution:
function firstItem(arr, cb) {
return cb(arr[0]);
}
firstItem(items, function(first) {
console.log(first)
});
*/
//higher order function for arr problems
function higherOrderFunction1(arr, cb){
console.log(cb(arr))
}
function getLength(arr, cb) {
// getLength passes the length of the array into the callback.
return arr.length;
}
higherOrderFunction1(items, getLength);
function last(arr, cb) {
// last passes the last item of the array into the callback.
const lastItem = arr.length - 1;
return arr[lastItem];
}
higherOrderFunction1(items, last);
//higher order function for Number problems
function higherOrderFunction2(x, y, cb){
console.log(cb(x, y))
}
function sumNums(x, y) {
// sumNums adds two numbers (x, y) and passes the result to the callback.
return x + y;
}
higherOrderFunction2(4, 9, sumNums);
function multiplyNums(x, y) {
// multiplyNums multiplies two numbers and passes the result to the callback.
return x * y
}
higherOrderFunction2(4, 3, multiplyNums);
//Higher Order Function to check list;
function higherOrderFunction3(item,list,cb){
console.log(cb(item, list))
}
function contains(item,list) {
// contains checks if an item is present inside of the given array/list.
// Pass true to the callback if it is, otherwise pass false.
for(let i = 0; i < list.length; i++){
if(item.toLowerCase() === list[i].toLowerCase()){
return true;
}
}
return false;
}
higherOrderFunction3('yo-yo',items, contains)
higherOrderFunction3('giants',sportsTeams, contains)
/* 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.
}