-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathutil.js
56 lines (52 loc) · 1.58 KB
/
util.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
function searchObjectInArray(array, object, arrayField) {
for (let i = 0; i < array.length; i++) {
if (array[i][arrayField] == object) {
return array[i];
}
}
return undefined;
}
function getObjectsArray2inArray1(array1, fieldArray1, array2, fieldArray2) {
let ret = [];
for (let i = 0; i < array1.length; i++) {
for (let j = 0; j < array2.length; j++) {
if (array1[i][fieldArray1] == array2[j][fieldArray2]) {
ret.push(array2[j]);
}
}
}
return ret;
}
function getBestInArray(array, arrayField, f) {
let ret = array[0];
for (let i = 1; i < array.length; i++) {
if (f(array[i][arrayField], ret[arrayField]) > 0) {
ret = array[i];
}
}
return ret;
}
function getNumItemInArray(array, field, f) {
if (Array.isArray(field) && Array.isArray(f) && f.length == field.length) {
for (let i = 0; i < array.length; i++) {
let ok = true;
for (let j = 0; j < field.length; j++) {
if (array[i][field[j]] != f[j]) {
ok = false;
break;
}
}
if (ok) {
return i;
}
}
} else {
for (let i = 0; i < array.length; i++) {
if (array[i][field] == f) {
return i;
}
}
}
return undefined;
}
module.exports = { getObjectsArray2inArray1, searchObjectInArray, getBestInArray, getNumItemInArray };