Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

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

    battleship-combinatorics Combinatorics.Battleship.Count.Frontier

    No documentation available.

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

    battleship-combinatorics Combinatorics.Battleship.Fleet

    No documentation available.

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

    bimaps Data.Bijection.Class

    No documentation available.

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

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

    bytestring-trie Data.Trie

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

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

    cabal-install Distribution.Client.InstallPlan

    Lookup a package in the plan.

  7. lookup :: Ord p => p -> LexTree p a -> Maybe a

    calligraphy Calligraphy.Util.LexTree

    No documentation available.

  8. lookup :: Uniquable a => a -> UniqMap b -> Maybe b

    clash-lib Clash.Data.UniqMap

    Lookup an item in the map, using the unique of the given key.

  9. lookup :: Ord k => k -> CompactMap k v -> Maybe v

    compactmap Data.CompactMap

    No documentation available.

  10. lookup :: forall (vec :: Type -> Type) v k . (Vector vec v, Ord k) => k -> CompactMap vec k v -> Maybe v

    compactmap Data.CompactMap.Generic

    No documentation available.

Page 17 of many | Previous | Next