Class

util.analyzers.GenMDDFactory

MDDNode

Related Doc: package GenMDDFactory

Permalink

class MDDNode extends MDD with NodeNP[Val, MDD, Var] with Traversable[(Val, MDD)]

case class for Node of a MDD

Linear Supertypes
Traversable[(Val, MDD)], GenTraversable[(Val, MDD)], GenericTraversableTemplate[(Val, MDD), Traversable], TraversableLike[(Val, MDD), Traversable[(Val, MDD)]], GenTraversableLike[(Val, MDD), Traversable[(Val, MDD)]], Parallelizable[(Val, MDD), ParIterable[(Val, MDD)]], TraversableOnce[(Val, MDD)], GenTraversableOnce[(Val, MDD)], FilterMonadic[(Val, MDD), Traversable[(Val, MDD)]], HasNewBuilder[(Val, MDD), Traversable[(Val, MDD)]], NodeNP[Val, MDD, Var], MDD, Node, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MDDNode
  2. Traversable
  3. GenTraversable
  4. GenericTraversableTemplate
  5. TraversableLike
  6. GenTraversableLike
  7. Parallelizable
  8. TraversableOnce
  9. GenTraversableOnce
  10. FilterMonadic
  11. HasNewBuilder
  12. NodeNP
  13. MDD
  14. Node
  15. AnyRef
  16. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Self = Traversable[(Val, MDD)]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def ++[B >: (Val, MDD), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(Val, MDD)], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  4. def ++:[B >: (Val, MDD), That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[(Val, MDD)], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  5. def ++:[B >: (Val, MDD), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(Val, MDD)], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  6. def /:[B](z: B)(op: (B, (Val, MDD)) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  7. def :\[B](z: B)(op: ((Val, MDD), B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  8. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  9. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  10. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  11. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  12. def aggregate[B](z: ⇒ B)(seqop: (B, (Val, MDD)) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  13. def applyCase(altsMap: Map[ValuedTerminal, MDD]): MDD

    Permalink

    F.applyCase(t1->G1,..,tp->Gp) apply MDD Gi if F=ti, thus we must have p=|terminals|

    F.applyCase(t1->G1,..,tp->Gp) apply MDD Gi if F=ti, thus we must have p=|terminals|

    altsMap

    gives for each terminal ti of F the corresponding alternative

    returns

    the resulting MDD after application of alternatives

    Definition Classes
    MDD
  14. def applyCaseInOrder(alt: MDD*): MDD

    Permalink

    apply the case operator by giving the alternative in order according to the mdd terminals order

    apply the case operator by giving the alternative in order according to the mdd terminals order

    alt

    alternative fo terminal i

    returns

    the resulting MDD

    Definition Classes
    MDD
  15. val applyCaseTailRec: (Map[Terminal, MDD]) ⇒ TailRec[MDD]

    Permalink

    If the selector is a node then we apply the formula of "Algorithms for Discrete Function Manipulation" (doi: 10.1109/ICCAD.1990.129849) F.applyCase(t1->G1,..,tp->Gp)= (v, v1->F.coFactor(v,v1).applyCase(t1->G1.cofactor(v,v1),...,tp->Gp.cofactor(v,v1)), ..., vn->F.coFactor(v,vn).applyCase(t1->G1.cofactor(v,vn),...,tp->Gp.cofactor(v,vn))) where v is the lowest var in {F,G1,...,Gp} and its domain is {v1..vn} and terminal is a subset of {t1,...,tp}.

    If the selector is a node then we apply the formula of "Algorithms for Discrete Function Manipulation" (doi: 10.1109/ICCAD.1990.129849) F.applyCase(t1->G1,..,tp->Gp)= (v, v1->F.coFactor(v,v1).applyCase(t1->G1.cofactor(v,v1),...,tp->Gp.cofactor(v,v1)), ..., vn->F.coFactor(v,vn).applyCase(t1->G1.cofactor(v,vn),...,tp->Gp.cofactor(v,vn))) where v is the lowest var in {F,G1,...,Gp} and its domain is {v1..vn} and terminal is a subset of {t1,...,tp}. Indeed for an applyCase, the MDD is build only if for each possible terminal the alternative is specified

    returns

    the resulting MDD after application of alternatives

    Attributes
    protected[util.analyzers.GenMDDFactory]
    Definition Classes
    MDDNodeMDD
  16. def applyCaseWithDefault(altsMap: Map[ValuedTerminal, MDD], default: ValuedTerminal): MDD

    Permalink

    apply the case operator by setting all terminals alternatives which are not in altsMap to the default value

    apply the case operator by setting all terminals alternatives which are not in altsMap to the default value

    altsMap

    the alternative map

    default

    the default value

    returns

    the resulting MDD

    Definition Classes
    MDD
  17. def applyCaseWithDefaultTrash(altsMap: Map[ValuedTerminal, MDD]): MDD

    Permalink

    apply the case operator by setting all terminals alternatives which are not in altsMap to the trash terminal

    apply the case operator by setting all terminals alternatives which are not in altsMap to the trash terminal

    altsMap

    the alternative map

    returns

    the resulting MDD

    Definition Classes
    MDD
  18. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  19. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  20. def coFactor(variable: Var, value: Val): MDD

    Permalink

    For a node(w,kid1,...kidp) the coFactor over v=vi could be : -himself if the v < w (since v will not appear in kids) -kidi if v = w (since the decision is done on this label) -(w,kid1.coFactor(v=vi),...,kidp.coFactor(v=vi)) if v > w (since v could appear in kids we must rebuild a node where the decision v=vi has been applied)

    For a node(w,kid1,...kidp) the coFactor over v=vi could be : -himself if the v < w (since v will not appear in kids) -kidi if v = w (since the decision is done on this label) -(w,kid1.coFactor(v=vi),...,kidp.coFactor(v=vi)) if v > w (since v could appear in kids we must rebuild a node where the decision v=vi has been applied)

    variable

    the label to assign

    value

    the value to assign

    returns

    the coFactor of this BDD

    Attributes
    protected[util.analyzers.GenMDDFactory]
    Definition Classes
    MDDNodeMDD
  21. def collect[B, That](pf: PartialFunction[(Val, MDD), B])(implicit bf: CanBuildFrom[Traversable[(Val, MDD)], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  22. def collectFirst[B](pf: PartialFunction[(Val, MDD), B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  23. def companion: GenericCompanion[Traversable]

    Permalink
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate
  24. def copyToArray[B >: (Val, MDD)](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  25. def copyToArray[B >: (Val, MDD)](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def copyToArray[B >: (Val, MDD)](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def copyToBuffer[B >: (Val, MDD)](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce
  28. def count(p: ((Val, MDD)) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  29. def drop(n: Int): Traversable[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  30. def dropWhile(p: ((Val, MDD)) ⇒ Boolean): Traversable[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  31. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  32. def equals(other: Any): Boolean

    Permalink

    Reference based equality.

    Reference based equality.

    Definition Classes
    Node → AnyRef → Any
  33. def exists(p: ((Val, MDD)) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  34. def filter(p: ((Val, MDD)) ⇒ Boolean): Traversable[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  35. def filterNot(p: ((Val, MDD)) ⇒ Boolean): Traversable[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  36. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  37. def find(p: ((Val, MDD)) ⇒ Boolean): Option[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  38. def flatMap[B, That](f: ((Val, MDD)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(Val, MDD)], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  39. def flatten[B](implicit asTraversable: ((Val, MDD)) ⇒ GenTraversableOnce[B]): Traversable[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  40. def fold[A1 >: (Val, MDD)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  41. def foldLeft[B](z: B)(op: (B, (Val, MDD)) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  42. def foldRight[B](z: B)(op: ((Val, MDD), B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  43. def forall(p: ((Val, MDD)) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  44. def foreach[U](f: ((Val, MDD)) ⇒ U): Unit

    Permalink
    Definition Classes
    MDDNode → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  45. def genericBuilder[B]: Builder[B, Traversable[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  46. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  47. def groupBy[K](f: ((Val, MDD)) ⇒ K): Map[K, Traversable[(Val, MDD)]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  48. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  49. lazy val hashCode: Int

    Permalink
    Definition Classes
    NodeNP → AnyRef → Any
  50. def head: (Val, MDD)

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  51. def headOption: Option[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def init: Traversable[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  53. def inits: Iterator[Traversable[(Val, MDD)]]

    Permalink
    Definition Classes
    TraversableLike
  54. def isEmpty: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  55. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  56. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  57. final val kids: SortedMap[Val, MDD]

    Permalink

    the kids for each possible value of topVar (accessible from the main MDDMap)

    the kids for each possible value of topVar (accessible from the main MDDMap)

    Definition Classes
    MDDNodeNodeNP
  58. def last: (Val, MDD)

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  59. def lastOption: Option[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  60. def map[B, That](f: ((Val, MDD)) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(Val, MDD)], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  61. def max[B >: (Val, MDD)](implicit cmp: Ordering[B]): (Val, MDD)

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  62. def maxBy[B](f: ((Val, MDD)) ⇒ B)(implicit cmp: Ordering[B]): (Val, MDD)

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  63. def min[B >: (Val, MDD)](implicit cmp: Ordering[B]): (Val, MDD)

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  64. def minBy[B](f: ((Val, MDD)) ⇒ B)(implicit cmp: Ordering[B]): (Val, MDD)

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  65. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  66. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  67. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  69. def newBuilder: Builder[(Val, MDD), Traversable[(Val, MDD)]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  70. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  71. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  72. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  73. def par: ParIterable[(Val, MDD)]

    Permalink
    Definition Classes
    Parallelizable
  74. def parCombiner: Combiner[(Val, MDD), ParIterable[(Val, MDD)]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  75. final val param: Var

    Permalink

    the decision label of this Node

    the decision label of this Node

    Definition Classes
    MDDNodeNodeNP
  76. def partition(p: ((Val, MDD)) ⇒ Boolean): (Traversable[(Val, MDD)], Traversable[(Val, MDD)])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  77. def product[B >: (Val, MDD)](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. def reduce[A1 >: (Val, MDD)](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. def reduceLeft[B >: (Val, MDD)](op: (B, (Val, MDD)) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce
  80. def reduceLeftOption[B >: (Val, MDD)](op: (B, (Val, MDD)) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  81. def reduceOption[A1 >: (Val, MDD)](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  82. def reduceRight[B >: (Val, MDD)](op: ((Val, MDD), B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  83. def reduceRightOption[B >: (Val, MDD)](op: ((Val, MDD), B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. def removeTerminal(terminal: ValuedTerminal): MDD

    Permalink

    adds all the path to the terminal as forbidden values and returns the result

    adds all the path to the terminal as forbidden values and returns the result

    terminal

    the terminal to remove

    Definition Classes
    MDD
  85. def removeTerminals(toReplace: Traversable[ValuedTerminal]): MDD

    Permalink

    adds all the path to the terminal as forbidden values and returns the result

    adds all the path to the terminal as forbidden values and returns the result

    toReplace

    the terminals to remove

    Definition Classes
    MDD
  86. def repr: Traversable[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  87. def reversed: List[(Val, MDD)]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  88. def scan[B >: (Val, MDD), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[(Val, MDD)], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  89. def scanLeft[B, That](z: B)(op: (B, (Val, MDD)) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(Val, MDD)], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  90. def scanRight[B, That](z: B)(op: ((Val, MDD), B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(Val, MDD)], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  91. def seq: Traversable[(Val, MDD)]

    Permalink
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  92. def size: Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def slice(from: Int, until: Int): Traversable[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def span(p: ((Val, MDD)) ⇒ Boolean): (Traversable[(Val, MDD)], Traversable[(Val, MDD)])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def splitAt(n: Int): (Traversable[(Val, MDD)], Traversable[(Val, MDD)])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  96. def stringPrefix: String

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  97. def sum[B >: (Val, MDD)](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  99. def tail: Traversable[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def tails: Iterator[Traversable[(Val, MDD)]]

    Permalink
    Definition Classes
    TraversableLike
  101. def take(n: Int): Traversable[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  102. def takeWhile(p: ((Val, MDD)) ⇒ Boolean): Traversable[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  103. val terminals: SortedSet[ValuedTerminal]

    Permalink
    Definition Classes
    MDDNodeMDD
  104. def thisCollection: Traversable[(Val, MDD)]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  105. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (Val, MDD), Col[(Val, MDD)]]): Col[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  106. def toArray[B >: (Val, MDD)](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def toBuffer[B >: (Val, MDD)]: Buffer[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def toCollection(repr: Traversable[(Val, MDD)]): Traversable[(Val, MDD)]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  109. def toIndexedSeq: IndexedSeq[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def toIterable: Iterable[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def toIterator: Iterator[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableOnce
  112. def toList: List[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def toMap[T, U](implicit ev: <:<[(Val, MDD), (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def toSeq: Seq[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def toSet[B >: (Val, MDD)]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def toStream: Stream[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableOnce
  117. def toString(): String

    Permalink
    Definition Classes
    MDDNode → TraversableLike → AnyRef → Any
  118. def toTraversable: Traversable[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  119. def toVector: Vector[(Val, MDD)]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def transpose[B](implicit asTraversable: ((Val, MDD)) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  121. def unzip[A1, A2](implicit asPair: ((Val, MDD)) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  122. def unzip3[A1, A2, A3](implicit asTriple: ((Val, MDD)) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  123. val variables: SortedSet[Var]

    Permalink
    Definition Classes
    MDDNodeMDD
  124. def view(from: Int, until: Int): TraversableView[(Val, MDD), Traversable[(Val, MDD)]]

    Permalink
    Definition Classes
    TraversableLike
  125. def view: TraversableView[(Val, MDD), Traversable[(Val, MDD)]]

    Permalink
    Definition Classes
    TraversableLike
  126. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  129. def withFilter(p: ((Val, MDD)) ⇒ Boolean): FilterMonadic[(Val, MDD), Traversable[(Val, MDD)]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic

Inherited from Traversable[(Val, MDD)]

Inherited from GenTraversable[(Val, MDD)]

Inherited from GenericTraversableTemplate[(Val, MDD), Traversable]

Inherited from TraversableLike[(Val, MDD), Traversable[(Val, MDD)]]

Inherited from GenTraversableLike[(Val, MDD), Traversable[(Val, MDD)]]

Inherited from Parallelizable[(Val, MDD), ParIterable[(Val, MDD)]]

Inherited from TraversableOnce[(Val, MDD)]

Inherited from GenTraversableOnce[(Val, MDD)]

Inherited from FilterMonadic[(Val, MDD), Traversable[(Val, MDD)]]

Inherited from HasNewBuilder[(Val, MDD), Traversable[(Val, MDD)]]

Inherited from NodeNP[Val, MDD, Var]

Inherited from MDD

Inherited from Node

Inherited from AnyRef

Inherited from Any

Ungrouped