-
Notifications
You must be signed in to change notification settings - Fork 24
Expand file tree
/
Copy pathArrayUtils.js
More file actions
85 lines (67 loc) · 1.99 KB
/
ArrayUtils.js
File metadata and controls
85 lines (67 loc) · 1.99 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
class ArrayUtils{
isEmpty(array){return false;}
isEmpty(array) {
if (array.length == 0) {
return true
} else {
return false;
}
}
append(original, value){return original;}
append(original, value) {
original.push(value);
return original;
}
clone(original){return original;}
clone(original) {
let newArray = [];
newArray = original;
return newArray;
}
subArray(original, from, to){return original;}
subArray(original, from, to) {
let newArray = [];
for (let i = from; original[i] <= original[to]; i++) {
newArray[newArray.length] = i;
}
return newArray;
}
equals(arr1, arr2){return false;}
equals(arr1,arr2) {
for (let i = 0; i < arr1.length; i++) {
if (arr1[i] !== arr2[i]) return false;
}
return true;
}
fill(original, value){}
fill(original, value) {
for (let i = 0; i < original.length; i++) {
original[i] = value;
} return original;
}
indexOf(original, value){return -1;}
indexOf(original, value) {
for (let i = 0; i < original.length; i++) {
if (original[i] === value) return i;
}
return -1;
}
remove(original, value){return original;}
remove(original, value) {
let newOriginal = [...original]
for (i = 0; i < newOriginal.length; i++){
if (newOriginal[i] === value) {
delete newOriginal[i];
}
return newOriginal;
}
}
reverse(original){}
reverseArray(arr) {
let newArray = [];
for (let i = arr.length - 1; i >= 0; i--) {
newArray.push(arr[i]);
}
return newArray;
}
}