Package

scalax

collection

Permalink

package collection

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. collection
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

  1. type AnySet[A] = Set[A]

    Permalink
    Attributes
    protected[scalax]
  2. type ExtSet[A] = Set[A] with ExtSetMethods[A]

    Permalink
  3. type MSet[A] = Set[A]

    Permalink
    Attributes
    protected[scalax]

Value Members

  1. val AnyDegree: (Int) ⇒ Boolean

    Permalink
  2. final def MSet: Set.type

    Permalink
    Attributes
    protected[scalax]
    Annotations
    @inline()
  3. package constrained

    Permalink

    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.

Inherited from AnyRef

Inherited from Any

Ungrouped