Packages

class TableQuery[E <: AbstractTable[_]] extends Query[E, lifted.TableQuery.E.TableElementType, Seq]

Represents a database table. Profiles add extension methods to TableQuery for operations that can be performed on tables but not on arbitrary queries, e.g. getting the table DDL.

Source
TableQuery.scala
Linear Supertypes
Query[E, E.TableElementType, Seq], QueryBase[Seq[E.TableElementType]], Rep[Seq[E.TableElementType]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TableQuery
  2. Query
  3. QueryBase
  4. Rep
  5. AnyRef
  6. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new TableQuery(cons: (Tag) => E)

Value Members

  1. def ++[O >: E, R, D[_]](other: Query[O, E.TableElementType, D]): Query[O, E.TableElementType, Seq]

    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
  2. def baseTableRow: E

    Get the "raw" table row that represents the table itself, as opposed to a Path for a variable of the table's type.

    Get the "raw" table row that represents the table itself, as opposed to a Path for a variable of the table's type. This method should generally not be called from user code.

  3. def countDistinct: Rep[Int]

    The number of distinct elements of the query.

    The number of distinct elements of the query.

    Definition Classes
    Query
  4. def distinct: Query[E, E.TableElementType, Seq]

    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
  5. def distinctOn[F, T](f: (E) => F)(implicit shape: Shape[_ <: FlatShapeLevel, F, T, _]): Query[E, E.TableElementType, Seq]

    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
  6. def drop(num: Int): Query[E, E.TableElementType, Seq]

    Select all elements except the first num ones.

    Select all elements except the first num ones.

    Definition Classes
    Query
  7. def drop(num: Long): Query[E, E.TableElementType, Seq]

    Select all elements except the first num ones.

    Select all elements except the first num ones.

    Definition Classes
    Query
  8. def drop(num: ConstColumn[Long]): Query[E, E.TableElementType, Seq]

    Select all elements except the first num ones.

    Select all elements except the first num ones.

    Definition Classes
    Query
  9. def encodeRef(path: Node): Query[E, E.TableElementType, Seq]

    Encode a reference into this Rep.

    Encode a reference into this Rep.

    Definition Classes
    Query → Rep
  10. def exists: Rep[Boolean]

    Test whether this query is non-empty.

    Test whether this query is non-empty.

    Definition Classes
    Query
  11. def filter[T](f: (E) => T)(implicit wt: CanBeQueryCondition[T]): Query[E, E.TableElementType, Seq]

    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
  12. def filterIf[T](p: Boolean)(f: (E) => T)(implicit arg0: CanBeQueryCondition[T]): Query[E, E.TableElementType, Seq]

    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
  13. def filterNot[T](f: (E) => T)(implicit wt: CanBeQueryCondition[T]): Query[E, E.TableElementType, Seq]
    Definition Classes
    Query
  14. def filterNotIf[T](p: Boolean)(f: (E) => T)(implicit arg0: CanBeQueryCondition[T]): Query[E, E.TableElementType, Seq]

    Applies the given filterNot function, if the boolean parameter p evaluates to true.

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

    Definition Classes
    Query
  15. def filterNotOpt[V, T](optValue: Option[V])(f: (E, V) => T)(implicit arg0: CanBeQueryCondition[T]): Query[E, E.TableElementType, Seq]

    Applies the given filterNot, if the Option value is defined.

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

    Definition Classes
    Query
  16. def filterOpt[V, T](optValue: Option[V])(f: (E, V) => T)(implicit arg0: CanBeQueryCondition[T]): Query[E, E.TableElementType, Seq]

    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
  17. def flatMap[F, T, D[_]](f: (E) => Query[F, T, D]): Query[F, T, Seq]

    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
  18. def forUpdate: Query[E, E.TableElementType, Seq]

    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
  19. def groupBy[K, T, G, P](f: (E) => K)(implicit kshape: Shape[_ <: FlatShapeLevel, K, T, G], vshape: Shape[_ <: FlatShapeLevel, E, _, P]): Query[(G, Query[P, E.TableElementType, Seq]), (T, Query[P, E.TableElementType, Seq]), Seq]

    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
  20. def join[E2, U2, D[_]](q2: Query[E2, U2, D]): BaseJoinQuery[E, E2, E.TableElementType, U2, Seq, E, 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
  21. def joinFull[E1 >: E, 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, Seq, E, 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
  22. def joinLeft[E2, U2, D[_], O2](q2: Query[E2, _, D])(implicit ol: OptionLift[E2, O2], sh: Shape[FlatShapeLevel, O2, U2, _]): BaseJoinQuery[E, O2, E.TableElementType, U2, Seq, E, 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
  23. def joinRight[E1 >: E, 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, Seq, E, 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
  24. def length: Rep[Int]

    The total number of elements (i.e.

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

    Definition Classes
    Query
  25. def map[F, G, T](f: (E) => F)(implicit shape: Shape[_ <: FlatShapeLevel, F, T, G]): Query[G, T, Seq]

    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
  26. def pack[R](implicit packing: Shape[_ <: FlatShapeLevel, E, _, R]): Query[R, E.TableElementType, Seq]
    Definition Classes
    Query
  27. final lazy val packed: Node
    Definition Classes
    Query
  28. lazy val shaped: ShapedValue[_ <: E, E.TableElementType]
    Definition Classes
    TableQuery → Query
  29. def size: Rep[Int]

    The total number of elements (i.e.

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

    Definition Classes
    Query
  30. def sortBy[T](f: (E) => T)(implicit ev: (T) => Ordered): Query[E, E.TableElementType, Seq]

    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
  31. def sorted(implicit ev: (E) => Ordered): Query[E, E.TableElementType, Seq]

    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
  32. def subquery: Query[E, E.TableElementType, Seq]

    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
  33. def take(num: Int): Query[E, E.TableElementType, Seq]

    Select the first num elements.

    Select the first num elements.

    Definition Classes
    Query
  34. def take(num: Long): Query[E, E.TableElementType, Seq]

    Select the first num elements.

    Select the first num elements.

    Definition Classes
    Query
  35. def take(num: ConstColumn[Long]): Query[E, E.TableElementType, Seq]

    Select the first num elements.

    Select the first num elements.

    Definition Classes
    Query
  36. def to[D[_]](implicit ctc: TypedCollectionTypeConstructor[D]): Query[E, E.TableElementType, D]

    Change the collection type to build when executing the query.

    Change the collection type to build when executing the query.

    Definition Classes
    Query
  37. lazy val toNode: Node

    Get the Node for this Rep.

    Get the Node for this Rep.

    Definition Classes
    TableQuery → Rep
  38. def toString(): String
    Definition Classes
    Rep → AnyRef → Any
  39. def union[O >: E, R, D[_]](other: Query[O, E.TableElementType, D]): Query[O, E.TableElementType, Seq]

    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
  40. def unionAll[O >: E, R, D[_]](other: Query[O, E.TableElementType, D]): Query[O, E.TableElementType, Seq]

    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
  41. def withFilter[T](f: (E) => T)(implicit arg0: CanBeQueryCondition[T]): Query[E, E.TableElementType, Seq]

    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
  42. def zip[E2, U2, D[_]](q2: Query[E2, U2, D]): Query[(E, E2), (E.TableElementType, U2), Seq]

    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
  43. def zipWith[E2, U2, F, G, T, D[_]](q2: Query[E2, U2, D], f: (E, E2) => F)(implicit shape: Shape[_ <: FlatShapeLevel, F, T, G]): Query[G, T, Seq]

    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
  44. def zipWithIndex: BaseJoinQuery[E, Rep[Long], E.TableElementType, Long, Seq, E, Rep[Long]]

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

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

    Definition Classes
    Query