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. c_call_inflate_set_dictionary :: ZStream' -> Ptr CChar -> CUInt -> IO CInt

   streaming-commons	Data.Streaming.Zlib.Lowlevel

   No documentation available.

2. c_set_avail_in :: ZStream' -> Ptr CChar -> CUInt -> IO ()

   streaming-commons	Data.Streaming.Zlib.Lowlevel

   No documentation available.

3. c_set_avail_out :: ZStream' -> Ptr CChar -> CUInt -> IO ()

   streaming-commons	Data.Streaming.Zlib.Lowlevel

   No documentation available.

4. fromSetGet :: (a -> r -> r) -> (r -> a) -> T r a

   data-accessor	Data.Accessor.Basic

   No documentation available.

5. keysSet :: Ord k => T k a -> T k

   non-empty	Data.NonEmpty.Map

   No documentation available.

6. sort2ByOffset :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> Int -> m ()

   vector-algorithms	Data.Vector.Algorithms.Optimal

   Sorts the elements at the positions off and 'off + 1' in the given array using the comparison.

7. sort3ByOffset :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> Int -> m ()

   vector-algorithms	Data.Vector.Algorithms.Optimal

   Sorts the three elements starting at the given offset in the array.

8. sort4ByOffset :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> Int -> m ()

   vector-algorithms	Data.Vector.Algorithms.Optimal

   Sorts the four elements beginning at the offset.

9. class SetContainer set => HasKeysSet set

   mono-traversable	Data.Containers

   Type class for maps whose keys can be converted into sets.

10. class (SetContainer set, Element set ~ ContainerKey set) => IsSet set

    mono-traversable	Data.Containers

    Polymorphic typeclass for interacting with different set types

Page 95 of many | Previous | Next