blob: d0652192e8800f0e145d4b109a228426a2f386b1 (
plain)
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
|
/**
* @copyright Copyright (c) 2023 Daniel Kesselberg <mail@danielkesselberg.de>
*
* @author Daniel Kesselberg <mail@danielkesselberg.de>
*
* @license GNU AGPL version 3 or any later version
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/**
* Match a list of types against the available types
*
* @param {Array<string>} selectedTypes
* @param {Array<{id: string, name: string}>} options
*/
export function matchTypes(selectedTypes: Array<string>, options: Array<{id: string, name: string}>) {
const items = options.map(option => {
let score = 0
const types = option.id.split(',') // "WORK,HOME" => ['WORK', 'HOME']
const intersection = types.filter(value => selectedTypes.includes(value))
score = score + intersection.length
if (selectedTypes.length === types.length && selectedTypes.length === intersection.length) {
score++
}
return {
type: option,
score,
}
})
return items
.filter(value => value.score > 0)
.sort((a, b) => b.score - a.score)
.shift()
}
|
