 dphbase0.3: Basic Definitions for DataParallel Haskell.  Contents  Index 

Data.Array.Parallel.Base  Portability  nonportable (unboxed values and GHC libraries)  Stability  internal  Maintainer  Roman Leshchinskiy <rl@cse.unsw.edu.au> 





Description 
Interface to the Base modules


Synopsis 



Documentation 

check :: String > Int > Int > a > a 

checkCritical :: String > Int > Int > a > a 

checkLen :: String > Int > Int > a > a 

checkEq :: (Eq a, Show a) => String > String > a > a > b > b 

checkNotEmpty :: String > Int > a > a 

uninitialised :: String > a 

Strict pairs


data a :*: b 
Strict pair
 Constructors   Instances  


fstS :: (a :*: b) > a 

sndS :: (a :*: b) > b 

pairS :: (a, b) > a :*: b 

unpairS :: (a :*: b) > (a, b) 

curryS :: ((a :*: b) > c) > a > b > c 

uncurryS :: (a > b > c) > (a :*: b) > c 

unsafe_pairS :: (a, b) > a :*: b 
Same as pairS but comes with the unsafe rule
unsafe_unpairS . unsafe_pairS = id


unsafe_unpairS :: (a :*: b) > (a, b) 
Same as unpairS but comes with the unsafe rule
unsafe_unpairS . unsafe_pairS = id


Strict sums


data EitherS a b 
Strict sum
 Constructors   Instances  


Strict Maybe


data MaybeS a 
Strict Maybe
 Constructors   Instances  


maybeS :: b > (a > b) > MaybeS a > b 

fromMaybeS :: a > MaybeS a > a 

Lazy wrapper


data Lazy a 
Constructors   Instances  


Class of hyperstrict types


class HS a 
The class of hyperstrict types. These are those types for which weak
headnormal form and normal form are the same.
That is, once they are evaluated to WHNF, they are guaranteed to
contain no thunks
  Instances  


fromBool :: Num a => Bool > a 

toBool :: Num a => a > Bool 

showsApp :: Show a => Int > String > a > ShowS 

readApp :: Read a => String > ReadPrec a 

readsApp :: Read a => Int > String > ReadS a 

class Rebox a where 
 Methods  rebox :: a > a   dseq :: a > b > b 
  Instances  


newtype Box a 
Constructors   Instances  


Produced by Haddock version 2.3.0 