Hoogle Search

Within LTS Haskell 24.65 (ghc-9.10.3)

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

Exact lookup

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

   errors	Control.Error

   No documentation available.

2. 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.

3. 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.

4. 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.

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

   xml	Text.XML.Light.Proc

   Lookup attribute name from list.

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

   xml	Text.XML.Light.Proc

   Lookup the first attribute whose name satisfies the given predicate.

7. lookupCurveNameByOID :: OID -> Maybe CurveName

   crypton-x509	Data.X509.EC

   Return the curve name associated to an OID

8. 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.

9. lookupSub :: forall nm b (v :: Type -> Type) n m . IsName nm => nm -> SubMap b v n m -> Maybe [Subdiagram b v n m]

   diagrams-lib	Diagrams.Names

   Look for the given name in a name map, returning a list of subdiagrams associated with that name. If no names match the given name exactly, return all the subdiagrams associated with names of which the given name is a suffix.

10. lookupOf :: Eq k => Getting (Endo (Maybe v)) s (k, v) -> k -> s -> Maybe v

    diagrams-lib	Diagrams.Prelude

    The lookupOf function takes a Fold (or Getter, Traversal, Lens, Iso, etc.), a key, and a structure containing key/value pairs. It returns the first value corresponding to the given key. This function generalizes lookup to work on an arbitrary Fold instead of lists.

    >>> lookupOf folded 4 [(2, 'a'), (4, 'b'), (4, 'c')]
    Just 'b'
    

    >>> lookupOf each 2 [(2, 'a'), (4, 'b'), (4, 'c')]
    Just 'a'
    

    lookupOf :: Eq k => Fold s (k,v) -> k -> s -> Maybe v
    

Page 71 of many | Previous | Next