Adaptive-Blaisorblade-0.23: Library for incremental computing.

Safe HaskellNone

Control.Monad.Adaptive.OrderedList

Documentation

data Record m r a Source

data OrderedList m r a b Source

Instances

Ref m r => Monad (OrderedList m r a) 
Ref m r => Functor (OrderedList m r a) 
(EqRef r, Functor (OrderedList m r a), Monad (OrderedList m r a), Ref m r) => Ref (OrderedList m r a) r 
Enum (OrderedList m r a b) 
Eq (OrderedList m r a b) 
(Real (OrderedList m r a b), Enum (OrderedList m r a b), Ref m r, Integral b) => Integral (OrderedList m r a b) 
(Ref m r, Num b) => Num (OrderedList m r a b) 
Eq (OrderedList m r a b) => Ord (OrderedList m r a b) 
(Num (OrderedList m r a b), Ord (OrderedList m r a b), Ref m r, Real b) => Real (OrderedList m r a b) 
Show (OrderedList m r a b) 

rval :: Ref m r => Record m r a -> OrderedList m r a aSource

next :: Ref m r => Record m r a -> OrderedList m r a (Record m r a)Source

order :: Ref m r => Record m r a -> Record m r a -> OrderedList m r a OrderingSource

delete :: Ref m r => Record m r a -> OrderedList m r a ()Source

spliceOut :: Ref m r => Record m r a -> Record m r a -> OrderedList m r a ()Source

deleted :: Ref m r => Record m r a -> OrderedList m r a BoolSource

insert :: Ref m r => Record m r a -> a -> OrderedList m r a (Record m r a)Source

base :: Ref m r => OrderedList m r a (Record m r a)Source

run :: Ref m r => OrderedList m r a b -> m bSource

inM :: Ref m r => m b -> OrderedList m r a bSource

record :: Ref m r => Record m r a -> OrderedList m r a (Bool, Integer, a)Source