forked from bloominstituteoftechnology/Basic-JavaScript
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproject-4.js
More file actions
54 lines (46 loc) · 1.63 KB
/
Copy pathproject-4.js
File metadata and controls
54 lines (46 loc) · 1.63 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
const reduce = require('./arrays.js').reduce
const getFirstItem = (collection, cb) => {
// invoke the callback function and pass the first item from the collection in as an argument
return cb(collection[0])
};
const getLength = (collection, cb) => {
// Write a function called getLength that passes the length of the array into the callback
return cb(collection.length)
};
const getLastItem = (collection, cb) => {
// Write a function called getLastItem which passes the getLastItem item of the array into the callback
return cb(collection[collection.length - 1])
};
const sumNums = (x, y, cb) => {
// Write a function called sumNums that adds two numbers and passes the result to the callback
return cb(x + y)
};
const multiplyNums = (x, y, cb) => {
// Write a function called multiplyNums that multiplies two numbers and passes the result to the callback
return cb(x * y)
};
const contains = (collection, item, cb) => {
// Write a function called contains that checks if an item is present inside of the given array.
// Pass true to the callback if it is, otherwise pass false
return cb(collection.indexOf(item) >= 0)
};
const removeDuplicates = (collection, cb) => {
// Write a function called removeDuplicates that removes all duplicate values from the given array.
// Pass the array to the callback function. Do not mutate the original array.
const uniques = reduce(collection, (acc, item) => {
if (acc.indexOf(item) < 0) {
acc.push(item)
}
return acc
}, [])
return cb(uniques)
};
module.exports = {
getFirstItem,
getLength,
getLastItem,
sumNums,
multiplyNums,
contains,
removeDuplicates
};