-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathhigherOrderFunctions.js
More file actions
100 lines (87 loc) · 2.06 KB
/
higherOrderFunctions.js
File metadata and controls
100 lines (87 loc) · 2.06 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
91
92
93
94
95
96
97
98
99
100
myArray = [1,2,3,4,5];
myObj = {one: 1, two: 2, three: 3, four: 4, five: 5}
// Utility functions
function add(x, y) {
return x + y;
}
function mult(x, y) {
return x * y;
}
function addTen(x) {
return x + 10;
}
function even(x) {
return x % 2 == 0;
}
function odd(x) {
return x % 2 != 0;
}
function each(collection, callback) {
if (Array.isArray(collection)) {
for (var i = 0; i < collection.length; i++) {
callback(collection[i]);
}
} else {
for (var key in collection) {
if (collection.hasOwnProperty(key)) {
callback(collection[key]);
}
}
}
}
function map(collection, callback) {
var result = [];
each(collection, function (element) {
result.push(callback(element));
});
return result;
}
function filter(collection, predicate) {
var result = [];
each(collection, function (element) {
if (predicate(element)) {
result.push(element);
}
});
return result;
}
function reduce(collection, callback, initial) {
var accumulator = initial;
each(collection, function (element) {
if (accumulator === undefined) {
accumulator = element;
}
else {
accumulator = callback(accumulator, element);
}
});
return accumulator;
}
// Refactored reduce function with ternary operator
function reduce(collection, callback, initial) {
var accumulator = initial;
each(collection, function (element) {
accumulator = accumulator === undefined ? element : callback(accumulator, element);
});
return accumulator;
}
// Contains using reduce
function contains(collection, target) {
return reduce(collection, function(accumulator, element) {
return accumulator || accumulator === target;
}, false);
}
function contains(collection, target) {
if (Array.isArray(collection)) {
for (var i = 0; i < collection.length; i += 1) {
if (collection[i] === target) { return true };
}
} else {
for (var key in collection) {
if (collection.hasOwnProperty(key)) {
if (collection[key] === target) { return true };
}
}
}
return false;
}