implicit class BranchLabelingSyntax extends AnyRef
Syntax for labeling or creating new branches in a log tree given a description.
- Alphabetic
- By Inheritance
- BranchLabelingSyntax
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new BranchLabelingSyntax(description: String)
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
~<[V](dc: DescribedComputation[V]): DescribedComputation[V]
If
dc
has a log tree with an undescribed root node, give the root node thedescription
but otherwise leave it unchanged.If
dc
has a log tree with an undescribed root node, give the root node thedescription
but otherwise leave it unchanged. If the log tree has a described root node, create a new root node above the existing one and give the new root node thedescription
. In both cases preserve thevalue
and success/failure status. -
def
~<[F[_], V](describedComputations: F[DescribedComputation[V]])(implicit arg0: Monad[F], arg1: Traverse[F]): DescribedComputation[F[V]]
Create a new branch given a monadic, traversable 'container'
F[DescribedComputation[Value]]
, 'sequence' it to create aDescribedComputation[F[Value]]
, and give the newDescribedComputation's
log tree a new root node, with the givendescription
and whose children are the trees in theF[DescribedComputation[Value]]
.Create a new branch given a monadic, traversable 'container'
F[DescribedComputation[Value]]
, 'sequence' it to create aDescribedComputation[F[Value]]
, and give the newDescribedComputation's
log tree a new root node, with the givendescription
and whose children are the trees in theF[DescribedComputation[Value]]
.For example, if we evaluate this method with
F
instantiated asList
, we would turn aList[DescribedComputation[Value]]
into aDescribedComputation[List[Value]]
, such that theList[Value]
which is the result's 'value' is obtained by extracting the 'value' from each treelog.LogTreeSyntax.DescribedComputation in thedescribedComputations
parameter. Likewise, the child nodes of the returned log tree root node are obtained by extracting the log tree from each of thedescribedComputations
.The success status of the returned
DescribedComputations
log tree istrue
if all of the children are successful. It isfalse
otherwise. -
def
~<+[F[_], V, R](describedComputations: F[DescribedComputation[V]], f: (F[V]) ⇒ R)(implicit arg0: Monad[F], arg1: Traverse[F]): DescribedComputation[R]
As ~< but folding over the resulting F[Value] to yield R and return a DescribedComputation[R] with all the logs.
As ~< but folding over the resulting F[Value] to yield R and return a DescribedComputation[R] with all the logs.
For example, given l = List[DescribedComputation[Int]], and f = List[Int] ⇒ Int (say summing the list), then
"Sum" ~<+(l, f)
would return a DescribedComputation containing the sum of the elements of the list.