Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. lookup :: (Ord k, Semigroup v) => k -> AnnotatedMap k v a -> Maybe (v, a)

    what4 What4.Utils.AnnotatedMap

    No documentation available.

  2. lookup :: Exp -> MemberId -> Exp

    Agda Agda.Compiler.JS.Substitution

    No documentation available.

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

    Agda Agda.Utils.AssocList

    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"

  4. lookup :: Ord k => k -> BiMap k v -> Maybe v

    Agda Agda.Utils.BiMap

    Lookup. O(log n).

  5. lookup :: Ord n => n -> n -> Graph n e -> Maybe e

    Agda Agda.Utils.Graph.AdjacencyMap.Unidirectional

    If there is an edge from s to t, then lookup s t g is Just e, where e is the edge's label. O(log n).

  6. lookup :: (Eq k, Hashable k) => HashTable k v -> k -> IO (Maybe v)

    Agda Agda.Utils.HashTable

    Tries to find a value corresponding to the key in the hash table.

  7. lookup :: Ord k => [k] -> Trie k v -> Maybe v

    Agda Agda.Utils.Trie

    Returns the value associated with the given key, if any.

  8. lookup :: Typeable a => HKey a -> HSet s -> ST s (Maybe a)

    HSet Data.HSet.Mutable

    No documentation available.

  9. lookup :: (HashTable h, Hashable k) => k -> h RealWorld k v -> Maybe v

    RefSerialize Data.RefSerialize.Serialize

    No documentation available.

  10. lookup :: Nat w => T w -> Position -> Use

    battleship-combinatorics Combinatorics.Battleship.Count.Frontier

    No documentation available.

Page 16 of many | Previous | Next