FiniteDiscreteDomain

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(that: GenSet[T]): DiscreteDomain[T]

def &~(that: GenSet[T]): DiscreteDomain[T]

def +(elem: T): DiscreteDomain[T]

def +(elem1: T, elem2: T, elems: T*): DiscreteDomain[T]

def ++(elems: GenTraversableOnce[T]): DiscreteDomain[T]

def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[DiscreteDomain[T], B, That]): That

def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[DiscreteDomain[T], B, That]): That

def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[DiscreteDomain[T], B, That]): That

def -(elem: T): DiscreteDomain[T]

def -(elem1: T, elem2: T, elems: T*): DiscreteDomain[T]

def --(xs: GenTraversableOnce[T]): DiscreteDomain[T]

def /:[B](z: B)(op: (B, T) ⇒ B): B

def :\[B](z: B)(op: (T, B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[A](g: (Boolean) ⇒ A): (T) ⇒ A

def apply(elem: T): Boolean

final def asInstanceOf[T0]: T0

def bounds(implicit ev: Ordering[T]): Option[(T, T)]

The bounds method produces a minima/maxima scala.Tuple2 for the Domain value type, if possible.

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[DiscreteDomain[T], B, That]): That

def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

def companion: GenericCompanion[DiscreteDomain]

def compose[A](g: (A) ⇒ T): (A) ⇒ Boolean

def contains(elem: T): Boolean

The contains method determines whether or not the given item is within this Domain.

def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: T](xs: Array[B]): Unit

def copyToArray[B >: T](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: T](dest: Buffer[B]): Unit

def count(p: (T) ⇒ Boolean): Int

def diff(that: GenSet[T]): DiscreteDomain[T]

def drop(n: Int): DiscreteDomain[T]

def dropRight(n: Int): DiscreteDomain[T]

def dropWhile(p: (T) ⇒ Boolean): DiscreteDomain[T]

def empty: DiscreteDomain[T]

The empty property must produce a Domain which has no contents, for whatever definition of that means to the concrete type.

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: (T) ⇒ Boolean): Boolean

def filter(p: (T) ⇒ Boolean): DiscreteDomain[T]

def filterNot(p: (T) ⇒ Boolean): DiscreteDomain[T]

def finalize(): Unit

def find(p: (T) ⇒ Boolean): Option[T]

def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[DiscreteDomain[T], B, That]): That

def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Set[B]

def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

def foldRight[B](z: B)(op: (T, B) ⇒ B): B

def forall(p: (T) ⇒ Boolean): Boolean

def foreach[R](f: (T) ⇒ R): Unit

def genericBuilder[B]: Builder[B, Set[B]]

final def getClass(): Class[_]

def groupBy[K](f: (T) ⇒ K): Map[K, DiscreteDomain[T]]

def grouped(size: Int): Iterator[DiscreteDomain[T]]

val hasDefiniteSize: Boolean

def hashCode(): Int

def head: T

def headOption: Option[T]

def init: DiscreteDomain[T]

def inits: Iterator[DiscreteDomain[T]]

def intersect(that: GenSet[T]): DiscreteDomain[T]

final val isDiscrete: Boolean

The isDiscrete property indicates whether or not this Domain contains values which are not contiguous.

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

lazy val iterator: Iterator[T]

def last: T

def lastOption: Option[T]

def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[DiscreteDomain[T], B, That]): That

def max[B >: T](implicit cmp: Ordering[B]): T

def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def min[B >: T](implicit cmp: Ordering[B]): T

def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[T, DiscreteDomain[T]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParSet[T]

def parCombiner: Combiner[T, ParSet[T]]

def partition(p: (T) ⇒ Boolean): (DiscreteDomain[T], DiscreteDomain[T])

def product[B >: T](implicit num: Numeric[B]): B

def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: T](op: (B, T) ⇒ B): B

def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: T](op: (T, B) ⇒ B): B

def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

def repr: DiscreteDomain[T]

def reversed: List[T]

def sameElements[B >: T](that: GenIterable[B]): Boolean

def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[DiscreteDomain[T], B, That]): That

def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[DiscreteDomain[T], B, That]): That

def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[DiscreteDomain[T], B, That]): That

def seq: DiscreteDomain[T]

lazy val size: Int

def slice(from: Int, until: Int): DiscreteDomain[T]

def sliding(size: Int, step: Int): Iterator[DiscreteDomain[T]]

def sliding(size: Int): Iterator[DiscreteDomain[T]]

def span(p: (T) ⇒ Boolean): (DiscreteDomain[T], DiscreteDomain[T])

def splitAt(n: Int): (DiscreteDomain[T], DiscreteDomain[T])

def stringPrefix: String

def subsetOf(that: GenSet[T]): Boolean

def subsets: Iterator[DiscreteDomain[T]]

def subsets(len: Int): Iterator[DiscreteDomain[T]]

def sum[B >: T](implicit num: Numeric[B]): B

final def synchronized[T0](arg0: ⇒ T0): T0

def tail: DiscreteDomain[T]

def tails: Iterator[DiscreteDomain[T]]

def take(n: Int): DiscreteDomain[T]

def takeRight(n: Int): DiscreteDomain[T]

def takeWhile(p: (T) ⇒ Boolean): DiscreteDomain[T]

def thisCollection: Iterable[T]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[A1 >: T]: Buffer[A1]

def toCollection(repr: DiscreteDomain[T]): Iterable[T]

def toIndexedSeq: IndexedSeq[T]

def toIterable: Iterable[T]

def toIterator: Iterator[T]

def toList: List[T]

def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

def toSeq: Seq[T]

def toSet[B >: T]: Set[B]

def toStream: Stream[T]

def toString(): String

def toTraversable: Traversable[T]

def toVector: Vector[T]

def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Set[Set[B]]

def union(that: GenSet[T]): DiscreteDomain[T]

def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Set[A1], Set[A2])

def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

def view(from: Int, until: Int): IterableView[T, DiscreteDomain[T]]

def view: IterableView[T, DiscreteDomain[T]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, DiscreteDomain[T]]

def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[DiscreteDomain[T], (A1, B), That]): That

def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[DiscreteDomain[T], (A1, B), That]): That

def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[DiscreteDomain[T], (A1, Int), That]): That

def |(that: GenSet[T]): DiscreteDomain[T]

def /:\[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1