Hoogle Search

Within LTS Haskell 24.60 (ghc-9.10.3)

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

Exact lookup

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

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

   Agda	Agda.Utils.Trie

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

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

   HSet	Data.HSet.Mutable

   No documentation available.

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

   RefSerialize	Data.RefSerialize.Serialize

   No documentation available.

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

   battleship-combinatorics	Combinatorics.Battleship.Count.Frontier

   No documentation available.

6. lookup :: T -> ShipSize -> NumberOfShips

   battleship-combinatorics	Combinatorics.Battleship.Fleet

   No documentation available.

7. lookup :: DomCod z => z -> Dom z -> Maybe (Cod z)

   bimaps	Data.Bijection.Class

   No documentation available.

8. lookup :: BinList a -> Int -> Maybe a

   binary-list	Data.BinaryList

   O(log n). Lookup an element in the list by its index (starting from 0). If the index is out of range, Nothing is returned.

9. lookup :: ByteString -> Trie a -> Maybe a

   bytestring-trie	Data.Trie

   Return the value associated with a query string if it exists.

10. lookup :: (IsUnit ipkg, IsUnit srcpkg) => GenericInstallPlan ipkg srcpkg -> UnitId -> Maybe (GenericPlanPackage ipkg srcpkg)

    cabal-install	Distribution.Client.InstallPlan

    Lookup a package in the plan.

Page 17 of many | Previous | Next