Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. data EnumSet k

   enummapset	Data.EnumSet

   Wrapper for IntSet with Enum elements.

2. enumSetToIntSet :: EnumSet k -> IntSet

   enummapset	Data.EnumSet

   Unwrap IntSet.

3. intSetToEnumSet :: IntSet -> EnumSet k

   enummapset	Data.EnumSet

   Wrap IntSet.

4. isProperSubsetOf :: EnumSet k -> EnumSet k -> Bool

   enummapset	Data.EnumSet

   No documentation available.

5. isSubsetOf :: EnumSet k -> EnumSet k -> Bool

   enummapset	Data.EnumSet

   No documentation available.

6. genSetOf :: Ord v => Gen v -> Gen (Set v)

   genvalidity-containers	Data.GenValidity.Set

   No documentation available.

7. shrinkSetOf :: Ord v => (v -> [v]) -> Set v -> [Set v]

   genvalidity-containers	Data.GenValidity.Set

   No documentation available.

8. iterArrayLinearWithSetM_ :: forall r ix e m s . (Load r ix e, MonadPrimBase s m) => Scheduler s () -> Array r ix e -> (Int -> e -> m ()) -> (Ix1 -> Sz1 -> e -> m ()) -> m ()

   massiv	Data.Massiv.Array

   No documentation available.

9. fromByteArrayOffsetM :: (MonadThrow m, Index ix, Prim e) => Comp -> Sz ix -> Int -> ByteArray -> m (Array P ix e)

   massiv	Data.Massiv.Array.Manifest

   O(1) - Construct a primitive array from the ByteArray. Will return Nothing if number of elements doesn't match.

10. fromMutableByteArrayOffsetM :: (MonadThrow m, Index ix, Prim e) => Sz ix -> Ix1 -> MutableByteArray s -> m (MArray s P ix e)

    massiv	Data.Massiv.Array.Manifest

    O(1) - Construct a primitive mutable array from the MutableByteArray. Will throw SizeElementsMismatchException if number of elements doesn't match.

Page 110 of many | Previous | Next