Hoogle Search
Within LTS Haskell 24.67 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
readPrec_to_S :: ReadPrec a -> Int -> ReadS arebase Rebase.Prelude No documentation available.
readS_to_Prec :: (Int -> ReadS a) -> ReadPrec arebase Rebase.Prelude No documentation available.
readTBQueue :: TBQueue a -> STM arebase Rebase.Prelude Read the next value from the TBQueue.
-
rebase Rebase.Prelude Read the next value from the TChan.
-
rebase Rebase.Prelude This is a combination of takeTMVar and putTMVar; ie. it takes the value from the TMVar, puts it back, and also returns it.
readTQueue :: TQueue a -> STM arebase Rebase.Prelude Read the next value from the TQueue.
-
rebase Rebase.Prelude Return the current value stored in a TVar.
-
rebase Rebase.Prelude Return the current value stored in a TVar. This is equivalent to
readTVarIO = atomically . readTVar
but works much faster, because it doesn't perform a complete transaction, it just reads the current value of the TVar. -
rebase Rebase.Prelude equivalent to readsPrec with a precedence of 0.
readsPrec :: Read a => Int -> ReadS arebase Rebase.Prelude attempts to parse a value from the front of the string, returning a list of (parsed value, remaining string) pairs. If there is no successful parse, the returned list is empty. Derived instances of Read and Show satisfy the following:
That is, readsPrec parses the string produced by showsPrec, and delivers the value that showsPrec started with.