Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. data LeftMonoidalUpdate a

    configuration-tools Configuration.Utils.Monoid

    Update a value by appending on the left. Under normal circumstances you'll never use this type directly but only its FromJSON instance. See the leftMonoidalUpdate for an example.

  2. data RightMonoidalUpdate a

    configuration-tools Configuration.Utils.Monoid

    Update a value by appending on the right. Under normal circumstances you'll never use this type directly but only its FromJSON instance. See the leftMonoidalUpdate for an example.

  3. fromLeftMonoidalUpdate :: forall a b p f . (Profunctor p, Functor f) => p (LeftMonoidalUpdate a) (f (LeftMonoidalUpdate b)) -> p a (f b)

    configuration-tools Configuration.Utils.Monoid

    This is the same as from leftMonoidalUpdate but doesn't depend on the lens Library.

  4. fromRightMonoidalUpdate :: forall a b p f . (Profunctor p, Functor f) => p (RightMonoidalUpdate a) (f (RightMonoidalUpdate b)) -> p a (f b)

    configuration-tools Configuration.Utils.Monoid

    This is the same as from rightMonoidalUpdate but doesn't depend on the lens Library.

  5. leftMonoidalUpdate :: forall a b p f . (Profunctor p, Functor f) => p a (f b) -> p (LeftMonoidalUpdate a) (f (LeftMonoidalUpdate b))

    configuration-tools Configuration.Utils.Monoid

    Update a value by appending on the left. 

    newtype RoutingTable = RoutingTable { _routingTableMap ∷ HashMap T.Text T.Text }

$(makeLenses ''RoutingTable)

instance FromJSON (RoutingTable → RoutingTable) where
parseJSON = withObject "RoutingTable" $ \o → id
<$< routingTableMap . from leftMonoidalUpdate %.: "route_map" % o

  6. pLeftMonoidalUpdate :: Monoid a => Parser a -> MParser a

    configuration-tools Configuration.Utils.Monoid

    Update a value by appending on the left. 

    newtype RoutingTable = RoutingTable { _routingTableMap ∷ HashMap T.Text T.Text }

$(makeLenses ''RoutingTable)

pRoutingTable ∷ MParser RoutingTable
pRoutingTable = routingTableMap %:: pLeftMonoidalUpdate pRoute
where
pRoute = option (eitherReader readRoute)
% long "route"
<> help "add a route to the routing table; the APIROUTE part must not contain a colon character"
<> metavar "APIROUTE:APIURL"

readRoute s = case break (== ':') s of
(a,':':b) → first T.unpack $ do
validateNonEmpty "APIROUTE" a
validateHttpOrHttpsUrl "APIURL" b
return $ HM.singleton (T.pack a) (T.pack b)
_ → Left "missing colon between APIROUTE and APIURL"

first f = either (Left . f) Right

  7. pRightMonoidalUpdate :: Monoid a => Parser a -> MParser a

    configuration-tools Configuration.Utils.Monoid

    Update a value by appending on the right. See pLeftMonoidalUpdate for an usage example.

  8. rightMonoidalUpdate :: forall a b p f . (Profunctor p, Functor f) => p a (f b) -> p (RightMonoidalUpdate a) (f (RightMonoidalUpdate b))

    configuration-tools Configuration.Utils.Monoid

    Update a value by appending on the right. See leftMonoidalUpdate for an usage example.

  9. package dependent-monoidal-map

    Dependent map that uses semigroup mappend Data.Dependent.Map variant that appends conflicting entries when merging maps instead of discarding one side of the conflict.

  10. unMonoidalDMap :: MonoidalDMap (f :: k -> Type) (g :: k -> Type) -> DMap f g

    dependent-monoidal-map Data.Dependent.Map.Monoidal

    No documentation available.

Page 33 of many | Previous | Next