Data.Coolean

Proper documentation is TBD

Documentation

data Cool

Concurrent booleans. Writing properties with the Cool data type often yields faster searches compared to Bool.

Constructors

Atom Bool

Not Cool

And Cool Cool

Seq Cool Cool

Sequential conjunction, the second operator is not evaluated unless the first is true.

Instances

Show Cool

Methods

showsPrec :: Int -> Cool -> ShowS

show :: Cool -> String

showList :: [Cool] -> ShowS

Coolean Cool

Methods

toCool :: Cool -> Cool

toBool :: Cool -> Bool

isCool :: (a -> Cool) -> Bool

true :: Cool

false :: Cool

(&&&) :: (Coolean a, Coolean b) => a -> b -> Cool infixr 2

(|||) :: (Coolean a, Coolean b) => a -> b -> Cool

nott :: Coolean a => a -> Cool

(==>) :: (Coolean a, Coolean b) => a -> b -> Cool

(!=>) :: (Coolean a, Coolean b) => a -> b -> Cool

(!&&) :: (Coolean a, Coolean b) => a -> b -> Cool

(!||) :: (Coolean a, Coolean b) => a -> b -> Cool

class Coolean b where

Provides better interoperability between Bool and Cool by overloading operators.

Minimal complete definition

toCool, toBool, isCool

Methods

toCool :: b -> Cool

toBool :: b -> Bool

isCool :: (a -> b) -> Bool

Instances

Coolean Bool

Methods

toCool :: Bool -> Cool

toBool :: Bool -> Bool

isCool :: (a -> Bool) -> Bool

Coolean Cool

Methods

toCool :: Cool -> Cool

toBool :: Cool -> Bool

isCool :: (a -> Cool) -> Bool

(<&>) :: Cool -> Cool -> Cool

(<&) :: Bool -> Cool -> Cool

(&>) :: Cool -> Bool -> Cool

(&) :: Bool -> Bool -> Cool

(<||>) :: Cool -> Cool -> Cool

data Sched

Constructors

Flip Bool Sched Sched

Unsched

Instances

Eq Sched

Methods

(==) :: Sched -> Sched -> Bool

(/=) :: Sched -> Sched -> Bool

Show Sched

Methods

showsPrec :: Int -> Sched -> ShowS

show :: Sched -> String

showList :: [Sched] -> ShowS

split :: Sched -> Sched

sched0 :: Sched

run :: Sched -> Cool -> Bool

lookahead :: Sched -> Cool -> (Sched, Bool)

par :: Sched -> Cool -> (Sched, Bool)

subsetsc :: IO Int -> Sched -> Cool -> IO (Sched, Bool)