cabal-gild-1.0.2.4: source/library/CabalGild/Action/EvaluatePragmas.hs
module CabalGild.Action.EvaluatePragmas where
import qualified CabalGild.Class.MonadWalk as MonadWalk
import qualified CabalGild.Extra.FieldLine as FieldLine
import qualified CabalGild.Extra.ModuleName as ModuleName
import qualified CabalGild.Extra.Name as Name
import qualified CabalGild.Extra.String as String
import qualified CabalGild.Type.Comment as Comment
import qualified CabalGild.Type.Pragma as Pragma
import qualified Control.Monad as Monad
import qualified Control.Monad.Trans.Class as Trans
import qualified Control.Monad.Trans.Maybe as MaybeT
import qualified Data.List.NonEmpty as NonEmpty
import qualified Data.Maybe as Maybe
import qualified Data.Set as Set
import qualified Distribution.Compat.Lens as Lens
import qualified Distribution.Fields as Fields
import qualified Distribution.ModuleName as ModuleName
import qualified Distribution.Parsec as Parsec
import qualified Distribution.Utils.Generic as Utils
import qualified System.FilePath as FilePath
-- | High level wrapper around 'field' that makes this action easier to compose
-- with other actions.
run ::
(MonadWalk.MonadWalk m) =>
FilePath ->
([Fields.Field [Comment.Comment a]], cs) ->
m ([Fields.Field [Comment.Comment a]], cs)
run p (fs, cs) = (,) <$> traverse (field p) fs <*> pure cs
-- | Evaluates pragmas within the given field. Or, if the field is a section,
-- evaluates pragmas recursively within the fields of the section.
--
-- If modules are discovered for a field, that fields lines are completely
-- replaced. If anything goes wrong while discovering modules, the original
-- field is returned.
field ::
(MonadWalk.MonadWalk m) =>
FilePath ->
Fields.Field [Comment.Comment a] ->
m (Fields.Field [Comment.Comment a])
field p f = case f of
Fields.Field n fls -> fmap (Maybe.fromMaybe f) . MaybeT.runMaybeT $ do
Monad.guard $ Set.member (Name.value n) relevantFieldNames
comment <- hoistMaybe . Utils.safeLast $ Name.annotation n
pragma <- hoistMaybe . Parsec.simpleParsecBS $ Comment.value comment
case pragma of
Pragma.Discover ds -> do
let root = FilePath.takeDirectory p
directories =
FilePath.dropTrailingPathSeparator
. FilePath.normalise
. FilePath.combine root
<$> NonEmpty.toList ds
files <- Trans.lift . fmap mconcat $ traverse MonadWalk.walk directories
let comments = concatMap FieldLine.annotation fls
fieldLines =
zipWith ModuleName.toFieldLine (comments : repeat [])
. Maybe.mapMaybe (toModuleName directories)
$ Maybe.mapMaybe (stripAnyExtension extensions) files
-- This isn't great, but the comments have to go /somewhere/.
name =
if null fieldLines
then Lens.over Name.annotationLens (comments <>) n
else n
pure $ Fields.Field name fieldLines
Fields.Section n sas fs -> Fields.Section n sas <$> traverse (field p) fs
-- | These are the names of the fields that can have this action applied to
-- them.
relevantFieldNames :: Set.Set Fields.FieldName
relevantFieldNames =
Set.fromList $
fmap
String.toUtf8
[ "exposed-modules",
"other-modules",
"signatures"
]
-- | Attempts to strip any of the given extensions from the file path. If any
-- of them succeed, the result is returned. Otherwise 'Nothing' is returned.
stripAnyExtension :: Set.Set String -> FilePath -> Maybe String
stripAnyExtension es p =
Maybe.listToMaybe
. Maybe.mapMaybe (`FilePath.stripExtension` p)
$ Set.toList es
-- | The set of extensions that should be discovered by this pragma. Any file
-- with one of these extensions will be discovered.
--
-- <https://cabal.readthedocs.io/en/3.10/cabal-package.html#modules-and-preprocessors>
extensions :: Set.Set String
extensions =
Set.fromList
[ "chs",
"cpphs",
"gc",
"hs",
"hsc",
"hsig",
"lhs",
"lhsig",
"ly",
"x",
"y"
]
-- | Attempts to convert a file path (without an extension) into a module name
-- by making it relative to one of the given directories.
toModuleName :: [FilePath] -> FilePath -> Maybe ModuleName.ModuleName
toModuleName ds f =
Maybe.listToMaybe $
Maybe.mapMaybe (ModuleName.fromFilePath . flip FilePath.makeRelative f) ds
-- | This was added in @transformers-0.6.0.0@. See
-- <https://hub.darcs.net/ross/transformers/issue/49>.
hoistMaybe :: (Applicative f) => Maybe a -> MaybeT.MaybeT f a
hoistMaybe = MaybeT.MaybeT . pure