module Hadolint.Rule.DL3052 (rule) where

import qualified Data.Map as Map
import Data.Maybe
import qualified Data.Text as Text
import Hadolint.Rule
import Language.Docker.Syntax
import Network.URI as Uri


rule :: LabelSchema -> Rule args
rule :: forall args. LabelSchema -> Rule args
rule LabelSchema
labelschema = forall a. Monoid a => [a] -> a
mconcat forall a b. (a -> b) -> a -> b
$
  forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall args. Text -> Rule args
labelIsNotUrlRule (forall k a. Map k a -> [k]
Map.keys (forall a k. (a -> Bool) -> Map k a -> Map k a
Map.filter (forall a. Eq a => a -> a -> Bool
== LabelType
Url) LabelSchema
labelschema))
{-# INLINEABLE rule #-}

labelIsNotUrlRule :: LabelName -> Rule args
labelIsNotUrlRule :: forall args. Text -> Rule args
labelIsNotUrlRule Text
label = forall args.
RuleCode
-> DLSeverity -> Text -> (Instruction args -> Bool) -> Rule args
simpleRule RuleCode
code DLSeverity
severity Text
message forall {args}. Instruction args -> Bool
check
  where
    code :: RuleCode
code = RuleCode
"DL3052"
    severity :: DLSeverity
severity = DLSeverity
DLWarningC
    message :: Text
message = Text
"Label `" forall a. Semigroup a => a -> a -> a
<> Text
label forall a. Semigroup a => a -> a -> a
<> Text
"` is not a valid URL."
    check :: Instruction args -> Bool
check (Label Pairs
ls) = forall (t :: * -> *) a. Foldable t => t a -> Bool
null forall a b. (a -> b) -> a -> b
$ Text -> Pairs -> Pairs
getBadURLLabels Text
label Pairs
ls
    check Instruction args
_ = Bool
True

getBadURLLabels :: LabelName -> Pairs -> Pairs
getBadURLLabels :: Text -> Pairs -> Pairs
getBadURLLabels Text
lbl Pairs
prs = [(Text
l, Text
u) | (Text
l, Text
u) <- Pairs
prs, Text
l forall a. Eq a => a -> a -> Bool
== Text
lbl,
                                    (forall a. Maybe a -> Bool
isNothing forall b c a. (b -> c) -> (a -> b) -> a -> c
. String -> Maybe URI
Uri.parseURI) (Text -> String
Text.unpack Text
u)]