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.

  1. newtype HashSet a

    unordered-containers Data.HashSet.Internal

    A set of values. A set cannot contain duplicate values.

  2. HashSet :: HashMap a () -> HashSet a

    unordered-containers Data.HashSet.Internal

    No documentation available.

  3. isSubsetOf :: 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

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

  5. type ByteOffset = Int64

    binary Data.Binary.Get

    An offset, counted in bytes.

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

    attoparsec Data.Attoparsec.ByteString

    Run a parser and print its result to standard output.

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

    attoparsec Data.Attoparsec.ByteString.Char8

    Run a parser and print its result to standard output.

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

    attoparsec Data.Attoparsec.ByteString.Lazy

    Run a parser and print its result to standard output.

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

    attoparsec Data.Attoparsec.Text

    Run a parser and print its result to standard output.

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

    attoparsec Data.Attoparsec.Text.Lazy

    Run a parser and print its result to standard output.

Page 78 of many | Previous | Next