-
Notifications
You must be signed in to change notification settings - Fork 24
Expand file tree
/
Copy pathArrayUtils.js
More file actions
106 lines (86 loc) · 1.94 KB
/
ArrayUtils.js
File metadata and controls
106 lines (86 loc) · 1.94 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
101
102
103
104
105
// class ArrayUtils{
// isEmpty(array){return false;}
// append(original, value){return original;}
// clone(original){return original;}
// subArray(original, from, to){return original;}
// equals(arr1, arr2){return false;}
// fill(original, value){}
// indexOf(original, value){return -1;}
// remove(original, value){return original;}
// reverse(original){}
// }
//isEmpty
function empty(array){
if (array.length === 0){
return true
} return false
}
//append
function app(array, newValue){
array[array.length] = newValue;
return array
}
//clone
function cloning(original){
let newArr = []
newArr = original
return newArr
}
//subArray
function subArr(original, from, to) {
let newArray = []
for (i = from; original[i] <= original[to]; i++){
newArray[newArray.length] = original[i]
}
return newArray
}
//equals
function equal(arr1, arr2){
for (let i = 0; i < arr1.length; i++) {
if (arr1[i] !== arr2[i]) return false;
}
return true;
}
let test1 = [1, 2, 3, 4, 5, 6]
//fill
function filled(original, value) {
for (let i = 0; i < original.length; i++){
original[i] = value
}
return original
}
//indexOf
function indexed(original, value) {
for (let i = 0; i < original.length; i++){
if(original[i] === value){
return i;
break
}
}
return -1;
}
//remove
function removal(original, value){
let newOrig = [...original]
for (i = 0; i < newOrig.length; i++) {
if (newOrig[i] === value) {
delete newOrig[i]
return newOrig
break
}
}
}
//reverse
function reversed(original) {
let top = original.length - 1;
let bottom = 0;
let swap = 0;
while (top - bottom >= 1) {
swap = original[bottom];
original[bottom] = original[top];
original[top] = swap;
bottom++;
top--;
}
return original
}