at.logic.skeptik.algorithm.compressor

RandomCompressionRepeatableAlgorithm

trait RandomCompressionRepeatableAlgorithm[P <: ProofNode[_, P]] extends RepeatableAlgorithm[P]

Linear Supertypes
RepeatableAlgorithm[P], CompressorAlgorithm[P], AnyRef, Any
Known Subclasses
MultiSplit, Split, Split
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. RandomCompressionRepeatableAlgorithm
  2. RepeatableAlgorithm
  3. CompressorAlgorithm
  4. AnyRef
  5. Any
Implicitly
  1. by compressorAlgorithmToFunctionProofWithGuard
  2. by compressorAlgorithmToFunctionProof
  3. by any2stringadd
  4. by any2stringfmt
  5. by any2ArrowAssoc
  6. by any2Ensuring
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def apply(proof: Proof[P]): Proof[P]

    Definition Classes
    CompressorAlgorithm

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd

  5. def ->[B](y: B): (RandomCompressionRepeatableAlgorithm[P], B)

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to ArrowAssoc[RandomCompressionRepeatableAlgorithm[P]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

  6. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  7. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  8. def andThen[A](g: (Proof[P]) ⇒ A): (Proof[P]) ⇒ A

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to (Proof[P]) ⇒ Proof[P] performed by method compressorAlgorithmToFunctionProof in at.logic.skeptik.algorithm.compressor. This conversion will take place only if P is a subclass of ProofNode[_, P] (P <: ProofNode[_, P]).
    Definition Classes
    Function1
    Annotations
    @unspecialized()

  9. def apply(initialProofNode: Proof[P], guard: Guard[P]): Proof[P]

    Definition Classes
    RandomCompressionRepeatableAlgorithm → RepeatableAlgorithm → CompressorAlgorithm

  10. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  11. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  12. def compose[A](g: (A) ⇒ Proof[P]): (A) ⇒ Proof[P]

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to (Proof[P]) ⇒ Proof[P] performed by method compressorAlgorithmToFunctionProof in at.logic.skeptik.algorithm.compressor. This conversion will take place only if P is a subclass of ProofNode[_, P] (P <: ProofNode[_, P]).
    Definition Classes
    Function1
    Annotations
    @unspecialized()

  13. def curried: (Proof[P]) ⇒ (Guard[P]) ⇒ Proof[P]

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to (Proof[P], Guard[P]) ⇒ Proof[P] performed by method compressorAlgorithmToFunctionProofWithGuard in at.logic.skeptik.algorithm.compressor. This conversion will take place only if P is a subclass of ProofNode[_, P] (P <: ProofNode[_, P]).
    Definition Classes
    Function2
    Annotations
    @unspecialized()

  14. def ensuring(cond: (RandomCompressionRepeatableAlgorithm[P]) ⇒ Boolean, msg: ⇒ Any): RandomCompressionRepeatableAlgorithm[P]

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to Ensuring[RandomCompressionRepeatableAlgorithm[P]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  15. def ensuring(cond: (RandomCompressionRepeatableAlgorithm[P]) ⇒ Boolean): RandomCompressionRepeatableAlgorithm[P]

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to Ensuring[RandomCompressionRepeatableAlgorithm[P]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  16. def ensuring(cond: Boolean, msg: ⇒ Any): RandomCompressionRepeatableAlgorithm[P]

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to Ensuring[RandomCompressionRepeatableAlgorithm[P]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  17. def ensuring(cond: Boolean): RandomCompressionRepeatableAlgorithm[P]

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to Ensuring[RandomCompressionRepeatableAlgorithm[P]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  18. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  19. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  20. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  21. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

  22. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  23. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  24. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  25. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  26. final def notify(): Unit

    Definition Classes
    AnyRef

  27. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  29. def toString(): String

    Definition Classes
    AnyRef → Any

  30. def tupled: ((Proof[P], Guard[P])) ⇒ Proof[P]

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to (Proof[P], Guard[P]) ⇒ Proof[P] performed by method compressorAlgorithmToFunctionProofWithGuard in at.logic.skeptik.algorithm.compressor. This conversion will take place only if P is a subclass of ProofNode[_, P] (P <: ProofNode[_, P]).
    Definition Classes
    Function2
    Annotations
    @unspecialized()

  31. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  32. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  33. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  34. def →[B](y: B): (RandomCompressionRepeatableAlgorithm[P], B)

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to ArrowAssoc[RandomCompressionRepeatableAlgorithm[P]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implict Value Members

  1. def apply(v1: Proof[P], v2: Guard[P]): Proof[P]

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to (Proof[P], Guard[P]) ⇒ Proof[P] performed by method compressorAlgorithmToFunctionProofWithGuard in at.logic.skeptik.algorithm.compressor. This conversion will take place only if P is a subclass of ProofNode[_, P] (P <: ProofNode[_, P]).
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (randomCompressionRepeatableAlgorithm: (Proof[P], Guard[P]) ⇒ Proof[P]).apply(v1, v2)
    Definition Classes
    Function2

  2. def apply(v1: Proof[P]): Proof[P]

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to (Proof[P]) ⇒ Proof[P] performed by method compressorAlgorithmToFunctionProof in at.logic.skeptik.algorithm.compressor. This conversion will take place only if P is a subclass of ProofNode[_, P] (P <: ProofNode[_, P]).
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (randomCompressionRepeatableAlgorithm: (Proof[P]) ⇒ Proof[P]).apply(v1)
    Definition Classes
    Function1

  3. val self: Any

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (randomCompressionRepeatableAlgorithm: StringAdd).self
    Definition Classes
    StringAdd

  4. val self: Any

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (randomCompressionRepeatableAlgorithm: StringFormat).self
    Definition Classes
    StringFormat

  5. def toString(): String

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to (Proof[P], Guard[P]) ⇒ Proof[P] performed by method compressorAlgorithmToFunctionProofWithGuard in at.logic.skeptik.algorithm.compressor. This conversion will take place only if P is a subclass of ProofNode[_, P] (P <: ProofNode[_, P]).
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (randomCompressionRepeatableAlgorithm: (Proof[P], Guard[P]) ⇒ Proof[P]).toString()
    Definition Classes
    Function2 → AnyRef → Any

  6. def toString(): String

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to (Proof[P]) ⇒ Proof[P] performed by method compressorAlgorithmToFunctionProof in at.logic.skeptik.algorithm.compressor. This conversion will take place only if P is a subclass of ProofNode[_, P] (P <: ProofNode[_, P]).
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (randomCompressionRepeatableAlgorithm: (Proof[P]) ⇒ Proof[P]).toString()
    Definition Classes
    Function1 → AnyRef → Any

Deprecated Value Members

  1. def x: RandomCompressionRepeatableAlgorithm[P]

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to ArrowAssoc[RandomCompressionRepeatableAlgorithm[P]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (randomCompressionRepeatableAlgorithm: ArrowAssoc[RandomCompressionRepeatableAlgorithm[P]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  2. def x: RandomCompressionRepeatableAlgorithm[P]

    Implicit information
    This member is added by an implicit conversion from RandomCompressionRepeatableAlgorithm[P] to Ensuring[RandomCompressionRepeatableAlgorithm[P]] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (randomCompressionRepeatableAlgorithm: Ensuring[RandomCompressionRepeatableAlgorithm[P]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from RepeatableAlgorithm[P]

Inherited from CompressorAlgorithm[P]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion compressorAlgorithmToFunctionProofWithGuard from RandomCompressionRepeatableAlgorithm[P] to (Proof[P], Guard[P]) ⇒ Proof[P]

Inherited by implicit conversion compressorAlgorithmToFunctionProof from RandomCompressionRepeatableAlgorithm[P] to (Proof[P]) ⇒ Proof[P]

Inherited by implicit conversion any2stringadd from RandomCompressionRepeatableAlgorithm[P] to StringAdd

Inherited by implicit conversion any2stringfmt from RandomCompressionRepeatableAlgorithm[P] to StringFormat

Inherited by implicit conversion any2ArrowAssoc from RandomCompressionRepeatableAlgorithm[P] to ArrowAssoc[RandomCompressionRepeatableAlgorithm[P]]

Inherited by implicit conversion any2Ensuring from RandomCompressionRepeatableAlgorithm[P] to Ensuring[RandomCompressionRepeatableAlgorithm[P]]

Ungrouped