Hoogle Search

Within Stackage Nightly 2025-10-09 (ghc-9.12.2)

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

  1. isSubsetOf :: (Eq a, Hashable a) => HashSet a -> HashSet a -> Bool

    unordered-containers Data.HashSet.Internal

    Inclusion of sets.

    Examples

    >>> fromList [1,3] `isSubsetOf` fromList [1,2,3]
True

    >>> fromList [1,2] `isSubsetOf` fromList [1,3]
False

  2. keysSet :: HashMap k a -> HashSet k

    unordered-containers Data.HashSet.Internal

    Produce a HashSet of all the keys in the given HashMap. 

    >>> HashSet.keysSet (HashMap.fromList [(1, "a"), (2, "b")]
fromList [1,2]

  3. type ByteOffset = Int64

    binary Data.Binary.Get

    An offset, counted in bytes.

  4. parseTest :: Show a => Parser a -> ByteString -> IO ()

    attoparsec Data.Attoparsec.ByteString

    Run a parser and print its result to standard output.

  5. parseTest :: Show a => Parser a -> ByteString -> IO ()

    attoparsec Data.Attoparsec.ByteString.Char8

    Run a parser and print its result to standard output.

  6. parseTest :: Show a => Parser a -> ByteString -> IO ()

    attoparsec Data.Attoparsec.ByteString.Lazy

    Run a parser and print its result to standard output.

  7. parseTest :: Show a => Parser a -> Text -> IO ()

    attoparsec Data.Attoparsec.Text

    Run a parser and print its result to standard output.

  8. parseTest :: Show a => Parser a -> Text -> IO ()

    attoparsec Data.Attoparsec.Text.Lazy

    Run a parser and print its result to standard output.

  9. parseT :: Monad m => ZeptoT m a -> ByteString -> m (Either String a)

    attoparsec Data.Attoparsec.Zepto

    Run a parser on top of the given base monad.

  10. defaultSetByteArray# :: Prim a => MutableByteArray# s -> Int# -> Int# -> a -> State# s -> State# s

    primitive Data.Primitive.Types

    An implementation of setByteArray# that calls writeByteArray# to set each element. This is helpful when writing a Prim instance for a multi-word data type for which there is no CPU-accelerated way to broadcast a value to contiguous memory. It is typically used alongside defaultSetOffAddr#. For example: 

    data Trip = Trip Int Int Int

instance Prim Trip
sizeOfType# _ = 3# *# sizeOfType# (proxy# :: Proxy# Int)
alignmentOfType# _ = alignmentOfType# (proxy# :: Proxy# Int)
indexByteArray# arr# i# = ...
readByteArray# arr# i# = ...
writeByteArray# arr# i# (Trip a b c) =
\s0 -> case writeByteArray# arr# (3# *# i#) a s0 of
s1 -> case writeByteArray# arr# ((3# *# i#) +# 1#) b s1 of
s2 -> case writeByteArray# arr# ((3# *# i#) +# 2# ) c s2 of
s3 -> s3
setByteArray# = defaultSetByteArray#
indexOffAddr# addr# i# = ...
readOffAddr# addr# i# = ...
writeOffAddr# addr# i# (Trip a b c) =
\s0 -> case writeOffAddr# addr# (3# *# i#) a s0 of
s1 -> case writeOffAddr# addr# ((3# *# i#) +# 1#) b s1 of
s2 -> case writeOffAddr# addr# ((3# *# i#) +# 2# ) c s2 of
s3 -> s3
setOffAddr# = defaultSetOffAddr#

Page 76 of many | Previous | Next