-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathscript.js
85 lines (67 loc) · 1.76 KB
/
script.js
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
/**
* Нужно описать оставшиеся методы, чтобы они выполянли такую же логику, что и стандартные методы js
*
* */
class MyArray {
constructor(...args) {
for (let i = 0; i < args.length; i++) {
this[i] = args[i];
};
this.length = args.length;
}
push(...args) {
for (let i = 0; i < args.length; i++) {
this[this.length] = args[i];
this.length++;
};
}
map(func) {
const arrMap = new MyArray();
for (let i = 0; i < this.length; i++) {
const value = func(this[i]);
arrMap.push(value);
}
return arrMap;
}
filter(func) {
const arrFilter = new MyArray();
for (let i = 0; i < this.length; i++) {
if (func(this[i])) {
arrFilter.push(this[i]);
}
};
return arrFilter;
}
reduce(func, acc) {
for (let i = 0; i < this.length; i++) {
acc = func(acc, this[i]);
};
return acc;
}
includes(valueToFind) {
for (let i = 0; i < this.length; i++) {
if (valueToFind === this[i]) {
return true;
}
}
return false;
}
}
const arr1 = new MyArray(1, 2, -3, 4, 5);
console.log(arr1);
arr1.push(100, 200, 300);
console.log(arr1);
const arrFilter = arr1.filter(function (item) {
return item > 0;
})
console.log(arrFilter);
const arrMap = arr1.map(function (item) {
return item * 2;
})
console.log(arrMap);
const valueReduce = arr1.reduce(function (sum, current) {
return sum + current
}, 0);
console.log(valueReduce);
const arrInclude = arr1.includes(2);
console.log(arrInclude);