Interface QOM.EndsWith<T>

All Superinterfaces:

Condition, Field<Boolean>, FieldOrConstraint, FieldOrRow, FieldOrRowOrSelect, GroupField, Named, OrderField<Boolean>, QOM.CompareCondition<T, QOM.EndsWith<T>>, QueryPart, SelectField<Boolean>, SelectFieldOrAsterisk, Serializable, TableElement, Typed<Boolean>

Enclosing class:

QOM

public static interface QOM.EndsWith<T>
extends QOM.CompareCondition<T, QOM.EndsWith<T>>

The ENDS WITH operator.

Create a condition to check if this field ends with a string value.

Author:

Lukas Eder

Method Summary

Modifier and Type	Method	Description
Field<T>	$arg1()
default QOM.EndsWith<T>	$arg1(Field<T> newArg1)
Field<T>	$arg2()
default QOM.EndsWith<T>	$arg2(Field<T> newArg2)
default @NotNull List<?>	$args()
@NotNull Function2<? super Field<T>, ? super Field<T>, ? extends QOM.EndsWith<T>>	$constructor()
default QueryPart	$replace(Replacer replacer)	Traverse a QueryPart hierarchy and recursively replace its elements by alternatives.
default @NotNull Field<T>	$string()
default @NotNull QOM.EndsWith<T>	$string(Field<T> newString)
default @NotNull Field<T>	$suffix()
default @NotNull QOM.EndsWith<T>	$suffix(Field<T> newSuffix)
default <T> T	$traverse(Traverser<?,T> traverser)	Traverser this QueryPart expression tree using a composable Traverser, producing a result.

Methods inherited from interface Condition

and, and, and, and, and, and, andExists, andNot, andNot, andNotExists, not, or, or, or, or, or, or, orExists, orNot, orNot, orNotExists, xor, xor, xor, xor, xor, xor, xorExists, xorNot, xorNot, xorNotExists

Methods inherited from interface Field

add, add, as, as, as, as, asc, ascii, between, between, between, between, betweenSymmetric, betweenSymmetric, betweenSymmetric, betweenSymmetric, binaryLike, binaryLike, binaryLike, bitAnd, bitAnd, bitLength, bitNand, bitNand, bitNor, bitNor, bitNot, bitOr, bitOr, bitXNor, bitXNor, bitXor, bitXor, cast, cast, cast, changed, charLength, coalesce, coalesce, coerce, coerce, coerce, collate, collate, collate, comment, comment, compare, compare, compare, compare, concat, concat, concat, contains, contains, containsIgnoreCase, containsIgnoreCase, convert, convert, convert, convertFrom, convertFrom, convertTo, convertTo, decode, decode, decode, decode, desc, div, div, divide, divide, endsWith, endsWith, endsWithIgnoreCase, endsWithIgnoreCase, eq, eq, eq, eq, equal, equal, equal, equal, equalIgnoreCase, equalIgnoreCase, equals, field, from, ge, ge, ge, ge, get, getComment, getName, getValue, greaterOrEqual, greaterOrEqual, greaterOrEqual, greaterOrEqual, greaterThan, greaterThan, greaterThan, greaterThan, gt, gt, gt, gt, in, in, in, in, in, isDistinctFrom, isDistinctFrom, isDistinctFrom, isDocument, isFalse, isJson, isNotDistinctFrom, isNotDistinctFrom, isNotDistinctFrom, isNotDocument, isNotJson, isNotNull, isNull, isTrue, le, le, le, le, length, lessOrEqual, lessOrEqual, lessOrEqual, lessOrEqual, lessThan, lessThan, lessThan, lessThan, like, like, like, like, like, likeIgnoreCase, likeIgnoreCase, likeIgnoreCase, likeIgnoreCase, likeRegex, likeRegex, lower, lpad, lpad, lpad, lpad, lt, lt, lt, lt, ltrim, minus, minus, mod, mod, modulo, modulo, mul, mul, multiply, multiply, ne, ne, ne, ne, neg, notBetween, notBetween, notBetween, notBetween, notBetweenSymmetric, notBetweenSymmetric, notBetweenSymmetric, notBetweenSymmetric, notBinaryLike, notBinaryLike, notBinaryLike, notContains, notContains, notContainsIgnoreCase, notContainsIgnoreCase, notEqual, notEqual, notEqual, notEqual, notEqualIgnoreCase, notEqualIgnoreCase, notIn, notIn, notIn, notIn, notIn, notLike, notLike, notLike, notLike, notLike, notLikeIgnoreCase, notLikeIgnoreCase, notLikeIgnoreCase, notLikeIgnoreCase, notLikeRegex, notLikeRegex, notSimilarTo, notSimilarTo, notSimilarTo, notSimilarTo, notSimilarTo, nullif, nullif, nullsFirst, nullsLast, nvl, nvl, nvl2, nvl2, octetLength, original, plus, plus, plus, position, position, pow, pow, power, power, rem, rem, repeat, repeat, replace, replace, replace, replace, reset, rpad, rpad, rpad, rpad, rtrim, shl, shl, shr, shr, similarTo, similarTo, similarTo, similarTo, similarTo, sort, sort, sortAsc, sortAsc, sortDefault, sortDesc, sortDesc, startsWith, startsWith, startsWithIgnoreCase, startsWithIgnoreCase, sub, sub, substring, substring, substring, substring, subtract, subtract, times, times, touched, trim, unaryMinus, unaryPlus, upper

Methods inherited from interface Named

$name, getCommentPart, getQualifiedName, getUnqualifiedName

Methods inherited from interface QueryPart

$replace, $traverse, hashCode, toString

Methods inherited from interface Typed

$dataType, getBinding, getConverter, getDataType, getDataType, getType

Method Details

$string

@NotNull
default @NotNull Field<T> $string()

$string

@CheckReturnValue
@NotNull
default @NotNull QOM.EndsWith<T> $string(Field<T> newString)

$suffix

@NotNull
default @NotNull Field<T> $suffix()

$suffix

@CheckReturnValue
@NotNull
default @NotNull QOM.EndsWith<T> $suffix(Field<T> newSuffix)

$arg1

Field<T> $arg1()

$arg2

Field<T> $arg2()

$arg1

@CheckReturnValue
@NotNull
default QOM.EndsWith<T> $arg1(Field<T> newArg1)

$arg2

@CheckReturnValue
@NotNull
default QOM.EndsWith<T> $arg2(Field<T> newArg2)

$constructor

@NotNull
@NotNull Function2<? super Field<T>, ? super Field<T>, ? extends QOM.EndsWith<T>> $constructor()

$args

@NotNull
default @NotNull List<?> $args()

$traverse

default <T> T $traverse(Traverser<?,T> traverser)

Description copied from interface: QueryPart

Traverser this QueryPart expression tree using a composable Traverser, producing a result.

This offers a generic way to traverse expression trees to translate the tree to arbitrary other data structures. The simplest traversal would just count all the tree elements:

int count = CUSTOMER.NAME.eq(1).$traverse(0, (i, p) -> i + 1);

The same can be achieved by translating the JDK Collector API to the Traverser API using Traversers.collecting(Collector).

CUSTOMER.NAME.eq(1).$traverse(Traversers.collecting(Collectors.counting()));

Unlike a Collector, a Traverser is optimised for tree traversal, not stream traversal:

• Is not designed for parallelism
• It can Traverser.abort() traversal early when the result can be produced early (e.g. when running Traversers.containing(QueryPart), and a result has been found).
• It can decide whether to Traverser.recurse() into a QueryPart subtree, or whether that is not necessary or even undesirable, e.g. to prevent entering new subquery scopes.
• Unlike a Collector, which can use its Collector.accumulator() to accumulate each element only once, in tree traversal, it's desirable to be able to distinguish between accumulating an item Traverser.before() or Traverser.after() recursing into it. This is useful e.g. to wrap each tree node in XML opening and closing tags.

This is a commercial jOOQ edition only feature.

Specified by:

$traverse in interface QueryPart

$replace

@NotNull
default QueryPart $replace(Replacer replacer)

Description copied from interface: QueryPart

Traverse a QueryPart hierarchy and recursively replace its elements by alternatives.

While replacing contents, this QueryPart isn't modified. Instead, a new object is returned.

This is a commercial jOOQ edition only feature.

Specified by:

$replace in interface QueryPart