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. basicSet :: MVector v a => v s a -> a -> ST s ()

   rebase	Rebase.Data.Vector.Generic.Mutable

   No documentation available.

2. peekSet :: (IsSet t, Store (Element t)) => Peek t

   store	Data.Store.Internal

   Implement peek for an IsSequence of Store instances.

3. pokeSet :: (IsSet t, Store (Element t)) => t -> Poke ()

   store	Data.Store.Internal

   Implement poke for an IsSequence of Store instances.

4. sizeSet :: (IsSet t, Store (Element t)) => Size t

   store	Data.Store.Internal

   Implement size for an IsSet of Store instances.

5. parseTimeRFC2822 :: TextualMonoid t => t -> Maybe ZonedTime

   timerep	Data.Time.RFC2822

   No documentation available.

6. parseTimeRFC3339 :: TextualMonoid t => t -> Maybe ZonedTime

   timerep	Data.Time.RFC3339

   No documentation available.

7. parseTimeRFC822 :: TextualMonoid t => t -> Maybe ZonedTime

   timerep	Data.Time.RFC822

   No documentation available.

8. defaultSettings :: Text -> Settings

   bugsnag	Data.Bugsnag.Settings

   No documentation available.

9. module Data.CharSet

   A CharSet is an efficient representation of a set of Char values designed for fast membership tests. As an example build isAlpha will create a set of alphabetic characters. We can then use member on the generated set to efficiently test if a given Char represents an alphabetic character. Designed to be imported qualified:

   import Data.CharSet (CharSet)
   import qualified Data.CharSet as CharSet
   

10. data CharSet

    charset	Data.CharSet

    Stored as a (possibly negated) IntSet and a fast set used for the head byte. The set of valid (possibly negated) head bytes is stored unboxed as a 32-byte bytestring-based lookup table.

Page 134 of many | Previous | Next