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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
-- ldgallery - A static generator which turns a collection of tagged
-- pictures into a searchable web gallery.
--
-- Copyright (C) 2019 Pacien TRAN-GIRARD
--
-- 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 <https://www.gnu.org/licenses/>.
{-# LANGUAGE
DuplicateRecordFields
, DeriveGeneric
, DeriveAnyClass
#-}
module Resource
( ResourceTree(..)
, DirProcessor
, ItemProcessor
, ThumbnailProcessor
, buildResourceTree
, cleanupResourceDir
) where
import Control.Concurrent.ParallelIO.Global (parallel)
import Data.Function ((&))
import Data.List ((\\), subsequences, sortBy)
import Data.Ord (comparing)
import Data.Maybe (mapMaybe)
import Files
import Input (InputTree(..), Sidecar)
-- | Tree representing the compiled gallery resources.
data ResourceTree =
ItemResource
{ sidecar :: Sidecar
, resPath :: Path
, thumbnailPath :: Maybe Path }
| DirResource
{ items :: [ResourceTree]
, resPath :: Path
, thumbnailPath :: Maybe Path }
deriving Show
type DirProcessor = Path -> IO Path
type ItemProcessor = Path -> IO Path
type ThumbnailProcessor = Path -> IO (Maybe Path)
buildResourceTree ::
DirProcessor -> ItemProcessor -> ThumbnailProcessor -> InputTree
-> IO ResourceTree
buildResourceTree processDir processItem processThumbnail = resNode
where
resNode (InputFile path sidecar) =
do
processedItem <- processItem path
processedThumbnail <- processThumbnail path
return ItemResource
{ sidecar = sidecar
, resPath = processedItem
, thumbnailPath = processedThumbnail }
resNode (InputDir path thumbnailPath items) =
do
processedDir <- processDir path
processedThumbnail <- maybeThumbnail thumbnailPath
dirItems <- parallel $ map resNode items
return DirResource
{ items = dirItems
, resPath = processedDir
, thumbnailPath = processedThumbnail }
maybeThumbnail :: Maybe Path -> IO (Maybe Path)
maybeThumbnail Nothing = return Nothing
maybeThumbnail (Just path) = processThumbnail path
flattenResourceTree :: ResourceTree -> [ResourceTree]
flattenResourceTree item@ItemResource{} = [item]
flattenResourceTree dir@(DirResource items _ _) =
dir:(concatMap flattenResourceTree items)
outputDiff :: ResourceTree -> FSNode -> [Path]
outputDiff resources ref =
(fsPaths ref) \\ (resPaths $ flattenResourceTree resources)
where
resPaths :: [ResourceTree] -> [Path]
resPaths resList = map resPath resList ++ thumbnailPaths resList
thumbnailPaths :: [ResourceTree] -> [Path]
thumbnailPaths = (concatMap subPaths) . (mapMaybe thumbnailPath)
fsPaths :: FSNode -> [Path]
fsPaths = map nodePath . tail . flattenDir
cleanupResourceDir :: ResourceTree -> FileName -> IO ()
cleanupResourceDir resourceTree outputDir =
readDirectory outputDir
>>= return . outputDiff resourceTree . root
>>= return . sortBy (flip $ comparing pathLength) -- nested files before dirs
>>= return . map (localPath . (/>) outputDir)
>>= mapM_ remove
|