DelegateQuery

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

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

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

final def asInstanceOf[T0]: T0

def ast: ExpressionNode

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[M, B])(implicit bf: CanBuildFrom[Iterable[M], B, That]): That

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

def companion: GenericCompanion[Iterable]

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

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

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

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

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

def distinct: Query[M]

def drop(n: Int): Iterable[M]

def dropRight(n: Int): Iterable[M]

def dropWhile(p: (M) ⇒ Boolean): Iterable[M]

def dumpAst: String

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

def filter(p: (M) ⇒ Boolean): Iterable[M]

def filterNot(p: (M) ⇒ Boolean): Iterable[M]

def finalize(): Unit

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

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

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

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

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

def forUpdate: Query[M]

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

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

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

final def getClass(): java.lang.Class[_]

def groupBy[K](f: (M) ⇒ K): Map[K, Iterable[M]]

def grouped(size: Int): Iterator[Iterable[M]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: M

def headOption: Option[M]

def init: Iterable[M]

def inits: Iterator[Iterable[M]]

def invokeYield(rsm: ResultSetMapper, rs: ResultSet): M

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[M]

def last: M

def lastOption: Option[M]

def map[B, That](f: (M) ⇒ B)(implicit bf: CanBuildFrom[Iterable[M], B, That]): That

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

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

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

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

def minus(q: Query[M]): Query[M]

def mkString: String

def mkString(sep: String): String

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

def name: String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[M, Iterable[M]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def page(offset: Int, length: Int): Query[M]

def par: ParIterable[M]

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

def partition(p: (M) ⇒ Boolean): (Iterable[M], Iterable[M])

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

val q: Query[M]

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

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

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

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

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

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

def repr: Iterable[M]

def reversed: List[M]

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

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

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

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

def seq: Iterable[M]

def single: M

Returns the first row of the query.

def size: Int

def slice(from: Int, until: Int): Iterable[M]

def sliding[B >: M](size: Int, step: Int): Iterator[Iterable[M]]

def sliding[B >: M](size: Int): Iterator[Iterable[M]]

def span(p: (M) ⇒ Boolean): (Iterable[M], Iterable[M])

def splitAt(n: Int): (Iterable[M], Iterable[M])

def statement: String

returns a 'pretty' statement, i.

def stringPrefix: String

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

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

def tail: Iterable[M]

def tails: Iterator[Iterable[M]]

def take(n: Int): Iterable[M]

def takeRight(n: Int): Iterable[M]

def takeWhile(p: (M) ⇒ Boolean): Iterable[M]

def thisCollection: Iterable[M]

def toArray[B >: M](implicit arg0: ClassManifest[B]): Array[B]

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

def toCollection(repr: Iterable[M]): Iterable[M]

def toIndexedSeq[B >: M]: IndexedSeq[B]

def toIterable: Iterable[M]

def toIterator: Iterator[M]

def toList: List[M]

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

def toSeq: Seq[M]

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

def toStream: Stream[M]

def toString(): String

def toTraversable: Traversable[M]

def transpose[B](implicit asTraversable: (M) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def union(q: Query[M]): Query[M]

def unzip[A1, A2](implicit asPair: (M) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (M) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

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

def view: IterableView[M, Iterable[M]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def where(whereClauseFunctor: (M) ⇒ LogicalBoolean)(implicit dsl: QueryDsl): Query[M]

def withFilter(p: (M) ⇒ Boolean): FilterMonadic[M, Iterable[M]]

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

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

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

def elements: Iterator[M]

def first: M

def firstOption: Option[M]

def projection: IterableView[M, Iterable[M]]