scalax.collection.constrained.constraints.Acyclic

Result

class Result extends PreCheckResult

This class makes it possible to carry over nodes that are passed to a pre-check and are already contained in the graph to postAdd. Thus we can limit the number of start nodes for cycle detection in the post-check to these passed over docking nodes.

Attributes
protected
Linear Supertypes
PreCheckResult, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Result
  2. PreCheckResult
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Result(followUp: PreCheckFollowUp, dockingNodes: Set[Graph.NodeT])

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. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. final def abort: Boolean

    Whether this.followUp equals to Abort.

    Whether this.followUp equals to Abort.

    Definition Classes
    PreCheckResult
  7. final def apply(): PreCheckFollowUp

    Definition Classes
    PreCheckResult
  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  10. final def complete: Boolean

    Whether this.followUp equals to Complete.

    Whether this.followUp equals to Complete.

    Definition Classes
    PreCheckResult
  11. val dockingNodes: Set[Graph.NodeT]

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

    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  14. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  15. def get[N, E[X] <: EdgeLikeIn[X]](op: Constraint[N, E]): Option[PreCheckResult]

    Definition Classes
    PreCheckResult
  16. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  17. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  19. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  20. final def noAbort: Boolean

    Whether this.followUp does not equal to Abort.

    Whether this.followUp does not equal to Abort.

    Definition Classes
    PreCheckResult
  21. final def noComplete: Boolean

    Whether this.followUp does not equal to Complete.

    Whether this.followUp does not equal to Complete.

    Definition Classes
    PreCheckResult
  22. final def noPostCheck: Boolean

    Whether this.followUp does not equal to PostCheck.

    Whether this.followUp does not equal to PostCheck.

    Definition Classes
    PreCheckResult
  23. final def notify(): Unit

    Definition Classes
    AnyRef
  24. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  25. final def postCheck: Boolean

    Whether this.followUp equals to PostCheck.

    Whether this.followUp equals to PostCheck.

    Definition Classes
    PreCheckResult
  26. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  27. def toString(): String

    Definition Classes
    AnyRef → Any
  28. final def tupled: (PreCheckResult, PreCheckFollowUp)

    Returns a tuple of this and this.followUp.

    Returns a tuple of this and this.followUp.

    Definition Classes
    PreCheckResult
  29. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  30. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  31. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from PreCheckResult

Inherited from AnyRef

Inherited from Any

Ungrouped