Reflex.Pure

Documentation

data Pure (t :: Type)

A completely pure-functional Reflex timeline, identifying moments in time with the type t.

Instances

(Enum t, HasTrie t, Ord t) => Reflex (Pure t :: Type)

The Enum instance of t must be dense: for all x :: t, there must not exist any y :: t such that pred x < y < x. The HasTrie instance will be used exclusively to memoize functions of t, not for any of its other capabilities.

Defined in Reflex.Pure

Associated Types

data Behavior (Pure t) :: Type -> Type

data Event (Pure t) :: Type -> Type

data Dynamic (Pure t) :: Type -> Type

data Incremental (Pure t) :: Type -> Type

type PushM (Pure t) :: Type -> Type

type PullM (Pure t) :: Type -> Type

Methods

never :: Event (Pure t) a

constant :: a -> Behavior (Pure t) a

push :: (a -> PushM (Pure t) (Maybe b)) -> Event (Pure t) a -> Event (Pure t) b

pushCheap :: (a -> PushM (Pure t) (Maybe b)) -> Event (Pure t) a -> Event (Pure t) b

pull :: PullM (Pure t) a -> Behavior (Pure t) a

mergeG :: forall k (k :: k -> Type) q v. GCompare k => (forall (a :: k). q a -> Event (Pure t) (v a)) -> DMap k q -> Event (Pure t) (DMap k v)

fanG :: forall k (k :: k -> Type) (v :: k -> Type). GCompare k => Event (Pure t) (DMap k v) -> EventSelectorG (Pure t) k v

switch :: Behavior (Pure t) (Event (Pure t) a) -> Event (Pure t) a

coincidence :: Event (Pure t) (Event (Pure t) a) -> Event (Pure t) a

current :: Dynamic (Pure t) a -> Behavior (Pure t) a

updated :: Dynamic (Pure t) a -> Event (Pure t) a

unsafeBuildDynamic :: PullM (Pure t) a -> Event (Pure t) a -> Dynamic (Pure t) a

unsafeBuildIncremental :: Patch p => PullM (Pure t) (PatchTarget p) -> Event (Pure t) p -> Incremental (Pure t) p

mergeIncrementalG :: forall k (k :: k -> Type) q v. GCompare k => (forall (a :: k). q a -> Event (Pure t) (v a)) -> Incremental (Pure t) (PatchDMap k q) -> Event (Pure t) (DMap k v)

mergeIncrementalWithMoveG :: forall k (k :: k -> Type) q v. GCompare k => (forall (a :: k). q a -> Event (Pure t) (v a)) -> Incremental (Pure t) (PatchDMapWithMove k q) -> Event (Pure t) (DMap k v)

currentIncremental :: Patch p => Incremental (Pure t) p -> Behavior (Pure t) (PatchTarget p)

updatedIncremental :: Patch p => Incremental (Pure t) p -> Event (Pure t) p

incrementalToDynamic :: Patch p => Incremental (Pure t) p -> Dynamic (Pure t) (PatchTarget p)

behaviorCoercion :: Coercion a b -> Coercion (Behavior (Pure t) a) (Behavior (Pure t) b)

eventCoercion :: Coercion a b -> Coercion (Event (Pure t) a) (Event (Pure t) b)

dynamicCoercion :: Coercion a b -> Coercion (Dynamic (Pure t) a) (Dynamic (Pure t) b)

incrementalCoercion :: Coercion (PatchTarget a) (PatchTarget b) -> Coercion a b -> Coercion (Incremental (Pure t) a) (Incremental (Pure t) b)

mergeIntIncremental :: Incremental (Pure t) (PatchIntMap (Event (Pure t) a)) -> Event (Pure t) (IntMap a)

fanInt :: Event (Pure t) (IntMap a) -> EventSelectorInt (Pure t) a

(Enum t, HasTrie t, Ord t) => MonadHold (Pure t :: Type) ((->) t :: Type -> Type)

Defined in Reflex.Pure

Methods

hold :: a -> Event (Pure t) a -> t -> Behavior (Pure t) a

holdDyn :: a -> Event (Pure t) a -> t -> Dynamic (Pure t) a

holdIncremental :: Patch p => PatchTarget p -> Event (Pure t) p -> t -> Incremental (Pure t) p

buildDynamic :: PushM (Pure t) a -> Event (Pure t) a -> t -> Dynamic (Pure t) a

headE :: Event (Pure t) a -> t -> Event (Pure t) a

MonadSample (Pure t :: Type) ((->) t :: Type -> Type)

Defined in Reflex.Pure

Methods

sample :: Behavior (Pure t) a -> t -> a

Monad (Dynamic (Pure t))

Defined in Reflex.Pure

Methods

(>>=) :: Dynamic (Pure t) a -> (a -> Dynamic (Pure t) b) -> Dynamic (Pure t) b

(>>) :: Dynamic (Pure t) a -> Dynamic (Pure t) b -> Dynamic (Pure t) b

return :: a -> Dynamic (Pure t) a

Functor (Dynamic (Pure t))

Defined in Reflex.Pure

Methods

fmap :: (a -> b) -> Dynamic (Pure t) a -> Dynamic (Pure t) b

(<$) :: a -> Dynamic (Pure t) b -> Dynamic (Pure t) a

Applicative (Dynamic (Pure t))

Defined in Reflex.Pure

Methods

pure :: a -> Dynamic (Pure t) a

(<*>) :: Dynamic (Pure t) (a -> b) -> Dynamic (Pure t) a -> Dynamic (Pure t) b

liftA2 :: (a -> b -> c) -> Dynamic (Pure t) a -> Dynamic (Pure t) b -> Dynamic (Pure t) c

(*>) :: Dynamic (Pure t) a -> Dynamic (Pure t) b -> Dynamic (Pure t) b

(<*) :: Dynamic (Pure t) a -> Dynamic (Pure t) b -> Dynamic (Pure t) a

newtype Behavior (Pure t :: Type) a

Defined in Reflex.Pure

newtype Behavior (Pure t :: Type) a = Behavior {

• unBehavior :: t -> a

}

newtype Event (Pure t :: Type) a

Defined in Reflex.Pure

newtype Event (Pure t :: Type) a = Event {

• unEvent :: t -> Maybe a

}

newtype Dynamic (Pure t :: Type) a

Defined in Reflex.Pure

newtype Dynamic (Pure t :: Type) a = Dynamic {

• unDynamic :: t -> (a, Maybe a)

}

newtype Incremental (Pure t :: Type) p

Defined in Reflex.Pure

newtype Incremental (Pure t :: Type) p = Incremental {

• unIncremental :: t -> (PatchTarget p, Maybe p)

}

type PushM (Pure t :: Type)

Defined in Reflex.Pure

type PushM (Pure t :: Type) = (->) t :: Type -> Type

type PullM (Pure t :: Type)

Defined in Reflex.Pure

type PullM (Pure t :: Type) = (->) t :: Type -> Type

data family Behavior t :: * -> *

A container for a value that can change over time. Behaviors can be sampled at will, but it is not possible to be notified when they change

Instances

Reflex t => Accumulator (t :: k) (Behavior t)

Defined in Reflex.Class

Methods

accum :: (MonadHold t m, MonadFix m) => (a -> b -> a) -> a -> Event t b -> m (Behavior t a)

accumM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t a) -> a -> Event t b -> m (Behavior t a)

accumMaybe :: (MonadHold t m, MonadFix m) => (a -> b -> Maybe a) -> a -> Event t b -> m (Behavior t a)

accumMaybeM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a)) -> a -> Event t b -> m (Behavior t a)

mapAccum :: (MonadHold t m, MonadFix m) => (a -> b -> (a, c)) -> a -> Event t b -> m (Behavior t a, Event t c)

mapAccumM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (a, c)) -> a -> Event t b -> m (Behavior t a, Event t c)

mapAccumMaybe :: (MonadHold t m, MonadFix m) => (a -> b -> (Maybe a, Maybe c)) -> a -> Event t b -> m (Behavior t a, Event t c)

mapAccumMaybeM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a, Maybe c)) -> a -> Event t b -> m (Behavior t a, Event t c)

Reflex t => Monad (Behavior t)

Defined in Reflex.Class

Methods

(>>=) :: Behavior t a -> (a -> Behavior t b) -> Behavior t b

(>>) :: Behavior t a -> Behavior t b -> Behavior t b

return :: a -> Behavior t a

Reflex t => Functor (Behavior t)

Defined in Reflex.Class

Methods

fmap :: (a -> b) -> Behavior t a -> Behavior t b

(<$) :: a -> Behavior t b -> Behavior t a

Reflex t => Applicative (Behavior t)

Defined in Reflex.Class

Methods

pure :: a -> Behavior t a

(<*>) :: Behavior t (a -> b) -> Behavior t a -> Behavior t b

liftA2 :: (a -> b -> c) -> Behavior t a -> Behavior t b -> Behavior t c

(*>) :: Behavior t a -> Behavior t b -> Behavior t b

(<*) :: Behavior t a -> Behavior t b -> Behavior t a

Reflex t => Apply (Behavior t)

Defined in Reflex.Class

Methods

(<.>) :: Behavior t (a -> b) -> Behavior t a -> Behavior t b

(.>) :: Behavior t a -> Behavior t b -> Behavior t b

(<.) :: Behavior t a -> Behavior t b -> Behavior t a

liftF2 :: (a -> b -> c) -> Behavior t a -> Behavior t b -> Behavior t c

Reflex t => Bind (Behavior t)

Defined in Reflex.Class

Methods

(>>-) :: Behavior t a -> (a -> Behavior t b) -> Behavior t b

join :: Behavior t (Behavior t a) -> Behavior t a

(Reflex t, Fractional a) => Fractional (Behavior t a)

Defined in Reflex.Class

Methods

(/) :: Behavior t a -> Behavior t a -> Behavior t a

recip :: Behavior t a -> Behavior t a

fromRational :: Rational -> Behavior t a

(Reflex t, Num a) => Num (Behavior t a)

Defined in Reflex.Class

Methods

(+) :: Behavior t a -> Behavior t a -> Behavior t a

(-) :: Behavior t a -> Behavior t a -> Behavior t a

(*) :: Behavior t a -> Behavior t a -> Behavior t a

negate :: Behavior t a -> Behavior t a

abs :: Behavior t a -> Behavior t a

signum :: Behavior t a -> Behavior t a

fromInteger :: Integer -> Behavior t a

(Reflex t, IsString a) => IsString (Behavior t a)

Defined in Reflex.Class

Methods

fromString :: String -> Behavior t a

(Reflex t, Semigroup a) => Semigroup (Behavior t a)

Defined in Reflex.Class

Methods

(<>) :: Behavior t a -> Behavior t a -> Behavior t a

sconcat :: NonEmpty (Behavior t a) -> Behavior t a

stimes :: Integral b => b -> Behavior t a -> Behavior t a

(Reflex t, Monoid a) => Monoid (Behavior t a)

Defined in Reflex.Class

Methods

mempty :: Behavior t a

mappend :: Behavior t a -> Behavior t a -> Behavior t a

mconcat :: [Behavior t a] -> Behavior t a

newtype Behavior (Pure t :: Type) a

Defined in Reflex.Pure

newtype Behavior (Pure t :: Type) a = Behavior {

• unBehavior :: t -> a

}

newtype Behavior (SpiderTimeline x :: Type) a

Defined in Reflex.Spider.Internal

newtype Behavior (SpiderTimeline x :: Type) a = SpiderBehavior {

• unSpiderBehavior :: Behavior x a

}

newtype Behavior (ProfiledTimeline t :: Type) a

Defined in Reflex.Profiled

newtype Behavior (ProfiledTimeline t :: Type) a = Behavior_Profiled {

• unBehavior_Profiled :: Behavior t a

}

data family Event t :: * -> *

A stream of occurrences. During any given frame, an Event is either occurring or not occurring; if it is occurring, it will contain a value of the given type (its "occurrence type")

Instances

Reflex t => Accumulator (t :: k) (Event t)

Defined in Reflex.Class

Methods

accum :: (MonadHold t m, MonadFix m) => (a -> b -> a) -> a -> Event t b -> m (Event t a)

accumM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t a) -> a -> Event t b -> m (Event t a)

accumMaybe :: (MonadHold t m, MonadFix m) => (a -> b -> Maybe a) -> a -> Event t b -> m (Event t a)

accumMaybeM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a)) -> a -> Event t b -> m (Event t a)

mapAccum :: (MonadHold t m, MonadFix m) => (a -> b -> (a, c)) -> a -> Event t b -> m (Event t a, Event t c)

mapAccumM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (a, c)) -> a -> Event t b -> m (Event t a, Event t c)

mapAccumMaybe :: (MonadHold t m, MonadFix m) => (a -> b -> (Maybe a, Maybe c)) -> a -> Event t b -> m (Event t a, Event t c)

mapAccumMaybeM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a, Maybe c)) -> a -> Event t b -> m (Event t a, Event t c)

Reflex t => Functor (Event t)

Defined in Reflex.Class

Methods

fmap :: (a -> b) -> Event t a -> Event t b

(<$) :: a -> Event t b -> Event t a

Reflex t => Apply (Event t)

Event intersection. Only occurs when both events are co-incident.

Defined in Reflex.Class

Methods

(<.>) :: Event t (a -> b) -> Event t a -> Event t b

(.>) :: Event t a -> Event t b -> Event t b

(<.) :: Event t a -> Event t b -> Event t a

liftF2 :: (a -> b -> c) -> Event t a -> Event t b -> Event t c

Reflex t => Semialign (Event t)

Defined in Reflex.Class

Methods

align :: Event t a -> Event t b -> Event t (These a b)

alignWith :: (These a b -> c) -> Event t a -> Event t b -> Event t c

Reflex t => Align (Event t)

Defined in Reflex.Class

Methods

nil :: Event t a

Reflex t => Zip (Event t)

Defined in Reflex.Class

Methods

zip :: Event t a -> Event t b -> Event t (a, b)

zipWith :: (a -> b -> c) -> Event t a -> Event t b -> Event t c

Reflex t => Unzip (Event t)

Defined in Reflex.Class

Methods

unzipWith :: (c -> (a, b)) -> Event t c -> (Event t a, Event t b)

unzip :: Event t (a, b) -> (Event t a, Event t b)

Reflex t => Plus (Event t)

Never: zero = never.

Defined in Reflex.Class

Methods

zero :: Event t a

Reflex t => Alt (Event t)

Left-biased event union (prefers left event on simultaneous occurrence).

Defined in Reflex.Class

Methods

(<!>) :: Event t a -> Event t a -> Event t a

some :: Applicative (Event t) => Event t a -> Event t [a]

many :: Applicative (Event t) => Event t a -> Event t [a]

Reflex t => Bind (Event t)

Event intersection (convenient interface to coincidence).

Defined in Reflex.Class

Methods

(>>-) :: Event t a -> (a -> Event t b) -> Event t b

join :: Event t (Event t a) -> Event t a

Reflex t => Filterable (Event t)

Defined in Reflex.Class

Methods

mapMaybe :: (a -> Maybe b) -> Event t a -> Event t b

catMaybes :: Event t (Maybe a) -> Event t a

filter :: (a -> Bool) -> Event t a -> Event t a

Reflex t => FunctorMaybe (Event t)

Defined in Reflex.Class

Methods

fmapMaybe :: (a -> Maybe b) -> Event t a -> Event t b

(Semigroup a, Reflex t) => Semigroup (Event t a)

Defined in Reflex.Class

Methods

(<>) :: Event t a -> Event t a -> Event t a

sconcat :: NonEmpty (Event t a) -> Event t a

stimes :: Integral b => b -> Event t a -> Event t a

(Semigroup a, Reflex t) => Monoid (Event t a)

Defined in Reflex.Class

Methods

mempty :: Event t a

mappend :: Event t a -> Event t a -> Event t a

mconcat :: [Event t a] -> Event t a

newtype Event (Pure t :: Type) a

Defined in Reflex.Pure

newtype Event (Pure t :: Type) a = Event {

• unEvent :: t -> Maybe a

}

newtype Event (SpiderTimeline x :: Type) a

Defined in Reflex.Spider.Internal

newtype Event (SpiderTimeline x :: Type) a = SpiderEvent {

• unSpiderEvent :: Event x a

}

newtype Event (ProfiledTimeline t :: Type) a

Defined in Reflex.Profiled

newtype Event (ProfiledTimeline t :: Type) a = Event_Profiled {

• unEvent_Profiled :: Event t a

}

data family Dynamic t :: * -> *

A container for a value that can change over time and allows notifications on changes. Basically a combination of a Behavior and an Event, with a rule that the Behavior will change if and only if the Event fires.

Instances

Reflex t => Accumulator (t :: k) (Dynamic t)

Defined in Reflex.Class

Methods

accum :: (MonadHold t m, MonadFix m) => (a -> b -> a) -> a -> Event t b -> m (Dynamic t a)

accumM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t a) -> a -> Event t b -> m (Dynamic t a)

accumMaybe :: (MonadHold t m, MonadFix m) => (a -> b -> Maybe a) -> a -> Event t b -> m (Dynamic t a)

accumMaybeM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a)) -> a -> Event t b -> m (Dynamic t a)

mapAccum :: (MonadHold t m, MonadFix m) => (a -> b -> (a, c)) -> a -> Event t b -> m (Dynamic t a, Event t c)

mapAccumM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (a, c)) -> a -> Event t b -> m (Dynamic t a, Event t c)

mapAccumMaybe :: (MonadHold t m, MonadFix m) => (a -> b -> (Maybe a, Maybe c)) -> a -> Event t b -> m (Dynamic t a, Event t c)

mapAccumMaybeM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a, Maybe c)) -> a -> Event t b -> m (Dynamic t a, Event t c)

Monad (Dynamic (Pure t))

Defined in Reflex.Pure

Methods

(>>=) :: Dynamic (Pure t) a -> (a -> Dynamic (Pure t) b) -> Dynamic (Pure t) b

(>>) :: Dynamic (Pure t) a -> Dynamic (Pure t) b -> Dynamic (Pure t) b

return :: a -> Dynamic (Pure t) a

HasSpiderTimeline x => Monad (Dynamic (SpiderTimeline x))

Defined in Reflex.Spider.Internal

Methods

(>>=) :: Dynamic (SpiderTimeline x) a -> (a -> Dynamic (SpiderTimeline x) b) -> Dynamic (SpiderTimeline x) b

(>>) :: Dynamic (SpiderTimeline x) a -> Dynamic (SpiderTimeline x) b -> Dynamic (SpiderTimeline x) b

return :: a -> Dynamic (SpiderTimeline x) a

Monad (Dynamic t) => Monad (Dynamic (ProfiledTimeline t))

Defined in Reflex.Profiled

Methods

(>>=) :: Dynamic (ProfiledTimeline t) a -> (a -> Dynamic (ProfiledTimeline t) b) -> Dynamic (ProfiledTimeline t) b

(>>) :: Dynamic (ProfiledTimeline t) a -> Dynamic (ProfiledTimeline t) b -> Dynamic (ProfiledTimeline t) b

return :: a -> Dynamic (ProfiledTimeline t) a

Functor (Dynamic (Pure t))

Defined in Reflex.Pure

Methods

fmap :: (a -> b) -> Dynamic (Pure t) a -> Dynamic (Pure t) b

(<$) :: a -> Dynamic (Pure t) b -> Dynamic (Pure t) a

HasSpiderTimeline x => Functor (Dynamic (SpiderTimeline x))

Defined in Reflex.Spider.Internal

Methods

fmap :: (a -> b) -> Dynamic (SpiderTimeline x) a -> Dynamic (SpiderTimeline x) b

(<$) :: a -> Dynamic (SpiderTimeline x) b -> Dynamic (SpiderTimeline x) a

Functor (Dynamic t) => Functor (Dynamic (ProfiledTimeline t))

Defined in Reflex.Profiled

Methods

fmap :: (a -> b) -> Dynamic (ProfiledTimeline t) a -> Dynamic (ProfiledTimeline t) b

(<$) :: a -> Dynamic (ProfiledTimeline t) b -> Dynamic (ProfiledTimeline t) a

Applicative (Dynamic (Pure t))

Defined in Reflex.Pure

Methods

pure :: a -> Dynamic (Pure t) a

(<*>) :: Dynamic (Pure t) (a -> b) -> Dynamic (Pure t) a -> Dynamic (Pure t) b

liftA2 :: (a -> b -> c) -> Dynamic (Pure t) a -> Dynamic (Pure t) b -> Dynamic (Pure t) c

(*>) :: Dynamic (Pure t) a -> Dynamic (Pure t) b -> Dynamic (Pure t) b

(<*) :: Dynamic (Pure t) a -> Dynamic (Pure t) b -> Dynamic (Pure t) a

HasSpiderTimeline x => Applicative (Dynamic (SpiderTimeline x))

Defined in Reflex.Spider.Internal

Methods

pure :: a -> Dynamic (SpiderTimeline x) a

(<*>) :: Dynamic (SpiderTimeline x) (a -> b) -> Dynamic (SpiderTimeline x) a -> Dynamic (SpiderTimeline x) b

liftA2 :: (a -> b -> c) -> Dynamic (SpiderTimeline x) a -> Dynamic (SpiderTimeline x) b -> Dynamic (SpiderTimeline x) c

(*>) :: Dynamic (SpiderTimeline x) a -> Dynamic (SpiderTimeline x) b -> Dynamic (SpiderTimeline x) b

(<*) :: Dynamic (SpiderTimeline x) a -> Dynamic (SpiderTimeline x) b -> Dynamic (SpiderTimeline x) a

Applicative (Dynamic t) => Applicative (Dynamic (ProfiledTimeline t))

Defined in Reflex.Profiled

Methods

pure :: a -> Dynamic (ProfiledTimeline t) a

(<*>) :: Dynamic (ProfiledTimeline t) (a -> b) -> Dynamic (ProfiledTimeline t) a -> Dynamic (ProfiledTimeline t) b

liftA2 :: (a -> b -> c) -> Dynamic (ProfiledTimeline t) a -> Dynamic (ProfiledTimeline t) b -> Dynamic (ProfiledTimeline t) c

(*>) :: Dynamic (ProfiledTimeline t) a -> Dynamic (ProfiledTimeline t) b -> Dynamic (ProfiledTimeline t) b

(<*) :: Dynamic (ProfiledTimeline t) a -> Dynamic (ProfiledTimeline t) b -> Dynamic (ProfiledTimeline t) a

(Num a, Reflex t) => Num (Dynamic t a)

Defined in Reflex.Class

Methods

(+) :: Dynamic t a -> Dynamic t a -> Dynamic t a

(-) :: Dynamic t a -> Dynamic t a -> Dynamic t a

(*) :: Dynamic t a -> Dynamic t a -> Dynamic t a

negate :: Dynamic t a -> Dynamic t a

abs :: Dynamic t a -> Dynamic t a

signum :: Dynamic t a -> Dynamic t a

fromInteger :: Integer -> Dynamic t a

(Reflex t, IsString a) => IsString (Dynamic t a)

Defined in Reflex.Class

Methods

fromString :: String -> Dynamic t a

(Reflex t, Semigroup a) => Semigroup (Dynamic t a)

Defined in Reflex.Class

Methods

(<>) :: Dynamic t a -> Dynamic t a -> Dynamic t a

sconcat :: NonEmpty (Dynamic t a) -> Dynamic t a

stimes :: Integral b => b -> Dynamic t a -> Dynamic t a

(Reflex t, Monoid a) => Monoid (Dynamic t a)

Defined in Reflex.Class

Methods

mempty :: Dynamic t a

mappend :: Dynamic t a -> Dynamic t a -> Dynamic t a

mconcat :: [Dynamic t a] -> Dynamic t a

(Reflex t, Default a) => Default (Dynamic t a)

Defined in Reflex.Class

Methods

def :: Dynamic t a

newtype Dynamic (Pure t :: Type) a

Defined in Reflex.Pure

newtype Dynamic (Pure t :: Type) a = Dynamic {

• unDynamic :: t -> (a, Maybe a)

}

newtype Dynamic (SpiderTimeline x :: Type) a

Defined in Reflex.Spider.Internal

newtype Dynamic (SpiderTimeline x :: Type) a = SpiderDynamic {

• unSpiderDynamic :: DynamicS x (Identity a)

}

newtype Dynamic (ProfiledTimeline t :: Type) a

Defined in Reflex.Profiled

newtype Dynamic (ProfiledTimeline t :: Type) a = Dynamic_Profiled {

• unDynamic_Profiled :: Dynamic t a

}

data family Incremental t :: * -> *

An Incremental is a more general form of a Dynamic. Instead of always fully replacing the value, only parts of it can be patched. This is only needed for performance critical code via mergeIncremental to make small changes to large values.

Instances

newtype Incremental (Pure t :: Type) p

Defined in Reflex.Pure

newtype Incremental (Pure t :: Type) p = Incremental {

• unIncremental :: t -> (PatchTarget p, Maybe p)

}

newtype Incremental (SpiderTimeline x :: Type) p

Defined in Reflex.Spider.Internal

newtype Incremental (SpiderTimeline x :: Type) p = SpiderIncremental {

• unSpiderIncremental :: DynamicS x p

}

newtype Incremental (ProfiledTimeline t :: Type) p

Defined in Reflex.Profiled

newtype Incremental (ProfiledTimeline t :: Type) p = Incremental_Profiled {

• unIncremental_Profiled :: Incremental t p

}

Orphan instances

MonadSample (Pure t :: Type) ((->) t :: Type -> Type)

Methods

sample :: Behavior (Pure t) a -> t -> a