Hoogle Search

Within LTS Haskell 24.26 (ghc-9.10.3)

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

Exact lookup

1. lookupMin :: Set a -> Maybe a

   rio	RIO.Set

   The minimal element of a set.

2. lookupHeader :: HeaderName -> [Header] -> Maybe String

   HTTP	Network.HTTP.Headers

   lookupHeader hdr hdrs locates the first header matching hdr in the list hdrs.

3. lookupJustDef :: Eq a => b -> a -> [(a, b)] -> b

   errors	Control.Error

   No documentation available.

4. lookupIndex :: (HashTable h, Eq k, Hashable k) => h s k v -> k -> ST s (Maybe Word)

   hashtables	Data.HashTable.Class

   Looks up the index of a key-value mapping in a hash table suitable for passing to nextByIndex.

5. lookupIndex :: (HashTable h, Eq k, Hashable k) => IOHashTable h k v -> k -> IO (Maybe Word)

   hashtables	Data.HashTable.IO

   See the documentation for this function in lookupIndex.

6. lookupIndex :: (Hashable k, Eq k) => HashTable s k v -> k -> ST s (Maybe Word)

   hashtables	Data.HashTable.ST.Cuckoo

   Find index of given key in the hashtable.

7. lookupAttr :: QName -> [Attr] -> Maybe String

   xml	Text.XML.Light.Proc

   Lookup attribute name from list.

8. lookupAttrBy :: (QName -> Bool) -> [Attr] -> Maybe String

   xml	Text.XML.Light.Proc

   Lookup the first attribute whose name satisfies the given predicate.

9. lookupCurveNameByOID :: OID -> Maybe CurveName

   crypton-x509	Data.X509.EC

   Return the curve name associated to an OID

10. lookupName :: forall nm (v :: Type -> Type) m n b . (IsName nm, Metric v, Semigroup m, OrderedField n) => nm -> QDiagram b v n m -> Maybe (Subdiagram b v n m)

    diagrams-lib	Diagrams.Names

    Lookup the most recent diagram associated with (some qualification of) the given name.

Page 71 of many | Previous | Next