Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. unlistenAll :: (HasCallStack, MonadDB m) => m ()

    hpqtypes Database.PostgreSQL.PQTypes.Notification

    Cancel all listener registrations for the current session.

  2. cfgFromList :: [(SectionName, [(OptionName, OptionValue)])] -> Config

    hsini Data.Ini.Types

    No documentation available.

  3. cfgToList :: Config -> [(SectionName, [(OptionName, OptionValue)])]

    hsini Data.Ini.Types

    No documentation available.

  4. type family InList x (xs :: [Type]) :: Nat

    hvect Data.HVect

    No documentation available.

  5. type family MaybeToList (a :: Maybe Type) :: [Type]

    hvect Data.HVect

    No documentation available.

  6. type family NotInList x (xs :: [Type]) :: Bool

    hvect Data.HVect

    No documentation available.

  7. fromList :: (Ord k, MonoidNull v) => [(k, v)] -> MonoidMap k v

    monoidmap Data.MonoidMap

    Constructs a MonoidMap from a list of key-value pairs. If the list contains more than one value for the same key, values are combined together in the order that they appear with the (<>) operator. Satisfies the following property for all possible keys k: 

    get k (fromList kvs) ==
foldMap snd (filter ((== k) . fst) kvs)
    Satisfies the following round-trip property: 
    fromList (toList m) == m

    Examples

    With String values: 
    >>> fromList [(1,"a"), (2,"x"), (1,"b"), (2,"y"), (1,"c"), (2,"z")]
fromList [(1,"abc"), (2,"xyz")]

  8. fromListWith :: (Ord k, MonoidNull v) => (v -> v -> v) -> [(k, v)] -> MonoidMap k v

    monoidmap Data.MonoidMap

    Constructs a MonoidMap from a list of key-value pairs, with a combining function for values. If the list contains more than one value for the same key, values are combined together in the order that they appear with the given combining function. Satisfies the following property for all possible keys k: 

    get k (fromListWith f kvs) ==
maybe mempty (foldl1 f)
(nonEmpty (snd <$> filter ((== k) . fst) kvs))

  9. toList :: MonoidMap k v -> [(k, v)]

    monoidmap Data.MonoidMap

    Converts a MonoidMap to a list of key-value pairs, where the keys are in ascending order. The result only includes entries with values that are not null. Satisfies the following round-trip property: 

    fromList (toList m) == m
    The resulting list is sorted in ascending key order: 
    sortOn fst (toList m) == toList m

  10. ResList :: [ResolverValue m] -> ResolverValue (m :: Type -> Type)

    morpheus-graphql-app Data.Morpheus.App.Internal.Resolving

    No documentation available.

Page 148 of many | Previous | Next