diff options
author | pacien | 2022-09-04 18:18:27 +0200 |
---|---|---|
committer | pacien | 2022-09-04 18:18:27 +0200 |
commit | 11bbbae2850b9c45da697a8ed9626495a50a38c0 (patch) | |
tree | ff2713118f8b45d36905bfea2933f08d8e70066d /viewer/src/services/indexsearch.ts | |
parent | e93f7b1eb84c083d67567115284c0002a3a7d5fc (diff) | |
parent | 8349be992b46b77dee921f484cfbff8b758ff756 (diff) | |
download | ldgallery-11bbbae2850b9c45da697a8ed9626495a50a38c0.tar.gz |
Merge branch 'develop': release v2.1v2.1
GitHub: related to #315
Diffstat (limited to 'viewer/src/services/indexsearch.ts')
-rw-r--r-- | viewer/src/services/indexsearch.ts | 68 |
1 files changed, 0 insertions, 68 deletions
diff --git a/viewer/src/services/indexsearch.ts b/viewer/src/services/indexsearch.ts deleted file mode 100644 index 00f8cfc..0000000 --- a/viewer/src/services/indexsearch.ts +++ /dev/null | |||
@@ -1,68 +0,0 @@ | |||
1 | /* ldgallery - A static generator which turns a collection of tagged | ||
2 | -- pictures into a searchable web gallery. | ||
3 | -- | ||
4 | -- Copyright (C) 2019-2020 Guillaume FOUET | ||
5 | -- | ||
6 | -- This program is free software: you can redistribute it and/or modify | ||
7 | -- it under the terms of the GNU Affero General Public License as | ||
8 | -- published by the Free Software Foundation, either version 3 of the | ||
9 | -- License, or (at your option) any later version. | ||
10 | -- | ||
11 | -- This program is distributed in the hope that it will be useful, | ||
12 | -- but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
13 | -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
14 | -- GNU Affero General Public License for more details. | ||
15 | -- | ||
16 | -- You should have received a copy of the GNU Affero General Public License | ||
17 | -- along with this program. If not, see <https://www.gnu.org/licenses/>. | ||
18 | */ | ||
19 | |||
20 | import { Operation } from "@/@types/Operation"; | ||
21 | |||
22 | export default class IndexSearch { | ||
23 | // Results of the search (by tags) | ||
24 | public static search(searchTags: Tag.Search[]): Gallery.Item[] { | ||
25 | const byOperation = this.extractTagsByOperation(searchTags); | ||
26 | const intersection = this.extractIntersection(byOperation); | ||
27 | const substraction = this.extractSubstraction(byOperation); | ||
28 | return this.aggregateAll(byOperation, intersection, substraction); | ||
29 | } | ||
30 | |||
31 | private static extractTagsByOperation(searchTags: Tag.Search[]): Tag.SearchByOperation { | ||
32 | const byOperation: Tag.SearchByOperation = {}; | ||
33 | Object.values(Operation).forEach( | ||
34 | operation => (byOperation[operation] = searchTags.filter(tag => tag.operation === operation)) | ||
35 | ); | ||
36 | return byOperation; | ||
37 | } | ||
38 | |||
39 | private static extractIntersection(byOperation: Tag.SearchByOperation): Set<Gallery.Item> { | ||
40 | const intersection = new Set<Gallery.Item>(); | ||
41 | if (byOperation[Operation.INTERSECTION].length > 0) { | ||
42 | byOperation[Operation.INTERSECTION] | ||
43 | .map(tag => tag.items) | ||
44 | .reduce((a, b) => a.filter(c => b.includes(c))) | ||
45 | .flatMap(items => items) | ||
46 | .forEach(item => intersection.add(item)); | ||
47 | } | ||
48 | return intersection; | ||
49 | } | ||
50 | |||
51 | private static extractSubstraction(byOperation: Tag.SearchByOperation): Set<Gallery.Item> { | ||
52 | const substraction = new Set<Gallery.Item>(); | ||
53 | if (byOperation[Operation.SUBSTRACTION].length > 0) { | ||
54 | byOperation[Operation.SUBSTRACTION].flatMap(tag => tag.items).forEach(item => substraction.add(item)); | ||
55 | } | ||
56 | return substraction; | ||
57 | } | ||
58 | |||
59 | private static aggregateAll( | ||
60 | byOperation: Tag.SearchByOperation, | ||
61 | intersection: Set<Gallery.Item>, | ||
62 | substraction: Set<Gallery.Item> | ||
63 | ): Gallery.Item[] { | ||
64 | byOperation[Operation.ADDITION].flatMap(tag => tag.items).forEach(item => intersection.add(item)); | ||
65 | substraction.forEach(item => intersection.delete(item)); | ||
66 | return [...intersection]; | ||
67 | } | ||
68 | } | ||