rows

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(that: GenSet[Int]): Set[Int]

def &~(that: GenSet[Int]): Set[Int]

def +(elem1: Int, elem2: Int, elems: Int*): Set[Int]

def +(elem: Int): Set[Int]

def ++(xs: GenTraversableOnce[Int]): Set[Int]

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

def ++:[B >: Int, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Set[Int], B, That]): That

def ++:[B >: Int, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[Set[Int], B, That]): That

final def ++=(xs: MoreElem[Int]): rows.this.type

final def +=(elem: Int): rows.this.type

def +=(elem1: Int, elem2: Int, elems: Int*): rows.this.type

def -(elem1: Int, elem2: Int, elems: Int*): Set[Int]

def -(elem: Int): Set[Int]

def --(xs: GenTraversableOnce[Int]): Set[Int]

final def --=(xs: MoreElem[Int]): rows.this.type

final def -=(elem: Int): rows.this.type

def -=(elem1: Int, elem2: Int, elems: Int*): rows.this.type

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

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

final def ==(arg0: Any): Boolean

def add(elem: Int): Boolean

def addAll(xs: MoreElem[Int]): rows.this.type

def addOne(n: Int): rows.this.type

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, Int) ⇒ B, combop: (B, B) ⇒ B): B

def anchorIndex: Int

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

def apply(elem: Int): Boolean

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clear(): Unit

def clone(): Set[Int]

def collect[B, That](pf: PartialFunction[Int, B])(implicit bf: CanBuildFrom[Set[Int], B, That]): That

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

def companion: GenericCompanion[Set]

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

def contains(n: Int): Boolean

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

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

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

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

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

def diff(that: GenSet[Int]): Set[Int]

def drop(n: Int): Set[Int]

def dropRight(n: Int): Set[Int]

def dropWhile(p: (Int) ⇒ Boolean): Set[Int]

def empty: Set[Int]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def filter(p: (Int) ⇒ Boolean): Set[Int]

def filterNot(p: (Int) ⇒ Boolean): Set[Int]

def finalize(): Unit

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

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

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

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

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

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

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

def foreach[U](f: (Int) ⇒ U): Unit

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

final def getClass(): Class[_]

def groupBy[K](f: (Int) ⇒ K): Map[K, Set[Int]]

def grouped(size: Int): collection.Iterator[Set[Int]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Int

def headOption: Option[Int]

def init: Set[Int]

def inits: collection.Iterator[Set[Int]]

def intersect(that: GenSet[Int]): Set[Int]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Int]

def last: Int

def lastOption: Option[Int]

def leadIndex: Int

def map[B, That](f: (Int) ⇒ B)(implicit bf: CanBuildFrom[Set[Int], B, That]): That

def mapResult[NewTo](f: (Set[Int]) ⇒ NewTo): Builder[Int, NewTo]

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

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

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

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

final def mkIterator[B](xs: MoreElem[B]): Iterator[B]

Cross-version way for creating an iterator from MoreElem.

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[Int, Set[Int]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParSet[Int]

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

def partition(p: (Int) ⇒ Boolean): (Set[Int], Set[Int])

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

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

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

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

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

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

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

def remove(elem: Int): Boolean

def repr: Set[Int]

def result(): Set[Int]

def retain(p: (Int) ⇒ Boolean): Unit

def reversed: List[Int]

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

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

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

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

def seq: Set[Int]

def size: Int

def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

def sizeHint(coll: TraversableLike[_, _]): Unit

def sizeHint(size: Int): Unit

def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

def slice(from: Int, until: Int): Set[Int]

def sliding(size: Int, step: Int): collection.Iterator[Set[Int]]

def sliding(size: Int): collection.Iterator[Set[Int]]

def span(p: (Int) ⇒ Boolean): (Set[Int], Set[Int])

def splitAt(n: Int): (Set[Int], Set[Int])

def stringPrefix: String

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

def subsets(): collection.Iterator[Set[Int]]

def subsets(len: Int): collection.Iterator[Set[Int]]

def subtractAll(xs: MoreElem[Int]): rows.this.type

def subtractOne(n: Int): rows.this.type

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

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

def tail: Set[Int]

def tails: collection.Iterator[Set[Int]]

def take(n: Int): Set[Int]

def takeRight(n: Int): Set[Int]

def takeWhile(p: (Int) ⇒ Boolean): Set[Int]

def thisCollection: collection.Iterable[Int]

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

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

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

def toCollection(repr: Set[Int]): collection.Iterable[Int]

def toIndexedSeq: collection.immutable.IndexedSeq[Int]

def toIterable: collection.Iterable[Int]

def toIterator: collection.Iterator[Int]

def toList: List[Int]

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

def toSeq: collection.Seq[Int]

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

def toStream: collection.immutable.Stream[Int]

def toString(): String

def toTraversable: collection.Traversable[Int]

def toVector: Vector[Int]

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

def union(that: GenSet[Int]): Set[Int]

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

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

def update(elem: Int, included: Boolean): Unit

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

def view: IterableView[Int, Set[Int]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (Int) ⇒ Boolean): FilterMonadic[Int, Set[Int]]

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

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

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

def |(that: GenSet[Int]): Set[Int]

def <<(cmd: Message[Int]): Unit