@__haoyang__/erwin
    Preparing search index...

    Class ConstraintDAG<T, V>

    A directed acyclic graph that stores the constraints between nodes.

    Type Parameters

    Hierarchy (View Summary)

    Index

    Constructors

    Properties

    dag_nodes: Map<number, ConstraintNode> = ...
    edge2leaf: Map<string, Set<number>> = ...
    leaves: Set<number> = ...
    leaves_equal: Set<string> = ...
    leaves_same: Set<string> = ...
    leaves_same_range: Set<string> = ...
    leaves_sub: Set<string> = ...
    name: string
    node2leaf: Map<number, Set<toLeaf>> = ...
    roots: Set<number> = ...
    solution_range: Map<number, V[]> = ...
    solutions: Map<number, V> = ...
    solutions_collection: Map<number, V>[] = []
    sub: Set<string> = ...
    super: Set<string> = ...

    Methods

    • Returns Generator<Map<number, V>>

    • Parameters

      • from: number
      • to: number

      Returns boolean

    • Parameters

      • from: number
      • to: number
      • Optionalrank: string

      Returns void

    • Parameters

      • dominator_id: number
      • dominatee_id: number

      Returns undefined | V[]

    • Parameters

      • dominator_id: number
      • dominatee_id: number

      Returns undefined | V[]

    • Parameters

      • path: string

      Returns Promise<void>

    • Parameters

      • nodeid: number
      • range: V[]

      Returns void

    • Parameters

      • isolated_node_is_root: boolean = true

      Returns void

    • Parameters

      • nodeid: number

      Returns boolean

    • Parameters

      • nodeid: number
      • range: V[]

      Returns void

    • Parameters

      • node: number
      • range: V[]

      Returns void

    • Parameters

      • nodeid: number

      Returns boolean

    • Parameters

      • nodeid: number

      Returns void

    • Parameters

      • from: number
      • to: number

      Returns void

    • Parameters

      • dominator_id: number
      • dominatee_id: number

      Returns void

    • Parameters

      • nodeid: number

      Returns V[]

    • Parameters

      • node: number

      Returns void

    • Parameters

      • solution_range: Map<number, V[]>
      • dominator_id: number
      • dominatee_id: number

      Returns V[]

    • Parameters

      • solution_range: Map<number, V[]>
      • dominator_id: number
      • dominatee_id: number

      Returns V[]

    • Parameters

      • node: number
      • new_range: V[]

      Returns boolean

    • Parameters

      • nodeid: number
      • range: V[]

      Returns void