Object

ap.util

Combinatorics

Related Doc: package util

Permalink

object Combinatorics

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

Value Members

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def cartesianProduct[A](seqs: List[Seq[A]]): Iterator[List[A]]

    Permalink

    Compute the elements of the Cartesian product of the given sequences.

  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. def genCoveredVectors(nums: List[Int]): Iterator[List[Int]]

    Permalink

    Generate all vectors that are <= nums.

    Generate all vectors that are <= nums.

  11. def genSubMultisets[A](seq: Seq[A]): Iterator[List[A]]

    Permalink

    Compute the sub-multisets of the given multi-set.

  12. def genSubsequences[A](seqs: Seq[Seq[A]], nums: Seq[Int]): Iterator[List[A]]

    Permalink
  13. def genSubsequences[A](seq: Seq[A], num: Int): Iterator[List[A]]

    Permalink

    Compute all sub-sequences of the given sequence with exactly num elements.

    Compute all sub-sequences of the given sequence with exactly num elements.

  14. def genSubsequencesWithDups[A](seqs: Seq[Seq[A]], nums: Seq[Int]): Iterator[List[A]]

    Permalink
  15. def genSubsequencesWithDups[A](seq: Seq[A], num: Int): Iterator[List[A]]

    Permalink

    Compute all sub-sequences of the given sequence with exactly num elements, allowing elements to occur repeatedly.

    Compute all sub-sequences of the given sequence with exactly num elements, allowing elements to occur repeatedly.

  16. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  17. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  18. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  19. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  20. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  22. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  23. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  24. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped