reactive-0.11.5: Push-pull functional reactive programming

Stabilityexperimental
Maintainerconal@conal.net

FRP.Reactive.Improving

Description

Improving values -- efficient version

Synopsis

Documentation

data Improving a Source

An improving value.

Constructors

Imp 

Fields

exact :: a
 
compareI :: a -> Ordering
 

Instances

(Ord a, Bounded a) => Bounded (Improving a) 
Eq a => Eq (Improving a) 
Ord a => Ord (Improving a) 
Show a => Show (Improving a) 
(Ord a, Arbitrary a) => Arbitrary (Improving a) 
CoArbitrary a => CoArbitrary (Improving a) 
EqProp a => EqProp (Improving a) 
Model (Improving a) a 

exactly :: Ord a => a -> Improving aSource

A known improving value (which doesn't really improve)

before :: Ord a => a -> Improving aSource

A value known to be < x.

after :: Ord a => a -> Improving aSource

A value known to be > x.

minI :: Ord a => Improving a -> Improving a -> (Improving a, Bool)Source

Efficient combination of min and '(<=)'

maxI :: Ord a => Improving a -> Improving a -> (Improving a, Bool)Source

Efficient combination of max and '(>=)'