Hoogle Search

Within LTS Haskell 24.10 (ghc-9.10.2)

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

  1. lookup :: Ord k => Group s k -> k -> IO (Maybe (W s))

    glfw-group Graphics.UI.GlfwG.Window

    No documentation available.

  2. lookup :: forall k (c :: Type -> Type) v . (PMapKey k, NonEmptyLike c) => k -> PMap c v -> Maybe v

    greskell Data.Greskell.AsLabel

    Lookup the first value for the key from PMap.

  3. lookup :: forall k (c :: Type -> Type) v . (PMapKey k, NonEmptyLike c) => k -> PMap c v -> Maybe v

    greskell Data.Greskell.PMap

    Lookup the first value for the key from PMap.

  4. lookup :: (Hashable k, Ord k) => k -> Map k a -> Maybe a

    hashmap Data.HashMap

    Lookup the value at a key in the map.

  5. lookup :: Eq a => a -> [(a, b)] -> Maybe b

    hledger-web Hledger.Web.Import

    lookup key assocs looks up a key in an association list. For the result to be Nothing, the list must be finite.

    Examples

    >>> lookup 2 []
Nothing

    >>> lookup 2 [(1, "first")]
Nothing

    >>> lookup 2 [(1, "first"), (2, "second"), (3, "third")]
Just "second"

  6. lookup :: FromParam a => Param -> QueryData -> Maybe a

    hyperbole Web.Hyperbole.Data.QueryData

    No documentation available.

  7. lookup :: Param -> Cookies -> Maybe ParamValue

    hyperbole Web.Hyperbole.Data.Session

    No documentation available.

  8. lookup :: Ord x => T x y -> x -> (Maybe (x, y), Maybe (x, y))

    interpolation Numeric.Interpolation.NodeList 

    >>> Nodes.lookup (Nodes.fromList ([(0,'a'),(2::Int,'b')])) (-1)
(Nothing,Just (0,'a'))

>>> Nodes.lookup (Nodes.fromList ([(0,'a'),(2::Int,'b')])) 0
(Just (0,'a'),Just (2,'b'))

>>> Nodes.lookup (Nodes.fromList ([(0,'a'),(2::Int,'b')])) 1
(Just (0,'a'),Just (2,'b'))

>>> Nodes.lookup (Nodes.fromList ([(0,'a'),(2::Int,'b')])) 2
(Just (2,'b'),Nothing)

>>> Nodes.lookup (Nodes.fromList ([(0,'a'),(2::Int,'b')])) 3
(Just (2,'b'),Nothing)

>>> Nodes.lookup (Nodes.fromList ([(0,'a'),(2,'b'),(5::Int,'c')])) 3
(Just (2,'b'),Just (5,'c'))

  9. lookup :: (Eq a, Eq b) => [(a, b)] -> Maybe a <-> Maybe b

    invertible Data.Invertible.List

    Bi-directional lookup.

  10. lookup :: Ord k => Key ph k -> Map ph k v -> v

    justified-containers Data.Map.Justified

    O(log n). Lookup the value at a key, known to be in the map. The result is a v rather than a Maybe v, because the proof obligation that the key is in the map must already have been discharged to obtain a value of type Key ph k.

Page 19 of many | Previous | Next