reactive-0.11.3: Push-pull functional reactive programming Source code Contents Index

FRP.Reactive.Improving Stability experimental Maintainer conal@conal.net

Description

Improving values -- efficient version

Synopsis

data Improving a = Imp { exact :: a compareI :: a -> Ordering } exactly :: Ord a => a -> Improving a before :: Ord a => a -> Improving a after :: Ord a => a -> Improving a minI :: Ord a => Improving a -> Improving a -> (Improving a, Bool) maxI :: Ord a => Improving a -> Improving a -> (Improving a, Bool) batch :: TestBatch

Documentation

data Improving a Source

An improving value. Constructors Imp 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 a Source

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

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

A value known to be < x.

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

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 '(>=)'

batch :: TestBatch Source

Produced by Haddock version 2.6.0