Hoogle Search
Within LTS Haskell 24.42 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
PublicKey :: Int -> Integer -> Integer -> PublicKeyRSA Codec.Crypto.RSA.Pure No documentation available.
Plane :: V3 a -> Color -> Color -> VisObject aVis Vis No documentation available.
Points :: [V3 a] -> Maybe GLfloat -> Color -> VisObject aVis Vis No documentation available.
Plane :: V3 a -> Color -> Color -> VisObject aVis Vis.VisObject No documentation available.
Points :: [V3 a] -> Maybe GLfloat -> Color -> VisObject aVis Vis.VisObject No documentation available.
class Monad m =>
ParFuture (future :: Type -> Type) (m :: Type -> Type) | m -> futureabstract-par Control.Monad.Par.Class ParFuture captures the class of Par monads which support futures. This level of functionality subsumes par/pseq and is similar to the Control.Parallel.Strategies.Eval monad. A minimal implementation consists of spawn_ and get. However, for monads that are also a member of ParIVar it is typical to simply define spawn in terms of fork, new, and put.
class ParFuture ivar m =>
ParIVar (ivar :: Type -> Type) (m :: Type -> Type) | m -> ivarabstract-par Control.Monad.Par.Class ParIVar builds on futures by adding full anyone-writes, anyone-reads IVars. These are more expressive but may not be supported by all distributed schedulers. A minimal implementation consists of fork, put_, and new.
class
ParUnsafe (iv :: Type -> Type) (p :: Type -> Type) | p -> ivabstract-par Control.Monad.Par.Unsafe The class of Par monads that provide unsafe functionality.
-
AcidState container without a transaction log. Mostly used for testing. This module consists of internal implementation details for Data.Acid.Memory. You should not normally need to import it. Call openMemoryState and thereafter use the API from Data.Acid instead.
module AERN2.MP.Ball.
PreludeOps Instances of Prelude classes Eq, Ord, Num etc