Package | Description |
---|---|
org.jooq |
The
org.jooq package contains jOOQ's public API
This package mostly contains interfaces that are implemented by the
org.jooq.impl package. |
org.jooq.impl |
The
org.jooq.impl package contains jOOQ's implementation classes
This package provides implementations for the jOOQ API from
org.jooq , whose interfaces are constructed mostly through the
Factory class, which hides implementation facts from
the public API |
Modifier and Type | Method and Description |
---|---|
Condition |
Row7.eq(Row7<T1,T2,T3,T4,T5,T6,T7> row)
Compare this row value expression with another row value expression for equality
Row equality comparison predicates can be simulated in those databases
that do not support such predicates natively:
(A, B) = (1, 2) is equivalent to
A = 1 AND B = 2 |
Condition |
Row7.equal(Row7<T1,T2,T3,T4,T5,T6,T7> row)
Compare this row value expression with another row value expression for equality
Row equality comparison predicates can be simulated in those databases
that do not support such predicates natively:
(A, B) = (1, 2) is equivalent to
A = 1 AND B = 2 |
Condition |
Row7.in(Row7<T1,T2,T3,T4,T5,T6,T7>... rows)
Compare this row value expression with a set of row value expressions for equality
Row IN predicates can be simulated in those databases that do not
support such predicates natively:
(A, B) IN ((1, 2), (3, 4))
is equivalent to ((A, B) = (1, 2)) OR ((A, B) = (3, 4)) ,
which is equivalent to
(A = 1 AND B = 2) OR (A = 3 AND B = 4) |
Condition |
Row7.ne(Row7<T1,T2,T3,T4,T5,T6,T7> row)
Compare this row value expression with another row value expression for non-equality
Row non-equality comparison predicates can be simulated in those
databases that do not support such predicates natively:
(A, B) <> (1, 2) is equivalent to
NOT(A = 1 AND B = 2) |
Condition |
Row7.notEqual(Row7<T1,T2,T3,T4,T5,T6,T7> row)
Compare this row value expression with another row value expression for non-equality
Row non-equality comparison predicates can be simulated in those
databases that do not support such predicates natively:
(A, B) <> (1, 2) is equivalent to
NOT(A = 1 AND B = 2) |
Condition |
Row7.notIn(Row7<T1,T2,T3,T4,T5,T6,T7>... rows)
Compare this row value expression with a set of row value expressions for equality
Row NOT IN predicates can be simulated in those databases that do not
support such predicates natively:
(A, B) NOT IN ((1, 2), (3, 4)) is equivalent to
NOT(((A, B) = (1, 2)) OR ((A, B) = (3, 4))) , which is
equivalent to NOT((A = 1 AND B = 2) OR (A = 3 AND B = 4)) |
Modifier and Type | Method and Description |
---|---|
Condition |
Row7.in(Collection<? extends Row7<T1,T2,T3,T4,T5,T6,T7>> rows)
Compare this row value expression with a set of row value expressions for equality
Row IN predicates can be simulated in those databases that do not
support such predicates natively:
(A, B) IN ((1, 2), (3, 4))
is equivalent to ((A, B) = (1, 2)) OR ((A, B) = (3, 4)) ,
which is equivalent to
(A = 1 AND B = 2) OR (A = 3 AND B = 4) |
Condition |
Row7.notIn(Collection<? extends Row7<T1,T2,T3,T4,T5,T6,T7>> rows)
Compare this row value expression with a set of row value expressions for equality
Row NOT IN predicates can be simulated in those databases that do not
support such predicates natively:
(A, B) NOT IN ((1, 2), (3, 4)) is equivalent to
NOT(((A, B) = (1, 2)) OR ((A, B) = (3, 4))) , which is
equivalent to NOT((A = 1 AND B = 2) OR (A = 3 AND B = 4)) |
Modifier and Type | Method and Description |
---|---|
static <T1,T2,T3,T4,T5,T6,T7> |
Factory.row(Field<T1> t1,
Field<T2> t2,
Field<T3> t3,
Field<T4> t4,
Field<T5> t5,
Field<T6> t6,
Field<T7> t7)
Create a row value expression of degree
7
Note: Not all databases support row value expressions, but many row value
expression operations can be simulated on all databases. |
static <T1,T2,T3,T4,T5,T6,T7> |
Factory.row(T1 t1,
T2 t2,
T3 t3,
T4 t4,
T5 t5,
T6 t6,
T7 t7)
Create a row value expression of degree
7
Note: Not all databases support row value expressions, but many row value
expression operations can be simulated on all databases. |
Copyright © 2013. All Rights Reserved.