CountSubQueryableQuery

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def /:[B](z: B)(op: (B, QueryDsl.LongType) ⇒ B): B

def :\[B](z: B)(op: (QueryDsl.LongType, B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def Count: ScalarQuery[QueryDsl.LongType]

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, QueryDsl.LongType) ⇒ 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[QueryDsl.LongType, B])(implicit bf: CanBuildFrom[Iterable[QueryDsl.LongType], B, That]): That

def collectFirst[B](pf: PartialFunction[QueryDsl.LongType, B]): Option[B]

def companion: GenericCompanion[Iterable]

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

def copyToArray[B >: QueryDsl.LongType](xs: Array[B]): Unit

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

def copyToBuffer[B >: QueryDsl.LongType](dest: Buffer[B]): Unit

def count(p: (QueryDsl.LongType) ⇒ Boolean): Int

def distinct: CountSubQueryableQuery

def drop(n: Int): Iterable[QueryDsl.LongType]

def dropRight(n: Int): Iterable[QueryDsl.LongType]

def dropWhile(p: (QueryDsl.LongType) ⇒ Boolean): Iterable[QueryDsl.LongType]

def dumpAst: String

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (QueryDsl.LongType) ⇒ Boolean): Boolean

def filter(p: (QueryDsl.LongType) ⇒ Boolean): Iterable[QueryDsl.LongType]

def filterNot(p: (QueryDsl.LongType) ⇒ Boolean): Iterable[QueryDsl.LongType]

def finalize(): Unit

def find(p: (QueryDsl.LongType) ⇒ Boolean): Option[QueryDsl.LongType]

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

def flatten[B](implicit asTraversable: (QueryDsl.LongType) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: QueryDsl.LongType](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, QueryDsl.LongType) ⇒ B): B

def foldRight[B](z: B)(op: (QueryDsl.LongType, B) ⇒ B): B

def forUpdate: ScalarQuery[QueryDsl.LongType]

def forall(p: (QueryDsl.LongType) ⇒ Boolean): Boolean

def foreach[U](f: (QueryDsl.LongType) ⇒ U): Unit

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

final def getClass(): Class[_]

def groupBy[K](f: (QueryDsl.LongType) ⇒ K): Map[K, Iterable[QueryDsl.LongType]]

def grouped(size: Int): Iterator[Iterable[QueryDsl.LongType]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: QueryDsl.LongType

def headOption: Option[QueryDsl.LongType]

def init: Iterable[QueryDsl.LongType]

def inits: Iterator[Iterable[QueryDsl.LongType]]

def invokeYield(rsm: ResultSetMapper, rs: ResultSet): QueryDsl.LongType

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[QueryDsl.LongType]

def last: QueryDsl.LongType

def lastOption: Option[QueryDsl.LongType]

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

def max[B >: QueryDsl.LongType](implicit cmp: Ordering[B]): QueryDsl.LongType

def maxBy[B](f: (QueryDsl.LongType) ⇒ B)(implicit cmp: Ordering[B]): QueryDsl.LongType

def min[B >: QueryDsl.LongType](implicit cmp: Ordering[B]): QueryDsl.LongType

def minBy[B](f: (QueryDsl.LongType) ⇒ B)(implicit cmp: Ordering[B]): QueryDsl.LongType

def minus(q: Query[QueryDsl.LongType]): Query[QueryDsl.LongType]

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[QueryDsl.LongType, Iterable[QueryDsl.LongType]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def page(offset: Int, length: Int): CountSubQueryableQuery

def par: ParIterable[QueryDsl.LongType]

def parCombiner: Combiner[QueryDsl.LongType, ParIterable[QueryDsl.LongType]]

def partition(p: (QueryDsl.LongType) ⇒ Boolean): (Iterable[QueryDsl.LongType], Iterable[QueryDsl.LongType])

def product[B >: QueryDsl.LongType](implicit num: Numeric[B]): B

def reduce[A1 >: QueryDsl.LongType](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: QueryDsl.LongType](op: (B, QueryDsl.LongType) ⇒ B): B

def reduceLeftOption[B >: QueryDsl.LongType](op: (B, QueryDsl.LongType) ⇒ B): Option[B]

def reduceOption[A1 >: QueryDsl.LongType](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: QueryDsl.LongType](op: (QueryDsl.LongType, B) ⇒ B): B

def reduceRightOption[B >: QueryDsl.LongType](op: (QueryDsl.LongType, B) ⇒ B): Option[B]

def repr: Iterable[QueryDsl.LongType]

def reversed: List[QueryDsl.LongType]

def sameElements[B >: QueryDsl.LongType](that: GenIterable[B]): Boolean

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

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

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

def seq: Iterable[QueryDsl.LongType]

def single: QueryDsl.LongType

Returns the first row of the query.

def size: Int

def slice(from: Int, until: Int): Iterable[QueryDsl.LongType]

def sliding(size: Int, step: Int): Iterator[Iterable[QueryDsl.LongType]]

def sliding(size: Int): Iterator[Iterable[QueryDsl.LongType]]

def span(p: (QueryDsl.LongType) ⇒ Boolean): (Iterable[QueryDsl.LongType], Iterable[QueryDsl.LongType])

def splitAt(n: Int): (Iterable[QueryDsl.LongType], Iterable[QueryDsl.LongType])

def statement: String

returns a 'pretty' statement, i.

def stringPrefix: String

def sum[B >: QueryDsl.LongType](implicit num: Numeric[B]): B

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

def tail: Iterable[QueryDsl.LongType]

def tails: Iterator[Iterable[QueryDsl.LongType]]

def take(n: Int): Iterable[QueryDsl.LongType]

def takeRight(n: Int): Iterable[QueryDsl.LongType]

def takeWhile(p: (QueryDsl.LongType) ⇒ Boolean): Iterable[QueryDsl.LongType]

def thisCollection: Iterable[QueryDsl.LongType]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, QueryDsl.LongType, Col[QueryDsl.LongType]]): Col[QueryDsl.LongType]

def toArray[B >: QueryDsl.LongType](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: QueryDsl.LongType]: Buffer[B]

def toCollection(repr: Iterable[QueryDsl.LongType]): Iterable[QueryDsl.LongType]

def toIndexedSeq: IndexedSeq[QueryDsl.LongType]

def toIterable: Iterable[QueryDsl.LongType]

def toIterator: Iterator[QueryDsl.LongType]

def toList: List[QueryDsl.LongType]

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

def toSeq: Seq[QueryDsl.LongType]

def toSet[B >: QueryDsl.LongType]: Set[B]

def toStream: Stream[QueryDsl.LongType]

def toString(): String

def toTraversable: Traversable[QueryDsl.LongType]

def toVector: Vector[QueryDsl.LongType]

def transpose[B](implicit asTraversable: (QueryDsl.LongType) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def union(q: Query[QueryDsl.LongType]): Query[QueryDsl.LongType]

def unzip[A1, A2](implicit asPair: (QueryDsl.LongType) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (QueryDsl.LongType) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def view(from: Int, until: Int): IterableView[QueryDsl.LongType, Iterable[QueryDsl.LongType]]

def view: IterableView[QueryDsl.LongType, Iterable[QueryDsl.LongType]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

def withFilter(p: (QueryDsl.LongType) ⇒ Boolean): FilterMonadic[QueryDsl.LongType, Iterable[QueryDsl.LongType]]

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

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

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

def /:\[A1 >: QueryDsl.LongType](z: A1)(op: (A1, A1) ⇒ A1): A1