Hoogle Search

Within LTS Haskell 24.5 (ghc-9.10.2)

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

  1. lookup :: Ord k => k -> PSQ k p -> Maybe p

    PSQueue Data.PSQueue.Internal

    O(log n) The priority of a given key, or Nothing if the key is not bound.

  2. lookup :: Key -> KeyMap v -> Maybe v

    aeson-schemas Data.Aeson.Schema.Utils.Compat

    Return the value to which the specified key is mapped, or Nothing if this map contains no mapping for the key.

  3. lookup :: BCP47 -> Trie a -> Maybe a

    bcp47 Data.BCP47.Trie

    Lookup the most relevant item for a tag "Lookup is used to select the single language tag that best matches the language priority list for a given request...For example, if the language range is 'de-ch', a lookup operation can produce content with the tags de or 'de-CH' but never content with the tag 'de-CH-1996'." https://tools.ietf.org/html/bcp47#page-2-12

  4. lookup :: Bytes -> Map v -> Maybe v

    bytehash Data.Bytes.HashMap

    Returns the value associated with the key in the map.

  5. lookup :: Bytes -> Map -> Maybe Word

    bytehash Data.Bytes.HashMap.Word

    No documentation available.

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

    cabal-install-solver Distribution.Solver.Compat.Prelude

    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"

  7. lookup :: Var QPN -> ConflictSet -> Maybe (Set Conflict)

    cabal-install-solver Distribution.Solver.Modular.ConflictSet

    No documentation available.

  8. lookup :: Eq k => k -> PSQ k v -> Maybe v

    cabal-install-solver Distribution.Solver.Modular.PSQ

    No documentation available.

  9. lookup :: Eq k => k -> WeightedPSQ w k v -> Maybe v

    cabal-install-solver Distribution.Solver.Modular.WeightedPSQ

    O(N). Return the value associated with the first occurrence of the give key, if it exists.

  10. lookup :: (Eq k, Hashable k) => Cache k v -> k -> IO (Maybe v)

    cache Data.Cache

    Lookup an item with the given key, and delete it if it is expired. The function will only return a value if it is present in the cache and if the item is not expired. The function will eagerly delete the item from the cache if it is expired.

Page 13 of many | Previous | Next