diff options
Diffstat (limited to 'viewer/src/services/indexsearch.ts')
-rw-r--r-- | viewer/src/services/indexsearch.ts | 70 |
1 files changed, 0 insertions, 70 deletions
diff --git a/viewer/src/services/indexsearch.ts b/viewer/src/services/indexsearch.ts deleted file mode 100644 index 57bd03c..0000000 --- a/viewer/src/services/indexsearch.ts +++ /dev/null | |||
@@ -1,70 +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 { Item } from "@/@types/gallery"; | ||
21 | import { Operation } from "@/@types/Operation"; | ||
22 | import { TagSearch, TagSearchByOperation } from "@/@types/tag"; | ||
23 | |||
24 | export default class IndexSearch { | ||
25 | // Results of the search (by tags) | ||
26 | public static search(searchTags: TagSearch[]): Item[] { | ||
27 | const byOperation = this.extractTagsByOperation(searchTags); | ||
28 | const intersection = this.extractIntersection(byOperation); | ||
29 | const substraction = this.extractSubstraction(byOperation); | ||
30 | return this.aggregateAll(byOperation, intersection, substraction); | ||
31 | } | ||
32 | |||
33 | private static extractTagsByOperation(searchTags: TagSearch[]): TagSearchByOperation { | ||
34 | const byOperation: TagSearchByOperation = {}; | ||
35 | Object.values(Operation).forEach( | ||
36 | operation => (byOperation[operation] = searchTags.filter(tag => tag.operation === operation)) | ||
37 | ); | ||
38 | return byOperation; | ||
39 | } | ||
40 | |||
41 | private static extractIntersection(byOperation: TagSearchByOperation): Set<Item> { | ||
42 | const intersection = new Set<Item>(); | ||
43 | if (byOperation[Operation.INTERSECTION].length > 0) { | ||
44 | byOperation[Operation.INTERSECTION] | ||
45 | .map(tag => tag.items) | ||
46 | .reduce((a, b) => a.filter(c => b.includes(c))) | ||
47 | .flatMap(items => items) | ||
48 | .forEach(item => intersection.add(item)); | ||
49 | } | ||
50 | return intersection; | ||
51 | } | ||
52 | |||
53 | private static extractSubstraction(byOperation: TagSearchByOperation): Set<Item> { | ||
54 | const substraction = new Set<Item>(); | ||
55 | if (byOperation[Operation.SUBSTRACTION].length > 0) { | ||
56 | byOperation[Operation.SUBSTRACTION].flatMap(tag => tag.items).forEach(item => substraction.add(item)); | ||
57 | } | ||
58 | return substraction; | ||
59 | } | ||
60 | |||
61 | private static aggregateAll( | ||
62 | byOperation: TagSearchByOperation, | ||
63 | intersection: Set<Item>, | ||
64 | substraction: Set<Item> | ||
65 | ): Item[] { | ||
66 | byOperation[Operation.ADDITION].flatMap(tag => tag.items).forEach(item => intersection.add(item)); | ||
67 | substraction.forEach(item => intersection.delete(item)); | ||
68 | return [...intersection]; | ||
69 | } | ||
70 | } | ||