Hoogle Search

Within LTS Haskell 24.12 (ghc-9.10.3)

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

Exact lookup

1. lookupGT :: Int -> PrimeIntSet -> Maybe (Prime Int)

   arithmoi	Math.NumberTheory.Primes.IntSet

   Find the smallest prime in the set, greater than the given integer, if any exists.

2. lookupLE :: Int -> PrimeIntSet -> Maybe (Prime Int)

   arithmoi	Math.NumberTheory.Primes.IntSet

   Find the largest prime in the set, smaller or equal to the given integer, if any exists.

3. lookupLT :: Int -> PrimeIntSet -> Maybe (Prime Int)

   arithmoi	Math.NumberTheory.Primes.IntSet

   Find the largest prime in the set, smaller than the given integer, if any exists.

4. lookupRanges :: Eq b => b -> [Range b a] -> Maybe (Range b a)

   binary-search	Numeric.Search

   Look up for the first Range with the given predicate.

5. lookupPosixAsciiCharSet :: String -> Maybe CharSet

   charset	Data.CharSet.Posix

   No documentation available.

6. lookupPosixUnicodeCharSet :: String -> Maybe CharSet

   charset	Data.CharSet.Posix

   No documentation available.

7. lookupPosixAsciiCharSet :: String -> Maybe CharSet

   charset	Data.CharSet.Posix.Ascii

   No documentation available.

8. lookupPosixUnicodeCharSet :: String -> Maybe CharSet

   charset	Data.CharSet.Posix.Unicode

   No documentation available.

9. lookupBlock :: String -> Maybe Block

   charset	Data.CharSet.Unicode.Block

   No documentation available.

10. lookupBlockCharSet :: String -> Maybe CharSet

    charset	Data.CharSet.Unicode.Block

    No documentation available.

Page 103 of many | Previous | Next