Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

Exact lookup

1. lookupList :: forall k (c :: Type -> Type) v . (PMapKey k, NonEmptyLike c) => k -> PMap c v -> [v]

   greskell	Data.Greskell.PMap

   Lookup all items for the key. If there is no item for the key, it returns an empty list.

2. lookupListAs :: forall k (c :: Type -> Type) a . (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException (NonEmpty a)

   greskell	Data.Greskell.PMap

   Look up the values and parse them into a.

3. lookupListAs' :: forall k (c :: Type -> Type) a . (PMapKey k, NonEmptyLike c, PMapValue k ~ Maybe a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException [Maybe a]

   greskell	Data.Greskell.PMap

   Similar to lookupListAs, but this function accepts null results. If the key k is not found in the map, it returns an empty list. If the key k is found and nulls are included in the values, they are obtained as Nothing.

4. lookupM :: forall k (c :: Type -> Type) m v . (PMapKey k, NonEmptyLike c, MonadThrow m) => k -> PMap c v -> m v

   greskell	Data.Greskell.PMap

   MonadThrow version of lookup. If there is no value for the key, it throws PMapNoSuchKey.

5. lookupQuantified :: forall (knd :: SymbolKind) . (HasCallStack, IsSymbolKind knd) => SomeTypedSymbol knd -> QuantifiedStack -> Maybe Dynamic

   grisette	Grisette.Internal.Backend.QuantifiedStack

   Look up a quantified symbol in the stack.

6. lookupTerm :: HasCallStack => SomeTerm -> SymBiMap -> Maybe (QuantifiedStack -> Dynamic)

   grisette	Grisette.Internal.Backend.SymBiMap

   Look up an sbv value with a symbolic Grisette term in the bidirectional map.

7. lookupString :: String -> Metadata -> Maybe String

   hakyll	Hakyll.Core.Metadata

   No documentation available.

8. lookupStringList :: String -> Metadata -> Maybe [String]

   hakyll	Hakyll.Core.Metadata

   No documentation available.

9. lookupTemplate :: forall (n :: Type -> Type) t . ByteString -> HeistState n -> (HeistState n -> HashMap TPath t) -> Maybe (t, TPath)

   heist	Heist

   Convenience function for looking up a template.

10. lookupSplice :: forall (n :: Type -> Type) . Text -> HeistState n -> Maybe (Splice n)

    heist	Heist.Interpreted

    Convenience function for looking up a splice.

Page 95 of many | Previous | Next