Packages

  • package root
    Definition Classes
    root
  • package scalax
    Definition Classes
    root
  • package collection
    Definition Classes
    scalax
  • package constrained

    Traits enabling to implement constraints and use constrained graphs.

    Traits enabling to implement constraints and use constrained graphs.

    Graphs may be constrained dynamically or statically.

    Dynamically constrained means that a constraint is bound to a constrained Graph instance at initialization time. The constrained Graph will then delegate all calls to the methods of ConstraintMethods and ConstraintHandlerMethods to the corresponding methods of the constraint bound to it. The immutable and mutable factories Graph in this package yield dynamically constrained graphs.

    To make use of dynamically constrained graphs you may make use of the predefined constraints or provide an own implementation of Constraint along with its companion object. To initialize a graph with one or several combined constraints just call the graph factory methods of the constraint package passing.

    Statically constrained means that the graph class directly implements the methods declared in ConstraintMethods.

    Definition Classes
    collection
  • package constraints

    Predefined constraints that may be passed to constrained Graphs.

    Predefined constraints that may be passed to constrained Graphs.

    Definition Classes
    constrained
  • class Acyclic [N, E[X] <: EdgeLikeIn[X]] extends Constraint[N, E]

    Ensures that the underlying Graph is acyclic at any time.

    Ensures that the underlying Graph is acyclic at any time.

    Definition Classes
    constraints
  • Result

object Result extends PreCheckResultCompanion

Attributes
protected
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Result
  2. PreCheckResultCompanion
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def apply(followUp: PreCheckFollowUp, nodesToCheck: Set[Graph.NodeT]): Result
  5. def apply(followUp: PreCheckFollowUp): Result
    Definition Classes
    ResultPreCheckResultCompanion
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def complete(ok: Boolean): PreCheckResult

    If ok is true returns a new PreCheckResult with followUp equaling to Complete otherwise to Abort.

    If ok is true returns a new PreCheckResult with followUp equaling to Complete otherwise to Abort.

    Definition Classes
    PreCheckResultCompanion
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  14. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  18. def postCheck(ok: Boolean): PreCheckResult

    If ok is true returns a new PreCheckResult with followUp equaling to PostCheck otherwise to Abort.

    If ok is true returns a new PreCheckResult with followUp equaling to PostCheck otherwise to Abort.

    Definition Classes
    PreCheckResultCompanion
  19. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  20. def toString(): String
    Definition Classes
    AnyRef → Any
  21. def unapply(result: Result): Option[Set[Graph.NodeT]]
  22. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from PreCheckResultCompanion

Inherited from AnyRef

Inherited from Any

Ungrouped