Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

Exact lookup

1. lookupInstance :: [TypeclassInstance] -> Name -> Maybe TypeclassInstance

   th-reify-many	Language.Haskell.TH.ReifyMany.Internal

   Returns the first TypeclassInstance where instanceMatches returns true.

2. lookupBit :: Addr# -> Int -> Int -> Bool

   unicode-data	Unicode.Internal.Bits

   lookupBit addr byteIndex bitIndex looks up the bit stored in the byte at index byteIndex at the bit index bitIndex using a bitmap starting at the address addr. The caller must make sure that the byte at address (addr + byteIndex) is legally accessible memory.

3. lookupWord16AsInt :: Addr# -> Int -> Int

   unicode-data	Unicode.Internal.Bits

   No documentation available.

4. lookupWord16AsInt# :: Addr# -> Int# -> Int#

   unicode-data	Unicode.Internal.Bits

   No documentation available.

5. lookupWord32# :: Addr# -> Int# -> Word#

   unicode-data	Unicode.Internal.Bits

   lookupWord32# addr index looks up for the index-th 32-bits word in the bitmap starting at addr, then convert it to a Word#. The caller must make sure that:

   • ceiling (addr + (n * 32)) is legally accessible Word32#.

6. lookupWord8AsInt :: Addr# -> Int -> Int

   unicode-data	Unicode.Internal.Bits

   lookupWord8AsInt addr index looks up for the index-th 8-bits word in the bitmap starting at addr, then convert it to an Int. The caller must make sure that:

   • ceiling (addr + (n * 8)) is legally accessible Word8#.

7. lookupWord8AsInt# :: Addr# -> Int# -> Int#

   unicode-data	Unicode.Internal.Bits

   No documentation available.

8. lookup' :: forall (ks :: Type -> Type -> Type) k (vs :: Type -> Type -> Type) v m . (MVector ks k, MVector vs v, PrimMonad m, Hashable k, Eq k) => Dictionary (PrimState m) ks k vs v -> k -> m v

   vector-hashtables	Data.Vector.Hashtables

   O(1) in the best case, O(n) in the worst case. Find value by given key in Dictionary. Throws an error if value not found.

9. lookup' :: forall (ks :: Type -> Type -> Type) k (vs :: Type -> Type -> Type) v m . (MVector ks k, MVector vs v, PrimMonad m, Hashable k, Eq k) => Dictionary (PrimState m) ks k vs v -> k -> m v

   vector-hashtables	Data.Vector.Hashtables.Internal

   O(1) in the best case, O(n) in the worst case. Find value by given key in Dictionary. Throws an error if value not found.

10. lookupIndex :: forall (ks :: Type -> Type -> Type) k (vs :: Type -> Type -> Type) v m . (MVector ks k, MVector vs v, PrimMonad m, Hashable k, Eq k) => Dictionary (PrimState m) ks k vs v -> k -> m (Maybe Int)

    vector-hashtables	Data.Vector.Hashtables.Internal

    O(1) in the best case, O(n) in the worst case. Lookup the index of a key, which is its zero-based index in the sequence sorted by keys. The index is a number from 0 up to, but not including, the size of the dictionary.

Page 109 of many | Previous | Next