forked from code-differently/JavaScript-Array-Lab
-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathArrayUtils.js
More file actions
94 lines (84 loc) · 1.97 KB
/
ArrayUtils.js
File metadata and controls
94 lines (84 loc) · 1.97 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
class ArrayUtils{
isEmpty(array){
if(array[0]) {
return false;
} else {
return true;
}
}
append(original, value){
original.push(value);
return original;
}
clone(original){
let copy = original;
return copy;
}
subArray(original, from, to){
let newArray = [];
for(let i = from; i <= to; i++) {
newArray.push(original[i]);
}
return newArray;
}
equals(arr1, arr2){
let mismatch = 0;
if(arr1.length > arr2.length) {
for(let i = 0; i < arr1.length; i++) {
if(arr1[i] !== arr2[i]) {
mismatch ++;
break;
}
}
} else {
for(let i = 0; i < arr2.length; i++) {
if(arr1[i] !== arr2[i]) {
mismatch ++;
break;
}
}
}
if(mismatch === 0){
return true;
} else {
return false;
}
}
fill(original, value){
for(let i = 0; i < original.length; i++) {
original[i] = value;
}
return original;
}
indexOf(original, value){
let match;
for(let i = 0; i < original.length; i++) {
if(original[i] === value) {
match = i;
break;
}
}
if(match != null) {
return match;
} else {
return -1;
}
}
remove(original, value){
let copy = original;
for(let i = 0; i < copy.length; i++) {
if(copy[i] === value) {
copy.splice(i, 1);
break;
}
}
return copy;
}
reverse(original){
let opposite = [];
for(let i = 0; i < original.length; i++) {
opposite.unshift(original[i]);
}
return opposite;
}
}