BaseJoinQuery

Instance Constructors

new BaseJoinQuery(leftGen: TermSymbol, rightGen: TermSymbol, left: Node, right: Node, jt: JoinType, base: ShapedValue[_ <: (E1, E2), (U1, U2)], b1: B1, b2: B2)

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def +(other: String): String

Implicit information
This member is added by an implicit conversion from BaseJoinQuery[E1, E2, U1, U2, C, B1, B2] to any2stringadd[BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
def ++[O >: (E1, E2), R, D[_]](other: Query[O, (U1, U2), D]): Query[O, (U1, U2), C]

Return a new query containing the elements from both operands.
Return a new query containing the elements from both operands. Duplicate elements are preserved.

Definition Classes
Query
def ->[B](y: B): (BaseJoinQuery[E1, E2, U1, U2, C, B1, B2], B)

Implicit information
This member is added by an implicit conversion from BaseJoinQuery[E1, E2, U1, U2, C, B1, B2] to ArrowAssoc[BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def distinct: Query[(E1, E2), (U1, U2), C]

Remove duplicate elements.
Remove duplicate elements. When used on an ordered Query, there is no guarantee in which order duplicates are removed. This method is equivalent to distinctOn(identity).

Definition Classes
Query
def distinctOn[F, T](f: ((E1, E2)) ⇒ F)(implicit shape: Shape[_ <: FlatShapeLevel, F, T, _]): Query[(E1, E2), (U1, U2), C]

Remove duplicate elements which are the same in the given projection.
Remove duplicate elements which are the same in the given projection. When used on an ordered Query, there is no guarantee in which order duplicates are removed.

Definition Classes
Query
def drop(num: Int): Query[(E1, E2), (U1, U2), C]

Select all elements except the first num ones.
Select all elements except the first num ones.

Definition Classes
Query
def drop(num: Long): Query[(E1, E2), (U1, U2), C]

Select all elements except the first num ones.
Select all elements except the first num ones.

Definition Classes
Query
def drop(num: ConstColumn[Long]): Query[(E1, E2), (U1, U2), C]

Select all elements except the first num ones.
Select all elements except the first num ones.

Definition Classes
Query
def encodeRef(path: Node): Query[(E1, E2), (U1, U2), C]

Encode a reference into this Rep.
Encode a reference into this Rep.

Definition Classes
Query → Rep
def ensuring(cond: (BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]) ⇒ Boolean, msg: ⇒ Any): BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]

Implicit information
This member is added by an implicit conversion from BaseJoinQuery[E1, E2, U1, U2, C, B1, B2] to Ensuring[BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]) ⇒ Boolean): BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]

Implicit information
This member is added by an implicit conversion from BaseJoinQuery[E1, E2, U1, U2, C, B1, B2] to Ensuring[BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: ⇒ Any): BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]

Implicit information
This member is added by an implicit conversion from BaseJoinQuery[E1, E2, U1, U2, C, B1, B2] to Ensuring[BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]

Implicit information
This member is added by an implicit conversion from BaseJoinQuery[E1, E2, U1, U2, C, B1, B2] to Ensuring[BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def exists: Rep[Boolean]

Test whether this query is non-empty.
Test whether this query is non-empty.

Definition Classes
Query
def filter[T <: Rep[_]](f: ((E1, E2)) ⇒ T)(implicit wt: CanBeQueryCondition[T]): Query[(E1, E2), (U1, U2), C]

Select all elements of this query which satisfy a predicate.
Select all elements of this query which satisfy a predicate. Unlike withFilter, this method only allows Rep-valued predicates, so it guards against the accidental use plain Booleans.

Definition Classes
Query
def filterIf(p: Boolean)(f: ((E1, E2)) ⇒ Rep[Boolean]): Query[(E1, E2), (U1, U2), C]

Applies the given filter function, if the boolean parameter p evaluates to true.
Applies the given filter function, if the boolean parameter p evaluates to true. If not, the filter will not be part of the query.

Definition Classes
Query
def filterNot[T <: Rep[_]](f: ((E1, E2)) ⇒ T)(implicit wt: CanBeQueryCondition[T]): Query[(E1, E2), (U1, U2), C]

Definition Classes
Query
def filterOpt[V, T <: Rep[_]](optValue: Option[V])(f: ((E1, E2), V) ⇒ T)(implicit arg0: CanBeQueryCondition[T]): Query[(E1, E2), (U1, U2), C]

Applies the given filter, if the Option value is defined.
Applies the given filter, if the Option value is defined. If the value is None, the filter will not be part of the query.

Definition Classes
Query
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def flatMap[F, T, D[_]](f: ((E1, E2)) ⇒ Query[F, T, D]): Query[F, T, C]

Build a new query by applying a function to all elements of this query and using the elements of the resulting queries.
Build a new query by applying a function to all elements of this query and using the elements of the resulting queries. This corresponds to an implicit inner join in SQL.

Definition Classes
Query
def forUpdate: Query[(E1, E2), (U1, U2), C]

Specify part of a select statement for update and marked for row level locking
Specify part of a select statement for update and marked for row level locking

Definition Classes
Query
def formatted(fmtstr: String): String

Implicit information
This member is added by an implicit conversion from BaseJoinQuery[E1, E2, U1, U2, C, B1, B2] to StringFormat[BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def groupBy[K, T, G, P](f: ((E1, E2)) ⇒ K)(implicit kshape: Shape[_ <: FlatShapeLevel, K, T, G], vshape: Shape[_ <: FlatShapeLevel, (E1, E2), _, P]): Query[(G, Query[P, (U1, U2), Seq]), (T, Query[P, (U1, U2), Seq]), C]

Partition this query into a query of pairs of a key and a nested query containing the elements for the key, according to some discriminator function.
Partition this query into a query of pairs of a key and a nested query containing the elements for the key, according to some discriminator function.

Definition Classes
Query
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def join[E2, U2, D[_]](q2: Query[E2, U2, D]): BaseJoinQuery[(E1, E2), E2, (U1, U2), U2, C, (E1, E2), E2]

Join two queries with a cross join or inner join.
Join two queries with a cross join or inner join. An optional join predicate can be specified later by calling on.

Definition Classes
Query
def joinFull[E1 >: (E1, E2), E2, U2, D[_], O1, U1, O2](q2: Query[E2, _, D])(implicit ol1: OptionLift[E1, O1], sh1: Shape[FlatShapeLevel, O1, U1, _], ol2: OptionLift[E2, O2], sh2: Shape[FlatShapeLevel, O2, U2, _]): BaseJoinQuery[O1, O2, U1, U2, C, (E1, E2), E2]

Join two queries with a full outer join.
Join two queries with a full outer join. An optional join predicate can be specified later by calling on. Both sides of the join are lifted to an Option. If at least one element on either side matches the other side, all matching elements are returned as Some, otherwise a single None row is returned.

Definition Classes
Query
def joinLeft[E2, U2, D[_], O2](q2: Query[E2, _, D])(implicit ol: OptionLift[E2, O2], sh: Shape[FlatShapeLevel, O2, U2, _]): BaseJoinQuery[(E1, E2), O2, (U1, U2), U2, C, (E1, E2), E2]

Join two queries with a left outer join.
Join two queries with a left outer join. An optional join predicate can be specified later by calling on. The right side of the join is lifted to an Option. If at least one element on the right matches, all matching elements are returned as Some, otherwise a single None row is returned.

Definition Classes
Query
def joinRight[E1 >: (E1, E2), E2, U2, D[_], O1, U1](q2: Query[E2, U2, D])(implicit ol: OptionLift[E1, O1], sh: Shape[FlatShapeLevel, O1, U1, _]): BaseJoinQuery[O1, E2, U1, U2, C, (E1, E2), E2]

Join two queries with a right outer join.
Join two queries with a right outer join. An optional join predicate can be specified later by calling on. The left side of the join is lifted to an Option. If at least one element on the left matches, all matching elements are returned as Some, otherwise a single None row is returned.

Definition Classes
Query
def length: Rep[Int]

The total number of elements (i.e.
The total number of elements (i.e. rows).

Definition Classes
Query
def map[F, G, T](f: ((E1, E2)) ⇒ F)(implicit shape: Shape[_ <: FlatShapeLevel, F, T, G]): Query[G, T, C]

Build a new query by applying a function to all elements of this query.
Build a new query by applying a function to all elements of this query.

Definition Classes
Query
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def on[T <: Rep[_]](pred: (B1, B2) ⇒ T)(implicit wt: CanBeQueryCondition[T]): Query[(E1, E2), (U1, U2), C]

Add a join condition to a join operation.
def pack[R](implicit packing: Shape[_ <: FlatShapeLevel, (E1, E2), _, R]): Query[R, (U1, U2), C]

Definition Classes
Query
final lazy val packed: Node

Definition Classes
Query
val shaped: ShapedValue[_ <: (E1, E2), (U1, U2)]

Definition Classes
WrappingQuery → Query
def size: Rep[Int]

The total number of elements (i.e.
The total number of elements (i.e. rows).

Definition Classes
Query
def sortBy[T](f: ((E1, E2)) ⇒ T)(implicit ev: (T) ⇒ Ordered): Query[(E1, E2), (U1, U2), C]

Sort this query according to a function which extracts the ordering criteria from the query's elements.
Sort this query according to a function which extracts the ordering criteria from the query's elements.

Definition Classes
Query
def sorted(implicit ev: ((E1, E2)) ⇒ Ordered): Query[(E1, E2), (U1, U2), C]

Sort this query according to a the ordering of its elements.
Sort this query according to a the ordering of its elements.

Definition Classes
Query
def subquery: Query[(E1, E2), (U1, U2), C]

Force a subquery to be created when using this Query as part of a larger Query.
Force a subquery to be created when using this Query as part of a larger Query. This method should never be necessary for correctness. If a query works with an explicit .subquery call but fails without, this should be considered a bug in Slick. The method is exposed in the API to enable workarounds to be written in such cases.

Definition Classes
Query
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def take(num: Int): Query[(E1, E2), (U1, U2), C]

Select the first num elements.
Select the first num elements.

Definition Classes
Query
def take(num: Long): Query[(E1, E2), (U1, U2), C]

Select the first num elements.
Select the first num elements.

Definition Classes
Query
def take(num: ConstColumn[Long]): Query[(E1, E2), (U1, U2), C]

Select the first num elements.
Select the first num elements.

Definition Classes
Query
def to[D[_]](implicit ctc: TypedCollectionTypeConstructor[D]): Query[(E1, E2), (U1, U2), D]

Change the collection type to build when executing the query.
Change the collection type to build when executing the query.

Definition Classes
Query
val toNode: Node

Get the Node for this Rep.
Get the Node for this Rep.

Definition Classes
WrappingQuery → Rep
def toString(): String

Definition Classes
Rep → AnyRef → Any
def union[O >: (E1, E2), R, D[_]](other: Query[O, (U1, U2), D]): Query[O, (U1, U2), C]

Return a new query containing the elements from both operands.
Return a new query containing the elements from both operands. Duplicate elements are eliminated from the result.

Definition Classes
Query
def unionAll[O >: (E1, E2), R, D[_]](other: Query[O, (U1, U2), D]): Query[O, (U1, U2), C]

Return a new query containing the elements from both operands.
Return a new query containing the elements from both operands. Duplicate elements are preserved.

Definition Classes
Query
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def withFilter[T](f: ((E1, E2)) ⇒ T)(implicit arg0: CanBeQueryCondition[T]): Query[(E1, E2), (U1, U2), C]

Select all elements of this query which satisfy a predicate.
Select all elements of this query which satisfy a predicate. This method is used when desugaring for-comprehensions over queries. There is no reason to call it directly because it is the same as filter.

Definition Classes
Query
def zip[E2, U2, D[_]](q2: Query[E2, U2, D]): Query[((E1, E2), E2), ((U1, U2), U2), C]

Return a query formed from this query and another query by combining corresponding elements in pairs.
Return a query formed from this query and another query by combining corresponding elements in pairs.

Definition Classes
Query
def zipWith[E2, U2, F, G, T, D[_]](q2: Query[E2, U2, D], f: ((E1, E2), E2) ⇒ F)(implicit shape: Shape[_ <: FlatShapeLevel, F, T, G]): Query[G, T, C]

Return a query formed from this query and another query by combining corresponding elements with the specified function.
Return a query formed from this query and another query by combining corresponding elements with the specified function.

Definition Classes
Query
def zipWithIndex: BaseJoinQuery[(E1, E2), Rep[Long], (U1, U2), Long, C, (E1, E2), Rep[Long]]

Zip this query with its indices (starting at 0).
Zip this query with its indices (starting at 0).

Definition Classes
Query
def →[B](y: B): (BaseJoinQuery[E1, E2, U1, U2, C, B1, B2], B)

Implicit information
This member is added by an implicit conversion from BaseJoinQuery[E1, E2, U1, U2, C, B1, B2] to ArrowAssoc[BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc

Deprecated Value Members

def countDistinct: Rep[Int]

The number of distinct elements of the query.
The number of distinct elements of the query.

Definition Classes
Query
Annotations
@deprecated
Deprecated
(Since version 3.2) Use length on distinct or distinctOn instead of countDistinct

Inherited from WrappingQuery[(E1, E2), (U1, U2), C]

Inherited from Query[(E1, E2), (U1, U2), C]

Inherited from QueryBase[C[(U1, U2)]]

Inherited from Rep[C[(U1, U2)]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from BaseJoinQuery[E1, E2, U1, U2, C, B1, B2] to any2stringadd[BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]]

Inherited by implicit conversion StringFormat from BaseJoinQuery[E1, E2, U1, U2, C, B1, B2] to StringFormat[BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]]

Inherited by implicit conversion Ensuring from BaseJoinQuery[E1, E2, U1, U2, C, B1, B2] to Ensuring[BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]]

Inherited by implicit conversion ArrowAssoc from BaseJoinQuery[E1, E2, U1, U2, C, B1, B2] to ArrowAssoc[BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]]

Ungrouped

Related Doc: package lifted

final class BaseJoinQuery[+E1, +E2, U1, U2, C[_], +B1, +B2] extends WrappingQuery[(E1, E2), (U1, U2), C]

Instance Constructors

new BaseJoinQuery(leftGen: TermSymbol, rightGen: TermSymbol, left: Node, right: Node, jt: JoinType, base: ShapedValue[_ <: (E1, E2), (U1, U2)], b1: B1, b2: B2)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ++[O >: (E1, E2), R, D[_]](other: Query[O, (U1, U2), D]): Query[O, (U1, U2), C]

def ->[B](y: B): (BaseJoinQuery[E1, E2, U1, U2, C, B1, B2], B)

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def distinct: Query[(E1, E2), (U1, U2), C]

def distinctOn[F, T](f: ((E1, E2)) ⇒ F)(implicit shape: Shape[_ <: FlatShapeLevel, F, T, _]): Query[(E1, E2), (U1, U2), C]

def drop(num: Int): Query[(E1, E2), (U1, U2), C]

def drop(num: Long): Query[(E1, E2), (U1, U2), C]

def drop(num: ConstColumn[Long]): Query[(E1, E2), (U1, U2), C]

def encodeRef(path: Node): Query[(E1, E2), (U1, U2), C]

def ensuring(cond: (BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]) ⇒ Boolean, msg: ⇒ Any): BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]

def ensuring(cond: (BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]) ⇒ Boolean): BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]

def ensuring(cond: Boolean, msg: ⇒ Any): BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]

def ensuring(cond: Boolean): BaseJoinQuery[E1, E2, U1, U2, C, B1, B2]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists: Rep[Boolean]

def filter[T <: Rep[_]](f: ((E1, E2)) ⇒ T)(implicit wt: CanBeQueryCondition[T]): Query[(E1, E2), (U1, U2), C]

def filterIf(p: Boolean)(f: ((E1, E2)) ⇒ Rep[Boolean]): Query[(E1, E2), (U1, U2), C]

def filterNot[T <: Rep[_]](f: ((E1, E2)) ⇒ T)(implicit wt: CanBeQueryCondition[T]): Query[(E1, E2), (U1, U2), C]

def filterOpt[V, T <: Rep[_]](optValue: Option[V])(f: ((E1, E2), V) ⇒ T)(implicit arg0: CanBeQueryCondition[T]): Query[(E1, E2), (U1, U2), C]

def finalize(): Unit

def flatMap[F, T, D[_]](f: ((E1, E2)) ⇒ Query[F, T, D]): Query[F, T, C]

def forUpdate: Query[(E1, E2), (U1, U2), C]

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def groupBy[K, T, G, P](f: ((E1, E2)) ⇒ K)(implicit kshape: Shape[_ <: FlatShapeLevel, K, T, G], vshape: Shape[_ <: FlatShapeLevel, (E1, E2), _, P]): Query[(G, Query[P, (U1, U2), Seq]), (T, Query[P, (U1, U2), Seq]), C]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def join[E2, U2, D[_]](q2: Query[E2, U2, D]): BaseJoinQuery[(E1, E2), E2, (U1, U2), U2, C, (E1, E2), E2]

def joinFull[E1 >: (E1, E2), E2, U2, D[_], O1, U1, O2](q2: Query[E2, _, D])(implicit ol1: OptionLift[E1, O1], sh1: Shape[FlatShapeLevel, O1, U1, _], ol2: OptionLift[E2, O2], sh2: Shape[FlatShapeLevel, O2, U2, _]): BaseJoinQuery[O1, O2, U1, U2, C, (E1, E2), E2]

def joinLeft[E2, U2, D[_], O2](q2: Query[E2, _, D])(implicit ol: OptionLift[E2, O2], sh: Shape[FlatShapeLevel, O2, U2, _]): BaseJoinQuery[(E1, E2), O2, (U1, U2), U2, C, (E1, E2), E2]

def joinRight[E1 >: (E1, E2), E2, U2, D[_], O1, U1](q2: Query[E2, U2, D])(implicit ol: OptionLift[E1, O1], sh: Shape[FlatShapeLevel, O1, U1, _]): BaseJoinQuery[O1, E2, U1, U2, C, (E1, E2), E2]

def length: Rep[Int]

def map[F, G, T](f: ((E1, E2)) ⇒ F)(implicit shape: Shape[_ <: FlatShapeLevel, F, T, G]): Query[G, T, C]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def on[T <: Rep[_]](pred: (B1, B2) ⇒ T)(implicit wt: CanBeQueryCondition[T]): Query[(E1, E2), (U1, U2), C]

def pack[R](implicit packing: Shape[_ <: FlatShapeLevel, (E1, E2), _, R]): Query[R, (U1, U2), C]

final lazy val packed: Node

val shaped: ShapedValue[_ <: (E1, E2), (U1, U2)]

def size: Rep[Int]

def sortBy[T](f: ((E1, E2)) ⇒ T)(implicit ev: (T) ⇒ Ordered): Query[(E1, E2), (U1, U2), C]

def sorted(implicit ev: ((E1, E2)) ⇒ Ordered): Query[(E1, E2), (U1, U2), C]

def subquery: Query[(E1, E2), (U1, U2), C]

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

def take(num: Int): Query[(E1, E2), (U1, U2), C]

def take(num: Long): Query[(E1, E2), (U1, U2), C]

def take(num: ConstColumn[Long]): Query[(E1, E2), (U1, U2), C]

def to[D[_]](implicit ctc: TypedCollectionTypeConstructor[D]): Query[(E1, E2), (U1, U2), D]

val toNode: Node

def toString(): String

def union[O >: (E1, E2), R, D[_]](other: Query[O, (U1, U2), D]): Query[O, (U1, U2), C]

def unionAll[O >: (E1, E2), R, D[_]](other: Query[O, (U1, U2), D]): Query[O, (U1, U2), C]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter[T](f: ((E1, E2)) ⇒ T)(implicit arg0: CanBeQueryCondition[T]): Query[(E1, E2), (U1, U2), C]

def zip[E2, U2, D[_]](q2: Query[E2, U2, D]): Query[((E1, E2), E2), ((U1, U2), U2), C]

def zipWith[E2, U2, F, G, T, D[_]](q2: Query[E2, U2, D], f: ((E1, E2), E2) ⇒ F)(implicit shape: Shape[_ <: FlatShapeLevel, F, T, G]): Query[G, T, C]

def zipWithIndex: BaseJoinQuery[(E1, E2), Rep[Long], (U1, U2), Long, C, (E1, E2), Rep[Long]]

def →[B](y: B): (BaseJoinQuery[E1, E2, U1, U2, C, B1, B2], B)

Deprecated Value Members

def countDistinct: Rep[Int]

Inherited from WrappingQuery[(E1, E2), (U1, U2), C]

Inherited from Query[(E1, E2), (U1, U2), C]

Inherited from QueryBase[C[(U1, U2)]]

Inherited from Rep[C[(U1, U2)]]

Inherited from AnyRef