search-0.2: Infinite search in finite time with Hilbert's epsilon

Safe HaskellSafe
LanguageHaskell98

Data.Search.LazyBool

Synopsis

Documentation

newtype B Source #

Bool with a lazier Ord as suggested here

Constructors

B Bool 

Instances

Eq B Source # 

Methods

(==) :: B -> B -> Bool #

(/=) :: B -> B -> Bool #

Ord B Source # 

Methods

compare :: B -> B -> Ordering #

(<) :: B -> B -> Bool #

(<=) :: B -> B -> Bool #

(>) :: B -> B -> Bool #

(>=) :: B -> B -> Bool #

max :: B -> B -> B #

min :: B -> B -> B #

Read B Source # 
Show B Source # 

Methods

showsPrec :: Int -> B -> ShowS #

show :: B -> String #

showList :: [B] -> ShowS #