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.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws(classOf[java.lang.CloneNotSupportedException]) @native()

6.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

7.  def equals(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef → Any

8.  def finalize(): Unit

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws(classOf[java.lang.Throwable])

9.  final def getClass(): Class[_ <: AnyRef]

   Definition Classes

   AnyRef → Any

   Annotations

   @native()

10.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

11.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

12.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

13.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

14.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

15.  def pSet[A](set: Set[A]): LazyList[(Set[A], Set[A])]

    Tail recursive pSet pSet s generates the power set of s, pairing each subset with its complement.

    Tail recursive pSet pSet s generates the power set of s, pairing each subset with its complement. Example: pSet(Set(1,2)) = Stream((Set(1,2),Set()),(Set(1),Set(2)),(Set(2),Set(1)),(Set(),Set(1,2))).

16.  def partition[A](set: Set[A], n: Int): LazyList[List[Set[A]]]

    paritition of a set in n sets whose union give that set again Example: partition(Set(1,2),2) = Stream( List(Set(1, 2), Set[Int]()), List(Set(2), Set(1)), List(Set(1), Set(2)), List(Set[Int](), Set(1, 2)) )

    paritition of a set in n sets whose union give that set again Example: partition(Set(1,2),2) = Stream( List(Set(1, 2), Set[Int]()), List(Set(2), Set(1)), List(Set(1), Set(2)), List(Set[Int](), Set(1, 2)) )

    partition(Set(1,2),3) = Stream( List(Set(1, 2), Set[Int](), Set[Int]()), List(Set(2), Set(1), Set[Int]()), List(Set(2), Set[Int](), Set(1)), List(Set(1), Set(2), Set[Int]()), List(Set(1), Set[Int](), Set(2)), List(Set[Int](), Set(1, 2), Set[Int]()), List(Set[Int](), Set(2), Set(1)), List(Set[Int](), Set(1), Set(2)), List(Set[Int](), Set[Int](), Set(1, 2)) )

    A

    type of values

    set

    set of elements

    n

    number of sets to generate

    returns

    a list of sets

17.  final def synchronized[T0](arg0: => T0): T0

    Definition Classes

    AnyRef

18.  def toString(): String

    Definition Classes

    AnyRef → Any

19.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

20.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

21.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException]) @native()