ResultSetTraversable

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

def :\[B](z: B)(op: (WrappedResultSet, 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, WrappedResultSet) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[WrappedResultSet, B])(implicit bf: CanBuildFrom[Traversable[WrappedResultSet], B, That]): That

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

def companion: GenericCompanion[Traversable]

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

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

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

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

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

def drop(n: Int): Traversable[WrappedResultSet]

def dropWhile(p: (WrappedResultSet) ⇒ Boolean): Traversable[WrappedResultSet]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

def filter(p: (WrappedResultSet) ⇒ Boolean): Traversable[WrappedResultSet]

def filterNot(p: (WrappedResultSet) ⇒ Boolean): Traversable[WrappedResultSet]

def finalize(): Unit

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

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

def flatten[B](implicit asTraversable: (WrappedResultSet) ⇒ GenTraversableOnce[B]): Traversable[B]

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

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

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

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

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

Applies a function.

def futureUsing[R <: Closable, A](resource: R)(f: (R) ⇒ Future[A])(implicit ec: ExecutionContext): Future[A]

Guarantees a Closeable resource will be closed after being passed to a block that takes the resource as a parameter and returns a Future.

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

final def getClass(): Class[_]

def groupBy[K](f: (WrappedResultSet) ⇒ K): Map[K, Traversable[WrappedResultSet]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: WrappedResultSet

def headOption: Option[WrappedResultSet]

def init: Traversable[WrappedResultSet]

def inits: Iterator[Traversable[WrappedResultSet]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def last: WrappedResultSet

def lastOption: Option[WrappedResultSet]

def map[B, That](f: (WrappedResultSet) ⇒ B)(implicit bf: CanBuildFrom[Traversable[WrappedResultSet], B, That]): That

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

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

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

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

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[WrappedResultSet, Traversable[WrappedResultSet]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[WrappedResultSet]

def parCombiner: Combiner[WrappedResultSet, ParIterable[WrappedResultSet]]

def partition(p: (WrappedResultSet) ⇒ Boolean): (Traversable[WrappedResultSet], Traversable[WrappedResultSet])

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

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

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

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

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

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

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

def repr: Traversable[WrappedResultSet]

def reversed: List[WrappedResultSet]

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

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

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

def seq: Traversable[WrappedResultSet]

def size: Int

def slice(from: Int, until: Int): Traversable[WrappedResultSet]

def span(p: (WrappedResultSet) ⇒ Boolean): (Traversable[WrappedResultSet], Traversable[WrappedResultSet])

def splitAt(n: Int): (Traversable[WrappedResultSet], Traversable[WrappedResultSet])

def stringPrefix: String

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

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

def tail: Traversable[WrappedResultSet]

def tails: Iterator[Traversable[WrappedResultSet]]

def take(n: Int): Traversable[WrappedResultSet]

def takeWhile(p: (WrappedResultSet) ⇒ Boolean): Traversable[WrappedResultSet]

def thisCollection: Traversable[WrappedResultSet]

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

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

def toBuffer[B >: WrappedResultSet]: Buffer[B]

def toCollection(repr: Traversable[WrappedResultSet]): Traversable[WrappedResultSet]

def toIndexedSeq: IndexedSeq[WrappedResultSet]

def toIterable: Iterable[WrappedResultSet]

def toIterator: Iterator[WrappedResultSet]

def toList: List[WrappedResultSet]

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

def toSeq: Seq[WrappedResultSet]

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

def toStream: Stream[WrappedResultSet]

def toString(): String

def toTraversable: Traversable[WrappedResultSet]

def toVector: Vector[WrappedResultSet]

def transpose[B](implicit asTraversable: (WrappedResultSet) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

def unzip[A1, A2](implicit asPair: (WrappedResultSet) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (WrappedResultSet) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

def using[R <: Closable, A](resource: R)(f: (R) ⇒ A): A

def view(from: Int, until: Int): TraversableView[WrappedResultSet, Traversable[WrappedResultSet]]

def view: TraversableView[WrappedResultSet, Traversable[WrappedResultSet]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (WrappedResultSet) ⇒ Boolean): FilterMonadic[WrappedResultSet, Traversable[WrappedResultSet]]

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