aboutsummaryrefslogtreecommitdiff
path: root/viewer/src/services/indexSearch.ts
diff options
context:
space:
mode:
authorpacien2022-09-04 18:18:27 +0200
committerpacien2022-09-04 18:18:27 +0200
commit11bbbae2850b9c45da697a8ed9626495a50a38c0 (patch)
treeff2713118f8b45d36905bfea2933f08d8e70066d /viewer/src/services/indexSearch.ts
parente93f7b1eb84c083d67567115284c0002a3a7d5fc (diff)
parent8349be992b46b77dee921f484cfbff8b758ff756 (diff)
downloadldgallery-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.ts74
1 files changed, 74 insertions, 0 deletions
diff --git a/viewer/src/services/indexSearch.ts b/viewer/src/services/indexSearch.ts
new file mode 100644
index 0000000..df0a600
--- /dev/null
+++ b/viewer/src/services/indexSearch.ts
@@ -0,0 +1,74 @@
1/* ldgallery - A static generator which turns a collection of tagged
2-- pictures into a searchable web gallery.
3--
4-- Copyright (C) 2019-2022 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
20import { Item } from '@/@types/gallery';
21import { Operation } from '@/@types/operation';
22import { TagSearch, TagSearchByOperation } from '@/@types/tag';
23
24function _extractTagsByOperation(searchTags: TagSearch[]): TagSearchByOperation {
25 const byOperation: TagSearchByOperation = {};
26 Object.values(Operation).forEach(
27 operation => (byOperation[operation] = searchTags.filter(tag => tag.operation === operation)),
28 );
29 return byOperation;
30}
31
32function _extractIntersection(byOperation: TagSearchByOperation): Set<Item> {
33 const intersection = new Set<Item>();
34 if (byOperation[Operation.INTERSECTION].length > 0) {
35 byOperation[Operation.INTERSECTION]
36 .map(tag => tag.items)
37 .reduce((a, b) => a.filter(c => b.includes(c)))
38 .flatMap(items => items)
39 .forEach(item => intersection.add(item));
40 }
41 return intersection;
42}
43
44function _extractSubstraction(byOperation: TagSearchByOperation): Set<Item> {
45 const substraction = new Set<Item>();
46 if (byOperation[Operation.SUBSTRACTION].length > 0) {
47 byOperation[Operation.SUBSTRACTION].flatMap(tag => tag.items).forEach(item => substraction.add(item));
48 }
49 return substraction;
50}
51
52function _aggregateAll(
53 byOperation: TagSearchByOperation,
54 intersection: Set<Item>,
55 substraction: Set<Item>,
56): Item[] {
57 byOperation[Operation.ADDITION].flatMap(tag => tag.items).forEach(item => intersection.add(item));
58 substraction.forEach(item => intersection.delete(item));
59 return [...intersection];
60}
61
62// ---
63
64export const useIndexSearch = () => {
65 // Results of the search (by tags)
66 function indexSearch(searchTags: TagSearch[]): Item[] {
67 const byOperation = _extractTagsByOperation(searchTags);
68 const intersection = _extractIntersection(byOperation);
69 const substraction = _extractSubstraction(byOperation);
70 return _aggregateAll(byOperation, intersection, substraction);
71 }
72
73 return indexSearch;
74};