Monad_BindingSeqT
Type members
Inherited classlikes
Value members
Concrete methods
Returns a new data-binding sequence by applying a function to all elements of this sequence and using the elements of the resulting collections.
Returns a new data-binding sequence by applying a function to all elements of this sequence and using the elements of the resulting collections.
Whenever fa
or one of the subsequence changes, the result sequence changes accordingly. The time complexity
to update the result sequence, when fa
changes, is O(log(n) + c)
, where n
is the size of fa
, and c
is number of elements in fa
, mapped to mutable subsequences by f
, of which the indices in fa
are
changing. For example, if the size of fa
is 10 and 4 elements of them mapped to mutable subsequences, when
an element is prepended to fa
, c
is 4. However when an element is appended to fa
, c
is zero, because
no element's index in `fa is changed.
The time complexity to update the result sequence, when one of the subsequence changes, is O(log(n))
, where
n
is the size of fa
.
Inherited methods
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Definition Classes
- Bind -> Apply
- Inherited from
- Bind
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
Add a unit to any Apply to form an Applicative.
Add a unit to any Apply to form an Applicative.
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
The composition of Functor F
and Bifunctor G
, [x, y]F[G[x, y]]
, is a Bifunctor
The composition of Functor F
and Bifunctor G
, [x, y]F[G[x, y]]
, is a Bifunctor
- Inherited from
- Functor
The composition of Applys F
and G
, [x]F[G[x]]
, is a Apply
The composition of Applys F
and G
, [x]F[G[x]]
, is a Apply
- Inherited from
- Apply
The composition of Functors F
and G
, [x]F[G[x]]
, is a Functor
The composition of Functors F
and G
, [x]F[G[x]]
, is a Functor
- Inherited from
- Functor
The composition of Applicatives F
and G
, [x]F[G[x]]
, is an Applicative
The composition of Applicatives F
and G
, [x]F[G[x]]
, is an Applicative
- Inherited from
- Applicative
Combine fa
and fb
according to Apply[F]
with a function that discards the A
(s)
Combine fa
and fb
according to Apply[F]
with a function that discards the A
(s)
- Inherited from
- Apply
Combine fa
and fb
according to Apply[F]
with a function that discards the B
(s)
Combine fa
and fb
according to Apply[F]
with a function that discards the B
(s)
- Inherited from
- Apply
Filter l
according to an applicative predicate.
Filter l
according to an applicative predicate.
- Inherited from
- Applicative
Filter l
according to an applicative predicate.
Filter l
according to an applicative predicate.
- Inherited from
- Applicative
Filter map
according to an applicative predicate. *
Filter map
according to an applicative predicate. *
- Inherited from
- Applicative
An Applicative
for F
in which effects happen in the opposite order.
An Applicative
for F
in which effects happen in the opposite order.
- Definition Classes
- Applicative -> Apply
- Inherited from
- Applicative
Repeats an applicative action infinitely
Repeats an applicative action infinitely
- Inherited from
- Apply
Pair all A
s in fa
with the result of function application.
Pair all A
s in fa
with the result of function application.
- Inherited from
- Functor
The composition of Functor F and Contravariant G, [x]F[G[x]]
,
is contravariant.
The composition of Functor F and Contravariant G, [x]F[G[x]]
,
is contravariant.
- Inherited from
- Functor
if
lifted into a binding. Unlike lift3((t,c,a)=>if(t)c else a)
, this will only include context from the chosen of ifTrue
and ifFalse
, not the other.
if
lifted into a binding. Unlike lift3((t,c,a)=>if(t)c else a)
, this will only include context from the chosen of ifTrue
and ifFalse
, not the other.
- Inherited from
- Bind
Execute an action repeatedly until its result satisfies the given predicate and return that result, discarding all others.
Execute an action repeatedly until its result satisfies the given predicate and return that result, discarding all others.
- Inherited from
- Monad
Execute an action repeatedly until its result fails to satisfy the given predicate and return that result, discarding all others.
Execute an action repeatedly until its result fails to satisfy the given predicate and return that result, discarding all others.
- Inherited from
- Monad
Sequence the inner F
of FFA
after the outer F
, forming a
single F[A]
.
Sequence the inner F
of FFA
after the outer F
, forming a
single F[A]
.
- Inherited from
- Bind
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
Lift apply(a)
, and apply the result to f
.
Lift apply(a)
, and apply the result to f
.
- Inherited from
- Functor
Pair A
with the result of function application.
Pair A
with the result of function application.
- Inherited from
- Bind
A lawful implementation of this that is isomorphic up to the methods defined on Applicative allowing for optimised parallel implementations that would otherwise violate laws of more specific typeclasses (e.g. Monad).
A lawful implementation of this that is isomorphic up to the methods defined on Applicative allowing for optimised parallel implementations that would otherwise violate laws of more specific typeclasses (e.g. Monad).
- Inherited from
- Applicative
Semigroups can be added within an Applicative
Semigroups can be added within an Applicative
- Inherited from
- Applicative
The product of Monad F
and G
, [x](F[x], G[x]])
, is a Monad
The product of Monad F
and G
, [x](F[x], G[x]])
, is a Monad
- Inherited from
- Monad
The product of Bind F
and G
, [x](F[x], G[x]])
, is a Bind
The product of Bind F
and G
, [x](F[x], G[x]])
, is a Bind
- Inherited from
- Bind
The product of Applys F
and G
, [x](F[x], G[x]])
, is a Apply
The product of Applys F
and G
, [x](F[x], G[x]])
, is a Apply
- Inherited from
- Apply
The product of Functors F
and G
, [x](F[x], G[x]])
, is a Functor
The product of Functors F
and G
, [x](F[x], G[x]])
, is a Functor
- Inherited from
- Functor
The product of Applicatives F
and G
, [x](F[x], G[x]])
, is an Applicative
The product of Applicatives F
and G
, [x](F[x], G[x]])
, is an Applicative
- Inherited from
- Applicative
Performs the action n
times, returning the list of results.
Performs the action n
times, returning the list of results.
- Inherited from
- Applicative
Performs the action n
times, returning nothing.
Performs the action n
times, returning nothing.
- Inherited from
- Applicative
- Inherited from
- Applicative
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
- Inherited from
- Apply
Unfold seed
to the right and combine effects left-to-right,
using the given Reducer to combine values.
Implementations may override this method to not unfold more
than is necessary to determine the result.
Unfold seed
to the right and combine effects left-to-right,
using the given Reducer to combine values.
Implementations may override this method to not unfold more
than is necessary to determine the result.
- Inherited from
- Apply
Returns the given argument if cond
is false
, otherwise, unit lifted into F.
Returns the given argument if cond
is false
, otherwise, unit lifted into F.
- Inherited from
- Applicative
Execute an action repeatedly until the Boolean
condition returns true
.
The condition is evaluated after the loop body. Collects results into an
arbitrary MonadPlus
value, such as a List
.
Execute an action repeatedly until the Boolean
condition returns true
.
The condition is evaluated after the loop body. Collects results into an
arbitrary MonadPlus
value, such as a List
.
- Inherited from
- Monad
Execute an action repeatedly until the Boolean
condition returns true
.
The condition is evaluated after the loop body. Discards results.
Execute an action repeatedly until the Boolean
condition returns true
.
The condition is evaluated after the loop body. Discards results.
- Inherited from
- Monad
Empty fa
of meaningful pure values, preserving its
structure.
Empty fa
of meaningful pure values, preserving its
structure.
- Inherited from
- Functor
Returns the given argument if cond
is true
, otherwise, unit lifted into F.
Returns the given argument if cond
is true
, otherwise, unit lifted into F.
- Inherited from
- Applicative
Execute an action repeatedly as long as the given Boolean
expression
returns true
. The condition is evaluated before the loop body.
Collects the results into an arbitrary MonadPlus
value, such as a List
.
Execute an action repeatedly as long as the given Boolean
expression
returns true
. The condition is evaluated before the loop body.
Collects the results into an arbitrary MonadPlus
value, such as a List
.
- Inherited from
- Monad
Execute an action repeatedly as long as the given Boolean
expression
returns true
. The condition is evaluated before the loop body.
Discards results.
Execute an action repeatedly as long as the given Boolean
expression
returns true
. The condition is evaluated before the loop body.
Discards results.
- Inherited from
- Monad
Functors are covariant by nature, so we can treat an F[A]
as
an F[B]
if A
is a subtype of B
.
Functors are covariant by nature, so we can treat an F[A]
as
an F[B]
if A
is a subtype of B
.
- Inherited from
- Functor
- Inherited from
- InvariantApplicative
- Inherited from
- InvariantApplicative
- Inherited from
- InvariantApplicative
Converts ma
to a value of type F[B]
using the provided bijection.
Converts ma
to a value of type F[B]
using the provided bijection.
- Inherited from
- InvariantFunctor
Converts ma
to a value of type F[B]
using the provided isomorphism.
Converts ma
to a value of type F[B]
using the provided isomorphism.
- Inherited from
- InvariantFunctor
- Definition Classes
- Applicative -> InvariantApplicative
- Inherited from
- Applicative
- Definition Classes
- Applicative -> InvariantApplicative
- Inherited from
- Applicative
- Definition Classes
- Applicative -> InvariantApplicative
- Inherited from
- Applicative