final class FreeObjectOutput[R, Ptr[_], A] extends AnyRef
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- FreeObjectOutput
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def ++[B](that: FreeObjectOutput[R, Ptr, B])(implicit ev: =:=[A, Unit]): FreeObjectOutput[R, Ptr, B]
- def +:(r: R): FreeObjectOutput[R, Ptr, A]
- def :+(r: R)(implicit ev: =:=[A, Unit]): FreeObjectOutput[R, Ptr, Unit]
- def ::(r: R): FreeObjectOutput[R, Ptr, A]
- def :::(that: FreeObjectOutput[R, Ptr, Unit]): FreeObjectOutput[R, Ptr, A]
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def appendTo[B, M[_]](b: B, deref: ~>[Ptr, M], decorateContent: ~>[Ptr, [α]IndexedDecoration[R, R]], showReference: ~>[Ptr, [α]R])(implicit agg: Aggregator[B, R], E: HEqualK[Ptr], M0: BindRec[M], M1: Applicative[M]): M[B]
- def appendTo[B, M[_]](b: B, deref: ~>[Ptr, M], decorateReferenced: ~>[Ptr, [α]IndexedDecoration[R, R]], decorateUnreferenced: ~>[Ptr, [α]IndexedDecoration[R, R]], showReference: ~>[Ptr, [α]R])(implicit agg: Aggregator[B, R], E: HEqualK[Ptr], M0: BindRec[M], M1: Applicative[M]): M[B]
- def appendTo[B](b: B, showReference: ~>[Ptr, [α]R])(implicit agg: Aggregator[B, R]): B
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def eval[M[_]](deref: ~>[Ptr, M], decorateContent: ~>[Ptr, [α]IndexedDecoration[R, R]], showReference: ~>[Ptr, [α]R])(implicit E: HEqualK[Ptr], M0: BindRec[M], M1: Applicative[M]): M[Tree[R]]
Serialize, cutting off cycles.
Serialize, cutting off cycles. Pointers that would cause cycles will be handled by
showReference. - def eval[M[_]](deref: ~>[Ptr, M], decorateReferenced: ~>[Ptr, [α]IndexedDecoration[R, R]], decorateUnreferenced: ~>[Ptr, [α]IndexedDecoration[R, R]], showReference: ~>[Ptr, [α]R])(implicit E: HEqualK[Ptr], M0: BindRec[M], M1: Applicative[M]): M[Tree[R]]
Serialize, cutting off cycles.
Serialize, cutting off cycles. Pointers that would cause cycles will be handled by
showReference. - def eval(showReference: ~>[Ptr, [α]R]): Lst[R]
- def flatMap[B](f: (A) => FreeObjectOutput[R, Ptr, B]): FreeObjectOutput[R, Ptr, B]
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- 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() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- def printTree[M[_]](deref: ~>[Ptr, M], showRef: ~>[Ptr, [α]String], lineLimit: Int = 60, tab: String = " ", newLine: String = "\n")(decorateReferenced: ~>[Ptr, [α]IndexedDecoration[String, String]] = λ[Ptr ~> λ[α => Decoration[String]]](ref => Decoration(s"<def ${showRef(ref)}>", "</def>")), decorateUnreferenced: ~>[Ptr, [α]IndexedDecoration[String, String]] = λ[Ptr ~> λ[α => Decoration[String]]](ref => Decoration.naked), decorateReference: (String) => String = ref => s"<ref $ref/>")(implicit E: HEqualK[Ptr], M0: BindRec[M], M1: Applicative[M], ev: ===[R, String]): M[String]
- def serialize[M[_]](implicit M: MonadObjectOutput[M, R, Ptr]): M[A]
- def showAutoLabeled[M[_]](deref: ~>[Ptr, M], showRef: ~>[Ptr, [α]String])(decorateReferenced: ~>[Ptr, [α]IndexedDecoration[String, String]] = λ[Ptr ~> λ[α => Decoration[String]]](ref => Decoration(s"<def ${showRef(ref)}>", "</def>")), decorateUnreferenced: ~>[Ptr, [α]IndexedDecoration[String, String]] = λ[Ptr ~> λ[α => Decoration[String]]](ref => Decoration.naked), decorateReference: (String) => String = ref => s"<ref $ref/>")(implicit E: HEqualK[Ptr], M0: BindRec[M], M1: Applicative[M], ev: ===[R, String]): M[String]
- def showLabeled[M[_]](deref: ~>[Ptr, M], decorateContent: ~>[Ptr, [α]IndexedDecoration[R, R]], showReference: ~>[Ptr, [α]R])(implicit agg: Aggregator[StringBuilder, R], E: HEqualK[Ptr], M0: BindRec[M], M1: Applicative[M]): M[String]
- def showShallow(showReference: ~>[Ptr, [α]R])(implicit agg: Aggregator[StringBuilder, R]): String
- 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(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def writeTo[O](out: O)(implicit O: ObjectOutput[O, R, Ptr]): O
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated